Abstract
This paper investigates the scalability of applying Formal Concept Analysis to large data sets. In particular we present enhancements based on an existing spatial data structure, the RD-Tree, to better support both specific use with Formal Concept Analysis as well as generic multidimensional applications. Our experiments are motivated by the application of Formal Concept Analysis to a virtual filesystem [11,20,16]. In particular the libferris [1] Semantic File System.
Preview
Unable to display preview. Download preview PDF.
Similar content being viewed by others
References
libferris, http://witme.sourceforge.net/libferris.web/ , Visited Nov. 2005
Mail-sleuth homepage, http://www.mail-sleuth.com/ , Visited Jan. 2005
Aoki, P.M.: Implementation of extended indexes in POSTGRES. SIGIR Forum 25(1), 2–9 (1991), citeseer.ist.psu.edu/aoki91implementation.html
Blake, C., Merz, C.: UCI Repository of Machine Learning Databases. University of California, Irvine, CA, Department of Information and Computer Science (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html
Cole, R., Eklund, P.: Browsing semi-structured web texts using formal concept analysis. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 319–332. Springer, Heidelberg (2001)
Cole, R., Stumme, G.: Cem: A conceptual email manager. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, Springer, Heidelberg (2000)
Ferré, S., Ridoux, O.: A file system based on concept analysis. In: Computational Logic, pp. 1033–1047 (2000), citeseer.nj.nec.com/ferre00file.html
Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, Springer, Heidelberg (2000)
Folk, M.J., Zoelick, B.: File Structures. Addison-Wesley, Reading (1992)
Ganter, B., Wille, R.: Formal Concept Analysis — Mathematical Foundations. Springer, Heidelberg (1999)
Gifford, D.K., et al.: Semantic file systems. In: Proceedings of 13th ACM Symposium on Operating Systems Principles, ACM SIGOPS, pp. 16–25. ACM Press, New York (1991)
Goethals, B., Zaki, M.J.: Advances in frequent itemset mining implementations: Report on fimi’03. In: Goethals, B., Zaki, M.J. (eds.) Proceedings of the ICDM 2003 Workshop on Frequent Itemset Mining Implementations. CEUR Workshop Proceedings, vol. 90 (2003), citeseer.ist.psu.edu/article/goethals03advances.html
Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM-SIGMOD International Conference on Management of Data, Boston, MA, ACM Press, New York (1984)
Hellerstein, J.M., Naughton, J.F., Pfeffer, A.: Generalized search trees for database systems. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) Proc. 21st Int. Conf. Very Large Data Bases, VLDB, pp. 562–573. Morgan Kaufmann, San Francisco (1995), citeseer.ist.psu.edu/hellerstein95generalized.html
Hellerstein, J.M., Pfeffer, A.: The RD-Tree: An Index Structure for Sets. Technical Report 1252. University of Wisconsin at Madison (October 1994)
Martin, B.: Formal concept analysis and semantic file systems. In: Eklund, P.W. (ed.) ICFCA 2004. LNCS (LNAI), vol. 2961, pp. 88–95. Springer, Heidelberg (2004)
Martin, B., Eklund, P.: Applying formal concept analysis to semantic file systems leveraging wordnet. In: Australian Document Computing Symposium (ADCS05), Sydney University (2005)
Martin, B., Eklund, P.W.: Asymmetric page split generalized index search trees for formal concept analysis. In: Esposito, F., et al. (eds.) ISMIS 2006. LNCS (LNAI), vol. 4203, pp. 218–227. Springer, Heidelberg (2006)
Martin, B., Eklund, P.W.: Spatial indexing for scalability in fca. In: Missaoui, R., Schmidt, J. (eds.) Formal Concept Analysis. LNCS (LNAI), vol. 3874, pp. 205–220. Springer, Heidelberg (2006)
Padioleau, Y., Ridoux, O.: A logic file system. In: USENIX 2003 Annual Technical Conference, pp. 99–112 (2003)
Prediger, S.: Logical scaling in formal concept analysis. In: Delugach, H.S., et al. (eds.) ICCS 1997. LNCS, vol. 1257, pp. 332–341. Springer, Heidelberg (1997)
Agrawal, R., et al.: Fast discovery of association rules. In: Fayyad, U., et al. (eds.) Advances in Knowledge Discovery and Data Mining, pp. 307–328. AAAI Press, Menlo Park (1996)
Rock, T., Wille, R.: Ein Toscana-Erkundungssystem zur Literatursuche. In: Stumme, G., Wille, R. (eds.) Begriffliche Wissensverarbeitung, Methoden und Anwendungen, pp. 239–253. Springer, Heidelberg (2000)
Stumme, G., et al.: Computing iceberg concept lattices with titanic. J. on Knowledge and Data Engineering (KDE) 42, 189–222 (2002), citeseer.ist.psu.edu/article/stumme02computing.html
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer Berlin Heidelberg
About this paper
Cite this paper
Martin, B., Eklund, P. (2007). Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis. In: Kuznetsov, S.O., Schmidt, S. (eds) Formal Concept Analysis. ICFCA 2007. Lecture Notes in Computer Science(), vol 4390. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-70901-5_6
Download citation
DOI: https://doi.org/10.1007/978-3-540-70901-5_6
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-70828-5
Online ISBN: 978-3-540-70901-5
eBook Packages: Computer ScienceComputer Science (R0)