Abstract

In this article, we present a new approach to tackle lattice generation for complex and heterogeneous data using the concept of convexity. This is a work that we have already carried out, albeit intuitively [11] where we proposed the NextPriorityConcept algorithm for generating a meet-semilattice of concepts based on suitable descriptions and strategies. Now, we revisit the essential properties of our description spaces using a stronger formalism based on the properties of closure operators.

Full Text
Paper version not known

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 call

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.