Finding Maximal Fully-Correlated Itemsets in Large Databases
暂无分享,去创建一个
[1] Howard J. Hamilton,et al. Interestingness measures for data mining: A survey , 2006, CSUR.
[2] Philip S. Yu,et al. A new framework for itemset generation , 1998, PODS '98.
[3] Rajeev Motwani,et al. Beyond market baskets: generalizing association rules to correlations , 1997, SIGMOD '97.
[4] Ted Dunning,et al. Accurate Methods for the Statistics of Surprise and Coincidence , 1993, CL.
[5] Katsutoshi Yada,et al. Approximation of Optimal Two-Dimensional Association Rules for Categorical Attributes Using Semidefinite Programming , 1999, Discovery Science.
[6] Rajeev Motwani,et al. Dynamic itemset counting and implication rules for market basket data , 1997, SIGMOD '97.
[7] Jaideep Srivastava,et al. Selecting the right objective measure for association analysis , 2004, Inf. Syst..
[8] Tomasz Imielinski,et al. Mining association rules between sets of items in large databases , 1993, SIGMOD Conference.
[9] Chris Jermaine,et al. Finding the most interesting correlations in a database: how hard can it be? , 2005, Inf. Syst..
[10] Gregory Piatetsky-Shapiro,et al. Discovery, Analysis, and Presentation of Strong Rules , 1991, Knowledge Discovery in Databases.
[11] Christian Borgelt,et al. EFFICIENT IMPLEMENTATIONS OF APRIORI AND ECLAT , 2003 .
[12] A. Choudhary,et al. A fast high utility itemsets mining algorithm , 2005, UBDM '05.
[13] Edward Omiecinski,et al. Alternative Interest Measures for Mining Associations in Databases , 2003, IEEE Trans. Knowl. Data Eng..