Generating non-redundant association rules

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Generating non-redundant association rules

Full text

Pdf (182 KB)

Source

International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining table of contents

Boston, Massachusetts, United States

Pages: 34 - 43

Year of Publication: 2000

ISBN:1-58113-233-6

Author

Mohammed J. Zaki

Computer Science Department, Rensselaer Polytechnic Institute, Troy, NY

Sponsors

SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
AAAI : Am Assoc for Artifical Intelligence
SIGART: ACM Special Interest Group on Artificial Intelligence
SIGMOD: ACM Special Interest Group on Management of Data

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 14, Downloads (12 Months): 114, Citation Count: 58

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	Request Permissions Review this Article Save this Article to a Binder Display Formats: BibTeX EndNote ACM Ref

DOI Bookmark:	Use this link to bookmark this Article: http://doi.acm.org/10.1145/347090.347101 What is a DOI?

REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

	1	Rakesh Agrawal , Heikki Mannila , Ramakrishnan Srikant , Hannu Toivonen , A. Inkeri Verkamo, Fast discovery of association rules, Advances in knowledge discovery and data mining, American Association for Artificial Intelligence, Menlo Park, CA, 1996
	2	Roberto J. Bayardo, Jr., Efficiently mining long patterns from databases, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.85-93, June 01-04, 1998, Seattle, Washington, United States
	3	Roberto J. Bayardo, Jr. , Rakesh Agrawal, Mining the most interesting rules, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.145-154, August 15-18, 1999, San Diego, California, United States [doi>10.1145/312129.312219]
	4	Sergey Brin , Rajeev Motwani , Jeffrey D. Ullman , Shalom Tsur, Dynamic itemset counting and implication rules for market basket data, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.255-264, May 11-15, 1997, Tucson, Arizona, United States
	5	Bernhard Ganter , C. Franzke , Rudolf Wille, Formal Concept Analysis: Mathematical Foundations, Springer-Verlag New York, Inc., Secaucus, NJ, 1997
	6	Robert Godin , Rokia Missaoui, An incremental concept formation approach for learning from databases, Theoretical Computer Science, v.133 n.2, p.387-419, Oct. 24, 1994 [doi>10.1016/0304-3975(94)90195-3]
	7	J. L. Guigues and V. Duquenne. Familles minimales d'implications informatives resultant d'un tableau de donnees binaires. Math. Sci. hum., 24(95):5-18, 1986.
	8	Mika Klemettinen , Heikki Mannila , Pirjo Ronkainen , Hannu Toivonen , A. Inkeri Verkamo, Finding interesting rules from large sets of discovered association rules, Proceedings of the third international conference on Information and knowledge management, p.401-407, November 29-December 02, 1994, Gaithersburg, Maryland, United States [doi>10.1145/191246.191314]
	9	Dao-I Lin , Zvi M. Kedem, Pincer Search: A New Algorithm for Discovering the Maximum Frequent Set, Proceedings of the 6th International Conference on Extending Database Technology: Advances in Database Technology, p.105-119, March 23-27, 1998
	10	Bing Liu , Wynne Hsu , Yiming Ma, Pruning and summarizing the discovered associations, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.125-134, August 15-18, 1999, San Diego, California, United States [doi>10.1145/312129.312216]
	11	M. Luxenburger. Implications partielles dans un contexte. Math. Inf. Sci. hum., 29(113):35-55, 1991.
	12	Raymond T. Ng , Laks V. S. Lakshmanan , Jiawei Han , Alex Pang, Exploratory mining and pruning optimizations of constrained associations rules, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.13-24, June 01-04, 1998, Seattle, Washington, United States
	13	Nicolas Pasquier , Yves Bastide , Rafik Taouil , Lotfi Lakhal, Discovering Frequent Closed Itemsets for Association Rules, Proceeding of the 7th International Conference on Database Theory, p.398-416, January 10-12, 1999
	14	Nicolas Pasquier , Yves Bastide , Rafik Taouil , Lotfi Lakhal, Efficient mining of association rules using closed itemset lattices, Information Systems, v.24 n.1, p.25-46, March 1999 [doi>10.1016/S0306-4379(99)00003-4]
	15	Ashoka Savasere , Edward Omiecinski , Shamkant B. Navathe, An Efficient Algorithm for Mining Association Rules in Large Databases, Proceedings of the 21th International Conference on Very Large Data Bases, p.432-444, September 11-15, 1995
	16	R. Taouil, Y. Bastide, N. Pasquier, G. Stumme, and L. Lakhal. Mining bases for association rules based on formal concept analysis. In 16th IEEE Intl. Conf. on Data Engineering, Feb. 2000.
	17	H. Toivonen, M. Klemettinen, P. Ronkainen, K. Hatonen, and H. Mannila. Pruning and grouping discovered association rules. In MLnet Wkshp. on Statistics, Machine Learning, and Discovery in Databases, Apr. 1995.
	18	M. J. Zaki. Generating non-redundant association rules. Technical Report 99-12, Computer Science Dept., Rensselaer Polytechnic Institute, December 1999.
	19	M. J. Zaki and C.-J. Hsiao. CHARM: An efficient algorithm for closed association rule mining. Technical Report 99-10, Computer Science Dept., Rensselaer Polytechnic Institute, October 1999.
	20	M. J. Zaki and M. Ogihara. Theoretical foundations of association rules. In 3rd ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, June 1998.
	21	M. J. Zaki, S. Parthasarathy, M. Ogihara, and W. Li. New algorithms for fast discovery of association rules. In 3rd Intl. Conf. on Knowledge Discovery and Data Mining, Aug. 1997.

CITED BY 58

	Zijian Zheng , Ron Kohavi , Llew Mason, Real world performance of association rule algorithms, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.401-406, August 26-29, 2001, San Francisco, California
	Bruno Pôssas , Nivio Ziviani , Wagner Meira, Jr. , Berthier Ribeiro-Neto, Set-based model: a new approach for information retrieval, Proceedings of the 25th annual international ACM SIGIR conference on Research and development in information retrieval, August 11-15, 2002, Tampere, Finland
	Jiawei Han , Laks V. S. Lakshmanan , Jian Pei, Scalable frequent-pattern mining methods: an overview, Tutorial notes of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, August 26-29, 2001, San Francisco, California
	Jiong Yang , Wei Wang , Philip S. Yu, Infominer: mining surprising periodic patterns, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.395-400, August 26-29, 2001, San Francisco, California
	Bing Liu , Wynne Hsu , Yiming Ma, Identifying non-actionable association rules, Proceedings of the seventh ACM SIGKDD international conference on Knowledge discovery and data mining, p.329-334, August 26-29, 2001, San Francisco, California
	Mukund Deshpande , George Karypis, Using conjunction of attribute values for classification, Proceedings of the eleventh international conference on Information and knowledge management, November 04-09, 2002, McLean, Virginia, USA
	Elena Baralis , Silvia Chiusano , Paolo Garza, On support thresholds in associative classification, Proceedings of the 2004 ACM symposium on Applied computing, March 14-17, 2004, Nicosia, Cyprus
	François Rioult , Jean-François Boulicaut , Bruno Crémilleux , Jérémy Besson, Using transposition for pattern discovery from microarray data, Proceedings of the 8th ACM SIGMOD workshop on Research issues in data mining and knowledge discovery, June 13-13, 2003, San Diego, California
	Mohammed J. Zaki , Naren Ramakrishnan, Reasoning about sets using redescription mining, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
	Jianyong Wang , Jiawei Han , Jian Pei, CLOSET+: searching for the best strategies for mining frequent closed itemsets, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Gerd Stumme, Off to new shores: conceptual knowledge discovery and processing, International Journal of Human-Computer Studies, v.59 n.3, p.287-325, September 2003
	Jacky W. W. Wan , Gillian Dobbie, Mining association rules from XML data using XQuery, Proceedings of the second workshop on Australasian information security, Data Mining and Web Intelligence, and Software Internationalisation, p.169-174, January 01, 2004, Dunedin, New Zealand
	Cyrille Masson , Céline Robardet , Jean-François Boulicaut, Optimizing subset queries: a step towards SQL-based inductive databases for itemsets, Proceedings of the 2004 ACM symposium on Applied computing, March 14-17, 2004, Nicosia, Cyprus
	Charu C. Aggarwal, Towards long pattern generation in dense databases, ACM SIGKDD Explorations Newsletter, v.3 n.1, July 2001
	Alain Casali , Rosine Cicchetti , Lotfi Lakhal, Extracting semantics from data cubes using cube transversals and closures, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Gao Cong , Anthony K. H. Tung , Xin Xu , Feng Pan , Jiong Yang, FARMER: finding interesting rule groups in microarray datasets, Proceedings of the 2004 ACM SIGMOD international conference on Management of data, June 13-18, 2004, Paris, France
	Lei Jia , Renqing Pei , Dingyu Pei, Tough constraint-based frequent closed itemsets mining, Proceedings of the 2003 ACM symposium on Applied computing, March 09-12, 2003, Melbourne, Florida
	Miroslav Kubat , Alaaeldin Hafez , Vijay V. Raghavan , Jayakrishna R. Lekkala , Wei Kian Chen, Itemset Trees for Targeted Association Querying, IEEE Transactions on Knowledge and Data Engineering, v.15 n.6, p.1522-1534, November 2003
	Naren Ramakrishnan , Deept Kumar , Bud Mishra , Malcolm Potts , Richard F. Helm, Turning CARTwheels: an alternating algorithm for mining redescriptions, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	Nicolas Pasquier , Rafik Taouil , Yves Bastide , Gerd Stumme , Lotfi Lakhal, Generating a Condensed Representation for Association Rules, Journal of Intelligent Information Systems, v.24 n.1, p.29-60, January 2005
	Krishna Gade , Jianyong Wang , George Karypis, Efficient closed pattern mining in the presence of tough block constraints, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	Jiuyong Li , Hong Shen , Rodney Topor, Mining Informative Rule Set for Prediction, Journal of Intelligent Information Systems, v.22 n.2, p.155-174, March 2004
	Mohammed J. Zaki , Ching-Jui Hsiao, Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure, IEEE Transactions on Knowledge and Data Engineering, v.17 n.4, p.462-478, April 2005
	Hasan M. Jamil, Bottom-Up Association Rule Mining in Relational Databases, Journal of Intelligent Information Systems, v.19 n.2, p.191-206, September 2002
	Mohammed J. Zaki , Karam Gouda, Fast vertical mining using diffsets, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Ke Wang , Yuelong Jiang , Laks V. S. Lakshmanan, Mining unexpected rules by pushing user dynamics, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Bing Liu , Wynne Hsu , Shu Chen , Yiming Ma, Analyzing the Subjective Interestingness of Association Rules, IEEE Intelligent Systems, v.15 n.5, p.47-55, September 2000
	Bing Liu , Wynne Hsu , Shu Chen , Yiming Ma, Analyzing the Subjective Interestingness of Association Rules, IEEE Intelligent Systems, v.15 n.5, p.47-55, September 2000
	Edward R. Omiecinski, Alternative Interest Measures for Mining Associations in Databases, IEEE Transactions on Knowledge and Data Engineering, v.15 n.1, p.57-69, January 2003
	Szymon Jaroszewicz , Dan A. Simovici, Interestingness of frequent itemsets using Bayesian networks as background knowledge, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	Jian Pei , Guozhu Dong , Wei Zou , Jiawei Han, Mining condensed frequent-pattern bases, Knowledge and Information Systems, v.6 n.5, p.570-594, September 2004
	Elena Baralis , Silvia Chiusano, Essential classification rule sets, ACM Transactions on Database Systems (TODS), v.29 n.4, p.635-674, December 2004
	Bruno Pôssas , Nivio Ziviani , Wagner Meira, Jr. , Berthier Ribeiro-Neto, Set-based vector model: An efficient approach for correlation-based ranking, ACM Transactions on Information Systems (TOIS), v.23 n.4, p.397-429, October 2005
	Baptiste Jeudy , Jean-François Boulicaut, Optimization of association rule mining queries, Intelligent Data Analysis, v.6 n.4, p.341-357, September 2002
	Anthony J. T. Lee , Chun-Sheng Wang , Wan-Yu Weng , Yi-An Chen , Huei-Wen Wu, An efficient algorithm for mining closed inter-transaction itemsets, Data & Knowledge Engineering, v.66 n.1, p.68-91, July, 2008
	Girish K. Palshikar , Mandar S. Kale , Manoj M. Apte, Association rules mining using heavy itemsets, Data & Knowledge Engineering, v.61 n.1, p.93-113, April, 2007
	Vania Bogorny , Sandro Camargo , Paulo Martins Engel , Luis Otavio Alvares, Mining frequent geographic patterns with knowledge constraints, Proceedings of the 14th annual ACM international symposium on Advances in geographic information systems, November 10-11, 2006, Arlington, Virginia, USA
	Dora Souliou , Aris Pagourtzis , Nikolaos Drosinos , Panayiotis Tsanakas, Computing frequent itemsets in parallel using partial support trees, Journal of Systems and Software, v.79 n.12, p.1735-1743, December, 2006
	Marcel Bruch , Thorsten Schäfer , Mira Mezini, FrUiT: IDE support for framework understanding, Proceedings of the 2006 OOPSLA workshop on eclipse technology eXchange, p.55-59, October 22-23, 2006, Portland, Oregon
	José L. Balcázar , Gemma C. Garriga, Horn axiomatizations for sequential data, Theoretical Computer Science, v.371 n.3, p.247-264, March, 2007
	Tobias Scheffer, Finding association rules that trade support optimally against confidence, Intelligent Data Analysis, v.9 n.4, p.381-395, July 2005
	Jiong Yang , Wei Wang , Philip S. Yu, Mining Surprising Periodic Patterns, Data Mining and Knowledge Discovery, v.9 n.2, p.189-216, September 2004
	Karam Gouda , Mohammed J. Zaki, GenMax: An Efficient Algorithm for Mining Maximal Frequent Itemsets, Data Mining and Knowledge Discovery, v.11 n.3, p.223-242, November 2005
	Geoffrey I. Webb, Discovering Significant Patterns, Machine Learning, v.68 n.1, p.1-33, July 2007
	Szymon Jaroszewicz , Tobias Scheffer , Dan A. Simovici, Scalable pattern mining with Bayesian networks as background knowledge, Data Mining and Knowledge Discovery, v.18 n.1, p.56-100, February 2009
	James Cheng , Yiping Ke , Wilfred Ng, Maintaining frequent closed itemsets over a sliding window, Journal of Intelligent Information Systems, v.31 n.3, p.191-215, December 2008
	Yue Xu , Yuefeng Li, Generating concise association rules, Proceedings of the sixteenth ACM conference on Conference on information and knowledge management, November 06-10, 2007, Lisbon, Portugal
	Petko Valtchev , Rokia Missaoui , Robert Godin, A framework for incremental generation of closed itemsets, Discrete Applied Mathematics, v.156 n.6, p.924-949, March, 2008
	Mafruz Zaman Ashrafi , David Taniar , Kate Smith, Redundant association rules reduction techniques, International Journal of Business Intelligence and Data Mining, v.2 n.1, p.29-63, March 2007
	V. Bogorny , B. Kuijpers , L. O. Alvares, Reducing uninteresting spatial association rules in geographic databases using background knowledge: a summary of results, International Journal of Geographical Information Science, v.22 n.4, p.361-386, January 2008
	Shyue-Liang Wang , Kuan-Wei Huang , Tien-Chin Wang , Tzung-Pei Hong, Maintenance of informative ruler sets for predictions, Intelligent Data Analysis, v.11 n.3, p.279-292, August 2007
	Shyue-Liang Wang , Kuan-Wei Huang , Tien-Chin Wang , Tzung-Pei Hong, Maintenance of informative ruler sets for predictions, Intelligent Data Analysis, v.11 n.3, p.279-292, August 2007
	Arnaud Soulet , Bruno Crémilleux, Adequate condensed representations of patterns, Data Mining and Knowledge Discovery, v.17 n.1, p.94-110, August 2008
	Gemma C. Garriga , Petra Kralj , Nada Lavrač, Closed Sets for Labeled Data, The Journal of Machine Learning Research, 9, p.559-580, 6/1/2008
	Fei Chiang , Renée J. Miller, Discovering data quality rules, Proceedings of the VLDB Endowment, v.1 n.1, August 2008
	James Cheng , Yiping Ke , Wilfred Ng, A survey on algorithms for mining frequent itemsets over data streams, Knowledge and Information Systems, v.16 n.1, p.1-27, July 2008
	F. Coenen , P. Leng , A. Pagourtzis , W. Rytter , D. Souliou, Improved methods for extracting frequent itemsets from interim-support trees, Software—Practice & Experience, v.39 n.6, p.551-571, April 2009
	Sadok Ben Yahia , Ghada Gasmi , Engelbert Mephu Nguifo, A new generic basis of "factual" and "implicative" association rules, Intelligent Data Analysis, v.13 n.4, p.633-656, December 2009