Sciweavers

69 search results - page 5 / 14
» Proximity Algorithms for Nearly-Doubling Spaces
Sort
View
ICPR
2004
IEEE
14 years 8 months ago
Direct Condensing: An Efficient Voronoi Condensing Algorithm for Nearest Neighbor Classifiers
Voronoi condensing reduces training patterns of nearest neighbor classifiers without changing the classification boundaries. This method plays important roles not only in the near...
Takekazu Kato, Toshikazu Wada
VLDB
2005
ACM
153views Database» more  VLDB 2005»
14 years 7 months ago
An effective and efficient algorithm for high-dimensional outlier detection
Abstract. The outlier detection problem has important applications in the field of fraud detection, network robustness analysis, and intrusion detection. Most such applications are...
Charu C. Aggarwal, Philip S. Yu
IPL
2006
108views more  IPL 2006»
13 years 7 months ago
Robustness of k-gon Voronoi diagram construction
In this paper, we present a plane sweep algorithm for constructing the Voronoi diagram of a set of non-crossing line segments in 2D space using a distance metric induced by a regu...
Zhenming Chen, Evanthia Papadopoulou, Jinhui Xu
SIGMOD
2000
ACM
165views Database» more  SIGMOD 2000»
13 years 12 months ago
Finding Generalized Projected Clusters In High Dimensional Spaces
High dimensional data has always been a challenge for clustering algorithms because of the inherent sparsity of the points. Recent research results indicate that in high dimension...
Charu C. Aggarwal, Philip S. Yu
VLDB
1997
ACM
170views Database» more  VLDB 1997»
13 years 11 months ago
M-tree: An Efficient Access Method for Similarity Search in Metric Spaces
A new access method, called M-tree, is proposed to organize and search large data sets from a generic "metric space", i.e. where object proximity is only defined by a di...
Paolo Ciaccia, Marco Patella, Pavel Zezula