Sciweavers

985 search results - page 33 / 197
» An Experiment with Distance Measures for Clustering
Sort
View
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
16 years 20 days ago
Worst-Case and Smoothed Analysis of k-Means Clustering with Bregman Divergences
The k-means algorithm is the method of choice for clustering large-scale data sets and it performs exceedingly well in practice. Most of the theoretical work is restricted to the c...
Bodo Manthey, Heiko Röglin
CVPR
2007
IEEE
16 years 8 months ago
High-dimensional statistical distance for region-of-interest tracking: Application to combining a soft geometric constraint with
This paper deals with region-of-interest (ROI) tracking in video sequences. The goal is to determine in successive frames the region which best matches, in terms of a similarity m...
Sylvain Boltz, Eric Debreuve, Michel Barlaud
TJS
2010
182views more  TJS 2010»
15 years 4 months ago
A novel unsupervised classification approach for network anomaly detection by k-Means clustering and ID3 decision tree learning
This paper presents a novel host-based combinatorial method based on k-Means clustering and ID3 decision tree learning algorithms for unsupervised classification of anomalous and ...
Yasser Yasami, Saadat Pour Mozaffari
ESWA
2010
158views more  ESWA 2010»
15 years 3 months ago
Interval competitive agglomeration clustering algorithm
1 In this study, a novel robust clustering algorithm, robust interval competitive agglomeration (RICA) clustering algorithm, is proposed to overcome the problems of the outliers, t...
Jin-Tsong Jeng, Chen-Chia Chuang, Chin-Wang Tao
CVPR
2006
IEEE
16 years 8 months ago
Diffusion Distance for Histogram Comparison
In this paper we propose diffusion distance, a new dissimilarity measure between histogram-based descriptors. We define the difference between two histograms to be a temperature f...
Haibin Ling, Kazunori Okada