15494 search results - page 196 / 3099 » Computing dynamic clusters |
154
Voted
ICMLA
2008
15 years 7 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 ...
151
click to vote
JCP
2008
15 years 6 months ago
2008
Finding clusters with widely differing sizes, shapes and densities in presence of noise and outliers is a challenging job. The DBSCAN is a versatile clustering algorithm that can f...
182
click to vote
CLUSTER
2008
IEEE
16 years 23 days ago
2008
IEEE
—A key benefit of utility data centers and cloud computing infrastructures is the level of consolidation they can offer to arbitrary guest applications, and the substantial savi...
197
click to vote
ADBIS
2007
Springer
16 years 14 days ago
2007
Springer
In solving the classification problem in relational data mining, traditional methods, for example, the C4.5 and its variants, usually require data transformations from datasets sto...
172
click to vote
PR
2008
15 years 6 months ago
2008
In this paper, we extend the conventional vector quantization by incorporating a vigilance parameter, which steers the tradeoff between plasticity and stability during incremental...