60 search results - page 5 / 12 » Mining Multi-Level Frequent Itemsets under Constraints |
KDD
2001
ACM
14 years 8 months ago
2001
ACM
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
DATAMINE
2010
13 years 7 months ago
2010
In this article we show that there is a strong connection between decision tree learning and local pattern mining. This connection allows us to solve the computationally hard probl...
CINQ
2004
Springer
13 years 11 months ago
2004
Springer
Inductive databases (IDBs) have been proposed to afford the problem of knowledge discovery from huge databases. With an IDB the user/analyst performs a set of very different operat...
CORR
2008
Springer
13 years 7 months ago
2008
Springer
Mining frequent itemsets is a popular method for finding associated items in databases. For this method, support, the co-occurrence frequency of the items which form an associatio...
IDA
2002
Springer
13 years 7 months ago
2002
Springer
Levelwise algorithms (e.g., the Apriori algorithm) have been proved eective for association rule mining from sparse data. However, in many practical applications, the computation ...