Representing large concept hierarchies using lattice data structure

DOI10.1007/3-540-45357-1_23MaRDI QIDQ2768567zbMATH OpenFDO

Authors Yanee Kachai, Kitsana Waiyamai

Publication date 3 February 2002

Published in Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL http://link.springer.de/link/service/series/0558/bibs/2035/20350186

Mathematics Subject Classification ID

Network design and communication in computer systems (68M10) Database theory (68P15) Learning and adaptive systems in artificial intelligence (68T05) Computing methodologies and applications (68U99)

Recommendations

• scientific article; zbMATH DE number 754421
• Concept lattices and conceptual knowledge systems
• Describing hierarchy of concept lattice by using matrix
• Hierarchic construction of concept lattices
• Maintaining class membership information

Cited in

(5)

• Describing hierarchy of concept lattice by using matrix
• Concept lattices as a search space for graph compression
• Efficient data retrieval and manipulation using Boolean entity lattice
• CHARACTERIZING TREES IN CONCEPT LATTICES
• Fast Access to Concepts in Concept Lattices via Bidirectional Associative Memories

This page was built for publication: Representing large concept hierarchies using lattice data structure

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2768567)