This paper describes a theoretical framework for inducing knowledge from incomplete data sets. The general framework can be used with any formalism based on a lattice structure. It is illustrated within two formalisms: the attribute-value formalism and Sowa's conceptual graphs. The induction engine is based on a non-supervised algorithm called default clustering which uses the concept of stereotype and the new notion of default subsumption, inspired by the default logic theory. A validation using artificial data sets and an application concerning the extraction of stereotypes from newspaper articles are given at the end of the paper. © Springer-Verlag Berlin Heidelberg 2007.
CITATION STYLE
Velcin, J., & Ganascia, J. G. (2007). Default clustering with conceptual structures. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 4380 LNCS, pp. 1–25). Springer Verlag. https://doi.org/10.1007/978-3-540-70664-9_1
Mendeley helps you to discover research relevant for your work.