J. Hipp and U. G untzler. Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations, 4(1):50--55, 2002. Home/Search Document Details and Download
Summary Related Articles Check |
This paper is cited in the following contexts:
DualMiner: A Dual-Pruning Algorithm for Itemsets with.. - Bucila, Gehrke, Kifer (2002) (11 citations) (Correct)
.... treatment by Gunopoulos et al. 10] Some recent papers study the problem in the context of multi attribute data of high dimensionality [21] or take another approach to the problem, such as not pushing the constraints deeply into the mining process, but enforcing the constraints in a final phase [13]. Other papers present specializations of previous algorithms, based on FP trees [15] or based on projected databases [19] 10. Conclusions and Future Work It is clear from our experiments that taking advantage of the structures of both monotone and antimonotone predicates yields good results. ....
J. Hipp and U. Guntzer. Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations, 4(1):50--55, 2002.
How to Quickly Find a Witness - Kifer, Gehrke, Bucila, White (2003) (1 citation) (Correct)
.... for pruning the search space [6] Some recent papers study the problem in the context of multi attribute data of high dimensionality [17] or take another approach to the problem, such as not pushing the constraints deeply into the mining process, but enforcing the constraints in a final phase [9]. Other papers present specializations of previous algorithms, based on FP trees [11] or based on projected databases [15] 6. ....
J. Hipp and U. Guntzer. Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations, 4(1):50--55, 2002.
Frequency-Based Views to Pattern Collections - Mielikäinen (2003) (Correct)
....value # such that #(p) # for almost all interesting patterns p and for only very few uninteresting ones. One way to augment the interestingness measure is to define additional constraints for the patterns. There has been several studies especially about structural constraints on patterns [5, 26, 40, 41, 45]. In the case of association rules structural constraints could be e.g. constraints between items. Unfortunately, defining the structural constraints may demand considerable amount of domain expertise. We suggest a complementary approach to structural constraints which can further restrict and ....
J. Hipp and U. G untzler, Is pushing constraints deeply into the mining algorithms really what we want?, SIGKDD Explorations, 4 (2002), pp. 50--55.
On Inverse Frequent Set Mining - Mielikäinen (2003) (Correct)
No context found.
J. Hipp and U. G untzler. Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations, 4(1):50--55, 2002.
On Inverse Frequent Set Mining - Mielikäinen (2003) (Correct)
No context found.
J. Hipp and U. G untzler. Is pushing constraints deeply into the mining algorithms really what we want? SIGKDD Explorations, 4(1):50--55, 2002.
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC