Sciweavers

7379 search results - page 16 / 1476
» How Many Clusters
Sort
View
COMPGEOM
2009
ACM
14 years 11 days ago
k-means requires exponentially many iterations even in the plane
The k-means algorithm is a well-known method for partitioning n points that lie in the d-dimensional space into k clusters. Its main features are simplicity and speed in practice....
Andrea Vattani
ACSW
2004
13 years 9 months ago
Clustering Stream Data by Regression Analysis
In data clustering, many approaches have been proposed such as K-means method and hierarchical method. One of the problems is that the results depend heavily on initial values and...
Masahiro Motoyoshi, Takao Miura, Isamu Shioya
USENIX
2000
13 years 9 months ago
MOSIX: How Linux Clusters Solve Real-World Problems
As the complexity of software increases, the size of the software tends to increase as well, which incurs longer compilation and build cycles. In this paper, the authors present o...
Steve McClure, Richard Wheeler
ICTAI
2007
IEEE
14 years 2 months ago
Conceptual Clustering Categorical Data with Uncertainty
Many real datasets have uncertain categorical attribute values that are only approximately measured or imputed. Uncertainty in categorical data is commonplace in many applications...
Yuni Xia, Bowei Xi
COLT
2010
Springer
13 years 5 months ago
Robust Hierarchical Clustering
One of the most widely used techniques for data clustering is agglomerative clustering. Such algorithms have been long used across many different fields ranging from computational...
Maria-Florina Balcan, Pramod Gupta