Decomposition methodology for knowledge discovery and data mining: Theory and applications

Decomposition Methodology For Knowledge Discovery And Data Mining: Theory And Applications

Volumn , Issue , 2005, Pages 1-323

  Maimon, Oded ^a   Rokach, Lior ^a  

^a TEL AVIV UNIVERSITY   (Israel)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85115728351     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1142/5686     Document Type: Book

References (345)

1. Aha, D. W.; Kibler, D.; and Albert, M. K., Instancebased learning algorithms. Machine Learning 6(1):37-66, 1991
2. Al-Sultan K. S., A tabu search approach to the clustering problem, Pattern Recognition, 28:1443-1451, 1995
3. Al-Sultan K. S., Khan M. M.: Computational experience on four algorithms for the hard clustering problem. Pattern Recognition Letters 17(3): 295-308, 1996.
4. Ali K. M., Pazzani M. J., Error Reduction through Learning Multiple Descriptions. Machine Learning, 24: 3, 173-202, 1996.
5. Almuallim H., An Efficient Algorithm for Optimal Pruning of Decision Trees. Artificial Intelligence 83(2): 347-362, 1996.
6. Almuallim H,. and Dietterich T.G., Learning Boolean concepts in the presence of many irrelevant features. Artificial Intelligence, 69: 1-2, 279-306, 1994.
7. Alsabti K., Ranka S. and Singh V., CLOUDS: A Decision Tree Classifier for Large Datasets, Conference on Knowledge Discovery and Data Mining (KDD-98), August 1998.
8. Anand R, Methrotra K, Mohan CK, Ranka S. Efficient classification for multiclass problems using modular neural networks. IEEE Trans Neural Networks, 6(1): 117-125, 1995.
9. Anderson, J.A. and Rosenfeld, E. Talking Nets: An Oral History of Neural Network Research. Cambridge, MA: MIT Press, 2000.
10. Ashenhurst, R. L., The decomposition of switching functions, Technical report, Bell Laboratories BL-l(ll), pp. 541-602, 1952.
11. Attneave F., Applications of Information Theory to Psychology. Holt, Rinehart and Winston, 1959.
12. Avnimelech R. and Intrator N., Boosted Mixture of Experts: an ensemble learning scheme, Neural Computations, 11(2):483-497, 1999.
13. Baker E., and Jain A. K., On feature ordering in practice and some finite sample effects. In Proceedings of the Third International Joint Conference on Pattern Recognition, pages 45-49, San Diego, CA, 1976.
14. Banfield J. D. and Raftery A. E.. Model-based Gaussian and non-Gaussian clustering. Biometrics, 49:803-821, 1993.
15. Bartlett P. and Shawe-Taylor J., Generalization Performance of Support Vector Machines and Other Pattern Classifiers, In “Advances in Kernel Methods, Support Vector Learning”, Bernhard Scholkopf, Christopher J. C. Burges, and Alexander J. Smola (eds), MIT Press, Cambridge, USA, 1998.
16. Bauer, E. and Kohavi, R., “An Empirical Comparison of Voting Classification Algorithms: Bagging, Boosting, and Variants”. Machine Learning, 35: 1-38, 1999.
17. Baxt, W. G., Use of an artificial neural network for data analysis in clinical decision making: The diagnosis of acute coronary occlusion. Neural Computation, 2(4):480-489, 1990.
18. Bay, S., Nearest neighbor classification from multiple feature subsets. Intelligent Data Analysis, 3(3): 191-209, 1999.
19. Bellman, R., Adaptive Control Processes: A Guided Tour, Princeton University Press, 1961.
20. BenBassat M., Myopic policies in sequential classification. IEEE Trans, on Computing, 27(2):170-174, February 1978.
21. Bennett X. and Mangasarian O.L., Multicategory discrimination via linear programming. Optimization Methods and Software, 3:29-39, 1994.
22. Bensusan H. and Kalousis A., Estimating the Predictive Accuracy of a Classifier, In Proc. Proceedings of the 12th European Conference on Machine Learning, pages 25-36, 2001.
23. Bentley J. L. and Friedman J. H., Fast algorithms for constructing minimal spanning trees in coordinate spaces. IEEE Transactions on Computers, C27(2):97-105, February 1978. 275
24. Bernard M.E., Decision trees and diagrams. Computing Surveys, 14(4):593-623, 1982.
25. Berry M., and Linoff G., Mastering Data Mining, John Wiley & Sons, 2000
26. Bhargava H. K., Data Mining by Decomposition: Adaptive Search for Hypothesis Generation, INFORMS Journal on Computing Vol. 11, Iss. 3, pp. 239-47, 1999.
27. Biermann, A. W., Faireld, J., and Beres, T. (1982). Signature table systems and learning. IEEE Trans. Syst. Man Cybern., 12(5):635-648.
28. Blum, A. L. and Langley, P., 1997, Selection of relevant features and examples in machine learning, Artificial Intelligence, 97, pp.245-271.
29. Blum A., and Mitchell T., Combining Labeled and Unlabeled Data with CoTrain-ing. In Proc. of the 11th Annual Conference on Computational Learning Theory, pages 92-100, 1998.
30. Bonner, R., On Some Clustering Techniques. IBM journal of research and development, 8:22-32, 1964.
31. Booker L., Goldberg D. E., and Holland J. H., Classifier systems and genetic algorithms. Artificial Intelligence, 40(1-3):235-282, 1989.
32. Brachman, R. and Anand, T., 1994, The process of knowledge discovery in databases, in: Advances in Knowledge Discovery and Data Mining, AAAI/MIT Press, pp. 37-58.
33. Bratko I., and Bohanec M., Trading accuracy for simplicity in decision trees. Machine Learning 15: 223-250, 1994.
34. Brazdil P., Gama J., Henery R., Characterizing the Applicability of Classification Algorithms using Meta Level Learning, in Machine Learning: ECML-94, F.Bergadano e L. de Raedt (eds), LNAI No. 784: pp. 83-102, Springer-Verlag, 1994.
35. Breiman L., Bagging predictors. Machine Learning, 24(2):123-140, 1996
36. Breiman L., Friedman J., Olshen R., and Stone C. Classification and Regression Trees. Wadsworth Int. Group, 1984
37. Br Brodley, C. E., Automatic selection of split criterion during tree growing based on node selection. In Proceedings of the Twelth International Conference on Machine Learning, 73-80 Taho City, Ca. Morgan Kaufmann, 1995
38. Brodley C. E. and Utgoff. P. E., Multivariate decision trees. Machine Learning, 19:45-77, 1995.
39. Buchanan, B.G. and Shortliffe, E.H., Rule Based Expert Systems, 272-292, Addison-Wesley, 1984.
40. Buja, A. and Lee, Y.S., Data mining criteria for tree based regression and classification, Proceedings of the 7th International Conference on Knowledge Discovery and Data Mining, (pp 27-36), San Diego, USA, 2001.
41. Buntine, W., A Theory of Learning Classification Rules. Doctoral dissertation. School of Computing Science, University of Technology. Sydney. Australia, 1990.
42. Buntine, W., “Graphical Models for Discovering Knowledge”, in U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthurusamy, editors, Advances in Knowledge Discovery and Data Mining, pp 59-82. AAAI/MIT Press, 1996.
43. Buntine W., Niblett T., A Further Comparison of Splitting Rules for Decision-Tree Induction. Machine Learning, 8: 75-85, 1992.
44. Buczak A. L. and Ziarko W., “Neural and Rough Set Based Data Mining Methods in Engineering”, Klosgen W. and Zytkow J. M. (Eds), Handbook of Data Mining and Knowledge Discovery, pages 788-797. Oxford University Press, 2002.
45. Can F., Incremental clustering for dynamic information processing, in ACM Transactions on Information Systems, no. 11, pp 143-164, 1993
46. Catlett J., Mega induction: Machine Learning on Vary Large Databases, PhD, University of Sydney, 1991
47. Chan P. K. and Stolfo, S. J., Toward parallel and distributed learning by meta-learning, In AAAI Workshop in Knowledge Discovery in Databases, pp. 227-240, 1993.
48. Chan P.K. and Stolfo, S.J., A Comparative Evaluation of Voting and Meta-learning on Partitioned Data, Proc. 12th Intl. Conf. On Machine Learning ICML-95, 1995.
49. Chan P.K. and Stolfo S.J, On the Accuracy of Meta-learning for Scalable Data Mining, J. Intelligent Information Systems, 8:5-28, 1997.
50. Charnes, A., Cooper, W. W., and Rhodes, E., Measuring the efficiency of decision making units. European Journal of Operational Research, 2(6):429-444, 1978.
51. Chen K., Wang L. and Chi H., Methods of Combining Multiple Classifiers with Different Features and Their Applications to Text-Independent Speaker Identification. International Journal of Pattern Recognition and Artificial Intelligence, 11(3): 417-445, 1997.
52. Cheeseman P., Stutz J.: Bayesian Classification (AutoClass): Theory and Results. Advances in Knowledge Discovery and Data Mining 1996: 153-180
53. Cherkauer, K. J., Human Expert-Level Performance on a Scientific Image Analysis Task by a System Using Combined Artificial Neural Networks. In Working Notes, Integrating Multiple Learned Models for Improving and Scaling Machine Learning Algorithms Workshop, Thirteenth National Conference on Artificial Intelligence. Portland, OR: AAAI Press, 1996.
54. Chizi, B., Maimon, O. and Smilovici A. On Dimensionality Reduction of High Dimensional Data Sets, Frontiers in Artificial Intelligence and Applications, IOS press, pp. 230-236, 2002.
55. Clark P., and Niblett T., The CN2 rule induction algorithm. Machine Learning, 3:261-284, 1989.
56. Clark, P. and Boswell, R., “Rule induction with CN2: Some recent improvements.” In Proceedings of the European Working Session on Learning, pp. 151-163, Pitman, 1991.
57. Clearwater, S., T. Cheng, H. Hirsh, and B. Buchanan. Incremental batch learning. In Proceedings of the Sixth International Workshop on Machine Learning, San Mateo CA:, pp. 366-370. Morgan Kaufmann, 1989.
58. Crawford S. L., Extensions to the CART algorithm. Int. J. of ManMachine Studies, 31(2):197-217, August 1989.
59. Curtis, H. A., A New Approach to the Design of Switching Functions, Van Nos-trand, Princeton, 1962.
60. Dhillon I. and Modha D., Concept Decomposition for Large Sparse Text Data Using Clustering. Machine Learning. 42, pp.143-175. (2001).
61. Dempster A.P., Laird N.M., and Rubin D.B., Maximum likelihood from incomplete data using the EM algorithm. Journal of the Royal Statistical Society, 39(B), 1977.
62. Dietterich, T. G., “Approximate statistical tests for comparing supervised classification learning algorithms”. Neural Computation, 10(7): 1895-1924, 1998.
63. Dietterich, T. G., An Experimental Comparison of Three Methods for Constructing Ensembles of Decision Trees: Bagging. Boosting and Randomization. 40(2):139-157, 2000.
64. Dietterich T., Ensemble methods in machine learning. In J. Kittler and F. Roll, editors, First International Workshop on Multiple Classifier Systems, Lecture Notes in Computer Science, pages 1-15. Springer-Verlag, 2000
65. Dietterich, T. G., and Ghulum Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2:263-286, 1995.
66. Dietterich, T. G., and Kong, E. B., Machine learning bias, statistical bias, and statistical variance of decision tree algorithms. Tech. rep., Oregon State University, 1995.
67. Dietterich, T. G., and Michalski, R. S., A comparative review of selected methods for learning from examples, Machine Learning, an Artificial Intelligence approach, 1: 41-81, 1983.
68. Dietterich, T. G., Kearns, M., and Mansour, Y., Applying the weak learning framework to understand and improve C4.5. Proceedings of the Thirteenth International Conference on Machine Learning, pp. 96-104, San Francisco: Morgan Kaufmann, 1996.
69. Domingos, P., Using Partitioning to Speed Up Specific-to-General Rule Induction. In Proceedings of the AAAI-96 Workshop on Integrating Multiple Learned Models, pp. 29-34, AAAI Press, 1996.
70. Domingos, P., & Pazzani, M., On the Optimality of the Naive Bayes Classifier under Zero-One Loss. Machine Learning, 29: 2, 103-130, 1997.
71. Dougherty, J., Kohavi, R, Sahami, M., Supervised and unsupervised discretization of continuous attributes. Machine Learning: Proceedings of the twelfth International Conference, Morgan Kaufman pp. 194-202, 1995.
72. Duda, R., and Hart, P., Pattern Classification and Scene Analysis, New-York, Wiley, 1973.
73. Duda, P. E. Hart and D. G. Stork, Pattern Classification, Wiley, New York, 2001.
74. Dunteman, G.H., Principal Components Analysis, Sage Publications, 1989.
75. Elder I. and Pregibon, D., “A Statistical Perspective on Knowledge Discovery in Databases”, In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, and R. Uthu-rusamy editors., Advances in Knowledge Discovery and Data Mining, pp. 83-113, AAAI/MIT Press, 1996.
76. Esposito F., Malerba D. and Semeraro G., A Comparative Analysis of Methods for Pruning Decision Trees. EEE Transactions on Pattern Analysis and Machine Intelligence, 19(5):476-492, 1997.
77. Ester M., Kriegel H.P., Sander S., and Xu X., A density-based algorithm for discovering clusters in large spatial databases with noise. In E. Simoudis, J. Han, and U. Fayyad, editors, Proceedings of the 2nd International Conference on Knowledge Discovery and Data Mining (KDD-96), pages 226-231, Menlo Park, CA, 1996. AAAI, AAAI Press.
78. Estivill-Castro, V. and Yang, J. A Fast and robust general purpose clustering algorithm. Pacific Rim International Conference on Artificial Intelligence, pp. 208-218, 2000.
79. Fraley C. and Raftery A.E., “How Many Clusters? Which Clustering Method? Answers Via Model-Based Cluster Analysis”, Technical Report No. 329. Department of Statistics University of Washington, 1998.
80. Fayyad, U., Piatesky-Shapiro, G. & Smyth P., From Data Mining to Knowledge Discovery: An Overview. In U. Fayyad, G. Piatetsky-Shapiro, P. Smyth, & R. Uthurusamy (Eds), Advances in Knowledge Discovery and Data Mining, pp 1-30, AAAI/MIT Press, 1996.
81. Fayyad, U., Grinstein, G. and Wierse, A., Information Visualization in Data Mining and Knowledge Discovery, Morgan Kaufmann, 2001.
82. Fayyad U., and Irani K. B., The attribute selection problem in decision tree generation. In proceedings of Tenth National Conference on Artificial Intelligence, pp. 104-110, Cambridge, MA: AAAI Press/MIT Press, 1992.
83. Ferri C, Flach P., and Hernandez-Orallo J., Learning Decision Trees Using the Area Under the ROC Curve. In Claude Sammut and Achim Hoffmann, editors, Proceedings of the 19th International Conference on Machine Learn-ing, pp. 139-146. Morgan Kaufmann, July 2002
84. Fifield D. J., Distributed Tree Construction From Large Datasets, Bachelor’s Honor Thesis, Australian National University, 1992.
85. Fisher, D., 1987, Knowledge acquisition via incremental conceptual clustering, in machine learning 2, pp. 139-172.
86. Fischer, B., “Decomposition of Time Series -Comparing Different Methods in Theory and Practice”, Eurostat Working Paper, 1995
87. Fix, E., and Hodges, J.L., Discriminatory analysis. Nonparametric discrimination. Consistency properties. Technical Report 4, US Air Force School of Aviation Medicine. Randolph
88. Field, TX, 1957. Fortier, J.J. and Solomon, H. 1996. Clustering procedures. In proceedings of the Multivariate Analysis, '66, P.R. Krishnaiah (Ed), pp. 493-506.
89. Fountain, T. Dietterich T., Sudyka B., “Mining IC Test Data to Optimize VLSI Testing”, ACM SIGKDD Conference, 2000, pp. 18-25, 2000
90. Frawley W. J., Piatetsky-Shapiro G., and Matheus C. J., “Knowledge Discovery in Databases: An Overview, " G. Piatetsky-Shapiro and W. J. Frawley, editors, Knowledge Discovery in Databases, 1-27, AAAI Press, Menlo Park, California, 1991.
91. Freitas X., and Lavington S. H., Mining Very Large Databases With Parallel Processing, Kluwer Academic Publishers, 1998.
92. Freund Y. and Schapire R. E., Experiments with a new boosting algorithm. In Machine Learning: Proceedings of the Thirteenth International Conference, pages 325-332, 1996.
93. Friedman J. H., A recursive partitioning decision rule for nonparametric classifiers. IEEE Trans, on Comp., C26:404-408, 1977.
94. Friedman, J. H., “Multivariate Adaptive Regression Splines”, The Annual Of Statistics, 19, 1-141, 1991.
95. Friedman, J.H. (1997a). Data Mining and Statistics: What is the connection? 1997.
96. Friedman, J.H. (1997b). On bias, variance, 0/1 -loss and the curse of dimensionality, Data Mining and Knowledge Discovery, 1: 1, 55-77, 1997.
97. Friedman, J.H. & Tukey, J.W., A Projection Pursuit Algorithm for Exploratory Data Analysis. IEEE Transactions on Computers, 23: 9, 881-889, 1973.
98. Friedman N., Geiger D., and Goldszmidt M., Bayesian Network Classifiers. Machine Learning 29: 2-3, 131-163, 1997.
99. Fukunaga, K., Introduction to Statistical Pattern Recognition. San Diego, CA: Academic, 1990.
100. Furnkranz, J., More efficient windowing, In Proceeding of The 14th national Conference on Artificial Intelegence (AAAI-97), pp. 509-514, Providence, RI. AAAI Press, 1997
101. Gallinari, P., Modular Neural Net Systems, Training of. In (Ed) M.A. Arbib. The Handbook of Brain Theory and Neural Networks, Bradford Books/MIT Press, 1995.
102. Gama J., A Linear-Bayes Classifier. In C. Monard, editor, Advances on Artificial Intelligence -SBIA2000. LNAI 1952, pp 269-279, Springer Verlag, 2000
103. Gams, M., New Measurements Highlight the Importance of Redundant Knowl-edge. In European Working Session on Learning, Montpeiller, France, Pitman, 1989.
104. Gardner M., Bieker, J., Data mining solves tough semiconductor manufacturing problems. KDD 2000: pp. 376-383, 2000.
105. Gehrke J., Ganti V., Ramakrishnan R., Loh W., BOAT-Optimistic Decision Tree Construction. SIGMOD Conference 1999: pp. 169-180, 1999.
106. Gehrke J., Ramakrishnan R., Ganti V., RainForest -A Framework for Fast Decision Tree Construction of Large Datasets, Data Mining and Knowledge Discovery, 4 (23) 127-162, 2000.
107. Gelfand S. B., Ravishankar C. S., and Delp E. J., An iterative growing and pruning algorithm for classification tree design. IEEE Transaction on Pattern Analysis and Machine Intelligence, 13(2):163-174, 1991.
108. Geman S., Bienenstock, E., and Doursat, R., Neural networks and the bias/variance dilemma. Neural Computation, 4:1-58, 1995.
109. Gillo M. W., MAID: A Honeywell 600 program for an automatised survey analysis. Behavioral Science 17: 251-252, 1972.
110. Giraud-Carrier Ch., Vilalta R., Brazdil R., Introduction to the Special Issue of on Meta-Learning. Machine Learning, 54 (3), 197-194, 2004.
111. Gluck, M. and Corter, J. (1985). Information, uncertainty, and the utility of categories. Proceedings of the Seventh Annual Conference of the Cognitive Science Society (pp. 283-287). Irvine, California: Lawrence Erlbaum Associates.
112. Grossman R., Kasif S., Moore R., Rocke D., and Ullman J., Data mining research: Opportunities and challenges. Report of three NSF workshops on mining large, massive, and distributed data, 1999.
113. Grumbach S., Milo T., Towards Tractable Algebras for Bags. Journal of Computer and System Sciences 52(3): 570-588, 1996.
114. Guo Y. and Sutiwaraphun J., Knowledge probing in distributed data mining, in Proc. 4h Int. Conf. Knowledge Discovery Data Mining, pp 61-69, 1998.
115. Guha, S., Rastogi, R. and Shim, K. CURE: An efficient clustering algorithm for large databases. In Proceedings of ACM SIGMOD International Conference on Management of Data, pages 73-84, New York, 1998.
116. Han, J. and Kamber, M. Data Mining: Concepts and Techniques. Morgan Kauf-mann Publishers, 2001.
117. Hancock T. R., Jiang T., Li M., Tromp J., Lower Bounds on Learning Decision Lists and Trees. Information and Computation 126(2): 114-122, 1996.
118. Hand, D., Data Mining -reaching beyond statistics. Research in Official Stat. 1(2):5-17, 1998.
119. Hampshire, J. B., and Waibel, A. The meta-Pi network -building distributed knowledge representations for robust multisource pattern-recognition. Pattern Analyses and Machine Intelligence 14(7): 751-769, 1992.
120. Hansen J., Combining Predictors. Meta Machine Learning Methods and Bias/Variance & Ambiguity Decompositions. PhD dissertation. Aurhus University. 2000.
121. Hansen, L. K., and Salamon, P., Neural network ensembles. IEEE Transactions on Pattern Analysis and Machine Intelligence, 12(10), 993-1001, 1990.
122. Hartigan, J. A. Clustering algorithms. John Wiley and Sons., 1975.
123. Huang, Z., Extensions to the k-means algorithm for clustering large data sets with categorical values. Data Mining and Knowledge Discovery, 2(3), 1998
124. He D. W., Strege B., Tolle H., and Kusiak A., Decomposition in Automatic Generation of Petri Nets for Manufacturing System Control and Scheduling. International Journal of Production Research, 38(6): 1437-1457, 2000
125. Holmstrom, L., Koistinen, P., Laaksonen, J., and Oja, E., Neural and statistical classifiers -taxonomy and a case study. IEEE Trans, on Neural Networks, 8,: 5-17, 1997.
126. Holte R. C, Very simple classification rules perform well on most commonly used datasets. Machine Learning, 11:63-90, 1993
127. Holte, R. C; Acker, L. E.; and Porter, B. W., Concept learning and the problem of small disjuncts. In Proceedings of the 11th International Joint Conference on Artificial Intelligence, pp. 813-818, 1989
128. Hoppner F., Klawonn F., Kruse R., Runkler T., Fuzzy Cluster Analysis, Wiley, 2000.
129. Hrycej T., Modular Learning in Neural Networks. New York: Wiley, 1992.
130. Hu, X., Using Rough Sets Theory and Database Operations to Construct a Good Ensemble of Classifiers for Data Mining Applications. ICDM01. pp 233-240, 2001.
131. Hubert, L. and Arabie, P. (1985) Comparing partitions. Journal of Classification, 5. 193-218.
132. Hunter L., Klein T. E., Finding Relevant Biomolecular Features. ISMB 1993, pp. 190-197, 1993.
133. Hwang J., Lay S., and Lippman A., Nonparametric multivariate density estimation: A comparative study. IEEE Transaction on Signal Processing, 42(10): 2795-2810, 1994.
134. Hyafil L. and Rivest R.L., Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976
135. Jacobs, R. A., Jordan, M. I., Nowlan, S. J., and Hinton, G. E. Adaptive mixtures of local experts. Neural Computation 3(1):79-87, 1991.
136. Jain, A.K. Murty, M.N. and Flynn, P.J. Data Clustering: A Survey. ACM Computing Surveys, Vol. 31, No. 3, September 1999.
137. Jenkins R. and Yuhas, B. P. A simplified neural network solution through problem decomposition: The case of Truck backer-upper, IEEE Transactions on Neural Networks 4(4):718-722, 1993.
138. Jimenez, L. O., & Landgrebe D. A., Supervised Classification in High-Dimensional Space: Geometrical, Statistical, and Asymptotical Properties of Multivariate Data. IEEE Transaction on Systems Man, and Cybernetics -Part C: Applications and Reviews, 28:39-54, 1998.
139. Johansen T. A. and Foss B. A., A narmax model representation for adaptive control based on local model -Modeling. Identification and Control, 13(1):25-39, 1992.
140. John G. H., Robust linear discriminant trees. In D. Fisher and H. Lenz, editors, Learning From Data: Artificial Intelligence and Statistics V, Lecture Notes in Statistics, Chapter 36, pp. 375-385. Springer-Verlag, New York, 1996.
141. John G. H., Kohavi R., and Pfleger P., Irrelevant features and the subset selection problem. In Machine Learning: Proceedings of the Eleventh International Conference. Morgan Kaufmann, 1994.
142. John G. H., and Langley P., Estimating Continuous Distributions in Bayesian Classifiers. Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence, pp. 338-345. Morgan Kaufmann, San Mateo, 1995.
143. Jordan, M. I., and Jacobs, R. A., Hierarchical mixtures of experts and the EM algorithm. Neural Computation, 6, 181-214, 1994.
144. Jordan, M. I., and Jacobs, R. A. Hierarchies of adaptive experts. In Advances in Neural Information Processing Systems, J. E. Moody, S. J. Hanson, and R. P. Lippmann, Eds., vol. 4, Morgan Kaufmann Publishers, Inc., pp. 985-992, 1992.
145. Joshi, V. M., “On Evaluating Performance of Classifiers for Rare Classes”, Second IEEE Internationa] Conference on Data Mining, IEEE Computer Society Press, pp. 641-644, 2002
146. Kanal, L. N., “Patterns in Pattern Recognition: 1968-1974". IEEE Transactions on Information Theory IT-20, 6: 697-722, 1974
147. Kargupta, H. and Chan P., eds, Advances in Distributed and Parallel Knowledge Discovery, pp. 185-210, AAAI/MIT Press, 2000
148. Kaufman, L. and Rousseeuw, P.J., 1987, Clustering by Means of Medoids, In Y. Dodge, editor, Statistical Data Analysis, based on the LI Norm, pp. 405-416, Elsevier/North Holland, Amsterdam
149. Kaufmann, L. and Rousseeuw, P.J. Finding groups in data. New-York: Wiley, 1990.
150. Kass G. V., An exploratory technique for investigating large quantities of categorical data. Applied Statistics, 29(2): 119-127, 1980.
151. Kearns M. and Mansour Y., A fast, bottom-up decision tree pruning algorithm with near-optimal generalization, in J. Shavlik, ed., ‘Machine Learning: Proceedings of the Fifteenth International Conference’, Morgan Kaufmann Publishers, Inc., pp. 269-277, 1998.
152. Kearns M. and Mansour Y., On the boosting ability of top-down decision tree learning algorithms. Journal of Computer and Systems Sciences, 58(1): 109-128, 1999.
153. Kenney, J. F. and Keeping, E. S. “Moment-Generating and Characteristic Functions, " “Some Examples of Moment-Generating Functions, " and “Uniqueness Theorem for Characteristic Functions.” 4.6-4.8 in Mathematics of Statistics, Pt. 2, 2nd ed. Princeton, NJ: Van Nostrand, pp. 72-77, 1951.
154. Kerber, R., 1992, ChiMerge: Descretization of numeric attributes, in AAAI-92, Proceedings Ninth National Conference on Artificial Intelligence, pp. 123-128, AAAI Press/MIT Press.
155. Kim J.O. h Mueller C.W., Factor Analysis: Statistical Methods and Practical Issues Sage Publications, 1978.
156. Kim, D.J., Park, Y.W. and Park,. A novel validity index for determination of the optimal number of clusters. IEICE Trans. Inf., Vol. E84-D, no.2 (2001), 281-285.
157. King, B. Step-wise Clustering Procedures, J. Am. Stat. Assoc. 69, pp. 86-101, 1967.
158. Klosgen W. and Zytkow J. M., “KDD: The Purpose, Necessity and Chalanges”, Klosgen W. and Zytkow J. M. (Eds), Handbook of Data Mining and Knowledge Discovery, pp. 1-9. Oxford University Press, 2002.
159. Kohavi, R., Bottom-up induction of oblivious read-once decision graphs, in F. Bergadano and L. De Raedt, editors, Proc. European Conference on Machine Learning, pp. 154-169, Springer-Verlag, 1994.
160. Kohavi R., Scaling up the accuracy of naive-bayes classifiers: a decision-tree hybrid. In Proceedings of the Second International Conference on Knowledge Discovery and Data Mining, pages 114-119, 1996.
161. Kohavi R., Becker B., and Sommerfield D., Improving simple Bayes. In Proceedings of the European Conference on Machine Learning, 1997.
162. Kohavi R. and John G., The Wrapper Approach, In Feature Extraction, Construction and Selection: A Data Mining Perspective, H. Liu and H. Motoda (eds), Kluwer Academic Publishers, 1998.
163. Kohavi R., and Provost F., Glossary of Terms. Machine Learning 30(23): 271-274, 1998.
164. Kohavi R. and Quinlan J. R., Decision-tree discovery. In Klosgen W. and Zytkow J. M., editors, Handbook of Data Mining and Knowledge Discovery, chapter 16.1.3, pages 267-276. Oxford University Press, 2002.
165. Kohavi R. and Sommerfield D., Targeting business users with decision table classifiers, in R. Agrawal, P. Stolorz & G. Piatetsky-Shapiro, eds, ‘Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining’, AAAI Press, pp. 249-253, 1998.
166. Kohavi R. and Wolpert, D. H., Bias Plus Variance Decomposition for Zero-One Loss Functions, Machine Learning: Proceedings of the 13th International Conference. Morgan Kaufman, 1996.
167. Kolen, J. F., and Pollack, J. B., Back propagation is sesitive to initial conditions. In Advances in Neural Information Processing Systems, Vol. 3, pp. 860-867 San Francisco, CA. Morgan Kaufmann, 1991.
168. Kononenko, I., Comparison of inductive and Naive Bayes learning approaches to automatic knowledge acquisition. In B. Wielinga (Ed), Current Trends in Knowledge Acquisition, Amsterdam, The Netherlands IOS Press, 1990.
169. Kononenko, I., SemiNaive Bayes classifier, Proceedings of the Sixth European Working Session on Learning, pp. 206-219, Porto, Portugal: SpringerVerlag, 1991.
170. Krogh, A., and Vedelsby, J., Neural network ensembles, cross validation and active learning. In Advances in Neural Information Processing Systems 7, pp. 231-238 1995.
171. Kuhn H. W., The Hungarian method for the assignment problem. Naval Research Logistics Quarterly, 2:83-97, 1955
172. Kuncheva, L., & Whitaker, C, Measures of diversity in classifier ensembles and their relationship with ensemble accuracy. Machine Learning, pp. 181-207, 2003.
173. Kusiak, A., Decomposition in Data Mining: An Industrial Case Study, IEEE Transactions on Electronics Packaging Manufacturing, Vol. 23, No. 4, pp. 345-353, 2000.
174. Kusiak, A., Rough Set Theory: A Data Mining Tool for Semiconductor Manufacturing, IEEE Transactions on Electronics Packaging Manufacturing, 24(1): 44-50, 2001.
175. Kusiak, A., 2001, Feature Transformation Methods in Data Mining, IEEE Transactions on Elctronics Packaging Manufacturing, Vol. 24, No. 3, pp. 214-221, 2001B.
176. Kusiak A., Kurasek C, Data Mining of Printed-Circuit Board Defects, IEEE Transactions on Robotics and Automation, 17(2): 191-196, 2001
177. Kusiak, E. Szczerbicki, and K. Park, A Novel Approach to Decomposition of Design Specifications and Search for Solutions, International Journal of Production Research, 29(7): 1391-1406, 1991
178. Langley, P., Selection of relevant features in machine learning, in Proceedings of the AAAI Fall Symposium on Relevance, pp. 140-144, AAAI Press, 1994
179. Langley, P. and Sage, S., Oblivious decision trees and abstract cases, in Working Notes of the AAAI-94 Workshop on Case-Based Reasoning, pp. 113-117, Seattle, WA: AAAI Press, 1994
180. Langley, P. and Sage, S., Induction of selective Bayesian classifiers, in Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence, pp. 399-406. Seattle, WA: Morgan Kaufmann, 1994
181. Larsen, B. and Aone, C. 1999. Fast and effective text mining using linear-time document clustering. In Proceedings of the 5th ACM SIGKDD, 16-22, San Diego, CA.
182. Last, M., Maimon, O. and Minkov, E., Improving Stability of Decision Trees, International Journal of Pattern Recognition and Artificial Intelligence, 16: 2, 145-159, 2002.
183. Last M., Kandel A., Data Mining for Process and Quality Control in the Semiconductor Industry, in Data Mining for Design and Manufacturing: Methods and Applications, D. Braha (ed), Kluwer Academic Publishers, pp. 207-234, 2001.
184. Lewis D., and Catlett J., Heterogeneous uncertainty sampling for supervised learning. In Machine Learning: Proceedings of the Eleventh Annual Conference, pp. 148-156, New Brunswick, New Jersey, Morgan Kaufmann, 1994.
185. Lewis, D., and Gale, W., Training text classifiers by uncertainty sampling, In seventeenth annual international ACM SIGIR conference on research and development in information retrieval, pp. 3-12, 1994.
186. Li X. and Dubes R. C, Tree classifier design with a Permutation statistic. Pattern Recognition 19:229-235, 1986.
187. Liao Y., and Moody J., Constructing Heterogeneous Committees via Input Feature Grouping, in Advances in Neural Information Processing Systems, Vol.12, S.A. Solla, T.K. Leen and K.-R. Muller (eds), MIT Press, 2000.
188. Lim X., Loh W.Y., and Shih X., A comparison of prediction accuracy, complexity, and training time of thirty-three old and new classification algorithms. Machine Learning 40:203-228, 2000.
189. Lin Y. K. and Fu K., Automatic classification of cervical cells using a binary tree classifier. Pattern Recognition, 16(1):69-80, 1983.
190. Liu H. & Motoda H., Feature Selection for Knowledge Discovery and Data Mining, Kluwer Academic Publishers, 1998.
191. Loh W.Y., and Shih X., Split selection methods for classification trees. Statistica Sinica, 7: 815-840, 1997.
192. Loh W.Y. and Shih X., Families of splitting criteria for classification trees. Statistics and Computing 9:309-315, 1999.
193. Loh W.Y. and Vanichsetakul N., Tree-structured classification via generalized discriminant Analysis. Journal of the American Statistical Association, 83:715-728, 1988.
194. Long C, Bi-Decomposition of Function Sets Using Multi-Valued Logic, Eng.Doc. Dissertation, Technischen Universität Bergakademie Freiberg 2003
195. Lopez de Mantras R., A distance-based attribute selection measure for decision tree induction, Machine Learning 6:81-92, 1991
196. Lu B.L., Ito M., Task Decomposition and Module Combination Based on Class Relations: A Modular Neural Network for Pattern Classification, IEEE Trans, on Neural Networks, 10(5):1244-1256, 1999
197. Lu H., Setiono R., and Liu H., Effective Data Mining Using Neural Networks. IEEE Transactions on Knowledge and Data Engineering, 8 (6): 957-961, 1996.
198. Luba, T., Decomposition of multiple-valued functions, in Intl. Symposium on Multiple-Valued Logic’, Bloomigton, Indiana, pp. 256-261, 1995.
199. Lubinsky D., Algorithmic speedups in growing classification trees by using an additive split criterion. Proc. AI&Statistics93, pp. 435-444, 1993.
200. Maimon O. and Last M., Knowledge Discovery and Data Mining: The Info-Fuzzy network (IFN) methodology Kluwer Academic Publishers, 2000.
201. Maimon O., and Rokach, L. Data Mining by Attribute Decomposition with semiconductors manufacturing case study, in Data Mining for Design and Manufacturing: Methods and Applications, D. Braha (ed), Kluwer Academic Publishers, pp. 311-336, 2001.
202. Maimon O. and Rokach L., “Improving supervised learning by feature decomposition”, Proceedings of the Second International Symposium on Foundations of Information and Knowledge Systems, Lecture Notes in Computer Science, Springer, pp. 178-196, 2002.
203. Maimon, O., Rokach, L. and Cohen, S., 2002, Comparing Classification Models Using Expert Knowledge, Proceeding of the 6th World Multiconference on Systemics, Cybernetics and Informatics (SCI 2002).
204. Mansour, Y. and McAllester, D., Generalization Bounds for Decision Trees, in Proceedings of the 13th Annual Conference on Computer Learning Theory, pp. 69-80, San Francisco, Morgan Kaufmann, 2000.
205. Marcotorchino, J.F. and Michaud, P. Optimisation en Analyse Ordinale des Donns. Masson, Paris.
206. Margineantu D. and Dietterich T., Pruning adaptive boosting. In Proc. Fourteenth Intl. Conf. Machine Learning, pages 211-218, 1997.
207. Martin J. K., An exact probability metric for decision tree splitting and stopping. An Exact Probability Metric for Decision Tree Splitting and Stopping, Ma-chine Learning, 28 (2-3):257-291, 1997.
208. Mehta M., Rissanen J., Agrawal R., MDL-Based Decision Tree Pruning. KDD 1995: pp. 216-221, 1995.
209. Mehta M., Agrawal R. and Rissanen J., SLIQ: A fast scalable classifier for data mining: In Proc. If the fifth Int’l Conference on Extending Database Technology (EDBT), Avignon, France, March 1996.
210. Meretakis, D. and Wthrich, B., Extending Nave Bayes Classifiers Using Long Itemsets, in Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, pp. 165-174, San Diego, USA, 1999.
211. Merz, C. J. and Murphy. P.M., UCI Repository of machine learning databases. Irvine, CA: University of California, Department of Information and Computer Science, 1998.
212. Michalski R. S., A theory and methodology of inductive learning. Artificial Intelligence, 20:111-161, 1983.
213. Michalski R. S., Understanding the nature of learning: issues and research directions, in R. Michalski, J. Carbonnel and T. Mitchell, eds, Machine Learning: An Artificial Intelligence Approach, Kaufmann, Paolo Alto, CA, pp. 3-25, 1986.
214. Michalski R. S., and Tecuci G.. Machine Learning, A Multistrategy Approach, Vol. J. Morgan Kaufmann, 1994
215. Michie, D., Problem decomposition and the learning of skills, in Proceedings of the European Conference on Machine Learning, pp. 17-31, Springer-Verlag, 1995.
216. Michie D., Spiegelhalter D.J., Taylor C.C, Machine Learning, Neural and Statistical Classification, Prentice Hall, 1994.
217. Mingers J., An empirical comparison of pruning methods for decision tree induction. Machine Learning, 4(2):227-243, 1989.
218. Minsky M., Logical vs. Analogical or Symbolic vs. Connectionist or Neat vs. Scruffy, in Artificial Intelligence at MIT., Expanding Frontiers, Patrick H. Winston (Ed), Vol 1, MIT Press, 1990. Reprinted in AI Magazine, 1991.
219. Mishra, S. K. and Raghavan, V. V., An empirical study of the performance of heuristic methods for clustering. In Pattern Recognition in Practice, E. S. Gelsema and L. N. Kanal, Eds. 425436, 1994.
220. Mitchell, T., Machine Learning, McGraw-Hill, 1997.
221. Mitchell, T., The need for biases in learning generalizations. Technical Report CBM-TR-117, Rutgers University, Department of Computer Science, New Brunswick, NJ, 1980.
222. Moody, J. and Darken, C, Fast learning in networks of locally tuned units. Neural Computations, 1(2):281-294, 1989.
223. Morgan J. N. and Messenger R. C, THAID: a sequential search program for the analysis of nominal scale dependent variables. Technical report, Institute for Social Research, Univ. of Michigan, Ann Arbor, MI, 1973.
224. Muller W., and Wysotzki F., Automatic construction of decision trees for classification. Annals of Operations Research, 52:231-247, 1994.
225. Murtagh, F. A survey of recent advances in hierarchical clustering algorithms which use cluster centers. Comput. J. 26 354-359, 1984.
226. Murthy S. K., Automatic Construction of Decision Trees from Data: A Multi-Disciplinary Survey. Data Mining and Knowledge Discovery, 2(4):345-389, 1998.
227. Murthy S. K., Kasif S., and Salzberg S.. A system for induction of oblique decision trees. Journal of Artificial Intelligence Research, 2:1-33, August 1994.
228. Naumov G.E., NP-completeness of problems of construction of optimal decision trees. Soviet Physics: Doklady, 36(4):270-271, 1991.
229. Neal R., Probabilistic inference using Markov Chain Monte Carlo methods. Tech. Rep. CRG-TR-93-1, Department of Computer Science, University of Toronto, Toronto, CA, 1993.
230. Ng, R. and Han, J. 1994. Very large data bases. In Proceedings of the 20th International Conference on Very Large Data Bases (VLDB94, Santiago, Chile, Sept), VLDB Endowment, Berkeley, CA, 144155.
231. Niblett T., Constructing decision trees in noisy domains. In Proceedings of the Second European Working Session on Learning, pages 67-78, 1987.
232. Niblett T. and Bratko I., Learning Decision Rules in Noisy Domains, Proc. Expert Systems 86, Cambridge: Cambridge University Press, 1986.
233. Nowlan S. J., and Hinton G. E. Evaluation of adaptive mixtures of competing experts. In Advances in Neural Information Processing Systems, R. P. Lipp-mann, J. E. Moody, and D. S. Touretzky, Eds., vol. 3, pp. 774-780, Morgan Kaufmann Publishers Inc., 1991.
234. Oates, T., Jensen D., 1998, Large Datasets Lead to Overly Complex Models: An Explanation and a Solution, KDD 1998, pp. 294-298.
235. Ohno-Machado, L., and Musen, M. A. Modular neural networks for medical prognosis: Quantifying the benefits of combining neural networks for survival prediction. Connection Science 9, 1 (1997), 71-86.
236. Opitz, D. and Maclin, R., Popular Ensemble Methods: An Empirical Study, Journal of Artificial Research, 11: 169-198, 1999.
237. Pagallo, G. and Huassler, D., Boolean feature discovery in empirical learning. Machine Learning, 5(1): 71-99, 1990.
238. Parmanto, B., Munro, P. W., and Doyle, H. R., Improving committee diagnosis with resampling techinques. In Touretzky, D. S., Mozer, M. C, and Hes-selmo, M. E. (Eds). Advances in Neural Information Processing Systems, Vol. 8, pp. 882-888 Cambridge, MA. MIT Press, 1996.
239. Pearl, J., Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. Morgan-Kaufmann, 1988.
240. Peng, F. and Jacobs R. A., and Tanner M. A., Bayesian Inference in Mixtures-of-Experts and Hierarchical Mixtures-of-Experts Models With an Application to Speech Recognition, Journal of the American Statistical Association, 1995.
241. Perkowski, M. A., A survey of literature on function decomposition, Technical report, GSRP Wright Laboratories, Ohio OH, 1995.
242. Perkowski, M.A., Luba, T., Grygiel, S., Kolsteren, M., Lisanke, R., Hiev, N., Burkey, P., Burns, M., Malvi, R., Stanley, C, Wang, Z., Wu, H., Yang, F., Zhou, S. and Zhang, J. S., Unified approach to functional decompositions of switching functions, Technical report, Warsaw University of Technology and Eindhoven University of Technology, 1995.
243. Perkowski, M., Jozwiak, L. and Mohamed, S., New approach to learning noisy Boolean functions, Proceedings of the Second International Conference on Computational Intelligence and Multimedia Applications, pp. 693-706, World Scientific, Australia, 1998.
244. Pfahringer, B., Controlling constructive induction in CiPF, In Bergadano, F. and De Raedt, L. (Eds), Proceedings of the seventh European Conference on Machine Learning, pp. 242-256, Springer-Verlag, 1994.
245. Pfahringer, B., Bensusan H., and Giraud-Carrier C, Tell Me Who Can Learn You and I Can Tell You Who You are: Landmarking Various Learning Algorithms, In Proc. of the Seventeenth International Conference on Machine Learning (ICML2000), pages 743-750, 2000.
246. Poggio T., Girosi, F., Networks for Approximation and Learning, Proc. 1EER, Vol 78(9): 1481-1496, Sept. 1990.
247. Pratt, L. Y., Mostow, J., and Kamm C. A., Direct Transfer of Learned Information Among Neural Networks, in: Proceedings of the Ninth National Conference on Artificial Intelligence, Anaheim, CA, 584-589, 1991.
248. Prodromidis, A. L., Stolfo, S. J. and Chan, P. K., Effective and efficient pruning of metaclassifiers in a distributed data mining system. Technical report CUCS-017-99, Columbia Univ., 1999.
249. Provost, F.J. and Kolluri, V., A Survey of Methods for Scaling Up Inductive Learning Algorithms, Proc. 3rd International Conference on Knowledge Discovery and Data Mining, 1997.
250. Provost, F., Jensen, D. and Oates, T., 1999, Efficient Progressive Sampling, In Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining, pp.23-32.
251. Quinlan, J.R. Learning efficient classification procedures and their application to chess endgames. R. Michalski, J. Carbonell, T. Mitchel. Machine learning: an AI approach. Los Altos, CA. Morgan Kaufman, 1983.
252. Quinlan, J.R., Induction of decision trees. Machine Learning 1, 81-106, 1986.
253. Quinlan, J.R., Simplifying decision trees. International Journal of Man-Machine Studies, 27, 221-234, 1987.
254. Quinlan, J.R., Decision Trees and Multivalued Attributes, J. Richards, ed., Machine Intelligence, V. 11, Oxford, England, Oxford Univ. Press, pp. 305-318, 1988.
255. Quinlan, J. R., Unknown attribute values in induction. In Segre, A. (Ed), Proceedings of the Sixth International Machine Learning Workshop Cornell, New York. Morgan Kaufmann, 1989.
256. Quinlan, J. R., Unknown attribute values in induction. In Segre, A. (Ed), Proceedings of the Sixth International Machine Learning Workshop Cornell, New York. Morgan Kaufmann, 1989.
257. Quinlan, J. R., C4.5: Programs for Machine Learning, Morgan Kaufmann, Los Altos, 1993.
258. Quinlan, J. R., Bagging, Boosting, and C4.5. In Proceedings of the Thirteenth National Conference on Artificial Intelligence, pages 725-730, 1996
259. Quinlan, J. R. and Rivest, R. L., Inferring Decision Trees Using The Minimum Description Length Principle. Information and Computation, 80:227-248, 1989.
260. Ragavan, H. and Rendell, L., Look ahead feature construction for learning hard concepts. In Proceedings of the Tenth International Machine Learning Conference: pp. 252-259, Morgan Kaufman, 1993.
261. Rahman, A. F. R., and Fairhurst, M. C. A new hybrid approach in combining multiple experts to recognize handwritten numerals. Pattern Recognition Letters, 18: 781-790, 1997.
262. Rastogi, R., and Shim, K., PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning, Data Mining and Knowledge Discovery, 4(4):315-344, 2000.
263. Ramamurti, V., and Ghosh, J., Structurally Adaptive Modular Networks for Non-Stationary Environments, IEEE Transactions on Neural Networks, 10 (1):152-160, 1999.
264. Rand, W. M., Objective criteria for the evaluation of clustering methods. Journal of the American Statistical Association, 66: 846-850, 1971.
265. Rao, R., Gordon, D., and Spears, W., For every generalization action, is there really an equal or opposite reaction? Analysis of conservation law. In Proc. of the Twelveth International Conference on Machine Learning, pp. 471-479. Morgan Kaufmann, 1995.
266. Ray, S., and Turi, R.H. Determination of Number of Clusters in K-Means Clustering and Application in Color Image Segmentation. Monash university, 1999.
267. R’enyi A., Probability Theory, North-Holland, Amsterdam, 1970
268. Buczak A. L. and Ziarko W., “Stages of The Discovery Process”, Klosgen W. and Zytkow J. M. (Eds), Handbook of Data Mining and Knowledge Discovery, pages 185-192. Oxford University Press, 2002.
269. Ridgeway, G., Madigan, D., Richardson, T. and O’Kane, J. (1998), “Interpretable Boosted Naive Bayes Classification”, Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining, pp 101-104.
270. Rissanen, J., Stochastic complexity and statistical inquiry. World Scientific, 1989.
271. Rokach L. and Maimon O., “Theory and Application of Attribute Decomposition”, Proceedings of the First IEEE International Conference on Data Mining, IEEE Computer Society Press, pp. 473-480, 2001
272. Ronco, E., Gollee, H., and Gawthrop, P. J., Modular neural network and self-decomposition. CSC Research Report CSC-96012, Centre for Systems and Control, University of Glasgow, 1996.
273. Rounds, E., A combined non-parametric approach to feature selection and binary decision tree design, Pattern Recognition 12, 313-317, 1980.
274. Rumelhart, D., G. Hinton and R. Williams, Learning internal representations through error propagation. In Parallel Distributed Processing: Explorations in the Microstructure of Cognition, Volume 1: Foundations, D. Rumelhart and J. McClelland (eds) Cambridge, MA: MIT Press., pp 2540, 1986.
275. Saaty, X., The analytic hierarchy process: A 1993 overview. Central European Journal for Operations Research and Economics, Vol. 2, No. 2, p. 119-137, 1993.
276. Safavin S. R. and Landgrebe, D., A survey of decision tree classifier methodology. IEEE Trans, on Systems, Man and Cybernetics, 21(3):660-674, 1991.
277. Salzberg. S. L., On Comparing Classifiers: Pitfalls to Avoid and a Recommended Approach. Data Mining and Knowledge Discovery, 1: 312-327, Kluwer Academic Publishers, Bosto, 1997.
278. Samuel, A., Some studies in machine learning using the game of checkers II: Recent progress. IBM J. Res. Develop., 11:601-617, 1967.
279. Schaffer, C, Selecting a classification method by cross-validation. Machine Learning 13(1):135-143, 1993.
280. Schaffer J., A Conservation Law for Generalization Performance. In Proceedings of the 11th International Conference on Machine Learning: pp. 259-265, 1993.
281. Schapire, R.E., The strength of week learnability. In Machine learning 5(2), 197-227, 1990.
282. Schmitt, M., On the complexity of computing and learning with multiplicative neural networks. Neural Computation 14: 2, 241-301, 2002.
283. Schlimmer, J. C., Efficiently inducing determinations: A complete and systematic search algorithm that uses optimal pruning. In Proceedings of the 1993 International Conference on Machine Learning: pp 284-290, San Mateo, CA, Morgan Kaufmann, 1993.
284. Seewald, A.K. and Fiirnkranz, J., Grading classifiers, Austrian research institute for Artificial intelligence, 2001.
285. Selim, S.Z., and Ismail, M.A. K-means-type algorithms: a generalized convergence theorem and characterization of local optimality. In IEEE transactions on pattern analysis and machine learning, vol. PAMI-6, no. 1, January, 1984.
286. Selim, S. Z. AND Al-Sultan, K. 1991. A simulated annealing algorithm for the clustering problem. Pattern Recogn. 24, 10 (1991), 10031008.
287. Selfridge, O. G. Pandemonium: a paradigm for learning. In Mechanization of Thought Processes: Proceedings of a Symposium Held at the National Physical Laboratory, November, 1958, 513-526. London: H.M.S.O., 1958.
288. Servedio, R., On Learning Monotone DNF under Product Distributions. Information and Computation 193, pp. 57-74, 2004.
289. Sethi, K., and Yoo, J. H., Design of multicategory, multifeature split decision trees using perceptron learning. Pattern Recognition, 27(7):939-947, 1994.
290. Shapiro, A. D. and Niblett, T., Automatic induction of classification rules for a chess endgame, in M. R. B. Clarke, ed., Advances in Computer Chess 3, Pergamon, Oxford, pp. 73-92, 1982.
291. Shapiro, A. D., Structured induction in expert systems, Turing Institute Press in association with Addison-Wesley Publishing Company, 1987.
292. Sharkey, A., On combining artificial neural nets, Connection Science, Vol. 8, pp.299-313, 1996.
293. Sharkey, A., Multi-Net Iystems, In Sharkey A. (Ed) Combining Artificial Neural Networks: Ensemble and Modular Multi-Net Systems, pp. 1-30, Springer-Verlag, 1999.
294. Shafer, J. C, Agrawal, R. and Mehta, M., SPRINT: A Scalable Parallel Clas-sifier for Data Mining, Proc. 22nd Int. Conf. Very Large Databases, T. M. Vijayaraman and Alejandro P. Buchmann and C. Mohan and Nandlal L. Sarda (eds), 544-555, Morgan Kaufmann, 1996
295. Shilen, S., Multiple binary tree classifiers. Pattern Recognition 23(7): 757-763, 1990.
296. Shilen, S., Nonparametric classification using matched binary decision trees. Pattern Recognition Letters 13: 83-87, 1992.
297. Sklansky, J. and Wassel, G. N., Pattern classifiers and trainable machines. SpringerVerlag, New York, 1981.
298. Sneath, P., and Sokal, R. Numerical Taxonomy. W.H. Freeman Co., San Francisco, CA, 1973.
299. Sohn S. Y., Choi, H., Ensemble based on Data Envelopment Analysis, ECML Meta Learning workshop, Sep. 4, 2001
300. Sonquist, J. A., Baker E. L., and Morgan, J. N., Searching for Structure. Institute for Social Research, Univ. of Michigan, Ann Arbor, MI, 1971
301. Spirtes, P., Glymour C, and Scheines, R., Causation, Prediction, and Search. Springer Verlag, 1993
302. Steuer R.E., Multiple Criteria Optimization: Theory, Computation and Application. John Wiley, New York, 1986
303. Strehl A. and Ghosh J., Clustering Guidance and Quality Evaluation Using Relationship-based Visualization, Proceedings of Intelligent Engineering Systems Through Artificial Neural Networks, 5-8 November 2000, St. Louis, Missouri, USA, pp 483-488.
304. Strehl, A., Ghosh, J., Mooney, R.: Impact of similarity measures on web-page clustering. In Proc. AAAI Workshop on AI for Web Search, pp 58-64, 2000
305. Tadepalli, P. and Russell, S., Learning from examples and membership queries with structured determinations. Machine Learning, 32(3), pp. 245-295, 1998.
306. Taylor P. C, and Silverman, B. W., Block diagrams and splitting criteria for classification trees. Statistics and Computing, 3(4):147-161, 1993.
307. Tibshirani, R., Walther, G. and Hastie, T. (2000). Estimating the number of clusters in a dataset via the gap statistic. Tech. Rep. 208, Dept. of Statistics, Stanford University.
308. Towell, G. Shavlik, J., Knowledge-based artificial neural networks, Artificial Intelligence, 70: 119-165, 1994.
309. Tresp, V. and Taniguchi, M. Combining estimators using non-constant weighting functions. In Tesauro, G., Touretzky, D., & Leen, T. (Eds), Advances in Neural Information Processing Systems, volume 7: pp. 419-426, The MIT Press, 1995.
310. Tsallis C, Possible Generalization of Boltzmann-Gibbs Statistics, J. Stat.Phys., 52, 479-487, 1988.
311. Turner, K. and Ghosh J., Error Correlation and Error Reduction in Ensemble Classifiers, Connection Science, Special issue on combining artificial neural networks: ensemble approaches, 8 (3-4): 385-404, 1996.
312. Turner, K., and Ghosh J., Linear and Order Statistics Combiners for Pattern Classification, in Combining Articial Neural Nets, A. Sharkey (Ed), pp. 127-162, Springer-Verlag, 1999.
313. Turner, K., and Ghosh J., Robust Order Statistics based Ensembles for Distributed Data Mining. In Kargupta, H. and Chan P., eds, Advances in Distributed and Parallel Knowledge Discovery, pp. 185-210, AAAI/MIT Press, 2000.
314. Tyron R. C. and Bailey D.E. Cluster Analysis. McGraw-Hill, 1970.
315. Urquhart, R. Graph-theoretical clustering, based on limited neighborhood sets. Pattern recognition, vol. 15, pp. 173-187, 1982.
316. Utgoff, P. E., Perceptron trees: A case study in hybrid concept representations. Connection Science, 1(4):377-391, 1989.
317. Utgoff, P. E., Incremental induction of decision trees. Machine Learning, 4:161-186, 1989.
318. Utgoff, P. E., Decision tree induction based on efficient tree restructuring. Machine Learning 29 (1):5-44, 1997.
319. Utgoff, P. E., and Clouse, J. A., A Kolmogorov-Smirnoff Metric for Decision Tree Induction, Technical Report 96-3, University of Massachusetts, Department of Computer Science, Amherst, MA, 1996.
320. Valiant, L. G. (1984). A theory of the learnable. Communications of the ACM 1984, pp. 1134-1142.
321. Van Rijsbergen, C. J., Information Retrieval. Butterworth, ISBN 0-408-70929-4, 1979.
322. Van Zant, P., Microchip fabrication: a practical guide to semiconductor processing, New York: McGraw-Hill, 1997.
323. Vapnik, V.N., The Nature of Statistical Learning Theory. Springer-Verlag, New York, 1995.
324. Veyssieres, M.P. and Plant, R.E. Identification of vegetation state-and-transition domains in California’s hardwood rangelands. University of California, 1998.
325. Wallace, C. S., MML Inference of Predictive Trees, Graphs and Nets. In A. Gam-merman (ed), Computational Learning and Probabilistic Reasoning, pp 43-66, Wiley, 1996.
326. Wallace, C. S., and Patrick J., Coding decision trees. Machine Learning 11: 7-22, 1993.
327. Wallace C. S. and Dowe D. L., Intrinsic classification by mml -the snob program. In Proceedings of the 7th Australian Joint Conference on Artificial Intelligence, pages 37-44, 1994.
328. Wan, W. and Perkowski, M. A., A new approach to the decomposition of incompletely specified functions based on graph-coloring and local transformations and its application to FPGAmapping, In Proc. of the IEEE EURO-DAC '92, pp. 230-235, 1992.
329. Wang, X. and Yu, Q. Estimate the number of clusters in web documents via gap statistic. May 2001.
330. Ward, J. H. Hierarchical grouping to optimize an objective function. Journal of the American Statistical Association, 58:236-244, 1963.
331. Weigend, A. S., Mangeas, M., and Srivastava, A. N. Nonlinear gated experts for time-series -discovering regimes and avoiding overfitting. International Journal of Neural Systems 6(5):373-399, 1995.
332. Wolpert, D.H., Stacked Generalization, Neural Networks, Vol. 5, pp. 241-259, Pergamon Press, 1992.
333. Wolpert, D. H., The relationship between PAC, the statistical physics framework, the Bayesian framework, and the VC framework. In D. H. Wolpert, editor, The Mathematics of Generalization, The SFI Studies in the Sciences of Complexity, pages 117-214. Addison Wesley, 1995.
334. Wolpert, D. H., “The lack of a priori distinctions between learning algorithms, " Neural Computation 8: 1341-1390, 1996.
335. Wyse, N., Dubes, R. and Jain, A.K., A critical evaluation of intrinsic dimensionality algorithms, Pattern Recognition in Practice, E.S. Gelsema and L.N. Kanal (eds), North-Holland, pp. 415-425, 1980.
336. Zahn, C. T., Graph-theoretical methods for detecting and describing gestalt clusters. IEEE trans. Comput. C-20 (Apr), 68-86, 1971.
337. Zaki, M. J., Ho C. T., and Agrawal, R., Scalable parallel classification for data mining on shared-memory multiprocessors, in Proc. IEEE Int. Conf. Data Eng., Sydney, Australia, WKDD99, pp. 198-205, 1999.
338. Zaki, M. J., Ho C. T., Eds., Large-Scale Parallel Data Mining. New York: Springer-Verlag, 2000.
339. Zantema, H., and Bodlaender H. L., Finding Small Equivalent Decision Trees is Hard, International Journal of Foundations of Computer Science, 11(2):343-354, 2000.
340. Zeira, G., Maimon, O., Last, M. and Rokach, L” Change detection in classification models of data mining, Data Mining in Time Series Databases. World Scientific Publishing, 2003.
341. Zenobi, G., and Cunningham, P. Using diversity in preparing ensembles of classifiers based on different feature subsets to minimize generalization error. In Proceedings of the European Conference on Machine Learning, 2001.
342. Zhou, Z. H., and Tang, W., Selective Ensemble of Decision Trees, in Guoyin Wang, Qing Liu, Yiyu Yao, Andrzej Skowron (Eds): Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, 9th International Conference, RSFDGrC, Chongqing, China, Proceedings. Lecture Notes in Computer Science 2639, pp.476-483, 2003.
343. Zhou, Z. H., Wu J., Tang W., Ensembling neural networks: many could be better than all. Artificial Intelligence 137: 239-263, 2002.
344. Zupan, B., Bohanec, M., Demsar J., and Bratko, I., Feature transformation by function decomposition, IEEE intelligent systems & their applications, 13: 38-43, 1998.
345. Zupan, B., Bratko, I., Bohanec, M. and Demsar, J., 2000, Induction of concept hierarchies from noisy data, in Proceedings of the Seventeenth International Conference on Machine Learning (ICML-2000), San Francisco, CA, pp. 1199-1206.