124 search results - page 8 / 25 » Quantitative evaluation of approximate frequent pattern mini... |
109
click to vote
SDM
2004
SIAM
14 years 11 months ago
2004
SIAM
Graph-based modeling has emerged as a powerful abstraction capable of capturing in a single and unified framework many of the relational, spatial, topological, and other characteri...
PAKDD
2010
ACM
14 years 11 months ago
2010
ACM
Mining frequent itemsets from transactional datasets is a well known problem with good algorithmic solutions. In the case of uncertain data, however, several new techniques have be...
159
click to vote
ICDE
2005
IEEE
15 years 11 months ago
2005
IEEE
Benchmarking technical solutions is as important as the solutions themselves. Yet many fields still lack any type of rigorous evaluation. Performance benchmarking has always been ...
KDD
2008
ACM
15 years 10 months ago
2008
ACM
Closed patterns are powerful representatives of frequent patterns, since they eliminate redundant information. We propose a new approach for mining closed unlabeled rooted trees a...
115
click to vote
DATAMINE
1999
14 years 9 months ago
1999
Discovery of frequent patterns has been studied in a variety of data mining settings. In its simplest form, known from association rule mining, the task is to discover all frequent...