Sciweavers

1285 search results - page 31 / 257
» On the Complexity of Ordinal Clustering
Sort
View
CIKM
2008
Springer
13 years 10 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
ICDE
1999
IEEE
183views Database» more  ICDE 1999»
14 years 10 months ago
ROCK: A Robust Clustering Algorithm for Categorical Attributes
Clustering, in data mining, is useful to discover distribution patterns in the underlying data. Clustering algorithms usually employ a distance metric based (e.g., euclidean) simi...
Sudipto Guha, Rajeev Rastogi, Kyuseok Shim
ICML
2006
IEEE
14 years 9 months ago
Discriminative cluster analysis
Clustering is one of the most widely used statistical tools for data analysis. Among all existing clustering techniques, k-means is a very popular method because of its ease of pr...
Fernando De la Torre, Takeo Kanade
SSDBM
2006
IEEE
123views Database» more  SSDBM 2006»
14 years 2 months ago
Mining Hierarchies of Correlation Clusters
The detection of correlations between different features in high dimensional data sets is a very important data mining task. These correlations can be arbitrarily complex: One or...
Elke Achtert, Christian Böhm, Peer Kröge...
CEC
2009
IEEE
14 years 1 months ago
Automatic clustering with multi-objective Differential Evolution algorithms
—This paper applies the Differential Evolution (DE) algorithm to the task of automatic fuzzy clustering in a Multi-objective Optimization (MO) framework. It compares the performa...
Kaushik Suresh, Debarati Kundu, Sayan Ghosh, Swaga...