Sciweavers

4085 search results - page 63 / 817
» Benchmarking Data Mining Algorithms
Sort
View
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
13 years 6 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
KDD
2004
ACM
624views Data Mining» more  KDD 2004»
14 years 2 months ago
Programming the K-means clustering algorithm in SQL
Using SQL has not been considered an efficient and feasible way to implement data mining algorithms. Although this is true for many data mining, machine learning and statistical a...
Carlos Ordonez
AVBPA
2005
Springer
395views Biometrics» more  AVBPA 2005»
13 years 11 months ago
A Score-Level Fusion Benchmark Database for Biometric Authentication
Fusing the scores of several biometric systems is a very promising approach to improve the overall system’s accuracy. Despite many works in the literature, it is surprising that ...
Norman Poh, Samy Bengio
DAWAK
2008
Springer
13 years 10 months ago
Mining Multidimensional Sequential Patterns over Data Streams
Sequential pattern mining is an active field in the domain of knowledge discovery and has been widely studied for over a decade by data mining researchers. More and more, with the ...
Chedy Raïssi, Marc Plantevit
ICDM
2007
IEEE
105views Data Mining» more  ICDM 2007»
14 years 3 months ago
Fast Mining of Complex Spatial Co-location Patterns Using GLIMIT
Most algorithms for mining interesting spatial colocations integrate the co-location / clique generation task with the interesting pattern mining task, and are usually based on th...
Florian Verhein, Ghazi Al-Naymat