Skip to Main content Skip to Navigation
New interface
Conference papers

KIDS: an iterative algorithm to organize relational knowledge

Abstract : The goal of conceptual clustering is to build a set of embedded classes, which cluster objects based on their similarities. Knowledge organization aims at generating the set of most specific classes: the Generalization Space. It has applications in the field of data mining, knowledge indexation or knowledge acquisition. Efficient algorithms have been proposed for data described in éattribute, valueé pairs formalism and for taking into account domain knowledge. Our research focuses on the organization of relational knowledge represented using conceptual graphs. In order to avoid the combinatorial explosion due to the relations in the building of the Generalization Space, we progressively introduce the complexity of the relations. The KIDS algorithm is based upon an iterative data reformulation which allows us to use an efficient propositional knowledge organization algorithm. Experiments show that the KIDS algorithm builds an organization of relational concepts but remains with a complexity that grows linearly with the number of considered objects.
Document type :
Conference papers
Complete list of metadata

https://hal.archives-ouvertes.fr/hal-01572569
Contributor : Lip6 Publications Connect in order to contact the contributor
Submitted on : Monday, August 7, 2017 - 5:18:24 PM
Last modification on : Thursday, March 31, 2022 - 2:46:03 PM

Links full text

Identifiers

Citation

Mélanie Courtine, Isabelle Bournaud, Jean-Daniel Zucker. KIDS: an iterative algorithm to organize relational knowledge. 12th International Conference on Knowledge Engineering and Knowledge Management (EKAW'2000), Oct 2000, Juan-les-Pins, France. pp.217-232, ⟨10.1007/3-540-39967-4_16⟩. ⟨hal-01572569⟩

Share

Metrics

Record views

28