Sciweavers

4085 search results - page 13 / 817
» Benchmarking Data Mining Algorithms
Sort
View
KDD
2012
ACM
202views Data Mining» more  KDD 2012»
11 years 10 months ago
UFIMT: an uncertain frequent itemset mining toolbox
In recent years, mining frequent itemsets over uncertain data has attracted much attention in the data mining community. Unlike the corresponding problem in deterministic data, th...
Yongxin Tong, Lei Chen 0002, Philip S. Yu
ECIS
2003
13 years 9 months ago
Towards definitive benchmarking of algorithm performance
One of the primary methods employed by researchers to judge the merits of new heuristics and algorithms is to run them on accepted benchmark test cases and comparing their perform...
Andrew Lim, Wee-Chong Oon, Wenbin Zhu
DIS
2004
Springer
14 years 1 months ago
Predictive Graph Mining
Abstract. Graph mining approaches are extremely popular and effective in molecular databases. The vast majority of these approaches first derive interesting, i.e. frequent, patte...
Andreas Karwath, Luc De Raedt
COMPSAC
2006
IEEE
14 years 1 months ago
Data Structure and Algorithm in Data Mining: Granular Computing View
This paper discusses foundations of conventional style of rule mining in which rules are extracted from a data table. Rule mining mainly uses the structure of a table, data partit...
Shusaku Tsumoto
PAKDD
2010
ACM
215views Data Mining» more  PAKDD 2010»
13 years 9 months ago
Mining Closed Episodes from Event Sequences Efficiently
Recent studies have proposed different methods for mining frequent episodes. In this work, we study the problem of mining closed episodes based on minimal occurrences. We study the...
Wenzhi Zhou, Hongyan Liu, Hong Cheng