Sciweavers

331 search results - page 23 / 67
» A Clustering Algorithm Based Absorbing Nearest Neighbors
Sort
View
ICPR
2008
IEEE
14 years 2 months ago
Clustering by evidence accumulation on affinity propagation
If there are more clusters than the ideal, each intrinsic cluster will be split into several subsets. Theoretically, this split can be arbitrary and neighboring data points have a ...
Xuqing Zhang, Fei Wu, Yueting Zhuang
PODS
1989
ACM
155views Database» more  PODS 1989»
13 years 11 months ago
Fractals for Secondary Key Retrieval
In this paper we propose the use of fractals and especially the Hilbert curve, in order to design good distance-preserving mappings. Such mappings improve the performance of secon...
Christos Faloutsos, Shari Roseman
SIGMOD
2000
ACM
173views Database» more  SIGMOD 2000»
13 years 11 months ago
Efficient Algorithms for Mining Outliers from Large Data Sets
In this paper, we propose a novel formulation for distance-based outliers that is based on the distance of a point from its kth nearest neighbor. We rank each point on the basis o...
Sridhar Ramaswamy, Rajeev Rastogi, Kyuseok Shim
EUROPAR
2007
Springer
14 years 1 months ago
Parallel Nearest Neighbour Algorithms for Text Categorization
In this paper we describe the parallelization of two nearest neighbour classification algorithms. Nearest neighbour methods are well-known machine learning techniques. They have be...
Reynaldo Gil-García, José Manuel Bad...
PRL
2007
146views more  PRL 2007»
13 years 7 months ago
Neighbor number, valley seeking and clustering
This paper proposes a novel nonparametric clustering algorithm capable of identifying shape-free clusters. This algorithm is based on a nonparametric estimation of the normalized ...
Chaolin Zhang, Xuegong Zhang, Michael Q. Zhang, Ya...