Scalable data mining with model constraints

Subscribe (Full Service)


	Search: The ACM Digital Library The Guide

	Feedback

Scalable data mining with model constraints

Full text

Pdf (1.15 MB)

Source

ACM SIGKDD Explorations Newsletter archive
Volume 2 , Issue 2 (December 2000) table of contents
Special issue on “Scalable data mining algorithms”

Pages: 39 - 48

Year of Publication: 2000

ISSN:1931-0145

Authors

Minos Garofalakis	Bell Labs, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ
Rajeev Rastogi	Bell Labs, Lucent Technologies, 600 Mountain Avenue, Murray Hill, NJ

Publisher

ACM New York, NY, USA

Bibliometrics

Downloads (6 Weeks): 3, Downloads (12 Months): 30, Citation Count: 1

Additional Information:

references cited by index terms collaborative colleagues

Tools and Actions:	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/380995.381012 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	Hussein Almuallim, An efficient algorithm for optimal pruning of decision trees, Artificial Intelligence, v.83 n.2, p.347-362, June 1996 [doi>10.1016/0004-3702(95)00060-7]
	3	Marko Bohanec , Ivan Bratko, Trading Accuracy for Simplicity in Decision Trees, Machine Learning, v.15 n.3, p.223-250, June 1994 [doi>10.1023/A:1022685808937]
	4	[4] Leo Breiman, Jerome H. Friedman, Richard A. Olshen, and Charles J. Stone. "Classification and Regression Trees". Chapman & Hall, 1984.
	5	Surajit Chaudhuri, An overview of query optimization in relational systems, Proceedings of the seventeenth ACM SIGACT-SIGMOD-SIGART symposium on Principles of database systems, p.34-43, June 01-04, 1998, Seattle, Washington, United States [doi>10.1145/275487.275492]
	6	Ming-Syan Chen , Jong Soo Park , Philip S. Yu, Efficient Data Mining for Path Traversal Patterns, IEEE Transactions on Knowledge and Data Engineering, v.10 n.2, p.209-221, March 1998 [doi>10.1109/69.683753]
	7	Gregory F. Cooper , Edward Herskovits, A Bayesian method for constructing Bayesian belief networks from databases, Proceedings of the seventh conference (1991) on Uncertainty in artificial intelligence, p.86-94, June 1994, Los Angeles, California, United States
	8	[8] Nir Friedman, Iftach Nachman, and Dana Peér. "Learning Bayesian Network Structure from Massive Datasets: The "Sparse Candidate" Algorithm". In Proc. of the 15th Annual Conference on Uncertainty in Artificial Intelligence , Stockholm, Sweden, August 1999.
	9	Minos Garofalakis , Dongjoon Hyun , Rajeev Rastogi , Kyuseok Shim, Efficient algorithms for constructing decision trees with constraints, Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, p.335-339, August 20-23, 2000, Boston, Massachusetts, United States [doi>10.1145/347090.347163]
	10	Minos N. Garofalakis , Rajeev Rastogi , Kyuseok Shim, SPIRIT: Sequential Pattern Mining with Regular Expression Constraints, Proceedings of the 25th International Conference on Very Large Data Bases, p.223-234, September 07-10, 1999
	11	Johannes Gehrke , Venkatesh Ganti , Raghu Ramakrishnan , Wei-Yin Loh, BOAT—optimistic decision tree construction, Proceedings of the 1999 ACM SIGMOD international conference on Management of data, p.169-180, May 31-June 03, 1999, Philadelphia, Pennsylvania, United States
	12	Sudipto Guha , Rajeev Rastogi , Kyuseok Shim, CURE: an efficient clustering algorithm for large databases, Proceedings of the 1998 ACM SIGMOD international conference on Management of data, p.73-84, June 01-04, 1998, Seattle, Washington, United States
	13	Harry R. Lewis , Christos H. Papadimitriou , Christos Papadimitriou, Elements of the Theory of Computation, Prentice Hall PTR, Upper Saddle River, NJ, 1997
	14	[14] Manish Mehta, Jorma Rissanen, and Rakesh Agrawal. "MDL-based Decsion Tree Pruning". In Proc. of the 1st Intl. Conference on Knowledge Discovery and Data Mining, Montreal, Quebec, August 1995.
	15	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
	16	J. R. Quinlan , R. L. Rivest, Inferring decision trees using the minimum description length principle, Information and Computation, v.80 n.3, p.227-248, Mar. 1989 [doi>10.1016/0890-5401(89)90010-2]
	17	Rajeev Rastogi , Kyuseok Shim, PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning, Proceedings of the 24rd International Conference on Very Large Data Bases, p.404-415, August 24-27, 1998
	18	P. Griffiths Selinger , M. M. Astrahan , D. D. Chamberlin , R. A. Lorie , T. G. Price, Access path selection in a relational database management system, Proceedings of the 1979 ACM SIGMOD international conference on Management of data, May 30-June 01, 1979, Boston, Massachusetts [doi>10.1145/582095.582099]
	19	John C. Shafer , Rakesh Agrawal , Manish Mehta, SPRINT: A Scalable Parallel Classifier for Data Mining, Proceedings of the 22th International Conference on Very Large Data Bases, p.544-555, September 03-06, 1996
	20	Ramakrishnan Srikant , Rakesh Agrawal, Mining Sequential Patterns: Generalizations and Performance Improvements, Proceedings of the 5th International Conference on Extending Database Technology: Advances in Database Technology, p.3-17, March 25-29, 1996
	21	Jason Tsong-Li Wang , Gung-Wei Chirn , Thomas G. Marr , Bruce Shapiro , Dennis Shasha , Kaizhong Zhang, Combinatorial pattern discovery for scientific data: some preliminary results, Proceedings of the 1994 ACM SIGMOD international conference on Management of data, p.115-125, May 24-27, 1994, Minneapolis, Minnesota, United States