Default clustering from sparse data sets

Authors:
J. Velcin;J. -G. Ganascia
Affiliations:
LIP6, Université Paris VI, Paris, France;LIP6, Université Paris VI, Paris, France
Venue:
ECSQARU'05 Proceedings of the 8th European conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
Year:
2005

Citing 5
Cited 0

Tabu Search

Tabu Search
Knowledge Acquisition Via Incremental Conceptual Clustering

Machine Learning
An experimental study of concept formation

An experimental study of concept formation
Clustering Binary Fingerprint Vectors with Missing Values for DNA Array Data Analysis

CSB '03 Proceedings of the IEEE Computer Society Conference on Bioinformatics
A Grey-Based Nearest Neighbor Approach for Missing Attribute Value Prediction

Applied Intelligence

Quantified Score

Hi-index	0.00

Visualization

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.