Sciweavers

1301 search results - page 1 / 261
» Default Clustering from Sparse Data Sets
Sort
View
ECSQARU
2005
Springer
13 years 10 months ago
Default Clustering from Sparse Data Sets
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 clusterin...
Julien Velcin, Jean-Gabriel Ganascia
ER
2004
Springer
103views Database» more  ER 2004»
13 years 10 months ago
Modeling Default Induction with Conceptual Structures
Our goal is to model the way people induce knowledge from rare and sparse data. This paper describes a theoretical framework for inducing knowledge from these incomplete data descr...
Julien Velcin, Jean-Gabriel Ganascia
ICCS
2004
Springer
13 years 10 months ago
Clustering of Conceptual Graphs with Sparse Data
This paper gives a theoretical framework for clustering a set of conceptual graphs characterized by sparse descriptions. The formed clusters are named in an intelligible manner thr...
Jean-Gabriel Ganascia, Julien Velcin
JODS
2007
102views Data Mining» more  JODS 2007»
13 years 4 months ago
Default Clustering with Conceptual Structures
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...
Julien Velcin, Jean-Gabriel Ganascia
FLAIRS
2009
13 years 2 months ago
Mining Default Rules from Statistical Data
In this paper, we are interested in the qualitative knowledge that underlies some given probabilistic information. To represent such qualitative structures, we use ordinal conditi...
Gabriele Kern-Isberner, Matthias Thimm, Marc Finth...