Understanding the crucial differences between classification and discovery of association rules

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 , 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
	2	Bayardo, R.J. (1997) Brute-force mining of high-confidence classification rules. Proc. 3rd Int. Conf. on Knowledge Discovery & Data Mining (KDD-97), 123-126. AAAI Press.
	3	Bramer, M. (1996) Induction of classification rules from examples: a critical review. Proc. Data Mining'96 Unicom Seminar, 139-166. London: Unicom, 1996.
	4	Leonard A. Breslow , David W. Aha, Simplifying decision trees: A survey, The Knowledge Engineering Review, v.12 n.1, p.1-40, January 1997 [doi>10.1017/S0269888997000015]
	5	Christopher J. C. Burges, A Tutorial on Support Vector Machines for Pattern Recognition, Data Mining and Knowledge Discovery, v.2 n.2, p.121-167, June 1998 [doi>10.1023/A:1009715923555]
	6	Domingos, P. (1998) Occam's two razors: the sharp and the blunt. Proc. 4th Int. Conf. on Knowledge Discovery & Data Mining (KDD-98), 37-43. AAAI Press.
	7	Domshlak, C.; Gershkovich, D.; Gudes, E.; Liusternik, N.; Meisels, A.; Rosen, T.; Shimony, S.E. (1998) FlexiMine - A flexible platform for KDD research and application construction. Proc. 4th Int. Conf. on Knowledge Discovery & Data Mining (KDD-98), 184-188. AAAI Press.
	8	Guozhu Dong , Jinyan Li, Interestingness of Discovered Association Rules in Terms of Neighborhood-Based Unexpectedness, Proceedings of the Second Pacific-Asia Conference on Research and Development in Knowledge Discovery and Data Mining, p.72-86, April 15-17, 1998
	9	Sylvie Guillaume , Fabrice Guillet , Jacques Philippe, Improving the Discovery of Association Rules with Intensity of Implication, Proceedings of the Second European Symposium on Principles of Data Mining and Knowledge Discovery, p.318-327, September 23-26, 1998
	10	David D. Jensen , Paul R. Cohen, Multiple Comparisons in Induction Algorithms, Machine Learning, v.38 n.3, p.309-338, March 2000 [doi>10.1023/A:1007631014630]
	11	Jensen, D. and Schmill, M. (1997) Adjusting for multiple comparisons in decision tree pruning. Proc. 3rd Int. Conf. on Knowledge Discovery & Data Mining (KDD-97), 195-198. AAAI Press.
	12	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]
	13	Mika Klemettinen , Heikki Mannila , A. Inkeri Verkamo, Association Rule Selection in a Data Mining Environment, Proceedings of the Third European Conference on Principles of Data Mining and Knowledge Discovery, p.372-377, September 15-18, 1999
	14	King, R.D.; Feng, C. and Sutherland, A. (1995) STATLOG: comparison of classification algorithms on large real-world problems. Applied Artificial Inteligence 9(3). May/June 1995, 289-333.
	15	Liu, B.; Hsu, W. and Ma, Y. (1998) Integrating classification and association rule mining. Proc. 4th Int. Conf. on Knowledge Discovery and Data Mining (KDD-98), 80-86. AAAI Press.
	16	Bing Liu , Wynne Hsu , Yiming Ma, Mining association rules with multiple minimum supports, Proceedings of the fifth ACM SIGKDD international conference on Knowledge discovery and data mining, p.337-341, August 15-18, 1999, San Diego, California, United States [doi>10.1145/312129.312274]
	17	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]
	18	Michalski, R.W. (1983) A theory and methodology of inductive learning. Artificial Intelligence 20, 1983, 111-161.
	19	Michie, D.; Spiegelhalter, D.J. and Taylor, C.C. (1994) Machine Learning, Neural and Statistical Classification. New York: Ellis Horwood.
	20	Mitchell, T.M. (1980) The need for biases in learning generalizations. Rutgers Technical Report, 1980. Also published in: J.W. Shavlik and T.G. Dietterich (Eds.) Readings in Machine Learning, 184-191. Morgan Kaufmann, 1990.
	21	Thomas M. Mitchell, Machine Learning, McGraw-Hill Higher Education, 1997
	22	Oates, T. and Jensen, D. (1998) Large datasets lead to overly complex models: an explanation and a solution. Proc. 4th Int. Conf. on Knowledge Discovery & Data Mining (KDD- 98), 294-298. AAAI Press.
	23	Pinker, S. (1997) How the Mind Works. New York: W.W. Norton & Company.
	24	Rao, R.B.; Gordon, D. and Spears, W. (1995) For every generalization action, is there really an equal and opposite reaction? Analysis of the conservation law for generalization performance. Proc. 12th Int. Conf. on Machine Learning, 471-479. Morgan Kaufmann.
	25	Cullen Schaffer, Overfitting Avoidance as Bias, Machine Learning, v.10 n.2, p.153-178, Feb. 1993 [doi>10.1023/A:1022653209073]
	26	Schaffer, C. (1994) A conservation law for generalization performance. Proc. 11th Int. Conf. on Machine Learning, 259-265. Morgan Kaufmann.
	27	Smyth, P. and Goodman, R.M. (1991) Rule induction using information theory. In: G. Piatetsky-Shapiro and W.J. Frawley. (Eds.) Knowledge Discovery in Databases, 159- 176. AAAI Press.