Finding Interesting Rules From Large Data Sets

Finding Interesting Rules From Large Data Sets (2006)

Cached

Download Links

[fas.sfu.ca]

by Yuelong Jiang

BibTeX

@MISC{Jiang06findinginteresting,
    author = {Yuelong Jiang},
    title = {Finding Interesting Rules From Large Data Sets},
    year = {2006}
}

Bookmark

OpenURL

Abstract

Citations

4072	JR: C4.5: Programs for Machine Learning - Quinlan
3339	Pattern Classification and Scene Analysis - Duda, Hart - 1973
2161	Srikant R: Fast algorithms for mining association rules - Agrawal - 1994
1954	Mining association rules between sets of items in large databases - Agrawal, Imielinski, et al. - 1993
1306	M: Data Mining: Concepts and Techniques - Han, Kamber - 2001
882	Mining frequent patterns without candidate generation - Han, Pei, et al.
630	Data cube: A relational aggregation operator generalizing group-by, cross-tab, and sub-total - GRAY, BOSWORTH, et al. - 1996
415	Beyond Market Baskets: Generalizing Association Rules to Correlations - Brin, Motwani, et al. - 1997
412	Dynamic itemset counting and implication rules for market basket data - Brin, Motwani, et al. - 1997
399	Agrawal R: Mining generalized association rules - Srikant - 1995
337	Y.: Discovery of multiple-level association rules from large databases - Han, Fu - 1995
329	An efficient algorithm for mining association rules in large databases - Savasere, Omiecinski, et al. - 1995
324	Jr., “Efficiently Mining Long Patterns from Databases - Bayardo - 1998
309	gSpan: Graph-based substructure pattern mining - Yan, Han
291	Rule induction with CN2: Some recent improvements, Proceedings of the 5th European Working Session on Learning (EWSL-91 - Clark, Boswell - 1991
264	Discovering frequent closed itemsets for association rules - Pasquier, Bastide, et al. - 1999
253	Introduction to Algorithms. 2nd edition - Cormen, Leiserson, et al. - 1990
244	Exploratory Mining and Pruning Optimizations of Constrained Association Rules - Ng, Lakshmanan, et al. - 1998
215	CLOSET: An efficient algorithm for mining frequent closed itemsets - Pei, Han, et al.
201	Mining association rules with item constraints - Srikant, Vu, et al. - 1997
195	An efficient hash-based algorithm for mining association rules - Park, Chen, et al. - 1995
192	Efficient mining of emerging patterns: discovering trends and differences - Dong, Li - 1999
189	On the computation of multidimensional aggregates - Agarwal, Agrawal, et al. - 1996
187	T: MAFIA: A Maximal Frequent Itemset Algorithm - Burdick, Calimlim, et al.
185	Finding interesting rules from large sets of discovered association rules - Klementinen, Mannila, et al. - 1994
161	Selection of views to materialize in a data warehouse - Gupta, Mumick
159	Mining non-redundant association rules - Zaki - 2004
145	Mining longest repeating subsequences to predict World Wide Web surfing - Pitkow, Pirolli - 1999
132	Bottomup computation of sparse and iceberg cubes - Beyer, Ramakrishnan - 1999
123	Constraint-based rule mining in large, dense databases - Bayardo, Agrawal, et al.
121	Computing iceberg queries efficiently - Fang, Shivakumar, et al. - 1998
121	On subjective measures of interestingness in knowledge discovery - Silberschatz, Tuzhilin - 1995
114	Materialized views selection in a multidimensional database - Baralis, Paraboschi, et al. - 1997
114	CLOSET+: Searching for the Best Strategies for Mining Frequent Closed Itemsets”, in proceeding of the SIGKDD ’03 - Wang, Han, et al. - 2003
109	Data mining using two-dimensional optimized association rules: scheme, algorithms and visualization - Fukuda, Morimoto, et al. - 1996
99	Mining access patterns efficiently from Web logs - Pei, Han, et al. - 2000
98	Pruning and summarizing the discovered associations - Liu, Hsu, et al. - 1999
98	Search through systematic set enumeration - Rymon - 1992
93	Analysis, and Presentation of Strong Rules - Discovery - 1991
93	An algorithm for subgraph isomorphism - Ullman - 1976
88	The interestingness of deviations - Piatetsky-Shapiro, Matheus - 1994
87	A belief-driven method for discovering unexpected patterns - Padmanabhan, Tuzhilin - 1998
87	Mining frequent itemsets with convertible constraints - Pei, Han, et al. - 2001
86	Pincer-search: a new algorithm for discovering the maximum frequent set - Lin, Kedem - 2002
79	Using general impressions to analyze discovered classification rules - Liu, Hsu, et al. - 1997
70	H.: Pruning and grouping of discovered association rules - Toivonen, Klemettinen, et al. - 1995
68	Depth first generation of long patterns - Agarwal, Aggarwal, et al.
68	CHARM: An Efficient Algorithm for Closed Association Rule Mining - Zaki, Hsiao - 1999
61	Selection of views to materialize under a maintenance cost constraint - Gupta, Mumick - 1999
60	Can we push more constraints into frequent pattern mining - PEI, HAN - 2000