Sciweavers

436 search results - page 26 / 88
» Automatic Subspace Clustering of High Dimensional Data for D...
Sort
View
SOCO
2008
Springer
13 years 7 months ago
A particular Gaussian mixture model for clustering and its application to image retrieval
We introduce a new method for data clustering based on a particular Gaussian mixture model (GMM). Each cluster of data, modeled as a GMM into an input space, is interpreted as a hy...
Hichem Sahbi
DMIN
2006
115views Data Mining» more  DMIN 2006»
13 years 9 months ago
Privacy Preserving in Clustering using Fuzzy Sets
Data mining techniques, in spite of their benefit in a wide range of applications have also raised threat to privacy and data security. This paper addresses the problem of preservi...
S. Srinivasa Rao 0002, K. V. S. V. N. Raju, P. Kus...
TKDE
2011
332views more  TKDE 2011»
13 years 2 months ago
Adaptive Cluster Distance Bounding for High-Dimensional Indexing
—We consider approaches for similarity search in correlated, high-dimensional data-sets, which are derived within a clustering framework. We note that indexing by “vector appro...
Sharadh Ramaswamy, Kenneth Rose
OSDI
2008
ACM
13 years 10 months ago
DryadLINQ: A System for General-Purpose Distributed Data-Parallel Computing Using a High-Level Language
DryadLINQ is a system and a set of language extensions that enable a new programming model for large scale distributed computing. It generalizes previous execution environments su...
Yuan Yu, Michael Isard, Dennis Fetterly, Mihai Bud...
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...