Abstract
This paper falls within the framework of Formal Concept Analysis which provides classes (the extents) of objects sharing similar characters (the intents), a description by attributes being associated to each class. In a recent paper by the first author, a new similarity measure between two concepts in a concept lattice was introduced, allowing for a normalization depending on the size of the lattice.In this paper, we compare this similarity measure with existing measures, either based on cardinality of sets or originating from ontology design and based on the graph structure of the lattice. A statistical comparison with existing methods is carried out, and the output of the measure is tested for consistency.
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
Notes
- 1.
Source code available on demand.
References
Adams III, E. N. (1986). N-trees as nestings: Complexity, similarity, and consensus. Journal of Classification, 3, 299–317.
Baader, F., Calvanese, D., Mcguiness, D. L., NARDI, D., & Patel-Schneider, P. F. (Ed.) (2003). The description logic handbook: Theory, implementation, and applications. Cambridge: Cambridge University Press.
Baader, F., Kusters, R., & Molitor, R. (1999). Computing least common subsumers in description logics with existential restrictions. In IJCAI (pp. 96–103).
Barbut, M., & Monjardet, B. (1970). Ordres et classification: Algèbre et combinatoire (tome II). Paris: Hachette.
Caspard, N., & Monjardet, B. (2003). The lattices of Moore families and closure operators on a finite set: A survey. Discrete Applied Mathematics, 127, 241–269.
Caspard, N., Leclerc, B., & Monjardet, B. (2012). Finite ordered sets: Concepts, results and uses. Cambridge: Cambridge University Press.
Domenach, F. (2015). Similarity measures of concept lattices. In B. Lausen, S. Krolak-Schwerdt, & M. Böhmer (Eds.), Data science, learning by latent structures, and knowledge discovery. Studies in classification, data analysis, and knowledge organization (pp. 89–99). Berlin/Heidelberg: Springer. doi:10.1007/978-3-662-44983-7_8. http://dx.doi.org/10.1007/978-3-662-44983-7_8. ISBN: 978-3-662-44982-0.
Domenach, F., & Leclerc, B. (2004). Closure systems, implicational systems, overhanging relations and the case of hierarchical classification. Mathematical Social Sciences, 47(3), 349–366.
Ganter, B., & Wille, R. (1999). Formal concept analysis : Mathematical foundations. New York: Springer.
Jiang, J. J., & Conrath, D. W. (1997). Semantic similarity based on corpus statistics and lexical taxonomy. In International Conference on Research on Computational Linguistics (ROCLING X)
Leacock, C., & Chodorow, M. (1998). Combining local context and wordnet similarity for word sense identification. In C. Fellbaum (Ed.), WordNet: An electronic lexical database (pp. 265–283). Cambridge: MIT Press.
Lin, D. (1998). An information-theoretic definition of similarity. In J. W. Shavlik (Ed.), Proceedings of the Fifteenth International Conference on Machine Learning (ICML ’98) (pp. 296–304). San Francisco, CA: Morgan Kaufmann.
Nguyen, H. A., & Al-Mubaid, H. (2006). New ontology-based semantic similarity measure for the biomedical domain. In Proceedings of the IEEE International Conference on Granular Computing (pp. 623–628).
Pekar, V., & Staab, S. (2002). Taxonomy learning: Factoring the structure of a taxonomy into a semantic classification decision. In COLING ’02 Proceedings of the 19th International Conference on Computational Linguistics (Vol. 1, pp. 1–7).
Rada, R., Mili, H., Bicknell, E., & Blettner, M. (1989). Development and application of a metric on semantic nets. IEEE Transactions on Systems, Man, and Cybernetics, 19, 17–30.
Resnik, P. (1995). Using information content to evaluate semantic similarity in a taxonomy. In C. S. Mellish (Ed.), Proceedings of the 14th International Joint Conference on Artificial intelligence (IJCAI’95) (pp. 448–453).
Sanchez, D., Batet, M., & Isern, D. (2011). Ontology-based information content computation. Knowledge-Based Systems, 24(2), 297–303.
Seco, N., Veale, T., & Hayes, J. (2004). An intrinsic information content metric for semantic similarity in WordNet. In Proceedings of 16th European Conference on Artificial Intelligence, ECAI 2004 (pp. 1089–1090).
Tversky, A. (1977). Features of similarity. Psychological Reviews, 84(4), 327–352.
Wu, Z., & Palmer, M. (1994). Verb semantics and lexical selection. In Proceedings of 32nd Annual Meeting of the Associations for Comp. Linguistics (pp. 133–138).
Zhong, J., Zhu, H., Li, J., & Yu, Y. (2002). Conceptual graph matching for semantic search. In Proceedings of the 10th International Conference on Conceptual Structures (pp. 92–106).
Zhou, Z., Wang, Y., & Gu, J. (2008). A new model of information content for semantic similarity in WordNet. In Proceedings of Second International Conference on Future Generation Communication and Networking Symposia, FGCNS 2008 (pp. 85–89). Sanya: IEEE Computer Society.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Domenach, F., Portides, G. (2016). Similarity Measures on Concept Lattices. In: Wilhelm, A., Kestler, H. (eds) Analysis of Large and Complex Data. Studies in Classification, Data Analysis, and Knowledge Organization. Springer, Cham. https://doi.org/10.1007/978-3-319-25226-1_14
Download citation
DOI: https://doi.org/10.1007/978-3-319-25226-1_14
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-25224-7
Online ISBN: 978-3-319-25226-1
eBook Packages: Mathematics and StatisticsMathematics and Statistics (R0)