Asymmetric page split generalized index search trees for formal concept analysis
RIS ID
15379
Abstract
Formal Concept Analysis is an unsupervised machine learning technique that has successfully been applied to document organisation by considering documents as objects and keywords as attributes. The basic algorithms of Formal Concept Analysis then allow an intelligent information retrieval system to cluster documents according to keyword views. This paper investigates the scalability of this idea. In particular we present the results of applying spatial data structures to large datasets in formal concept analysis. Our experiments are motivated by the application of the Formal Concept Analysis idea of a virtual filesystem [11,17,15]. In particular the libferris [1] Semantic File System. This paper presents customizations to an RD-Tree Generalized Index Search Tree based index structure to better support the application of Formal Concept Analysis to large data sources.
Publication Details
Martin, B. & Eklund, P. W. (2006). Asymmetric page split generalized index search trees for formal concept analysis. In F. Esposito (Eds.), International Symposium on Foundations of Intelligent Systems (pp. 218-227). Berlin: Springer-Verlag.