Sciweavers

538 search results - page 37 / 108
» Dimension induced clustering
Sort
View
168
Voted
ICMLA
2004
15 years 6 months ago
PolyCluster: an interactive visualization approach to construct classification rules
This paper introduces a system, called PolyCluster, which adopts state-of-the-art algorithms for data visualization and integrates human domain knowledge into the construction pro...
Danyu Liu, Alan P. Sprague, Jeffrey G. Gray
CSDA
2010
105views more  CSDA 2010»
15 years 5 months ago
James-Stein shrinkage to improve k-means cluster analysis
We study a general algorithm to improve accuracy in cluster analysis that employs the James-Stein shrinkage effect in k-means clustering. We shrink the centroids of clusters towar...
Jinxin Gao, David B. Hitchcock
195
Voted
MLDM
2010
Springer
15 years 3 days ago
Fast Algorithms for Constant Approximation k-Means Clustering
In this paper we study the k-means clustering problem. It is well-known that the general version of this problem is NP-hard. Numerous approximation algorithms have been proposed fo...
Mingjun Song, Sanguthevar Rajasekaran
PKDD
2005
Springer
117views Data Mining» more  PKDD 2005»
15 years 10 months 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...
CVPR
2004
IEEE
16 years 7 months ago
Robust Subspace Clustering by Combined Use of kNND Metric and SVD Algorithm
Subspace clustering has many applications in computer vision, such as image/video segmentation and pattern classification. The major issue in subspace clustering is to obtain the ...
Qifa Ke, Takeo Kanade