Sciweavers

1836 search results - page 8 / 368
» Mining Clustering Dimensions
Sort
View
ECML
2005
Springer
13 years 9 months ago
Clustering and Metaclustering with Nonnegative Matrix Decompositions
Although very widely used in unsupervised data mining, most clustering methods are affected by the instability of the resulting clusters w.r.t. the initialization of the algorithm ...
Liviu Badea
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
14 years 25 days ago
A Bi-clustering Framework for Categorical Data
Bi-clustering is a promising conceptual clustering approach. Within categorical data, it provides a collection of (possibly overlapping) bi-clusters, i.e., linked clusters for both...
Ruggero G. Pensa, Céline Robardet, Jean-Fra...
SDM
2009
SIAM
184views Data Mining» more  SDM 2009»
14 years 4 months ago
DensEst: Density Estimation for Data Mining in High Dimensional Spaces.
Subspace clustering and frequent itemset mining via “stepby-step” algorithms that search the subspace/pattern lattice in a top-down or bottom-up fashion do not scale to large ...
Emmanuel Müller, Ira Assent, Ralph Krieger, S...
SDM
2004
SIAM
162views Data Mining» more  SDM 2004»
13 years 8 months ago
Subspace Clustering of High Dimensional Data
Clustering suffers from the curse of dimensionality, and similarity functions that use all input features with equal relevance may not be effective. We introduce an algorithm that...
Carlotta Domeniconi, Dimitris Papadopoulos, Dimitr...
SDM
2012
SIAM
452views Data Mining» more  SDM 2012»
11 years 9 months ago
Density-based Projected Clustering over High Dimensional Data Streams
Clustering of high dimensional data streams is an important problem in many application domains, a prominent example being network monitoring. Several approaches have been lately ...
Irene Ntoutsi, Arthur Zimek, Themis Palpanas, Peer...