Sciweavers

671 search results - page 7 / 135
» Mean shift-based clustering
Sort
View
TJS
2010
182views more  TJS 2010»
15 years 1 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
152
Voted
CVPR
2009
IEEE
16 years 10 months ago
Intrinsic Mean Shift for Clustering on Stiefel and Grassmann Manifolds
The mean shift algorithm, which is a nonparametric density estimator for detecting the modes of a distribution on a Euclidean space, was recently extended to operate on analytic ...
Hasan Ertan Çetingül, René Vida...
ACL
1993
15 years 4 months ago
Towards the Automatic Identification of Adjectival Scales: Clustering Adjectives According to Meaning
In this paper we present a method to group adjectives according to their meaning, as a first step towards the automatic identification of adjectival scales. We discuss the propert...
Vasileios Hatzivassiloglou, Kathleen McKeown
EUROPAR
1999
Springer
15 years 7 months ago
Parallel k/h-Means Clustering for Large Data Sets
This paper describes the realization of a parallel version of the k/h-means clustering algorithm. This is one of the basic algorithms used in a wide range of data mining tasks. We ...
Kilian Stoffel, Abdelkader Belkoniene
ISAAC
2009
Springer
175views Algorithms» more  ISAAC 2009»
15 years 9 months 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