Using a knowledge cache for interactive discovery of association rules

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Using a knowledge cache for interactive discovery of association rules

Full text

Pdf (1.26 MB)

Source

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

San Diego, California, United States

Pages: 244 - 253

Year of Publication: 1999

ISBN:1-58113-143-7

Authors

Biswadeep Nag	Computer Sciences Department, University of Wisconsin-Madison
Prasad M. Deshpande	Computer Sciences Department, University of Wisconsin-Madison
David J. DeWitt	Computer Sciences Department, University of Wisconsin-Madison

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): 39, Citation Count: 11

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/312129.312238 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	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
	2	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
	3	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
	4	Michael J. Carey , David J. DeWitt , Michael J. Franklin , Nancy E. Hall , Mark L. McAuliffe , Jeffrey F. Naughton , Daniel T. Schuh , Marvin H. Solomon , C. K. Tan , Odysseas G. Tsatalos , Seth J. White , Michael J. Zwilling, Shoring up persistent applications, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.383-394, May 24-27, 1994, Minneapolis, Minnesota, United States
	5	Prasad M. Deshpande , Karthikeyan Ramasamy , Amit Shukla , Jeffrey F. Naughton, Caching multidimensional queries using chunks, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.259-270, June 01-04, 1998, Seattle, Washington, United States
	6	Jiawei Han, Towards on-line analytical mining in large databases, ACM SIGMOD Record, v.27 n.1, p.97-107, March 1998 [doi>10.1145/273244.273273]
	7	Jiawei Han , Yongjian Fu, Discovery of Multiple-Level Association Rules from Large Databases, Proceedings of the 21th International Conference on Very Large Data Bases, p.420-431, September 11-15, 1995
	8	Venky Harinarayan , Anand Rajaraman , Jeffrey D. Ullman, Implementing data cubes efficiently, Proceedings of the 1996 ACM SIGMOD international conference on Management of data, p.205-216, June 04-06, 1996, Montreal, Quebec, Canada
	9	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
	10	Nag B, Deshpande P, DeWitt D, "Using a Kn owl edge Cache for Interact ive Discovery of Association Rules- Extended Version". h ttp ://www. cs. wisc. edu/~ bn g/sigkdd, pd f
	11	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
	12	Jong Soo Park , Ming-Syan Chen , Philip S. Yu, An effective hash-based algorithm for mining association rules, Proceedings of the 1995 ACM SIGMOD international conference on Management of data, p.175-186, May 22-25, 1995, San Jose, California, United States
	13	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
	14	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
	15	Hannu Toivonen, Sampling Large Databases for Association Rules, Proceedings of the 22th International Conference on Very Large Data Bases, p.134-145, September 03-06, 1996

CITED BY 11

	Ramesh C. Agarwal , Charu C. Aggarwal , V. V. V. Prasad, Depth first generation of long patterns, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.108-118, August 20-23, 2000, Boston, Massachusetts, United States
	Aaron Ceglar , John F. Roddick , Paul Calder, Guiding knowledge discovery through interactive data mining, Managing data mining technologies in organizations: techniques and applications, Idea Group Publishing, Hershey, PA, 2003
	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
	Ming-Yen Lin , Suh-Yin Lee, Interactive sequence discovery by incremental mining, Information Sciences—Informatics and Computer Science: An International Journal, v.165 n.3-4, p.187-205, 19 October 2004
	Ruoming Jin , Kaushik Sinha , Gagan Agrawal, Simultaneous optimization of complex mining tasks with a knowledgeable cache, Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, August 21-24, 2005, Chicago, Illinois, USA
	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
	Ruoming Jin , Kaushik Sinha , Gagan Agrawal, A framework to support multiple query optimization for complex mining tasks, Proceedings of the 6th international workshop on Multimedia data mining: mining integrated media and complex data, p.23-32, August 21-21, 2005, Chicago, Illinois
	Yu Li , Miroslav Kubat, Searching for high-support itemsets in itemset trees, Intelligent Data Analysis, v.10 n.2, p.105-120, March 2006
	Antonin Rozsypal , Miroslav Kubat, Association mining in time-varying domains, Intelligent Data Analysis, v.9 n.3, p.273-288, May 2005
	Aaron Ceglar , John F. Roddick, GAM: a guidance enabled association mining environment, International Journal of Business Intelligence and Data Mining, v.2 n.1, p.3-28, March 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