Skip to main content
SpringerLink
Log in

Custom Asymmetric Page Split Generalized Index Search Trees and Formal Concept Analysis

  • Conference paper
Formal Concept Analysis (ICFCA 2007)

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

Included in the following conference series:

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.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. libferris, http://witme.sourceforge.net/libferris.web/ , Visited Nov. 2005

  2. Mail-sleuth homepage, http://www.mail-sleuth.com/ , Visited Jan. 2005

  3. Aoki, P.M.: Implementation of extended indexes in POSTGRES. SIGIR Forum 25(1), 2–9 (1991), citeseer.ist.psu.edu/aoki91implementation.html

    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: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS, vol. 1867, Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  7. Ferré, S., Ridoux, O.: A file system based on concept analysis. In: Computational Logic, pp. 1033–1047 (2000), citeseer.nj.nec.com/ferre00file.html

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

    Chapter  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., 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)

    Google Scholar 

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

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

  17. Martin, B., Eklund, P.: Applying formal concept analysis to semantic file systems leveraging wordnet. In: Australian Document Computing Symposium (ADCS05), Sydney University (2005)

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Chapter  Google Scholar 

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

    Google Scholar 

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

    Google Scholar 

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

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Computer Science and Software Engineering, The University of Wollongong, Northfields Avenue, Wollongong, NSW 2522, Australia

    Ben Martin & 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

Sergei O. Kuznetsov Stefan Schmidt

Rights and permissions

Reprints 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)

Publish with us

Policies and ethics

Search

Navigation