Abstract
There is an increasing importance of problems regarding the analysis of propositions of experts and clustering of information contained in databases. Propositions of experts can be presented as formulas of n-valued logic \(L_{n}\). This paper is concerned with defining metrics and degrees of uncertainty on formulas of n-valued logic. After metrics and degrees of uncertainty (as well as their useful properties) have been established, they are used for the cluster analysis of the sets of n-valued formulas. Various clustering algorithms are performed and obtained results are analyzed. Established methods can be further employed for experts propositions analysis, clustering problems and pattern recognition.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
