skip to main content
article

Generalized pattern extraction from concept lattices

Published: 01 October 2014 Publication History

Abstract

In this paper, we show how the existence of taxonomies on objects and/or attributes can be used in Formal Concept Analysis to help discover generalized concepts. To that end, we analyze three generalization cases (, and ) and present different scenarios of a simultaneous generalization on both objects and attributes. We also discuss the cardinality of the generalized pattern set against the number of simple patterns produced from the initial data set.

References

[1]
Bache, K., Lichman, M.: UCI Machine Learning Repository. University of California, School of Information and Computer Science, Irvine, CA. {http://archive.ics.uci.edu/ml} (2013)
[2]
Adda, M., Valtchev, P., Missaoui, R., Djeraba, C.: Toward recommendation based on ontology-powered web-usage mining. IEEE Int. Comput. 11(4), 45---52 (2007)
[3]
Belohlávek, R., Vychodil, V.: Adding background knowledge to Formal Concept Analysis via attribute dependency formulas. In: SAC, pp. 938---943 (2008)
[4]
Berge, C.: Graphs and Hypergraphs, North Holland Mathematical Library, vol. 6. North Holland, Elsevier, Amsterdam (1979). repr. of the 2., rev. ed. edition
[5]
Cimiano, P., Hotho, A., Stumme, G., Tane, J.: Conceptual knowledge processing with formal concept analysis and ontologies. In: Eklund P.W. (ed.) Concept Lattices, 2nd International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, 23---26 Feb 2004. Proceedings of Lecture Notes in Computer Science, vol. 2961, pp. 189---207. Springer (2004)
[6]
Curé, O., Jeansoulin, R.: An FCA-based solution for ontology mediation. In: ONISW '08: Proceeding of the 2nd International Workshop on Ontologies and Information Systems for the Semantic web, pp 39---46. ACM, New York (2008)
[7]
Duquenne, V.: Lattice drawings and morphisms. In: 8th International Conference on Formal Concept Analysis, pp. 88---103 (2010)
[8]
Elkund, P.W. (ed.): Concept Lattices, 2nd International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, 23---26 Feb 2004. Proceedings, of Lecture Notes in Computer Science, vol. 2961. Springer (2004)
[9]
Erné, M.: Distributive laws for concept lattices. Algebra Univers. 30, 538---580 (1993)
[10]
Fan, L., Xiao, T.: An automatic method for ontology mapping. In: Apolloni, B., Howlett, R.J., Jain, L.C. (eds.) Knowledge-Based Intelligent Information and Engineering Systems. Lecture Notes of Computer Science, vol. 4964, pp. 661---669. Springer (2007)
[11]
Ferre, S., Ridoux, O.: A logical generalization of formal concept analysis. In: 8th International Conference on Conceptual Structures, pp. 371---384 (2000)
[12]
Ferre, S., Ridoux, O.: Introduction to logical information systems. Inf. Process. Manage. 40(3), 383---419 (2004)
[13]
Formica, A.: Ontology-based concept similarity in formal concept analysis. Inf. Sci. 176(18), 2624---2641 (2006)
[14]
Ganter, B.: Attribute exploration with background knowledge. Theor. Comput. Sci. 217(2), 215---233 (1999)
[15]
Ganter, B., Kuznetsov, S.O.: Pattern structures and their projections. In: 9th International Conference on Conceptual Structures, pp. 129---142 (2001)
[16]
Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, New York (1999). Translator-C. Franzke
[17]
Haav, H.-M.: A semi-automatic method to ontology design by using FCA. In: Snásel, V., Belohlávek, R. (eds.) Concept Lattices and Applications (CLA), CEUR Workshop Proceedings, vol. 110. CEUR-WS. org (2004)
[18]
Kaytoue, M., Kuznetsov, S.O., Napoli, A., Duplessis, S.: Mining gene expression data with pattern structures in formal concept analysis. Inf. Sci. 181(10), 1989---2001 (2011)
[19]
Kuznetsov, S.O.: Learning of simple conceptual graphs from positive and negative examples. In: PKDD, pp. 384---391 (1999)
[20]
Kwuida, L., Missaoui, R., Amor, B.B., Boumedjout, L., Vaillancourt, J.: Restrictions on concept lattices for pattern management. In: Kryszkiewicz, M., Obiedkov, S.A., (eds.) Concept Lattices and Applications (CLA), CEUR Workshop Proceedings, vol. 672, pp. 235---246. CEUR-WS.org (2010)
[21]
Kwuida, L., Missaoui, R., Boumedjout, L., Vaillancourt, J.: Mining generalized patterns from large databases using ontologies. CoRR, arXiv:http://arxiv.org/abs/0905.4713 (2009)
[22]
Kwuida, L., Missaoui, R., Vaillancourt, J.: Using taxonomies on objects and attributes to discover generalized patterns. In: Szathmary, L., Priss U. (eds.) CLA, pp. 327---338 (2012)
[23]
Liquiere, M., Sallantin, J.: Structural machine learning with Galois lattice and graphs. In: 15th International Conference on Machine Learning (ICML 1998), pp. 305---313. Madison (1998)
[24]
Pernelle, N., Rousset, M.-C., Soldano, H., Ventos, V.: Zoom: a nested Galois lattices-based system for conceptual clustering. J. Exp. Theor. Artif. Intell. 14(2---3), 157---187 (2002)
[25]
Scheich, P., Skorsky, M., Vogt, F., Wachter, C., Wille, R.: Conceptual data systems. In: Opitz, O., Lausen, B., Klar, R. (eds) Information and Classification, pp. 72---84. Springer, Berlin-Heidelberg (1993)
[26]
Srikant, R., Agrawal, R.: Mining generalized association rules. In: Dayal, U., Gray, P.M.D., Nishio, S. (eds.) VLDB, pp. 407---419. Morgan Kaufmann (1995)
[27]
Stumme, G.: Conceptual on-line analytical processing. In: Tanaka, K., Ghandeharizadeh, S., Kambayashi, Y. (eds.) Information Organization and Databases, chap. 14, pp. 191---203. Kluwer (2000)
[28]
Stumme, G., Alexander, M.: FCA-MERGE: Bottom-up merging of ontologies. In 17th International Joint Conference on Artificial Intelligence (IJCAI) pp. 225---234. Seattle (2001)
[29]
Stumme, G., Taouil, R., Bastide, Y., Pasquier, N., Lakhal, L.: Computing iceberg concept lattices with titanic. Data Knowl. Eng. 42(2), 189---222 (2002)
[30]
Ventos, V., Soldano, H.: Alpha Galois lattices: an overview. In: Ganter, B., Godin, R. (eds.) 3rd International Conference on Formal Concept Analysis, Lecture Notes in Computer Science, vol. 3403, pp. 299---314. Springer (2005)
[31]
Wang, J., He, K.: Towards representing FCA-based ontologies in semantic web rule language. In: CIT '06: Proceedings of the 6th IEEE International Conference on Computer and Information Technology, pp. 41. IEEE Computer Society, Washington (2006)
[32]
Wille, R.: Preconcept algebras and generalized double boolean algebras. In: Eklund P.W. (ed.) Concept Lattices, 2nd International Conference on Formal Concept Analysis, ICFCA 2004, Sydney, Australia, 23---26 Feb 2004. Proceedings, of Lecture Notes in Computer Science, vol. 2961. Springer (2004)

Cited By

View all

Recommendations

Comments

Information & Contributors

Information

Published In

cover image Annals of Mathematics and Artificial Intelligence
Annals of Mathematics and Artificial Intelligence  Volume 72, Issue 1-2
October 2014
191 pages

Publisher

Kluwer Academic Publishers

United States

Publication History

Published: 01 October 2014

Author Tags

  1. 06A15
  2. 68T30
  3. Concept lattices
  4. Formal Concept Analysis
  5. Generalization
  6. Taxonomy

Qualifiers

  • Article

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)0
  • Downloads (Last 6 weeks)0
Reflects downloads up to 16 Oct 2024

Other Metrics

Citations

Cited By

View all

View Options

View options

Get Access

Login options

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media