Default Clustering from Sparse Data Sets

Abstract : Categorization with a very high missing data rate is seldom studied, especially from a non-probabilistic point of view. This paper proposes a new algorithm called default clustering that relies on default reasoning and uses the local search paradigm. Two kinds of experiments are considered: the first one presents the results obtained on artificial data sets, the second uses an original and real case where political stereotypes are extracted from newspaper articles at the end of the 19th century.
Document type :
Conference papers
Complete list of metadatas

https://hal.archives-ouvertes.fr/hal-01490510
Contributor : Lip6 Publications <>
Submitted on : Wednesday, March 15, 2017 - 2:29:06 PM
Last modification on : Thursday, March 21, 2019 - 1:04:52 PM

Links full text

Identifiers

Citation

Julien Velcin, Jean-Gabriel Ganascia. Default Clustering from Sparse Data Sets. ECSQARU 2005 - 8th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty, Jul 2005, Barcelona, Spain. pp.968-979, ⟨10.1007/11518655_81⟩. ⟨hal-01490510⟩

Share

Metrics

Record views

97