388 search results - page 15 / 78 » Mining Frequent Itemsets Using Support Constraints |
ICDM
2010
IEEE
13 years 5 months ago
2010
IEEE
While there has been a lot of work on finding frequent itemsets in transaction data streams, none of these solve the problem of finding similar pairs according to standard similar...
SIGCOMM
2010
ACM
13 years 7 months ago
2010
ACM
Finding the root-cause of a network security anomaly is essential for network operators. In our recent work [1, 5], we introduced a generic technique that uses frequent itemset mi...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we propose a novel probabilistic approach to summarize frequent itemset patterns. Such techniques are useful for summarization, post-processing, and end-user interp...
KDD
2007
ACM
14 years 8 months ago
2007
ACM
We present DL8, an exact algorithm for finding a decision tree that optimizes a ranking function under size, depth, accuracy and leaf constraints. Because the discovery of optimal...
SAC
2004
ACM
14 years 28 days ago
2004
ACM
In the paper a new data mining algorithm for finding the most interesting dependence rules is described. Dependence rules are derived from the itemsets with support significantly ...