Location via proxy:   [ UP ]  
[Report a bug]   [Manage cookies]                
Skip to main content
Springer Nature Link
Log in

Asymmetric Page Split Generalized Index Search Trees for Formal Concept Analysis

  • Conference paper
Foundations of Intelligent Systems (ISMIS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 4203))

Included in the following conference series:

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.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Similar content being viewed by others

References

  1. Libferris (visited, November 2005), http://witme.sourceforge.net/libferris.web/

  2. Mail-sleuth homepage (visited, January 2005), http://www.mail-sleuth.com/

  3. Aoki, P.M.: Implementation of extended indexes in POSTGRES. SIGIR Forum 25(1), 2–9 (1991)

    Article  Google Scholar 

  4. 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

  5. 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)

    Chapter  Google Scholar 

  6. Cole, R., Stumme, G.: Cem: A conceptual email manager. In: 7th International Conference on Conceptual Structures, ICCS 2000, Springer, Heidelberg (2000)

    Google Scholar 

  7. Ferré, S., Ridoux, O.: A file system based on concept analysis. In: Computational Logic, pp. 1033–1047 (2000)

    Google Scholar 

  8. Ferré, S., Ridoux, O.: A logical generalization of formal concept analysis. In: Mineau, G., Ganter, B. (eds.) International Conference on Conceptual Structures (August 2000)

    Google Scholar 

  9. Folk, M.J., Zoelick, B.: File Structures. Addison-Wesley, Reading (1992)

    MATH  Google Scholar 

  10. Ganter, B., Wille, R.: Formal Concept Analysis — Mathematical Foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  11. Gifford, D.K., Jouvelot, P., Sheldon, M.A., O’Toole Jr., J.W.: Semantic file systems. In: Proceedings of 13th ACM Symposium on Operating Systems Principles, pp. 16–25. ACM SIGOPS (1991)

    Google Scholar 

  12. Guttman, A.: R-trees: A dynamic index structure for spatial searching. In: Proc. ACM-SIGMOD International Conference on Management of Data, Bostan Mass (1984)

    Google Scholar 

  13. 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, 11–15, pp. 562–573. Morgan Kaufmann, San Francisco (1995)

    Google Scholar 

  14. Hellerstein, J.M., Pfeifer, A.: The RD-Tree: An Index Structure for Sets, Technical Report 1252. University of Wisconsin at Madison (October 1994)

    Google Scholar 

  15. 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)

    Chapter  Google Scholar 

  16. Martin, B., Eklund, P.: Concept Lattices. In: FIXME (ed.) Fourth International Conference on Formal Concept Analysis, ICFCA 2006, Proceedings, FIXME, Dresden, Germany. LNCS, Springer, Heidelberg (2006)

    Google Scholar 

  17. Padioleau, Y., Ridoux, O.: A logic file system. In: USENIX 2003 Annual Technical Conference, pp. 99–112 (2003)

    Google Scholar 

  18. Prediger, S.: Logical scaling in formal concept analysis. In: International Conference on Conceptual Structures, pp. 332–341. Springer, Heidelberg (1997)

    Google Scholar 

  19. Agrawal, R., Mannila, H., Srikant, R., Toivonen, H., Inkeri Verkamo, A.: 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)

    Google Scholar 

  20. Rock, T., Wille, R.: Ein TOSCANA-erkundungssytem zur literatursuche. In: Stumme, G., Wille, R. (eds.) Begriffliche WissensveraRbeitung: Methoden und Anwendungen, pp. 239–253. Springer, Berlin (2000)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Information Technology and Electrical Engineering, The University of Queensland, St. Lucia, QLD, 4072, Australia

    Ben Martin

  2. School of Economics and Information Systems, The University of Wollongong, Northfields Avenue, Wollongong, NSW, 2522, Australia

    Peter Eklund

Authors
  1. Ben Martin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Peter Eklund
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Dipartimento di Informatica, Università degli Studi di Bari,  

    Floriana Esposito

  2. Department of Computer Science, University of North Carolina, NC 28223, Charlotte, USA

    Zbigniew W. Raś

  3. Dipartimento di Informatica, Università degli Studi di Bari, via Orabona, 4, 70126, Bari, Italy

    Donato Malerba

  4. Dipartimento di Informatica, Università di Bari, Via E. Orabona, 4, 70125, Bari, Italia

    Giovanni Semeraro

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Martin, B., Eklund, P. (2006). Asymmetric Page Split Generalized Index Search Trees for Formal Concept Analysis. In: Esposito, F., Raś, Z.W., Malerba, D., Semeraro, G. (eds) Foundations of Intelligent Systems. ISMIS 2006. Lecture Notes in Computer Science(), vol 4203. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11875604_25

Download citation

  • DOI: https://doi.org/10.1007/11875604_25

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-45764-0

  • Online ISBN: 978-3-540-45766-4

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation