Sciweavers

288 search results - page 16 / 58
» Estimating the number of frequent itemsets in a large databa...
Sort
View
PAKDD
2005
ACM
128views Data Mining» more  PAKDD 2005»
15 years 11 months ago
A Two-Phase Algorithm for Fast Discovery of High Utility Itemsets
Traditional association rules mining cannot meet the demands arising from some real applications. By considering the different values of individual items as utilities, utility mini...
Ying Liu, Wei-keng Liao, Alok N. Choudhary
PAKDD
2005
ACM
124views Data Mining» more  PAKDD 2005»
15 years 11 months ago
Finding Sporadic Rules Using Apriori-Inverse
We define sporadic rules as those with low support but high confidence: for example, a rare association of two symptoms indicating a rare disease. To find such rules using the w...
Yun Sing Koh, Nathan Rountree
MLG
2007
Springer
16 years 6 days ago
Support Computation for Mining Frequent Subgraphs in a Single Graph
—Defining the support (or frequency) of a subgraph is trivial when a database of graphs is given: it is simply the number of graphs in the database that contain the subgraph. Ho...
Mathias Fiedler, Christian Borgelt
EDBT
2008
ACM
150views Database» more  EDBT 2008»
16 years 6 months ago
Cost-based query optimization for complex pattern mining on multiple databases
For complex data mining queries, query optimization issues arise, similar to those for the traditional database queries. However, few works have applied the cost-based query optim...
Ruoming Jin, David Fuhry, Abdulkareem Alali
SIGMOD
2000
ACM
129views Database» more  SIGMOD 2000»
15 years 10 months ago
Mining Frequent Patterns without Candidate Generation
Mining frequent patterns in transaction databases, time-series databases, and many other kinds of databases has been studied popularly in data mining research. Most of the previous...
Jiawei Han, Jian Pei, Yiwen Yin