796 search results - page 3 / 160 » Approximating the centroid is hard |
ICDM
2003
IEEE
14 years 23 days ago
2003
IEEE
The Support Vector Machine (SVM) solution corresponds to the centre of the largest sphere inscribed in version space. Alternative approaches like Bayesian Point Machines (BPM) and...
ICMLA
2008
13 years 9 months ago
2008
A method is presented to partition a given set of data entries embedded in Euclidean space by recursively bisecting clusters into smaller ones. The initial set is subdivided into ...
JIIS
2006
13 years 7 months ago
2006
In recent years, emerging applications introduced new constraints for data mining methods. These constraints are typical of a new kind of data: the data streams. In data stream pro...
JUCS
2007
13 years 7 months ago
2007
: An approach to polygonal approximation of regular digital curves based on PSO algorithm is presented. In this paper, each particle corresponds to a candidate solution to the poly...
ICPR
2008
IEEE
14 years 8 months ago
2008
IEEE
We present a new L1-distance-based k-means clustering algorithm to address the challenge of clustering high-dimensional proportional vectors. The new algorithm explicitly incorpor...