Sciweavers

1285 search results - page 73 / 257
» On the Complexity of Ordinal Clustering
Sort
View
FGCS
2007
89views more  FGCS 2007»
13 years 9 months ago
Federated grid clusters using service address routed optical networks
Clusters of computers have emerged as cost-effective parallel and/or distributed computing systems for computationally intensive tasks. Normally, clusters are composed of high per...
Isaac D. Scherson, Daniel S. Valencia, Enrique Cau...
PR
2006
122views more  PR 2006»
13 years 8 months ago
Fast multiscale clustering and manifold identification
We present a novel multiscale clustering algorithm inspired by algebraic multigrid techniques. Our method begins with assembling data points according to local similarities. It us...
Dan Kushnir, Meirav Galun, Achi Brandt
PRL
2007
146views more  PRL 2007»
13 years 8 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...
PKDD
2010
Springer
141views Data Mining» more  PKDD 2010»
13 years 6 months ago
On Detecting Clustered Anomalies Using SCiForest
Detecting local clustered anomalies is an intricate problem for many existing anomaly detection methods. Distance-based and density-based methods are inherently restricted by their...
Fei Tony Liu, Kai Ming Ting, Zhi-Hua Zhou
CGF
2010
171views more  CGF 2010»
13 years 5 months ago
Efficient Mean-shift Clustering Using Gaussian KD-Tree
Mean shift is a popular approach for data clustering, however, the high computational complexity of the mean shift procedure limits its practical applications in high dimensional ...
Chunxia Xiao, Meng Liu