4085 search results - page 218 / 817 » Benchmarking Data Mining Algorithms |
136
click to vote
ICDM
2007
IEEE
15 years 10 months ago
2007
IEEE
We study the problem of finding frequent itemsets in a continuous stream of transactions. The current frequency of an itemset in a stream is defined as its maximal frequency ove...
124
Voted
EURODAC
1994
IEEE
15 years 7 months ago
1994
IEEE
The use of a realistic component library with multiple implementations of operators, results in cost ef cient designs; slow components can then be used on non-critical paths and t...
137
Voted
KDD
2009
ACM
16 years 4 months ago
2009
ACM
We present a new approach to large-scale graph mining based on so-called backbone refinement classes. The method efficiently mines tree-shaped subgraph descriptors under minimum f...
150
Voted
ITCC
2005
IEEE
15 years 9 months ago
2005
IEEE
Density-based clustering algorithms have recently gained popularity in the data mining field due to their ability to discover arbitrary shaped clusters while preserving spatial pr...
112
Voted
CORR
2002
Springer
15 years 3 months ago
2002
Springer
In order to control the process of data mining and focus on the things of interest to us, many kinds of constraints have been added into the algorithms of data mining. However, di...