Sciweavers

1836 search results - page 46 / 368
» Mining Clustering Dimensions
Sort
View
DOLAP
2004
ACM
15 years 7 months ago
Handling big dimensions in distributed data warehouses using the DWS technique
The DWS (Data Warehouse Striping) technique allows the distribution of large data warehouses through a cluster of computers. The data partitioning approach partition the facts tab...
Marco Costa, Henrique Madeira
ICDM
2005
IEEE
138views Data Mining» more  ICDM 2005»
15 years 7 months ago
On Feature Selection through Clustering
We study an algorithm for feature selection that clusters attributes using a special metric and then makes use of the dendrogram of the resulting cluster hierarchy to choose the m...
Richard Butterworth, Gregory Piatetsky-Shapiro, Da...
ICDM
2005
IEEE
151views Data Mining» more  ICDM 2005»
15 years 7 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...
GECCO
2004
Springer
127views Optimization» more  GECCO 2004»
15 years 7 months ago
Improved Niching and Encoding Strategies for Clustering Noisy Data Sets
Clustering is crucial to many applications in pattern recognition, data mining, and machine learning. Evolutionary techniques have been used with success in clustering, but most su...
Olfa Nasraoui, Elizabeth Leon
CVPR
2004
IEEE
16 years 3 months ago
Minimum Effective Dimension for Mixtures of Subspaces: A Robust GPCA Algorithm and Its Applications
In this paper, we propose a robust model selection criterion for mixtures of subspaces called minimum effective dimension (MED). Previous information-theoretic model selection cri...
Kun Huang, René Vidal, Yi Ma