Can we push more constraints into frequent pattern mining?

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Can we push more constraints into frequent pattern mining?

Full text

Pdf (240 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: 350 - 354

Year of Publication: 2000

ISBN:1-58113-233-6

Authors

Jian Pei	School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6
Jiawei Han	School of Computing Science, Simon Fraser University, Burnaby, B.C., Canada V5A 1S6

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): 5, Downloads (12 Months): 68, Citation Count: 31

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.347166 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 , 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
	2	G. Gratme, L. Lakshmanan, mid X. Wang. Efficient mining of constrained correlated sets. In Proc. 2000 Int. Conf. Data Engineering (ICDE'00), Sml Diego, CA, Februm-y 2000.
	3	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
	4	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
	5	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

CITED BY 31

	Jian Pei , Jiawei Han, Constrained frequent pattern mining: a pattern-growth view, ACM SIGKDD Explorations Newsletter, v.4 n.1, June 2002
	Chang-Hung Lee , Cheng-Ru Lin , Ming-Syan Chen, Sliding-window filtering: an efficient algorithm for incremental mining, Proceedings of the tenth international conference on Information and knowledge management, October 05-10, 2001, Atlanta, Georgia, USA
	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
	Jiawei Han , Jian Pei , Guozhu Dong , Ke Wang, Efficient computation of Iceberg cubes with complex measures, ACM SIGMOD Record, v.30 n.2, p.1-12, June 2001
	Jian Pei , Jiawei Han , Wei Wang, Mining sequential patterns with constraints in large databases, Proceedings of the eleventh international conference on Information and knowledge management, November 04-09, 2002, McLean, Virginia, USA
	Daniel Kifer , Johannes Gehrke , Cristian Bucila , Walker White, How to quickly find a witness, Proceedings of the twenty-second ACM SIGMOD-SIGACT-SIGART symposium on Principles of database systems, p.272-283, June 09-11, 2003, San Diego, California
	Alexander Tuzhilin , Gediminas Adomavicius, Handling very large numbers of association rules in the analysis of microarray data, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, July 23-26, 2002, Edmonton, Alberta, Canada
	Rosa Meo, Optimization of a language for data mining, Proceedings of the 2003 ACM symposium on Applied computing, March 09-12, 2003, Melbourne, Florida
	Jeffrey Hsu, Critical and future trends in data mining: a review of key data mining technologies/applications, Data mining: opportunities and challenges, Idea Group Publishing, Hershey, PA, 2003
	Cristian Bucila , Johannes Gehrke , Daniel Kifer , Walker White, DualMiner: a dual-pruning algorithm for itemsets with constraints, Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, July 23-26, 2002, Edmonton, Alberta, Canada
	Michael Steinbach , Pang-Ning Tan , Hui Xiong , Vipin Kumar, Generalizing the notion of support, Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, August 22-25, 2004, Seattle, WA, USA
	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
	Chang-Hung Lee , Cheng-Ru Lin , Ming-Syan Chen, Sliding window filtering: an efficient method for incremental mining on a time-variant database., Information Systems, v.30 n.3, p.227-244, May 2005
	Francesco Bonchi , Fosca Giannotti , Alessio Mazzanti , Dino Pedreschi, ExAnte: A Preprocessing Method for Frequent-Pattern Mining, IEEE Intelligent Systems, v.20 n.3, p.25-31, May 2005
	Kok-Leong Ong , Wee-Keong Ng , Ee-Peng Lim, CrystalBall: a framework for mining variants of association rules, Proceedings of the fourteenth Australasian database conference, p.85-94, February 01, 2003, Adelaide, Australia
	Pauline LienHua Chou , Xiuzhen Zhang, Efficiently computing the top N averages in iceberg cubes, Proceedings of the twenty-sixth Australasian conference on Computer science: research and practice in information technology, p.101-109, February 01, 2003, Adelaide, Australia
	Francesco Bonchi , Claudio Lucchese, On condensed representations of constrained frequent patterns, Knowledge and Information Systems, v.9 n.2, p.180-201, February 2006
	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
	Assaf Schuster , Ran Wolff , Dan Trock, A high-performance distributed algorithm for mining association rules, Knowledge and Information Systems, v.7 n.4, p.458-475, May 2005
	Hong Yao , Howard J. Hamilton, Mining itemset utilities from transaction databases, Data & Knowledge Engineering, v.59 n.3, p.603-626, December 2006
	Mohammad El-Hajj , Osmar R. Zaïane, Parallel Bifold: Large-scale parallel pattern mining with constraints, Distributed and Parallel Databases, v.20 n.3, p.225-243, November 2006
	Stefano Bistarelli , Francesco Bonchi, Soft constraint based pattern mining, Data & Knowledge Engineering, v.62 n.1, p.118-137, July, 2007
	Jian Pei , Jiawei Han , Wei Wang, Constraint-based sequential pattern mining: the pattern-growth methods, Journal of Intelligent Information Systems, v.28 n.2, p.133-160, April 2007
	Francesco Bonchi , Claudio Lucchese, Extending the state-of-the-art of constraint-based pattern discovery, Data & Knowledge Engineering, v.60 n.2, p.377-399, February, 2007
	Jiawei Han , Jian Pei, Mining frequent patterns by pattern-growth: methodology and implications, ACM SIGKDD Explorations Newsletter, v.2 n.2, p.14-20, Dec. 2000
	Jian Pei , Jiawei Han , Laks V. S. Lakshmanan, Pushing Convertible Constraints in Frequent Itemset Mining, Data Mining and Knowledge Discovery, v.8 n.3, p.227-252, May 2004
	Jen-Wei Huang , Bi-Ru Dai , Ming-Syan Chen, Twain: Two-end association miner with precise frequent exhibition periods, ACM Transactions on Knowledge Discovery from Data (TKDD), v.1 n.2, p.8-es, August 2007
	R. J. Kuo , C. W. Shih, Association rule mining through the ant colony system for National Health Insurance Research Database in Taiwan, Computers & Mathematics with Applications, v.54 n.11-12, p.1303-1318, December, 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
	Francesco Bonchi , Fosca Giannotti , Claudio Lucchese , Salvatore Orlando , Raffaele Perego , Roberto Trasarti, A constraint-based querying system for exploratory pattern discovery, Information Systems, v.34 n.1, p.3-27, March, 2009
	Anthony J. T. Lee , Yi-An Chen , Weng-Chong Ip, Mining frequent trajectory patterns in spatial-temporal databases, Information Sciences: an International Journal, v.179 n.13, p.2218-2231, June, 2009