Advertisement

Sorting Concepts by Priority Using the Theory of Monotone Systems

  • Ants Torim
  • Karin Lindroos
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 5113)

Abstract

Formal concept analysis is a powerful tool for conceptual modeling and knowledge discovery. As size of a concept lattice can easily get very large, there is a need for presenting information in the lattice in a more compressed form. We propose a novel method MONOCLE for this task that is based on the theory of monotone systems. The result of our method is a sequence of concepts, sorted by “goodness” thus enabling us to select a subset and a corresponding sub-lattice of desired size. That is achieved by defining a weight function that is monotone, correlated with area of data table covered and inversely correlated to overlaps of concepts. We can also use monotone systems theory of “kernels” to detect good cut-off points in the concept sequence. We apply our method to social and economic data of two Estonian islands and show that results are compact and useful.

Keywords

Minus Technique Concept Lattice Formal Concept Analysis Subset Relation Local Kernel 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bělohlávek, R., Vychodil, V.: Formal Concept Analysis with Constraints by Closure Operators. In: Ganter, B., Godin, R. (eds.) ICFCA 2005. LNCS (LNAI), vol. 3403, pp. 176–191. Springer, Heidelberg (2005)Google Scholar
  2. 2.
    Davey, B.A., Priestley, H.A.: Introduction to Lattices and Order 2nd Revised edn. Cambridge University Press, Cambridge (2002)Google Scholar
  3. 3.
    Galicia Home Page [WWW] (December 30, 2007), http://www.iro.umontreal.ca/~valtchev/galicia/
  4. 4.
    Ganter, B., Wille, R.: Formal Concept Analysis, Mathematical Foundation. Springer, Heidelberg (1998)Google Scholar
  5. 5.
    Juurikas, K., Torim, A., Võhandu, L.: Multivariate Data Visualization in Social Space. In: Procs. of IADIS International Conf. on Applied Computing, pp. 427–432 (2006)Google Scholar
  6. 6.
    Kuznetsov, S.O.: On stability of a formal concept. Annals of Mathematics and Artificial Intelligence 49, 101–115 (2007)zbMATHCrossRefMathSciNetGoogle Scholar
  7. 7.
    Mullat, I.: Extremal Monotonic Systems (in Russian). Automation and Remote Control No 5, 130–139 (1976) (in English), [WWW] (December 31, 2007) , http://www.datalaundering.com/download/extrem01.pdf
  8. 8.
    Stumme, G., Taouil, R., Bastide, Y., Lakhal, L.: Conceptual Clustering with Iceberg Concept Lattices. In: Proc. GI-Fachgruppentreffen Maschinelles Lernen 2001,Universität Dortmund 763 (2001)Google Scholar
  9. 9.
    Valtchev, P., Grosser, D., Roume, C., Hacene, R.H.: GALICIA: an open platform for lattices. In: Using Conceptual Structures: Contrib. to the 11th ICCS, pp. 241–254 (2003)Google Scholar
  10. 10.
    Võhandu, L., Kuusik, R., Torim, A., Aab, E., Lind, G.: Some Monotone Systems Algorithms for Data Mining. WSEAS Transactions on Information Science & Applications, 802–809 (2006)Google Scholar
  11. 11.
    Wille, R., Stumme, G., Ganter, B.: Formal Concept Analysis: Foundations and Applications. Springer, Heidelberg (2005)zbMATHGoogle Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2008

Authors and Affiliations

  • Ants Torim
    • 1
  • Karin Lindroos
    • 1
  1. 1.Tallinn University of TechnologyTallinnEstonia

Personalised recommendations