Depth first generation of long patterns

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Depth first generation of long patterns

Full text

Pdf (217 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: 108 - 118

Year of Publication: 2000

ISBN:1-58113-233-6

Authors

Ramesh C. Agarwal	IBM T. J. Watson Research Center, Yorktown Heights, NY
Charu C. Aggarwal	IBM T. J. Watson Research Center, Yorktown Heights, NY
V. V. V. Prasad	IBM T. J. Watson Research Center, Yorktown Heights, 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): 81, Citation Count: 42

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.347114 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	Ramesh C. Agarwal , Charu C. Aggarwal , V. V. V. Prasad, A tree projection algorithm for generation of frequent item sets, Journal of Parallel and Distributed Computing, v.61 n.3, p.350-371, March 1, 2001 [doi>10.1006/jpdc.2000.1693]
	2	R. C. Agarwal, C. C. Aggarwal, V. V. V. Prasad. Depth First Generation of Large Itemsets for Association Rules. IBM Research Report RC 21538, July 1999.
	3	Charu C. Aggarwal , Philip S. Yu, Online Generation of Association Rules, Proceedings of the Fourteenth International Conference on Data Engineering, p.402-411, February 23-27, 1998
	4	Charu C. Aggarwal , Philip S. Yu, A new framework for itemset generation, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.18-24, June 01-04, 1998, Seattle, Washington, United States [doi>10.1145/275487.275490]
	5	Rakesh Agrawal , Tomasz Imieliński , Arun Swami, Mining association rules between sets of items in large databases, Proceedings of the 1993 ACM SIGMOD international conference on Management of data, p.207-216, May 25-28, 1993, Washington, D.C., United States
	6	Rakesh Agrawal , Ramakrishnan Srikant, Fast Algorithms for Mining Association Rules in Large Databases, Proceedings of the 20th International Conference on Very Large Data Bases, p.487-499, September 12-15, 1994
	7	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
	8	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]
	9	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
	10	Sergey Brin , Rajeev Motwani , Craig Silverstein, Beyond market baskets: generalizing association rules to correlations, Proceedings of the 1997 ACM SIGMOD international conference on Management of data, p.265-276, May 11-15, 1997, Tucson, Arizona, United States
	11	Data Organization and Access for Efficient Data Mining, Proceedings of the 15th International Conference on Data Engineering, p.522, March 23-26, 1999
	12	Takeshi Fukuda , Yasuhido Morimoto , Shinichi Morishita , Takeshi Tokuyama, Mining optimized association rules for numeric attributes, Proceedings of the fifteenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.182-191, June 04-06, 1996, Montreal, Quebec, Canada [doi>10.1145/237661.237708]
	13	Takeshi Fukuda , Yasukiko Morimoto , Shinichi Morishita , Takeshi Tokuyama, Data mining using two-dimensional optimized association rules: scheme, algorithms, and visualization, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.13-23, June 04-06, 1996, Montreal, Quebec, Canada
	14	Dimitrios Gunopulos , Heikki Mannila , Sanjeev Saluja, Discovering All Most Specific Sentences by Randomized Algorithms, Proceedings of the 6th International Conference on Database Theory, p.215-229, January 08-10, 1997
	15	Jiawei Han , Jian Pei , Yiwen Yin, Mining frequent patterns without candidate generation, Proceedings of the 2000 ACM SIGMOD international conference on Management of data, p.1-12, May 15-18, 2000, Dallas, Texas, United States
	16	Christian Hidber, Online association rule mining, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.145-156, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	17	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
	18	H. Mannila, H. Toivonen, A. I. Verkamo. Efficient algorithms for discovering association rules. AAAI Workshop on KDD, 1994.
	19	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]
	20	Laks V. S. Lakshmanan , Raymond Ng , Jiawei Han , Alex Pang, Optimization of constrained frequent set queries with 2-variable constraints, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.157-168, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	21	Biswadeep Nag , Prasad M. Deshpande , David J. DeWitt, Using a knowledge cache for interactive discovery of association rules, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.244-253, August 15-18, 1999, San Diego, California, United States [doi>10.1145/312129.312238]
	22	Rajeev Rastogi , Kyuseok Shim, Mining Optimized Association Rules with Categorical and Numeric Attributes, Proceedings of the Fourteenth International Conference on Data Engineering, p.503-512, February 23-27, 1998
	23	R. Rastogi, K. Shim. Mining Optimized Support Rules for Numeric Attributes. ICDE Conference Proceedings, pages 126-135, 1999.
	24	I. Rigoutsos, A. Floratos. Combinatorial Pattern Discovery in Biological Sequences. Bioinformatics, 14(1): pages 55-67, 1998.
	25	R. Rymon. Search Through Systematic Set Enumeration. International Conference on Principles of Knowledge Representation and Reasoning, 1992.
	26	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
	27	Ramakrishnan Srikant , Rakesh Agrawal, Mining Generalized Association Rules, Proceedings of the 21th International Conference on Very Large Data Bases, p.407-419, September 11-15, 1995
	28	Ramakrishnan Srikant , Rakesh Agrawal, Mining quantitative association rules in large relational tables, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.1-12, June 04-06, 1996, Montreal, Quebec, Canada
	29	M. J. Zaki, S. Parthasarathy, M. Ogihara, W. Li. New Algorithms for Fast Discovery of Association Rules. KDD Conference Proceedings, pages 283-286, 1997.

CITED BY 42

	Charu C. Aggarwal, Towards long pattern generation in dense databases, ACM SIGKDD Explorations Newsletter, v.3 n.1, July 2001
	Chang-Shing Perng , Haixun Wang , Sheng Ma , Joseph L. Hellerstein, Discovery in multi-attribute data with user-defined constraints, ACM SIGKDD Explorations Newsletter, v.4 n.1, June 2002
	Ganesh Ramesh , William A. Maniatty , Mohammed J. Zaki, Feasible itemset distributions in data mining: theory and application, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.284-295, June 09-11, 2003, San Diego, California
	Bin Chen , Peter Haas , Peter Scheuermann, A new two-phase sampling based algorithm for discovering association rules, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, July 23-26, 2002, Edmonton, Alberta, Canada
	Dimitrios Gunopulos , Roni Khardon , Heikki Mannila , Sanjeev Saluja , Hannu Toivonen , Ram Sewak Sharma, Discovering all most specific sentences, ACM Transactions on Database Systems (TODS), v.28 n.2, p.140-174, June 2003
	Junqiang Liu , Yunhe Pan , Ke Wang , Jiawei Han, Mining frequent item sets by opportunistic projection, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, July 23-26, 2002, Edmonton, Alberta, Canada
	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
	Haixun Wang , Wei Wang , Jiong Yang , Philip S. Yu, Clustering by pattern similarity in large data sets, Proceedings of the 2002 ACM SIGMOD international conference on Management of data, June 03-06, 2002, Madison, Wisconsin
	Joong Hyuk Chang , Won Suk Lee, Finding recent frequent itemsets adaptively over online data streams, Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining, August 24-27, 2003, Washington, D.C.
	Laks V. S. Lakshmanan , Carson Kai-Sang Leung , Raymond T. Ng, Efficient dynamic mining of constrained frequent sets, ACM Transactions on Database Systems (TODS), v.28 n.4, p.337-389, December 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
	Bart Goethals , Mohammed J. Zaki, Advances in frequent itemset mining implementations: report on FIMI'03, ACM SIGKDD Explorations Newsletter, v.6 n.1, June 2004
	Ke Wang , Yabo Xu , Jeffrey Xu Yu, Scalable sequential pattern mining for biological sequences, Proceedings of the thirteenth ACM international conference on Information and knowledge management, November 08-13, 2004, Washington, D.C., USA
	Guizhen Yang, The complexity of mining maximal frequent itemsets and maximal frequent patterns, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	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
	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.
	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
	Joong Hyuk Chang , Won Suk Lee, estWin: Online data stream mining of recent frequent itemsets by sliding window method, Journal of Information Science, v.31 n.2, p.76-90, April 2005
	Joong Hyuk Chang , Won Suk Lee, Efficient mining method for retrieving sequential patterns over online data streams, Journal of Information Science, v.31 n.5, p.420-432, October 2005
	Floris Geerts , Bart Goethals , Jan Van Den Bussche, Tight upper bounds on the number of candidate patterns, ACM Transactions on Database Systems (TODS), v.30 n.2, p.333-363, June 2005
	Zhenjie Zhang , Xinyu Guo , Hua Lu , Anthony K. H. Tung , Nan Wang, Discovering strong skyline points in high dimensional spaces, Proceedings of the 14th ACM international conference on Information and knowledge management, October 31-November 05, 2005, Bremen, Germany
	Doug Burdick , Manuel Calimlim , Jason Flannick , Johannes Gehrke , Tomi Yiu, MAFIA: A Maximal Frequent Itemset Algorithm, IEEE Transactions on Knowledge and Data Engineering, v.17 n.11, p.1490-1504, November 2005
	Guimei Liu , Hongjun Lu , Jeffrey Xu Yu, CFP-tree: A compact disk-based structure for storing and querying frequent itemsets, Information Systems, v.32 n.2, p.295-319, April, 2007
	Mohammad El-Hajj , Osmar R. Zaïane, Implementing leap traversals of the itemset lattice, Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations, p.16-25, August 21-21, 2005, Chicago, Illinois
	Krishnamoorthy Srikumar , Bharat Bhasker, Efficiently mining Maximal Frequent Sets in dense databases for discovering association rules, Intelligent Data Analysis, v.8 n.2, p.171-182, April 2004
	Shao-Shin Hung , Ting-Chia Kuo , Damon Shing-Min Liu, An Efficient Mining and Clustering Algorithm for Interactive Walk-Through Traversal Patterns, Proceedings of the 2004 IEEE/WIC/ACM International Conference on Web Intelligence, p.356-362, September 20-24, 2004
	Guizhen Yang, Computational aspects of mining maximal frequent patterns, Theoretical Computer Science, v.362 n.1, p.63-85, 11 October 2006
	Congnan Luo , Anil L. Pereira , Soon M. Chung, Distributed Mining of Maximal Frequent Itemsets on a Data Grid System, The Journal of Supercomputing, v.37 n.1, p.71-90, July 2006
	Aaron Ceglar , John F. Roddick, Association mining, ACM Computing Surveys (CSUR), v.38 n.2, p.5-es, 2006
	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
	Fan Wu , Shih-Wen Chiang , Jiunn-Rong Lin, A new approach to mine frequent patterns using item-transformation methods, Information Systems, v.32 n.7, p.1056-1072, November, 2007
	John D. Holt , Soon M. Chung, Parallel mining of association rules from text databases, The Journal of Supercomputing, v.39 n.3, p.273-299, March 2007
	Shao-Shin Hung , Damon Shing-Min Liu, Efficient reduction of access latency through object correlations in virtual environments, EURASIP Journal on Applied Signal Processing, v.2007 n.1, p.178-178, 1 January 2007
	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
	Weiyang Lin , Sergio A. Alvarez , Carolina Ruiz, Efficient Adaptive-Support Association Rule Mining for Recommender Systems, Data Mining and Knowledge Discovery, v.6 n.1, p.83-105, January 2002
	Syed Khairuzzaman Tanbeer , Chowdhury Farhan Ahmed , Byeong-Soo Jeong , Young-Koo Lee, Efficient single-pass frequent pattern mining using a prefix-tree, Information Sciences: an International Journal, v.179 n.5, p.559-583, February, 2009
	Tianming Hu , Sam Yuan Sung , Hui Xiong , Qian Fu, Discovery of maximum length frequent itemsets, Information Sciences: an International Journal, v.178 n.1, p.69-87, January, 2008
	Chulyun Kim , Jong-Hwa Lim , Raymond T. Ng , Kyuseok Shim, SQUIRE: Sequential pattern mining with quantities, Journal of Systems and Software, v.80 n.10, p.1726-1745, October, 2007
	Jeffrey Xu Yu , Zhiheng Li , Guimei Liu, A data mining proxy approach for efficient frequent itemset mining, The VLDB Journal — The International Journal on Very Large Data Bases, v.17 n.4, p.947-970, July 2008
	Xiaowei Yan , Shichao Zhang , Chengqi Zhang, ON DATA STRUCTURES FOR ASSOCIATION RULE DISCOVERY, Applied Artificial Intelligence, v.21 n.2, p.57-79, February 2007
	Basel A. Mahafzah , Amer F. Al-Badarneh , Mohammed Z. Zakaria, A new sampling technique for association rule mining, Journal of Information Science, v.35 n.3, p.358-376, June 2009
	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