Sciweavers

256 search results - page 8 / 52
» A practical comparison of two K-Means clustering algorithms
Sort
View
SIAMJO
2008
117views more  SIAMJO 2008»
15 years 5 months ago
Two Algorithms for the Minimum Enclosing Ball Problem
Given A := {a1, . . . , am} Rn and > 0, we propose and analyze two algorithms for the problem of computing a (1 + )-approximation to the radius of the minimum enclosing ball o...
E. Alper Yildirim
GECCO
2009
Springer
254views Optimization» more  GECCO 2009»
16 years 15 days ago
Agglomerative genetic algorithm for clustering in social networks
Size and complexity of data repositories collaboratively created by Web users generate a need for new processing approaches. In this paper, we study the problem of detection of ï¬...
Marek Lipczak, Evangelos E. Milios
ISPASS
2006
IEEE
15 years 12 months ago
Comparing multinomial and k-means clustering for SimPoint
SimPoint is a technique used to pick what parts of the program’s execution to simulate in order to have a complete picture of execution. SimPoint uses data clustering algorithms...
Greg Hamerly, Erez Perelman, Brad Calder
ICSE
2004
IEEE-ACM
16 years 6 months ago
An Empirical Comparison of Dynamic Impact Analysis Algorithms
Impact analysis -- determining the potential effects of changes on a software system -- plays an important role in software engineering tasks such as maintenance, regression testi...
Alessandro Orso, Taweesup Apiwattanapong, James La...
IDA
2003
Springer
15 years 11 months ago
Fuzzy Clustering of Short Time-Series and Unevenly Distributed Sampling Points
This paper proposes a new clustering algorithm in the fuzzy-c-means family, which is designed to cluster time series and is particularly suited for short time series and those wit...
Carla S. Möller-Levet, Frank Klawonn, Kwang-H...