709 search results - page 59 / 142 » Constraint-Based Pattern Set Mining |
143
Voted
EDBT
2011
ACM
14 years 6 months ago
2011
ACM
Most known frequent item set mining algorithms work by enumerating candidate item sets and pruning infrequent candidates. An alternative method, which works by intersecting transa...
119
Voted
TKDE
2008
15 years 2 months ago
2008
In this paper, we present a new tree mining algorithm, DRYADEPARENT, based on the hooking principle first introduced in DRYADE. In the experiments, we demonstrate that the branchin...
105
Voted
AUSDM
2007
Springer
15 years 8 months ago
2007
Springer
Mining High Utility Itemsets from a transaction database is to find itemsests that have utility above a user-specified threshold. This problem is an extension of Frequent Itemset ...
108
Voted
CIKM
2009
Springer
15 years 5 months ago
2009
Springer
Dynamic data streams are those whose underlying distribution changes over time. They occur in a number of application domains, and mining them is important for these applications....
116
Voted
GECCO
2008
Springer
15 years 3 months ago
2008
Springer
The aim of process mining is to identify and extract process patterns from data logs to reconstruct an overall process flowchart. As business processes become more and more comple...