An efficient method for discretizing continuous attributes

International Journal of Data Warehousing and Mining

Volumn 6, Issue 2, 2010, Pages 1-21

  Engle, Kelley M ^a   Gangopadhyay, Aryya ^a  

^a UNIVERSITY OF MARYLAND BALTIMORE COUNTY   (United States)

Author keywords

Continuous attributes; Decision tree; Discretization; Golden search; Hill climbing; Information gain

Indexed keywords

CONTINUOUS ATTRIBUTE; CONTINUOUS ATTRIBUTES; DISCRETIZATIONS; HILL CLIMBING; INFORMATION GAIN;

DATA MINING; DECISION TREES;

OPTIMIZATION;

EID: 77954117917     PISSN: 15483924     EISSN: 15483932     Source Type: Journal    
DOI: 10.4018/jdwm.2010040101     Document Type: Article

References (51)

1. Asuncion, A., & Newman, D. J. (2007). UCI machine learning repository. Retrieved from http://www.ics. uci.edu/~mlearn/MLRepository.html
2. Bagui, S. (2006). An approach to mining crime patterns. International Journal of Data Warehousing and Mining, 2 (1), 50-80.
3. Baruch Options Data Warehouse. (2008). Subotnik Financial Services Center. Retrieved
4. Breiman, L., Friedman, J. H., Olshen, R. A., & Stone, C. J. (1998). Megainduction: machine learning on very large databases. Sydney, Australia: University of Sydney.
5. Catlett, J. (1991). On changing continuous attributes into ordered discrete attributes. Paper presented at the Proceedings of the European Working Session on Learning, Berlin, Germany.
6. Chan, C. C., Batur, C., & Srinivasan, A. (1991). Determination of quantization intervals in rule based model for dynamic systems. Paper presented at the Proceedings of the IEEE Conference on Systems, Man, and Cybernetics, Charlottesville, VA.
7. Chan, P. K., & Stolfo, S. J. (1993). Experiments on multistrategy learning by metalearning. Paper presented at the Proceedings of the Second International Conference on Information and Knowledge Management, Washington, D. C.
8. Chan, P. K., & Stolfo, S. J. (1993). Metalearning for multistrategy and parallel learning. Paper presented at the Proceedings of Second International Workshop on Multistrategy Learning.
9. Charles, F., & Cavazza, M. (2004). Exploring the scalability of character-based storytelling. Paper presented at the Third International Joint Conference on Autonomous Agents and Multiagent Systems.
10. Chaudhuri, S. (1998). Data mining and database systems: where is the intersection? A Quarterly Bulletin of the Computer Society of the IEEE Technical Committee on Data Engineering, 21 (1), 4-8.
11. Chickering, D. M., Meek, C., & Rounthwaite, R. (2001). Efficient Determination of Dynamic Split Points in a Decision Tree. Paper presented at the First IEEE International Conference on Data Mining, San Jose, CA.
12. Chiu, D. K. Y., Cheung, B., & Wong, A. K. C. (1990). Information synthesis based on hierarchical entropy discretization. Journal of Experimental & Theoretical Artificial Intelligence, 2, 117-129. doi:10.1080/ 09528139008953718
13. Dougherty, J., Kohavi, R., & Sahami, M. (1995). Supervised and unsupervised discretization of continuous features. Paper presented at the Proceedings of the 12th International Conference on Machine Learning, Tahoe City, CA.
14. Fayyad, U. M., & Irani, K. B. (1992). On the handling of continuous-valued attributes in decision tree generation. Machine Learning, 8, 87-102.
15. Fayyad, U. M., & Irani, K. B. (1993). Multi-interval discretization of continuous-valued attributes for classification learning. Paper presented at the Proceedings of the 13th International Joint Conference on Artificial Intelligence.
16. Friedman, N., & Goldszmidt, M. (1996). Discretizing continuous attributes whle learning Bayesian networks. Paper presented at the Proceedings of the Thirteenth International Conference on Machine Learning, San Francisco, CA.
17. Ganti, V., Gehrke, J., & Ramakrishnan, R. (1999). Mining very large databases. Computer, 32 (8), 38-45. doi:10.1109/2.781633
18. Gehrke, J., Ganti, V., Ramakrishnan, R., & Loh, W. Y. (1999). BOAT - optimistic decision tree construction. Paper presented at the 1999 ACM SIGMOD International Conference on Management of Data, Philadelphia, PA.
19. Gehrke, J., Ramakrishnan, R., & Ganti, V. (2000). Rainforest - A framework for fast decision tree construction of large datasets. Data Mining and Knowledge Discovery, 4, 127-162. doi:10.1023/A:1009839829793
20. Han, J., & Kamber, M. (2006). Data Mining: Concepts and Techniques (2nd ed.). Amsterdam: Morgan Kaufman.
21. Hand, D., Mannila, H., & Smyth, P. (2001). Principles of Data Mining. Cambridge, MA: MIT Press.
22. Ho, K. M., & Scott, P. D. (1997). Zeta: A global method for discretization of continuous variables. Paper presented at the KDD97:3rd International Conference of Knowledge Discovery and Data Mining, Newport Beach, CA.
23. Holte, R. C. (1993). Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11, 63-90. doi:10.1023/A: 1022631118932
24. Hyafil, L., & Rivest, R. L. (1976). Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5 (1), 15-17. doi:10.1016/0020-0190 (76) 90095-8 June 20, 2008 from http://optionsdata.baruch. cuny.edu/
25. Kamber, M., Winstone, L., Gong, W., Cheng, S., & Han, J. (1997). Generalization and decision tree induction: efficient classification in data mining. Paper presented at the RIDE '97.
26. Kerber, R. (1992). Chimerge: Discretization of numeric attributes. Paper presented at the Proceedings of the Tenth National Conference on Artificial Intelligence.
27. Kohonen, T. (1989). Self-Organization and Associative Memory. Berlin, Germany: Springer-Verlag.
28. Liu, H., Hussain, F., Tan, C. L., & Dash, M. (2002). Discretization: An enabling technique. Data Mining and Knowledge Discovery, 6, 393-423. doi:10.1023/A:1016304305535 (Pubitemid 37113864)
29. Loh, W.-Y., & Shih, Y.-S. (1997). Split selection methods for classification trees. Statistica Sinica, 7, 815-840.
30. Loh, W.-Y., & Vanichsetakul, N. (1988). Treestructured classification via generalized discriminant analysis. Journal of the American Statistical Association, 83 (403), 715-725. doi:10.2307/2289295
31. Mehta, M., Agrawal, R., & Rissanen, J. (1996, 1996). SLIQ: A Fast Scalable Classifier for Data Mining. Paper presented at the EDBT, Avignon, France.
32. Ng, R. T., & Han, J. (2002). CLARANS: A Method for Clustering Objects for Spatial Data Mining. IEEE Transactions on Knowledge and Data Engineering, 14 (5), 1003-1016. doi:10.1109/TKDE.2002.1033770 (Pubitemid 35242611)
33. Pfahringer, B. (1995). Compression-based discretization of continuous attributes. Paper presented at the Proceedings of the Twelfth International Conference on Machine Learning.
34. Press, W. H. (2007). Numerical recipes: the art of scientific computing (3rd ed.). New York: Cambridge University Press.
35. Quinlan, J. R. (1983). Learning efficient classification procedures and their application to chess endgames. In R. Michalski, T. Carbonell & T. Mitchell (Eds.), Machine Learning: an AI approach. Los Altos, CA: Morgan Kaufmann.
36. Quinlan, J. R. (1986). Induction of decision trees. Machine Learning, 1 (81-106), 81-106.
37. Quinlan, J. R. (1993). C4.5: Programs for Machine Learning. Los Altos, CA: Morgan Kauffman.
38. Quinlan, J. R. (1996). Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence Research, 4, 77-90.
39. Rastogi, R., & Shim, K. (2000). Public: A decision tree classifier that integrates building and pruning. Data Mining and Knowledge Discovery, 4 (4), 315-344. doi:10.1023/A:1009887311454
40. Richeldi, M., & Rossotto, M. (1995). Class-driven statistical discretization of continuous attributes. In N. Lavrac & S. Wrobel (Eds.), Lecture notes in Artificial Intelligence (Vol. 914, pp. 335-338). Berlin, Heidelberg, New York: Springer-Verlag.
41. Shafer, J., Agrawal, R., & Mehta, M. (1996). SPRINT: A scalable parallel classifier for data mining. Paper presented at the Proceedings of the 22nd International Conference of Very Large Databases, Mumbai (Bombay), India.
42. Sloan Digital Sky Survey. (2008). The 5th data release of the Sloan digital sky survey. Retrieved June 20, 2008 from http://cas.sdss.org/dr5/en
43. Tan, P.-N., et al. (2005) Introduction to Data Mining. Boston, MA: Addison-Wesley Longman Publishing Co., Inc.
44. Ting, K. M. (1994). Discretization of continuous-valued attributes and instance-based learning (Vol. 491) (Tech. Rep.). Australia: University of Sydney.
45. Tzanis, G., & Berberidis, C. (2007). Mining for Mutually Exclusive Items in Transaction Databases. International Journal of Data Warehousing and Mining, 3 (3), 45-59.
46. Van de Merckt, T. (1993). Decision trees in numerical attribute spaces. Paper presented at the 13th International Joint Conference on Artificial Intelligence.
47. Vannucci, M., & Colla, V. (2004, April 28-30). Meaningful discretization of continuous features for association rules mining by means of a SOM. Paper presented at the European Symposium on Artificial Neural Networks, Bruges, Belgium.
48. Weiss, S. M., Galen, R. S., & Tadepalli, P. V. (1990). Maximizing the predicative value of production rules. Artificial Intelligence, 45, 47-71. doi:10.1016/0004-3702 (90) 90037-Z
49. Witten, I. H., & Frank, E. (2005). Data Mining: Practical Machine Learning Tools and Techniques. San Francisco: Elsevier, Inc.
50. Wong, A. K. C., & Chiu, D. K. Y. (1987). Synthesizing statistical knowledge from incomplete mixed-mode data. IEEE Transactions on Pattern Analysis and Machine Intelligence, 9, 796-805. doi:10.1109/TPAMI.1987.4767986
51. Zaki, M. J. (2000). Scalable Algorithms for Association Mining. IEEE Transactions on Knowledge and Data Engineering, 12 (3), 372-390. doi:10.1109/69.846291