2969 search results - page 333 / 594 » A space efficient algorithm for group structure computation |
132
click to vote
ICML
2009
IEEE
16 years 5 months ago
2009
IEEE
The k q-flats algorithm is a generalization of the popular k-means algorithm where q dimensional best fit affine sets replace centroids as the cluster prototypes. In this work, a ...
162
click to vote
GRC
2005
IEEE
15 years 10 months ago
2005
IEEE
Abstract. A new methodology that structures the semantics of a collection of documents into the geometry of a simplicial complex is developed. A simplicial complex is topologically...
187
click to vote
COMGEO
2004
ACM
15 years 4 months ago
2004
ACM
In k-means clustering we are given a set of n data points in d-dimensional space d and an integer k, and the problem is to determine a set of k points in d , called centers, to mi...
175
click to vote
ECCV
2008
Springer
16 years 6 months ago
2008
Springer
We show that the complexity of the recently introduced medoid-shift algorithm in clustering N points is O(N2 ), with a small constant, if the underlying distance is Euclidean. This...
138
click to vote
ICTAC
2004
Springer
15 years 10 months ago
2004
Springer
A model-based approach for minimization of test sets for interactive systems is introduced. Test cases are efficiently generated and selected to cover the behavioral model and the ...