Sciweavers

960 search results - page 107 / 192
» CURE: An Efficient Clustering Algorithm for Large Databases
Sort
View
CORR
1999
Springer
222views Education» more  CORR 1999»
15 years 3 months ago
Analysis of approximate nearest neighbor searching with clustered point sets
Abstract. Nearest neighbor searching is a fundamental computational problem. A set of n data points is given in real d-dimensional space, and the problem is to preprocess these poi...
Songrit Maneewongvatana, David M. Mount
PAMI
2007
262views more  PAMI 2007»
15 years 3 months ago
An Efficient Multimodal 2D-3D Hybrid Approach to Automatic Face Recognition
—We present a fully automatic face recognition algorithm and demonstrate its performance on the FRGC v2.0 data. Our algorithm is multimodal (2D and 3D) and performs hybrid (featu...
Ajmal S. Mian, Mohammed Bennamoun, Robyn A. Owens
ADMA
2009
Springer
186views Data Mining» more  ADMA 2009»
15 years 10 months ago
Mining Compressed Repetitive Gapped Sequential Patterns Efficiently
Mining frequent sequential patterns from sequence databases has been a central research topic in data mining and various efficient mining sequential patterns algorithms have been p...
Yongxin Tong, Zhao Li, Dan Yu, Shilong Ma, Zhiyuan...
KBS
2006
87views more  KBS 2006»
15 years 3 months ago
Predictive and comprehensible rule discovery using a multi-objective genetic algorithm
We present a multi-objective genetic algorithm for mining highly predictive and comprehensible classification rules from large databases. We emphasize predictive accuracy and comp...
Satchidananda Dehuri, Rajib Mall
SIGMOD
2007
ACM
186views Database» more  SIGMOD 2007»
16 years 4 months ago
Fg-index: towards verification-free query processing on graph databases
Graphs are prevalently used to model the relationships between objects in various domains. With the increasing usage of graph databases, it has become more and more demanding to e...
James Cheng, Yiping Ke, Wilfred Ng, An Lu