Abstract
We study concept lattices constrained by hedges. The principal aim is to control, in a parameterical way, the size of concept lattices, i.e. the number of conceptual clusters extracted from data. The paper presents theoretical insight, comments, and examples. We introduce new, parameterized, concept-forming operators and study their properties. We obtain an axiomatic characterization of the concept-forming operators. Then, we show that a concept lattice with hedges is indeed a complete lattice which is isomorphic to an ordinary concept lattice. We describe the isomorphism and its inverse. These mappings serve as translation procedures. As a consequence, we obtain a theorem characterizing the structure of concept lattices with hedges which generalizes the well-known main theorem of ordinary concept lattices. Furthermore, the isomorphism and its inverse enable us to compute a concept lattice with hedges using algorithms for ordinary concept lattices. Further insight is provided for boundary choices of hedges. We demonstrate by experiments that the size reduction using hedges as parameters is smooth.
Sign-in/Register to access full text options 
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 callMore From: Journal of Advanced Computational Intelligence and Intelligent Informatics
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.
