Sciweavers

4085 search results - page 2 / 817
» Benchmarking Data Mining Algorithms
Sort
View
IJCNN
2006
IEEE
14 years 1 months ago
Nominal-scale Evolving Connectionist Systems
— A method is presented for extending the Evolving Connectionist System (ECoS) algorithm that allows it to explicitly represent and learn nominal-scale data without the need for ...
Michael J. Watts
VLDB
1998
ACM
103views Database» more  VLDB 1998»
13 years 11 months ago
The Drill Down Benchmark
Data Mining places specific requirements on DBMS query performance that cannot be evaluated satisfactorily using existing OLAP benchmarks. The DD Benchmark - defined here - provid...
Peter A. Boncz, Tim Rühl, Fred Kwakkel
KDD
2004
ACM
207views Data Mining» more  KDD 2004»
14 years 8 months ago
SPIN: mining maximal frequent subgraphs from graph databases
One fundamental challenge for mining recurring subgraphs from semi-structured data sets is the overwhelming abundance of such patterns. In large graph databases, the total number ...
Jun Huan, Wei Wang 0010, Jan Prins, Jiong Yang
ICDM
2005
IEEE
139views Data Mining» more  ICDM 2005»
14 years 1 months ago
Approximate Inverse Frequent Itemset Mining: Privacy, Complexity, and Approximation
In order to generate synthetic basket data sets for better benchmark testing, it is important to integrate characteristics from real-life databases into the synthetic basket data ...
Yongge Wang, Xintao Wu
KDD
2008
ACM
146views Data Mining» more  KDD 2008»
14 years 8 months ago
Constraint programming for itemset mining
The relationship between constraint-based mining and constraint programming is explored by showing how the typical constraints used in pattern mining can be formulated for use in ...
Luc De Raedt, Tias Guns, Siegfried Nijssen