Sciweavers

352 search results - page 23 / 71
» A local search approximation algorithm for k-means clusterin...
Sort
View
ESOA
2006
15 years 1 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...
KDD
2004
ACM
158views Data Mining» more  KDD 2004»
15 years 10 months ago
A generalized maximum entropy approach to bregman co-clustering and matrix approximation
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
Arindam Banerjee, Inderjit S. Dhillon, Joydeep Gho...
CEC
2009
IEEE
15 years 4 months ago
A clustering particle swarm optimizer for dynamic optimization
Abstract—In the real world, many applications are nonstationary optimization problems. This requires that optimization algorithms need to not only find the global optimal soluti...
Changhe Li, Shengxiang Yang
70
Voted
ICIP
2001
IEEE
15 years 11 months ago
Video similarity detection with video signature clustering
The proliferation of video content on the web makes similarity detection an indispensable tool in web data management, searching, and navigation. We have previously proposed a com...
Sen-Ching S. Cheung, Avideh Zakhor
MICCAI
2010
Springer
14 years 8 months ago
Guide-Wire Extraction through Perceptual Organization of Local Segments in Fluoroscopic Images
Segmentation of surgical devices in fluoroscopic images and in particular of guide-wires is a valuable element during surgery. In cardiac angioplasty, the problem is particularly ...
Nicolas Honnorat, Régis Vaillant, Nikos Par...