5733 search results - page 158 / 1147 » Clustering Categorical Data |
184
Voted
ICTAI
2006
IEEE
16 years 1 months ago
2006
IEEE
We propose two Euclidean minimum spanning tree based clustering algorithms — one a k-constrained, and the other an unconstrained algorithm. Our k-constrained clustering algorith...
224
click to vote
SIGMOD
2000
ACM
15 years 11 months ago
2000
ACM
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
188
click to vote
CIKM
2006
Springer
15 years 10 months ago
2006
Springer
Incremental hierarchical text document clustering algorithms are important in organizing documents generated from streaming on-line sources, such as, Newswire and Blogs. However, ...
222
click to vote
ICDE
2009
IEEE
16 years 1 months ago
2009
IEEE
— In this paper, we will study the problem of projected clustering of uncertain data streams. The use of uncertainty is especially important in the high dimensional scenario, bec...
211
click to vote
MCS
2005
Springer
16 years 17 days ago
2005
Springer
Abstract. In this paper, we propose a cluster-based cumulative representation for cluster ensembles. Cluster labels are mapped to incrementally accumulated clusters, and a matching...