Sciweavers

25041 search results - page 112 / 5009
» Algorithms for Clustering Data
Sort
View
ESANN
2008
13 years 9 months ago
SOM based clustering with instance-level constraints
This paper describes a new topological map dedicated to clustering under instance-level constraints. In general, traditional clustering is used in an unsupervised manner. However,...
Fazia Bellal, Khalid Benabdeslem, Alexandre Aussem
COLT
2003
Springer
14 years 1 months ago
On Finding Large Conjunctive Clusters
We propose a new formulation of the clustering problem that differs from previous work in several aspects. First, the goal is to explicitly output a collection of simple and meani...
Nina Mishra, Dana Ron, Ram Swaminathan
ICDE
2003
IEEE
148views Database» more  ICDE 2003»
14 years 9 months ago
Dynamic Clustering of Evolving Streams with a Single Pass
Stream data is common in many applications, e.g., stock quotes, merchandize sales record, system logs, etc.. It is of great importance to analyze these stream data. As one of the ...
Jiong Yang
DMIN
2006
122views Data Mining» more  DMIN 2006»
13 years 9 months ago
Clustering of Bi-Dimensional and Heterogeneous Time Series: Application to Social Sciences Data
We present an application of bi-dimensional and heterogeneous time series clustering in order to resolve a Social Sciences issue. The dataset is the result of a survey involving mo...
Rémi Gaudin, Sylvaine Barbier, Nicolas Nico...
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
14 years 8 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...