Algebra of Clusterizable Relations
Relations are usually represented in a space of attributes whose values differ only in names similar to algebra of sets. The order of the values or any other preference measures are not significant for such attributes. The paper proposes a mathematical model based on n-tuple algebra (NTA), for relations in which the values of attributes are ordered. For this case, a mathematical tool has been developed that can be used to perform not only the previously discussed methods and means of logical-semantic analysis on the basis of NTA, including analysis of defeasible reasoning and logic-probabilistic analysis, but also to analyze the order and connectivity of structures and implement clustering methods. The concept of granules is introduced, the power of connectivity between the granules is defined, and methods to calculate distances between the disconnected granules are proposed. The obtained dependencies make it possible to extend the scope of classification techniques.
KeywordsN-tuple algebra Logical-semantic analysis Ordered attribute Clusterization
The authors would like to thank the Russian Foundation for Basic Researches (grants 16-29-04424, 16-29-12901, 18-07-00132, 18-01-00076, and 18-29-03022) for partial funding of this work.
- 1.Gärdenfors, P.: Conceptual Spaces: The Geometry of Thought. A Bradford Book. MIT Press, Cambridge (2000)Google Scholar
- 4.Kulik, B., Fridman, A.: N-ary Relations for Logical Analysis of Data and Knowledge. IGI Global, Hershey (2017)Google Scholar
- 6.Krause, E.F.: Taxicab Geometry. Dover, NewYork (1987)Google Scholar