Abstract
This paper deals with Gärdenfors’ theory of conceptual spaces. Let {mathcal {S}} be a conceptual space consisting of 2-type fuzzy sets equipped with several kinds of metrics. Let a finite set of prototypes tilde{P}_1,ldots ,tilde{P}_nin mathcal {S} be given. Our main result is the construction of a classification algorithm. That is, given an element {tilde{A}}in mathcal {S}, our algorithm classifies it into the conceptual field determined by one of the given prototypes tilde{P}_i. The construction of our algorithm uses some physical analogies and the Newton potential plays a significant role here. Importantly, the resulting conceptual fields are not convex in the Euclidean sense, which we believe is a reasonable departure from the assumptions of Gardenfors’ original definition of the conceptual space. A partitioning algorithm of the space mathcal {S} is also considered in the paper. In the application section, we test our classification algorithm on real data and obtain very satisfactory results. Moreover, the example we consider is another argument against requiring convexity of conceptual fields.
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Disclaimer: 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.