Sciweavers

25041 search results - page 49 / 5009
» Algorithms for Clustering Data
Sort
View
ATAL
2003
Springer
14 years 1 months ago
Strategies for the Increased Robustness of Ant-Based Clustering
This paper introduces a set of algorithmic modifications that improve the partitioning results obtained with ant-based clustering. Moreover, general parameter settings and a self-...
Julia Handl, Joshua D. Knowles, Marco Dorigo
ALT
2009
Springer
14 years 5 months ago
Agnostic Clustering
Motivated by the principle of agnostic learning, we present an extension of the model introduced by Balcan, Blum, and Gupta [3] on computing low-error clusterings. The extended mod...
Maria-Florina Balcan, Heiko Röglin, Shang-Hua...
ESANN
2004
13 years 9 months ago
Fast semi-automatic segmentation algorithm for Self-Organizing Maps
Self-Organizing Maps (SOM) are very powerful tools for data mining, in particular for visualizing the distribution of the data in very highdimensional data sets. Moreover, the 2D m...
David Opolon, Fabien Moutarde
IV
2005
IEEE
136views Visualization» more  IV 2005»
14 years 1 months ago
Improved Visual Clustering of Large Multi-dimensional Data Sets
Lowering computational cost of data analysis and visualization techniques is an essential step towards including the user in the visualization. In this paper we present an improve...
Eduardo Tejada, Rosane Minghim
VLDB
1999
ACM
224views Database» more  VLDB 1999»
14 years 7 days ago
Optimal Grid-Clustering: Towards Breaking the Curse of Dimensionality in High-Dimensional Clustering
Many applications require the clustering of large amounts of high-dimensional data. Most clustering algorithms, however, do not work e ectively and e ciently in highdimensional sp...
Alexander Hinneburg, Daniel A. Keim