Skip to main content
SpringerLink
Log in

QuDA: Applying Formal Concept Analysis in a Data Mining Environment

  • Conference paper
Concept Lattices (ICFCA 2004)

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

Included in the following conference series:

Abstract

This contribution contains a report on using FCA technologies in a data mining environment QuDA. We also show how “scaling” capabilities of QuDA can be used to transform real-world datasets into formal contexts.

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. Agrawal, R., Imielinsky, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings of the 1993 International Conference on Managementof Data (SIGMOD 1993), pp. 207– 216 (1993)

    Google Scholar 

  2. ARMiner software, http://www.cs.umb.edu/~laur/ARMiner/

  3. Blake, C.L., Merz, C.J.: UCI repository of machine learning databases (1998), http://www.ics.uci.edu/~mlearn/MLRepository.html

  4. Finn, V.K.: Plausible reasoning in intelligent systems of JSM-type. Itogi Nauki i Tekhniki, ser. Informatika (15), 54–101 (1991) (in Russian)

    Google Scholar 

  5. Ganter, B., Kuznetsov, S.O.: Formalizing hypotheses with concepts. In: Ganter, B., Mineau, G.W. (eds.) ICCS 2000. LNCS (LNAI), vol. 1867, pp. 342–356. Springer, Heidelberg (2000)

    Chapter  Google Scholar 

  6. Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: Delugach, H.S., Stumme, G. (eds.) ICCS 2001. LNCS (LNAI), vol. 2120, pp. 129–142. Springer, Heidelberg (2001)

    Chapter  Google Scholar 

  7. Godin, R., Missaoui, R., Alaoui, H.: Incremental concept formation algorithms based on galois lattices. Computation Intelligence 11(2), 246–267 (1995)

    Article  Google Scholar 

  8. Guenoche, A.: Construction du treillis de galois d’une relation binaire. Math. Inf. Sci. Hum. 109, 41–53 (1990)

    MATH  MathSciNet  Google Scholar 

  9. Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical foundations. Springer, Heidelberg (1999)

    MATH  Google Scholar 

  10. Grigoriev, P., Yevtushenko, S., Grieser, G.: QuDA, a data miners’ discovery environment. Technical Report AIDA–03–06, FG Intellektik, FB Informatik, Technische Universität Darmstadt (September 2003), http://www.intellektik.informatik.tu-darmstadt.de/~peter/QuDA.pdf

  11. Kloesgen, W.: Deviation analysis. In: Kloesgen, W., Zytkow, J.M. (eds.) Handbook of data mining and Knowledge Discovery in Databases, pp. 344–360. Oxford University Press, Oxford (2002)

    Google Scholar 

  12. Kloesgen, W.: Subgroup patterns. In: Kloesgen, W., Zytkow, J.M. (eds.) Handbook of data mining and Knowledge Discovery in Databases, pp. 47–50. Oxford University Press, Oxford (2002)

    Google Scholar 

  13. Kuznetsov, S.O., Obiedkov, S.A.: Comparing performance of algorithms for generating concept lattices. In: Proc. of ICCS 2001 - Int’l Workshop On Concept Lattices Based KDD, pp. 35–47 (2001)

    Google Scholar 

  14. Luxenberger, M.: Implikationen, Abhängigkeiten und Galois Abbildungen. PhD thesis, Technische Hochschule Darmstadt (1993)

    Google Scholar 

  15. Mitchell, T.M.: Machine Learning. McGraw-Hill, New York (1997)

    MATH  Google Scholar 

  16. . Homepage of NaviCon, http://www.navicon.de

  17. Norris, E.M.: An algorithm for computing the maximal rectangles in a binary relation. Revue Roumanie de Mathématiques Pures et Appliquëes 23(2), 243–250 (1978)

    MATH  MathSciNet  Google Scholar 

  18. Nourine, L., Raynaud, O.: A fast algorithm for building lattices. Information Processing Letters 71, 199–204 (1999)

    Article  MATH  MathSciNet  Google Scholar 

  19. Pasquier, N., Bastide, Y., Taouil, R., Lakhal, L.: Pruning closed itemset lattices for association rules. In: Proceedings of the BDA French Conference on Advanced Databases, pp. 177–196 (1998)

    Google Scholar 

  20. Pissaro system – picturing interactively statistically sensible association rules reporting overviews, http://stats.math.uni-augsburg.de/Pissarro/

  21. Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data Knowledge Engineering 42(2), 189–222 (2002)

    Article  MATH  Google Scholar 

  22. Yevtushenko, S.A.: The research and development of the algorithms for the concept lattices construction. Master’s thesis, National Technical University of Ukraine “KPI’ (2000) (in Russian)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Technische Universität Darmstadt (TUD), Germany

    Peter A. Grigoriev & Serhiy A. Yevtushenko

Authors
  1. Peter A. Grigoriev
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Serhiy A. Yevtushenko
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. School of Information Systems and Technology, University of Wollongong, Northfields Ave, NSW 2522, Wollongong, Australia

    Peter Eklund

Rights and permissions

Reprints and permissions

Copyright information

© 2004 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Grigoriev, P.A., Yevtushenko, S.A. (2004). QuDA: Applying Formal Concept Analysis in a Data Mining Environment. In: Eklund, P. (eds) Concept Lattices. ICFCA 2004. Lecture Notes in Computer Science(), vol 2961. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-24651-0_32

Download citation

  • DOI: https://doi.org/10.1007/978-3-540-24651-0_32

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-21043-6

  • Online ISBN: 978-3-540-24651-0

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics

Search

Navigation