256 search results - page 7 / 52 » A practical comparison of two K-Means clustering algorithms |
ICPR
2008
IEEE
15 years 3 months ago
2008
IEEE
In this paper we propose a new clustering algorithm which combines the FCM clustering algorithm with the supervised learning normal mixture model; we call the algorithm as the FCM...
139
click to vote
CASC
2011
Springer
13 years 9 months ago
2011
Springer
We investigate two practical divide-and-conquer style algorithms for univariate polynomial arithmetic. First we revisit an algorithm originally described by Brent and Kung for comp...
79
Voted
SIGIR
2008
ACM
14 years 9 months ago
2008
ACM
Clustering hypertext document collection is an important task in Information Retrieval. Most clustering methods are based on document content and do not take into account the hype...
78
Voted
ADBIS
2006
Springer
15 years 3 months ago
2006
Springer
XML file comparison and clustering are two challenging tasks still accomplished predominantly manually. XML schema contains information about data structure, types, and labels fou...
75
Voted
CORR
2010
Springer
14 years 9 months ago
2010
Springer
We formulate weighted graph clustering as a prediction problem1 : given a subset of edge weights we analyze the ability of graph clustering to predict the remaining edge weights. ...