Sciweavers

985 search results - page 37 / 197
» An Experiment with Distance Measures for Clustering
Sort
View
VTC
2007
IEEE
164views Communications» more  VTC 2007»
15 years 4 months ago
Joint Distributed Clustering and Ranging for Wireless Ad-Hoc Sensor Networks
— This paper discusses a joint decentralized clustering and ranging algorithm for wireless ad-hoc sensor networks. Each sensor uses a random waiting timer and local criteria to d...
Chih-Yu Wen, Jun-Koh Chen, William A. Sethares
ADMI
2010
Springer
14 years 11 months ago
Clustering in a Multi-Agent Data Mining Environment
A Multi-Agent based approach to clustering using a generic Multi-Agent Data Mining (MADM) framework is described. The process use a collection of agents, running several different ...
Santhana Chaimontree, Katie Atkinson, Frans Coenen
KDD
2004
ACM
113views Data Mining» more  KDD 2004»
15 years 10 months ago
Learning spatially variant dissimilarity (SVaD) measures
Clustering algorithms typically operate on a feature vector representation of the data and find clusters that are compact with respect to an assumed (dis)similarity measure betwee...
Krishna Kummamuru, Raghu Krishnapuram, Rakesh Agra...
ICPR
2008
IEEE
15 years 4 months ago
Effective scene matching with local feature representatives
Scene matching measures the similarity of scenes in photos and is of central importance in applications where we have to properly organize large amount of digital photos by scene ...
Shugao Ma, Weiqiang Wang, Qingming Huang, Shuqiang...
VISUALIZATION
2000
IEEE
15 years 2 months ago
Topology preserving compression of 2D vector fields
We present an algorithm for compressing 2D vector fields that preserves topology. Our approach is to simplify the given data set using constrained clustering. We employ different...
Suresh K. Lodha, Jose C. Renteria, Krishna M. Rosk...