Sciweavers

2556 search results - page 93 / 512
» Clustering processes
Sort
View
126
Voted
ESOA
2006
15 years 7 months ago
Dynamic Decentralized Any-Time Hierarchical Clustering
Hierarchical clustering is used widely to organize data and search for patterns. Previous algorithms assume that the body of data being clustered is fixed while the algorithm runs...
H. Van Dyke Parunak, Richard Rohwer, Theodore C. B...
122
Voted
JGTOOLS
2008
100views more  JGTOOLS 2008»
15 years 3 months ago
Proximity Cluster Trees
Hierarchical spatial data structures provide a means for organizing data for efficient processing. Most spatial data structures are optimized for performing queries, such as inters...
Elena Jakubiak Hutchinson, Sarah F. Frisken, Ronal...
142
Voted
ICIP
2009
IEEE
15 years 1 months ago
K-means based segmentation for real-time zenithal people counting
The paper presents an efficient and reliable approach to automatic people segmentation, tracking and counting, designed for a system with an overhead mounted (zenithal) camera. Up...
Borislav Antic, Dragan Letic, Dubravko Culibrk, Vl...
118
Voted
AAAI
2008
15 years 6 months ago
Visualization of Large-Scale Weighted Clustered Graph: A Genetic Approach
In this paper, a bottom-up hierarchical genetic algorithm is proposed to visualize clustered data into a planar graph. To achieve global optimization by accelerating local optimiz...
Jiayu Zhou, Youfang Lin, Xi Wang
138
Voted
ICDM
2009
IEEE
167views Data Mining» more  ICDM 2009»
15 years 1 months ago
Self-Adaptive Anytime Stream Clustering
Clustering streaming data requires algorithms which are capable of updating clustering results for the incoming data. As data is constantly arriving, time for processing is limited...
Philipp Kranen, Ira Assent, Corinna Baldauf, Thoma...