Sciweavers

766 search results - page 24 / 154
» Clustering high dimensional data using subspace and projecte...
Sort
View
ICDM
2003
IEEE
111views Data Mining» more  ICDM 2003»
14 years 1 months ago
OP-Cluster: Clustering by Tendency in High Dimensional Space
Clustering is the process of grouping a set of objects into classes of similar objects. Because of unknownness of the hidden patterns in the data sets, the definition of similari...
Jinze Liu, Wei Wang 0010
SSD
2005
Springer
122views Database» more  SSD 2005»
14 years 2 months ago
Selectivity Estimation of High Dimensional Window Queries via Clustering
Abstract. Query optimization is an important functionality of modern database systems and often based on estimating the selectivity of queries before actually executing them. Well-...
Christian Böhm, Hans-Peter Kriegel, Peer Kr&o...
ICDM
2005
IEEE
151views Data Mining» more  ICDM 2005»
14 years 2 months ago
A Framework for Semi-Supervised Learning Based on Subjective and Objective Clustering Criteria
In this paper, we propose a semi-supervised framework for learning a weighted Euclidean subspace, where the best clustering can be achieved. Our approach capitalizes on user-const...
Maria Halkidi, Dimitrios Gunopulos, Nitin Kumar, M...
IEEEVAST
2010
13 years 3 months ago
Finding and visualizing relevant subspaces for clustering high-dimensional astronomical data using connected morphological opera
Data sets in astronomy are growing to enormous sizes. Modern astronomical surveys provide not only image data but also catalogues of millions of objects (stars, galaxies), each ob...
Bilkis J. Ferdosi, Hugo Buddelmeijer, Scott Trager...
KDD
2005
ACM
118views Data Mining» more  KDD 2005»
14 years 9 months ago
On the use of linear programming for unsupervised text classification
We propose a new algorithm for dimensionality reduction and unsupervised text classification. We use mixture models as underlying process of generating corpus and utilize a novel,...
Mark Sandler