Abstract
Representing concept lattices constructed from large contexts often results in heavy, complex diagrams that can be impractical to handle and, eventually, to make sense of. In this respect, many concepts could allegedly be dropped from the lattice without impairing its relevance towards a taxonomy description task at a certain level of detail. We propose a method where the notion of stability is introduced to select potentially more pertinent concepts. We present some theoretical properties of stability and discuss several use cases where taxonomy building is an issue.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Wille, R.: Concept lattices and conceptual knowledge systems. Computers & Mathematics with Applications 23, 493–515 (1992)
Ferré, S., Ridoux, O.: A file system based on concept analysis. In: Palamidessi, C., Moniz Pereira, L., Lloyd, J.W., Dahl, V., Furbach, U., Kerber, M., Lau, K.-K., Sagiv, Y., Stuckey, P.J. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 1033–1047. Springer, Heidelberg (2000)
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999)
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with TITANIC. Data & Knowledge Engineering 42, 189–222 (2002)
Roth, C., Obiedkov, S., Kourie, D.G.: Towards concise representation for taxonomies of epistemic communities. In: Ben Yahia, S., Mephu Nguifo, E. (eds.) CLA 4th International Conference on Concept Lattices and their Applications, Tunis, Faculté des Sciences de Tunis, pp. 205–218 (2006)
Roth, C., Bourgine, P.: Lattice-based dynamic and overlapping taxonomies: The case of epistemic communities. Scientometrics 69(2), 429–447 (2006)
Kuznetsov, S.O.: Stability as an estimate of the degree of substantiation of hypotheses derived on the basis of operational similarity. Nauchn. Tekh. Inf., Ser.2 (Automat. Document. Math. Linguist.) 12, 21–29 (1990)
Kuznetsov, S.O.: On stability of a formal concept. In: SanJuan, E. (ed.) JIM, Metz, France (2003)
Kuznetsov, S.O., Obiedkov, S.: Comparing performance of algorithms for generating concept lattices. J. Expt. Theor. Artif. Intell. 14(2/3), 189–216 (2002)
Bayardo, Jr., R., Goethals, B., Zaki, M. (eds.): FIMI 2004. Proc. of the IEEE ICDM Workshop on Frequent Itemset Mining Implementations, CEUR-WS.org (2004)
Godin, R., Missaoui, R., Allaoui, H.: Incremental concept formation algorithms based on Galois lattices. Computational Intelligence 11(2), 246–267 (1995)
Haas, P.: Introduction: epistemic communities and international policy coordination. International Organization 46(1), 1–35 (1992)
Porter, M.F.: An algorithm for suffix stripping. Program 14(3), 130–137 (1980)
Davis, A., Gardner, B.B., Gardner, M.R.: Deep South. University of Chicago Press, Chicago (1941)
Freeman, L.C., White, D.R.: Using Galois lattices to represent network data. Sociological Methodology 23, 127–146 (1993)
Freeman, L.: Finding social groups: A meta-analysis of the southern women data. In: Breiger, R., Carley, K., Pattison, P. (eds.) Dynamic Social Network Modeling and Analysis, pp. 39–97. National Academies Press, Washington, DC (2003)
Doreian, P.: On the delineation of small group structure. In: Hudson, H.C. (ed.) Classifying Social Data, pp. 215–230. Jossey-Bass, San Francisco (1979)
Atkin, R.: Mathematical Structure in Human Affairs. Heinemann Educational Books, London (1974)
Johnson, J.H.: Stars, maximal rectangles, lattices: A new perspective on Q-analysis. International Journal of Man-Machine Studies 24(3), 293–299 (1986)
Wille, R.: Conceptual structures of multicontexts. In: Eklund, P.W., Mann, G.A., Ellis, G. (eds.) ICCS 1996. LNCS, vol. 1115, pp. 23–29. Springer, Heidelberg (1996)
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2007 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kuznetsov, S., Obiedkov, S., Roth, C. (2007). Reducing the Representation Complexity of Lattice-Based Taxonomies. In: Priss, U., Polovina, S., Hill, R. (eds) Conceptual Structures: Knowledge Architectures for Smart Applications. ICCS 2007. Lecture Notes in Computer Science(), vol 4604. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-73681-3_18
Download citation
DOI: https://doi.org/10.1007/978-3-540-73681-3_18
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-73680-6
Online ISBN: 978-3-540-73681-3
eBook Packages: Computer ScienceComputer Science (R0)