Abstract
In this paper we present an efficient algorithm for simultaneous traversal of concept lattices of two distinct but related binary datasets.
2009 21st IEEE International Conference on Tools with Artificial Intelligence
Like what you’re reading?
Already a member?
Related Articles
- Organizing Capabilities Using Formal Concept Analysis
2013 Workshops on Enabling Technologies: Infrastructure for Collaborative Enterprises - Ontology Learning from Text Using Relational Concept Analysis
International MCETECH Conference on e-Technologies - A Distributed Concept Lattices Vertical Union Method
Artificial Intelligence and Computational Intelligence, International Conference on - Applying signatures for forward traversal query processing in object-oriented databases
Proceedings of 1994 IEEE 10th International Conference on Data Engineering - Diagnosis Rule Mining of Airborne Avionics Using Formal Concept Analysis
2013 International Conference on Cyber-Enabled Distributed Computing and Knowledge Discovery (CyberC) - A fast selective traversal algorithm for binary search trees
COMPSAC 79 - Proceedings. Computer Software and The IEEE Computer Society's Third International Applications Conference - Matrix Computation For Concept Lattices
Cognitive Informatics, IEEE International Conference on - Concept-Based Biclustering for Internet Advertisement
2012 IEEE 12th International Conference on Data Mining Workshops - Complementary Relations and Their Concept Lattices in Relational Databases
Semantics, Knowledge and Grid, International Conference on - Concept Analysis Based on Granular Formal Contexts
2018 IEEE International Conference on Data Mining Workshops (ICDMW)