Data Mining

Data Mining

Volumn , Issue , 2011, Pages

  Witten, Ian H ^a   Frank, Eibe ^a   Hall, Mark A ^b  

^a UNIVERSITY OF WAIKATO   (New Zealand)

^b NONE

Author keywords

[No Author keywords available]

Indexed keywords

EID: 85014149758     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1016/C2009-0-19715-5     Document Type: Book

References (342)

1. Abe N., Zadrozny B., Langford J. Outlier detection by active learning. Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2006, 767-772. ACM Press, New York.
2. Adriaans P., Zantige D. Data mining 1996, Addison-Wesley, Harlow, England.
3. Agrawal R., Srikant R. Fast algorithms for mining association rules in large databases. Proceedings of the International Conference on Very Large Data Bases 1994, 478-499. Morgan Kaufmann, Santiago, Chile. San Francisco. J. Bocca, M. Jarke, C. Zaniolo (Eds.).
4. Agrawal R., Imielinski T., Swami A. Database mining: A performance perspective. IEEE Transactions on Knowledge and Data Engineering 1993, 5(6):914-925.
5. Agrawal R., Imielinski T., Swami A. Mining association rules between sets of items in large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data 1993, 207-216. ACM Press, Washington, DC. New York. P. Buneman, S. Jajodia (Eds.).
6. Aha D. Tolerating noisy, irrelevant, and novel attributes in instance-based learning algorithms. International Journal of Man-Machine Studies 1992, 36(2):267-287.
7. Almuallin H., Dietterich T.G. Learning with many irrelevant features. Proceedings of the Ninth National Conference on Artificial Intelligence 1991, 547-552. AAAI Press, Anaheim, CA. Menlo Park, CA.
8. Almuallin H., Dietterich T.G. Efficient algorithms for identifying relevant features. Proceedings of the Ninth Canadian Conference on Artificial Intelligence 1992, 38-45. Morgan Kaufmann, Vancouver, BC. San Francisco.
9. Andrews S., Tsochantaridis I., Hofmann T. Support vector machines for multiple-instance learning. Proceedings of the Conference on Neural Information Processing Systems 2003, 561-568. MIT Press, Vancouver, BC. Cambridge, MA.
10. Ankerst M., Breunig M.M., Kriegel H.-P., Sander J. OPTICS: Ordering points to identify the clustering structure. Proceedings of the ACM SIGMOD International Conference on Management of Data 1999, 49-60. ACM Press, New York.
11. Appelt D. An introduction to information extraction. Artificial Intelligence Communications 1999, 12(3):161-172.
12. Arthur D., Vassilvitskii S. K-means++: The advantages of careful seeding. Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms 2007, 1027-1035. Society for Industrial and Applied Mathematics, New Orleans. Philadelphia.
13. Asuncion A., Newman D.J. UCI Machine Learning Repository 2007, University of California, School of Information and Computer Science, Irvine. http://www.ics.uci.edu/~mlearn/MLRepository.html.
14. Asmis E. Epicurus' scientific method 1984, Cornell University Press, Ithaca, NY.
15. Atkeson C.G., Schaal S.A., Moore A.W. Locally weighted learning. AI Review 1997, 11:11-71.
16. Auer P., Ortner R. A boosting approach to multiple instance learning. Proceedings of the European Conference on Machine Learning 2004, 63-74. Springer-Verlag, Pisa, Italy. Berlin.
17. Barnett V., Lewis T. Outliers in Statistical Data 1994, John Wiley, & Sons, West Sussex, England.
18. Bay S.D. Nearest neighbor classification from multiple feature subsets. Intelligent Data Analysis 1999, 3(3):191-209.
19. Bay S.D., Schwabacher M. Near linear time detection of distance-based outliers and applications to security. Proceedings of the Workshop on Data Mining for Counter Terrorism and Security 2003, Society for Industrial and Applied Mathematics, San Francisco. Philadelphia.
20. Bayes T. An essay towards solving a problem in the doctrine of chances. Philosophical Transactions of the Royal Society of London 1763, 53:370-418.
21. Beck J.R., Schultz E.K. The use of ROC curves in test performance evaluation. Archives of Pathology and Laboratory Medicine 1986, 110:13-20.
22. Bergadano F., Gunetti D. Inductive logic programming: From machine learning to software engineering 1996, MIT Press, Cambridge, MA.
23. Berry M.J.A., Linoff G. Data mining techniques for marketing, sales, and customer support 1997, John Wiley, New York.
24. Beygelzimer A., Kakade S., Langford J. Cover trees for nearest neighbor. Proceedings of the 23rd International Conference on Machine Learning 2006, 97-104. ACM Press, New York.
25. Bifet A., Holmes G., Kirkby R., Pfahringer B. MOA: Massive online analysis. Journal of Machine Learning Research 2010, 9:1601-1604.
26. Bigus J.P. Data mining with neural networks 1996, McGraw-Hill, New York.
27. Bishop C.M. Neural networks for pattern recognition 1995, Oxford University Press, New York.
28. Bigus J.P. Pattern recognition and machine learning 2006, Springer-Verlag.
29. BLI (Bureau of Labour Information) Collective Bargaining Review (November) 1988, Labour Canada, Bureau of Labour Information, Ottawa.
30. Blockeel H., Page D., Srinivasan A. Multi-instance tree learning. Proceedings of the 22nd International Conference on Machine Learning 2005, 57-64. ACM Press, Bonn. New York.
31. Blum A., Mitchell T. Combining labeled and unlabeled data with co-training. Proceedings of the Eleventh Annual Conference on Computational Learning Theory 1998, 92-100. Morgan Kaufmann, Madison, WI. San Francisco.
32. Bouckaert R.R. Bayesian belief networks: From construction to inference 1995, Ph.D. Dissertation, Computer Science Department, University of Utrecht, The Netherlands.
33. Bouckaert, R.R. (2004). Bayesian network classifiers in Weka. Working Paper 14/2004, Department of Computer Science, University of Waikato, New Zealand.
34. Bouckaert R.R. DensiTree: Making sense of sets of phylogenetic trees. Bioinformatics 2010, 26(10):1372-1373.
35. Readings in knowledge representation 1985, Morgan Kaufmann, San Francisco. R.J. Brachman, H.J. Levesque (Eds.).
36. Brefeld U., Scheffer T. Co-EM support vector learning. Proceedings of the Twenty-First International Conference on Machine Learning 2004, 121-128. ACM Press, Banff, AB. New York. R. Greiner, D. Schuurmans (Eds.).
37. Breiman L. Stacked regression. Machine Learning 1996, 24(1):49-64.
38. Breiman L. Bagging predictors. Machine Learning 1996, 24(2):123-140.
39. Breiman, L. (1996c). [Bias, variance, and] arcing classifiers. Technical Report 460. Department of Statistics, University of California, Berkeley.
40. Breiman L. Pasting small votes for classification in large databases and online. Machine Learning 1999, 36(1-2):85-103.
41. Breiman L. Random forests. Machine Learning 2001, 45(1):5-32.
42. Breiman L., Friedman J.H., Olshen R.A., Stone C.J. Classification and regression trees 1984, Wadsworth, Monterey, CA.
43. Brin S., Motwani R., Ullman J.D., Tsur S. Dynamic itemset counting and implication rules for market basket data. ACM SIGMOD Record 1997, 26(2):255-264.
44. Brin S., Page L. The anatomy of a large-scale hypertext search engine. Computer Networks and ISDN Systems 1998, 33:107-117.
45. Brodley C.E., Friedl M.A. Identifying and eliminating mislabeled training instances. Proceedings of the Thirteenth National Conference on Artificial Intelligence 1996, 799-805. AAAI Press, Portland, OR. Menlo Park, CA.
46. Brownstown L., Farrell R., Kant E., Martin N. Programming expert systems in OPS5 1985, Addison-Wesley, Reading, MA.
47. Buntine W. Learning classification trees. Statistics and Computing 1992, 2(2):63-73.
48. Burges C.J.C. A tutorial on support vector machines for pattern recognition. Data Mining and Knowledge Discovery 1998, 2(2):121-167.
49. Cabena P., Hadjinian P., Stadler R., Verhees J., Zanasi A. Discovering data mining: From concept to implementation 1998, Prentice-Hall, Upper Saddle River, NJ.
50. Cardie C. Using decision trees to improve case-based learning. Proceedings of the Tenth International Conference on Machine Learning 1993, 25-32. Morgan Kaufmann, Amherst, MA. San Francisco. P. Utgoff (Ed.).
51. Califf M.E., Mooney R.J. Relational learning of pattern-match rules for information extraction. Proceedings of the Sixteenth National Conference on Artificial Intelligence 1999, 328-334. AAAI Press, Orlando. Menlo Park, CA.
52. Cavnar W.B., Trenkle J.M. N-Gram-based text categorization. Proceedings of the Third Symposium on Document Analysis and Information Retrieval 1994, 161-175. UNLV Publications/Reprographics, Las Vegas.
53. Ceglar A., Roddick J.F. Association mining. ACM Computing Surveys 2006, 38(2). New York: ACM Press.
54. Cendrowska J. PRISM: An algorithm for inducing modular rules. International Journal of Man-Machine Studies 1987, 27(4):349-370.
55. Chakrabarti S. Mining the web: discovering knowledge from hypertext data 2003, Morgan Kaufmann, San Francisco.
56. Chang C.-C., Lin C.-J. LIBSVM: A library for support vector machines Software available at. http://www.csie.ntu.edu.tw/~cjlin/libsvm.
57. Chawla N.V., Bowyer K.W., Hall L.O., Kegelmeyer W.P. SMOTE: Synthetic minority over-sampling technique. Journal of Artificial Intelligence 2002, 16:321-357.
58. Cheeseman P., Stutz J. Bayesian classification (AutoClass): Theory and results. Advances in Knowledge Discovery and Data Mining 1995, 153-180. AAAI Press, Menlo Park, CA. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (Eds.).
59. Chen M.S., Jan J., Yu P.S. Data mining: An overview from a database perspective. IEEE Transactions on Knowledge and Data Engineering 1996, 8(6):866-883.
60. Chen Y., Bi J., Wang J.Z. MILES: Multiple-instance learning via embedded instance selection. IEEE Transactions on Pattern Analysis and Machine Intelligence 2006, 28(12):1931-1947.
61. Cherkauer K.J., Shavlik J.W. Growing simpler decision trees to facilitate knowledge discovery. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining 1996, 315-318. AAAI Press, Portland, OR. Menlo Park, CA. E. Simoudis, J.W. Han, U. Fayyad (Eds.).
62. Chevaleyre Y., Zucker J.-D. Solving multiple-instance and multiple-part learning problems with decision trees and rule sets: Application to the mutagenesis problem. Proceedings of the Biennial Conference of the Canadian Society for Computational Studies of Intelligence 2001, 204-214. Springer-Verlag, Ottawa. Berlin.
63. Cleary J.G., Trigg L.E. K*: An instance-based learner using an entropic distance measure. Proceedings of the Twelfth International Conference on Machine Learning 1995, 108-114. Morgan Kaufmann, Tahoe City, CA. San Francisco. A. Prieditis, S. Russell (Eds.).
64. Cohen J. A coefficient of agreement for nominal scales. Educational and Psychological Measurement 1960, 20:37-46.
65. Cohen W.W. Fast effective rule induction. Proceedings of the Twelfth International Conference on Machine Learning 1995, 115-123. Morgan Kaufmann, Tahoe City, CA. San Francisco. A. Prieditis, S. Russell (Eds.).
66. Cooper G.F., Herskovits E. A Bayesian method for the induction of probabilistic networks from data. Machine Learning 1992, 9(4):309-347.
67. Cortes C., Vapnik V. Support vector networks. Machine Learning 1995, 20(3):273-297.
68. Cover T.M., Hart P.E. Nearest neighbor pattern classification. IEEE Transactions on Information Theory 1967, IT-13:21-27.
69. Cristianini N., Shawe-Taylor J. An introduction to support vector machines and other kernel-based learning methods 2000, Cambridge University Press, Cambridge, UK.
70. Cypher A. Watch what I do: Programming by demonstration 1993, MIT Press, Cambridge, MA.
71. Dasgupta S. Performance guarantees for hierarchical clustering. Proceedings of the Fifteenth Annual Conference on Computational Learning Theory 2002, 351-363. Springer-Verlag, Sydney. Berlin. J. Kivinen, R.H. Sloan (Eds.).
72. Dasu, T., Koutsofios, E. & Wright, J. (2006). Zen and the art of data mining. In Proceedings of the KDD Workshop on Data Mining for Business Applications (pp. 37-43). Philadelphia. Proceedings at: . http://labs.accenture.com/kdd2006_workshop/dmba_proceedings.pdf.
73. Datta S., Kargupta H., Sivakumar K. Homeland defense, privacy-sensitive data mining, and random value distortion. Proceedings of the Workshop on Data Mining for Counter Terrorism and Security 2003, Society for International and Applied Mathematics, San Francisco. Philadelphia.
74. Day W.H.E., Edelsbrünner H. Efficient algorithms for agglomerative hierarchical clustering methods. Journal of Classification 1984, 1(1):7-24.
75. Demiroz G., Guvenir A. Classification by voting feature intervals. Proceedings of the Ninth European Conference on Machine Learning 1997, 85-92. Springer-Verlag, Prague. Berlin. M. van Someren, G. Widmer (Eds.).
76. de Raedt L. Logical and relational learning 2008, Springer-Verlag, New York.
77. Devroye L., Györfi L., Lugosi G. A probabilistic theory of pattern recognition 1996, Springer-Verlag, New York.
78. Dhar V., Stein R. Seven methods for transforming corporate data into business intelligence 1997, Prentice-Hall, Upper Saddle River, NJ.
79. Diederich J., Kindermann J., Leopold E., Paass G. Authorship attribution with support vector machines. Applied Intelligence 2003, 19(1):109-123.
80. Dietterich T.G. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning 2000, 40(2):139-158.
81. Dietterich T.G., Bakiri G. Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research 1995, 2:263-286.
82. Dietterich T.G., Kong E.B. Error-correcting output coding corrects bias and variance. Proceedings of the Twelfth International Conference on Machine Learning 1995, 313-321. Morgan Kaufmann, Tahoe City, CA. San Francisco.
83. Dietterich T.G., Lathrop R.H., Lozano-Perez T. Solving the multiple-instance problem with axis-parallel rectangles. Artificial Intelligence Journal 1997, 89(1-2):31-71.
84. Domingos P. Knowledge acquisition from examples via multiple models. Proceedings of the Fourteenth International Conference on Machine Learning 1997, 98-106. Morgan Kaufmann, Nashville. San Francisco. D.H. Fisher (Ed.).
85. Domingos P. MetaCost: A general method for making classifiers cost-sensitive. Proceedings of the Fifth International Conference on Knowledge Discovery and Data Mining 1999, 155-164. ACM Press, San Diego. New York. U.M. Fayyad, S. Chaudhuri, D. Madigan (Eds.).
86. Domingos P., Hulten G. Mining high-speed data streams. International Conference on Knowledge Discovery and Data Mining 2000, 71-80. ACM Press, Boston. New York.
87. Dong L., Frank E., Kramer S. Ensembles of balanced nested dichotomies for multi-class problems. Proceedings of the Ninth European Conference on Principles and Practice of Knowledge Discovery in Databases 2005, 84-95. Berlin: Springer-Verlag, Porto, Portugal.
88. Dougherty J., Kohavi R., Sahami M. Supervised and unsupervised discretization of continuous features. Proceedings of the Twelfth International Conference on Machine Learning 1995, 194-202. Morgan Kaufmann, Tahoe City, CA. San Francisco. A. Prieditis, S. Russell (Eds.).
89. Drucker H. Improving regressors using boosting techniques. Proceedings of the Fourteenth International Conference on Machine Learning 1997, 107-115. Morgan Kaufmann, Nashville. San Francisco. D.H. Fisher (Ed.).
90. Drummond C., Holte R.C. Explicitly representing expected cost: An alternative to ROC representation. Proceedings of the Sixth International Conference on Knowledge Discovery and Data Mining 2000, 198-207. ACM Press, Boston. New York. R. Ramakrishnan, S. Stolfo, R. Bayardo, I. Parsa (Eds.).
91. Duda R.O., Hart P.E. Pattern classification and scene analysis 1973, John Wiley, New York.
92. Duda R.O., Hart P.E., Stork D.G. Pattern Classification 2001, John Wiley, New York. 2nd ed.
93. Dumais S.T., Platt J., Heckerman D., Sahami M. Inductive learning algorithms and representations for text categorization. Proceedings of the ACM Seventh International Conference on Information and Knowledge Management 1998, 148-155. ACM Press, Bethesda, MD. New York.
94. Efron B., Tibshirani R. An introduction to the bootstrap 1993, Chapman and Hall, London.
95. Egan J.P. Signal detection theory and ROC analysis. Series in Cognition and Perception 1975, Academic Press, New York.
96. Ester M., Kriegel H.-P., Sander J., Xu X. A density-based algorithm for discovering clusters in large spatial databases with noise. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining (KDD-96) 1996, 226-231. AAAI Press, Menlo Park, CA.
97. Fan R.-E., Chang K.-W., Hsieh C.-J., Wang X.-R., Lin C.-J. LIBLINEAR: A library for large linear classification. Journal of Machine Learning Research 2008, 9:1871-1874.
98. Fayyad U.M., Irani K.B. Multi-interval discretization of continuous-valued attributes for classification learning. Proceedings of the Thirteenth International Joint Conference on Artificial Intelligence 1993, 1022-1027. Morgan Kaufmann, Chambery, France. San Francisco.
99. Fayyad U.M., Smyth P. From massive datasets to science catalogs: Applications and challenges. Proceedings of the Workshop on Massive Datasets 1995, 129-141. NRC, Committee on Applied and Theoretical Statistics, Washington, DC.
100. Advances in knowledge discovery and data mining 1996, AAAI Press/MIT Press, Menlo Park, CA. U.M. Fayyad, G. Piatetsky-Shapiro, P. Smyth, R. Uthurusamy (Eds.).
101. Fisher D. Knowledge acquisition via incremental conceptual clustering. Machine Learning 1987, 2(2):139-172.
102. Fisher R.A. The use of multiple measurements in taxonomic problems. Annual Eugenics 1936, 7(part II):179-188. Reprinted in Contributions to Mathematical Statistics, 1950. New York: John Wiley.
103. Fix, E., & Hodges, J. L. Jr. (1951). Discriminatory analysis; non-parametric discrimination: Consistency properties. Technical Report 21-49-004(4), USAF School of Aviation Medicine, Randolph Field, TX.
104. Flach P.A., Lachiche N. Confirmation-guided discovery of first-order rules with Tertius. Machine Learning 1999, 42:61-95.
105. Fletcher R. Practical methods of optimization 1987, John Wiley, New York. 2nd ed.
106. Foulds J., Frank E. Revisiting multiple-instance learning via embedded instance selection. Proceedings of the Australasian Joint Conference on Artificial Intelligence 2008, 300-310. Springer-Verlag, Auckland. Berlin.
107. Foulds J., Frank E. A review of multi-instance learning assumptions. Knowledge Engineering Review 2010, 25(1):1-25.
108. Fradkin D., Madigan D. Experiments with random projections for machine learning. Proceedings of the Ninth International Conference on Knowledge Discovery and Data Mining 2003, 517-522. ACM Press, Washington, DC. New York. L. Getoor, T.E. Senator, P. Domingos, C. Faloutsos (Eds.).
109. Frank E. Pruning decision trees and lists 2000, Ph.D. Dissertation, Department of Computer Science, University of Waikato, New Zealand.
110. Frank E., Hall M. A simple approach to ordinal classification. Proceedings of the Twelfth European Conference on Machine Learning 2001, 145-156. Springer-Verlag, Freiburg, Germany. Berlin. L. de Raedt, P.A. Flach (Eds.).
111. Frank E., Hall M., Pfahringer B. Locally weighted Naïve Bayes. Proceedings of the Nineteenth Conference on Uncertainty in Artificial Intelligence 2003, 249-256. Morgan Kaufmann, Acapulco. San Francisco. U. Kjærulff, C. Meek (Eds.).
112. Frank E., Holmes G., Kirkby R., Hall M. Racing Committees for Large Datasets. Proceedings of the Fifth International Conference on Discovery Science 2002, 153-164. Springer-Verlag, Lübeck, Germany. Berlin. S. Lange, K. Satoh, C.H. Smith (Eds.).
113. Frank E., Kramer S. Ensembles of nested dichotomies for multi-class problems. Proceedings of the Twenty-First International Conference on Machine Learning 2004, 305-312. ACM Press, Banff, AB. New York.
114. Frank E., Paynter G.W., Witten I.H., Gutwin C., Nevill-Manning C.G. Domain-specific key phrase extraction. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence 1999, 668-673. Morgan Kaufmann, Stockholm. San Francisco.
115. Frank E., Wang Y., Inglis S., Holmes G., Witten I.H. Using model trees for classification. Machine Learning 1998, 32(1):63-76.
116. Frank E., Witten I.H. Generating accurate rule sets without global optimization. Proceedings of the Fifteenth International Conference on Machine Learning 1998, 144-151. Morgan Kaufmann, Madison, WI. San Francisco. J. Shavlik (Ed.).
117. Frank E., Witten I.H. Making better use of global discretization. Proceedings of the Sixteenth International Conference on Machine Learning 1999, 115-123. Morgan Kaufmann, Bled, Slovenia. San Francisco. I. Bratko, S. Dzeroski (Eds.).
118. Frank, E., & Xu, X. (2003). Applying propositional learning algorithms to multi-instance data. Technical Report 06/03, Department of Computer Science, University of Waikato, New Zealand.
119. Freitag D. Machine learning for information extraction in informal domains. Machine Learning 2002, 39(2/3):169-202.
120. Freund Y., Mason L. The alternating decision tree learning algorithm. Proceedings of the Sixteenth International Conference on Machine Learning 1999, 124-133. Morgan Kaufmann, Bled, Slovenia. San Francisco. I. Bratko, S. Dzeroski (Eds.).
121. Freund Y., Schapire R.E. Experiments with a new boosting algorithm. Proceedings of the Thirteenth International Conference on Machine Learning 1996, 148-156. Morgan Kaufmann, Bari, Italy. San Francisco. L. Saitta (Ed.).
122. Freund Y., Schapire R.E. Large margin classification using the perceptron algorithm. Machine Learning 1999, 37(3):277-296.
123. Friedman, J. H. (1996). Another approach to polychotomous classification. Technical report, Department of Statistics, Stanford University, Stanford, CA.
124. Friedman J.H. Greedy function approximation: A gradient boosting machine. Annals of Statistics 2001, 29(5):1189-1232.
125. Friedman J.H., Bentley J.L., Finkel R.A. An algorithm for finding best matches in logarithmic expected time. ACM Transactions on Mathematical Software 1977, 3(3):209-266.
126. Friedman J.H., Hastie T., Tibshirani R. Additive logistic regression: A statistical view of boosting. Annals of Statistics 2000, 28(2):337-374.
127. Friedman N., Geiger D., Goldszmidt M. Bayesian Network Classifiers. Machine Learning 1997, 29(2):131-163.
128. Fulton T., Kasif S., Salzberg S. Efficient algorithms for finding multiway splits for decision trees. Proceedings of the Twelfth International Conference on Machine Learning 1995, 244-251. Morgan Kaufmann, Tahoe City, CA. San Francisco. A. Prieditis, S. Russell (Eds.).
129. Fürnkranz J. Round robin classification. Journal of Machine Learning Research 2002, 2:721-747.
130. Fürnkranz J. Round robin ensembles. Intelligent Data Analysis 2003, 7(5):385-403.
131. Fürnkranz J., Flach P.A. ROC 'n' rule learning: Towards a better understanding of covering algorithms. Machine Learning 2005, 58(1):39-77.
132. Fürnkranz J., Widmer G. Incremental reduced-error pruning. Proceedings of the Eleventh International Conference on Machine Learning 1994, 70-77. Morgan Kaufmann, New Brunswick, NJ. San Francisco. H. Hirsh, W. Cohen (Eds.).
133. Gaines B.R., Compton P. Induction of ripple-down rules applied to modeling large data bases. Journal of Intelligent Information Systems 1995, 5(3):211-228.
134. Gama J. Functional trees. Machine Learning 2004, 55(3):219-250.
135. Gärtner T., Flach P.A., Kowalczyk A., Smola A.J. Multi-instance kernels. Proceedings of the International Conference on Machine Learning 2002, 179-186. Morgan Kaufmann, Sydney. San Francisco.
136. Genkin A., Lewis D.D., Madigan D. Large-scale Bayesian logistic regression for text categorization. Technometrics 2007, 49(3):291-304.
137. Gennari J.H., Langley P., Fisher D. Models of incremental concept formation. Artificial Intelligence 1990, 40:11-61.
138. Ghani R. Combining labeled and unlabeled data for multiclass text categorization. Proceedings of the Nineteenth International Conference on Machine Learning 2002, 187-194. Morgan Kaufmann, Sydney. San Francisco. C. Sammut, A. Hoffmann (Eds.).
139. Gilad-Bachrach R., Navot A., Tishby N. Margin based feature selection: Theory and algorithms. Proceedings of the Twenty-First International Conference on Machine Learning 2004, 337-344. ACM Press, Banff, AB. New York. R. Greiner, D. Schuurmans (Eds.).
140. Giraud-Carrier C. FLARE: Induction with prior knowledge. Research and Development in Expert Systems XIII 1996, 11-24. SGES Publications, Cambridge, England. J. Nealon, J. Hunt (Eds.).
141. Gluck M., Corter J. Information, uncertainty and the utility of categories. Proceedings of the Annual Conference of the Cognitive Science Society 1985, 283-287. Lawrence Erlbaum, Irvine, CA. Hillsdale, NJ.
142. Goldberg D.E. Genetic algorithms in search, optimization and machine learning 1989, Addison-Wesley, Reading, MA.
143. Good P. Permutation tests: A practical guide to resampling methods for testing hypotheses 1994, Springer-Verlag, New York.
144. Grossman D., Domingos P. Learning Bayesian network classifiers by maximizing conditional likelihood. Proceedings of the Twenty-First International Conference on Machine Learning 2004, 361-368. ACM Press, Banff, AB. New York. R. Greiner, D. Schuurmans (Eds.).
145. Groth R. Data mining: A hands-on approach for business professionals 1998, Prentice-Hall, Upper Saddle River, NJ.
146. Guo Y., Greiner R. Discriminative model selection for belief net structures 2004, Department of Computing Science, TR04-22, University of Alberta, Canada.
147. Gütlein M., Frank E., Hall M., Karwath A. Large-scale attribute selection using wrappers. Proceedings of the IEEE Symposium on Computational Intelligence and Data Mining 2009, 332-339. IEEE Computer Society, Nashville. Washington, DC.
148. Guyon I., Weston J., Barnhill S., Vapnik V. Gene selection for cancer classification using support vector machines. Machine Learning 2002, 46(1-3):389-422.
149. Hall M. Correlation-based feature selection for discrete and numeric class machine learning. Proceedings of the Seventeenth International Conference on Machine Learning 2000, 359-366. Morgan Kaufmann, Stanford, CA. San Francisco. P. Langley (Ed.).
150. Hall M., Holmes G., Frank E. Generating rule sets from model trees. Proceedings of the Twelfth Australian Joint Conference on Artificial Intelligence 1999, 1-12. Springer-Verlag, Sydney. Berlin. N.Y. Foo (Ed.).
151. Hall M., Frank E. Combining Naïve Bayes and decision tables. Proceedings of the 21st Florida Artificial Intelligence Research Society Conference 2008, 318-319. AAAI Press, Miami. Menlo Park, CA.
152. Han J., Pei J., Yin Y. Mining frequent patterns without candidate generation. Proceedings of the ACM-SIGMOD International Conference on Management of Data 2000, 1-12. ACM Press, Dallas. New York.
153. Han J., Pei J., Yin Y., Mao R. Mining frequent patterns without candidate generation: A frequent-pattern tree approach. Data Mining and Knowledge Discovery 2004, 8(1):53-87.
154. Han J., Kamber M. Data mining: Concepts and techniques 2006, Morgan Kaufmann, San Francisco. 2nd ed.
155. Hand D.J. Classifier Technology and the Illusion of Progress. Statistical Science 2006, 21(1):1-14.
156. Hand D.J., Manilla H., Smyth P. Principles of Data Mining 2001, MIT Press, Cambridge, MA.
157. Hartigan J.A. Clustering algorithms 1975, John Wiley, New York.
158. Hastie T., Tibshirani R. Classification by pairwise coupling. Annals of Statistics 1998, 26(2):451-471.
159. Hastie T., Tibshirani R., Friedman J. The elements of statistical learning 2009, Springer-Verlag, New York. 2nd ed.
160. Heckerman D., Geiger D., Chickering D.M. Learning Bayesian networks: The combination of knowledge and statistical data. Machine Learning 1995, 20(3):197-243.
161. Hempstalk K., Frank E., Witten I.H. One-class classification by combining density and class probability estimation. Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Databases 2008, 505-519. Springer-Verlag, Antwerp. Berlin.
162. Hempstalk K., Frank E. Discriminating against new classes: One-class versus multi-class classification. Proceedings of the Twenty-first Australasian Joint Conference on Artificial Intelligence 2008, 225-236. Springer-Verlag, Auckland.
163. Ho T.K. The random subspace method for constructing decision forests. IEEE Transactions on Pattern Analysis and Machine Intelligence 1998, 20(8):832-844.
164. Hochbaum D.S., Shmoys D.B. A best possible heuristic for the k-center problem. Mathematics of Operations Research 1985, 10(2):180-184.
165. Hoerl A.E., Kennard R.W. Ridge regression: applications to nonorthogonal problems. Technometrics 1970, 12(1):69-82.
166. Holmes G., Nevill-Manning C.G. Feature selection via the discovery of simple classification rules. Proceedings of the International Symposium on Intelligent Data Analysis 1995, 75-79. International Institute for Advanced Studies in Systems Research and Cybernetics. Baden-Baden. Windsor, Ont: International Institute for Advanced Studies in Systems Research and Cybernetics, Baden-Baden, Germany. G.E. Lasker, X. Liu (Eds.).
167. Holmes G., Pfahringer B., Kirkby R., Frank E., Hall M. Multiclass alternating decision trees. Proceedings of the Thirteenth European Conference on Machine Learning 2002, 161-172. Springer-Verlag, Helsinki. Berlin. T. Elomaa, H. Mannila, H. Toivonen (Eds.).
168. Holte R.C. Very simple classification rules perform well on most commonly used datasets. Machine Learning 1993, 11:63-91.
169. Huffman S.B. Learning information extraction patterns from examples. Connectionist, statistical, and symbolic approaches to learning for natural language processing 1996, 246-260. Springer-Verlag, Berlin. S. Wertmer, E. Riloff, G. Scheler (Eds.).
170. Jabbour K., Riveros J.F.V., Landsbergen D., Meyer W. ALFA: Automated load forecasting assistant. IEEE Transactions on Power Systems 1988, 3(3):908-914.
171. Jiang L., Zhang H. Weightily averaged one-dependence estimators. Proceedings of the 9th Biennial Pacific Rim International Conference on Artificial Intelligence 2006, 970-974. Springer-Verlag, Guilin, China. Berlin.
172. John G.H. Robust decision trees: Removing outliers from databases. Proceedings of the First International Conference on Knowledge Discovery and Data Mining 1995, 174-179. AAAI Press, Montreal. Menlo Park, CA. U.M. Fayyad, R. Uthurusamy (Eds.).
173. John G.H. Enhancements to the data mining process 1997, Ph.D. Dissertation, Computer Science Department, Stanford University, Stanford, CA.
174. John G.H., Kohavi R., Pfleger P. Irrelevant features and the subset selection problem. Proceedings of the Eleventh International Conference on Machine Learning 1994, 121-129. Morgan Kaufmann, New Brunswick, NJ. San Francisco. H. Hirsh, W. Cohen (Eds.).
175. John G.H., Langley P. Estimating continuous distributions in Bayesian classifiers. Proceedings of the Eleventh Conference on Uncertainty in Artificial Intelligence 1995, 338-345. Morgan Kaufmann, Montreal. San Francisco. P. Besnard, S. Hanks (Eds.).
176. Johns M.V. An empirical Bayes approach to nonparametric two-way classification. Studies in item analysis and prediction 1961, Stanford University Press, Palo Alto, CA. H. Solomon (Ed.).
177. Kass R., Wasserman L. A reference Bayesian test for nested hypotheses and its relationship to the Schwarz criterion. Journal of the American Statistical Association 1995, 90:928-934.
178. Keerthi S.S., Shevade S.K., Bhattacharyya C., Murthy K.R.K. Improvements to Platt's SMO algorithm for SVM classifier design. Neural Computation 2001, 13(3):637-649.
179. Kerber R. Chimerge: Discretization of numeric attributes. Proceedings of the Tenth National Conference on Artificial Intelligence 1992, 123-128. AAAI Press, San Jose, CA. Menlo Park, CA. W. Swartout (Ed.).
180. Kibler D., Aha D.W. Learning representative exemplars of concepts: An initial case study. Proceedings of the Fourth Machine Learning Workshop 1987, 24-30. Morgan Kaufmann, Irvine, CA. San Francisco. P. Langley (Ed.).
181. Kimball R., Ross M. The data warehouse toolkit 2002, John Wiley, New York. 2nd ed.
182. Kira K., Rendell L. A practical approach to feature selection. Proceedings of the Ninth International Workshop on Machine Learning 1992, 249-258. Morgan Kaufmann, Aberdeen, Scotland. San Francisco. D. Sleeman, P. Edwards (Eds.).
183. Kirkby R. Improving Hoeffding trees 2007, Ph.D. Dissertation, Department of Computer Science, University of Waikato, New Zealand.
184. Kittler J. Feature set search algorithms. Pattern recognition and signal processing 1978, 41-60. Sijthoff an Noordhoff, Amsterdam. C.H. Chen (Ed.).
185. Kivinen J., Smola A.J., Williamson R.C. Online learning with kernels. IEEE Transactions on Signal Processing 2002, 52:2165-2176.
186. Kleinberg J. Authoritative sources in a hyperlinked environment. Proceedings of the ACM-SIAM Symposium on Discrete Algorithms 1998, 604-632. Extended version published in Journal of the ACM 46 (1999).
187. Koestler A. The act of creation 1964, Hutchinson, London.
188. Kohavi R. A study of cross-validation and bootstrap for accuracy estimation and model selection. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence 1995, 1137-1143. Morgan Kaufmann, Montreal. San Francisco.
189. Kohavi R. The power of decision tables. Proceedings of the Eighth European Conference on Machine Learning 1995, 174-189. Springer-Verlag, Iráklion, Crete. Berlin. N. Lavrac, S. Wrobel (Eds.).
190. Kohavi R. Scaling up the accuracy of Naïve Bayes classifiers: A decision-tree hybrid. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining 1996, 202-207. AAAI Press, Portland, OR. Menlo Park, CA. E. Simoudis, J.W. Han, U. Fayyad (Eds.).
191. Kohavi R., John G.H. Wrappers for feature subset selection. Artificial Intelligence 1997, 97(1-2):273-324.
192. Kohavi R., Kunz C. Option decision trees with majority votes. Proceedings of the Fourteenth International Conference on Machine Learning 1997, 161-191. Morgan Kaufmann, Nashville. San Francisco. D. Fisher (Ed.).
193. Kohavi R., Provost F. Machine learning: Special issue on applications of machine learning and the knowledge discovery process. Machine Learning 1998, 30(2/3):127-274. (Eds.).
194. Kohavi R., Sahami M. Error-based and entropy-based discretization of continuous features. Proceedings of the Second International Conference on Knowledge Discovery and Data Mining 1996, 114-119. AAAI Press, Portland, OR. Menlo Park, CA. E. Simoudis, J.W. Han, U. Fayyad (Eds.).
195. Komarek P., Moore A. A dynamic adaptation of AD-trees for efficient machine learning on large data sets. Proceedings of the Seventeenth International Conference on Machine Learning 2000, 495-502. Morgan Kaufmann, Stanford, CA. San Francisco. P. Langley (Ed.).
196. Kononenko I. On biases in estimating multi-valued attributes. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence 1995, 1034-1040. Morgan Kaufmann, Montreal. San Francisco.
197. Koppel M., Schler J. Authorship verification as a one-class classification problem. Proceedings of the Twenty-First International Conference on Machine Learning 2004, 489-495. ACM Press, Banff, AB. New York. R. Greiner, D. Schuurmans (Eds.).
198. Krogel M.-A., Wrobel S. Feature selection for propositionalization. Proceedings of the International Conference on Discovery Science 2002, 430-434. Springer-Verlag, Lübeck, Germany. Berlin.
199. Kubat M., Holte R.C., Matwin S. Machine learning for the detection of oil spills in satellite radar images. Machine Learning 1998, 30:195-215.
200. Kuncheva L.I., Rodriguez J.J. An experimental study on rotation forest ensembles. Proceedings of the Seventh International Workshop on Multiple Classifier Systems 2007, 459-468. Springer-Verlag, Prague. Berlin/Heidelberg.
201. Kushmerick N., Weld D.S., Doorenbos R. Wrapper induction for information extraction. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence 1997, 729-735. Morgan Kaufmann, Nagoya, Japan. San Francisco.
202. Laguna, M., & Marti, R. (2003). Scatter search: Methodology and implementations in C. Dordrecht, The Netherlands: Kluwer Academic Press.
203. Landwehr N., Hall M., Frank E. Logistic model trees. Machine Learning 2005, 59(1-2):161-205.
204. Langley P. Elements of machine learning 1996, Morgan Kaufmann, San Francisco.
205. Langley P., Iba W., Thompson K. An analysis of Bayesian classifiers. Proceedings of the Tenth National Conference on Artificial Intelligence 1992, 223-228. AAAI Press, San Jose, CA. Menlo Park, CA. W. Swartout (Ed.).
206. Langley P., Sage S. Induction of selective Bayesian classifiers. Proceedings of the Tenth Conference on Uncertainty in Artificial Intelligence 1994, 399-406. Morgan Kaufmann, Seattle. San Francisco. R.L. de Mantaras, D. Poole (Eds.).
207. Langley P., Simon H.A. Applications of machine learning and rule induction. Communications of the ACM 1995, 38(11):55-64.
208. Lavrac N., Motoda H., Fawcett T., Holte R., Langley P., Adriaans P. Special issue on lessons learned from data mining applications and collaborative problem solving. Machine Learning 2004, 57(1/2). (Eds.).
209. Lawson C.L., Hanson R.J. Solving least squares problems 1995, SIAM Publications, Philadelphia.
210. le Cessie S., van Houwelingen J.C. Ridge estimators in logistic regression. Applied Statistics 1992, 41(1):191-201.
211. Li M., Vitanyi P.M.B. Inductive reasoning and Kolmogorov complexity. Journal of Computer and System Sciences 1992, 44:343-384.
212. Your wish is my command: Programming by example 2001, Morgan Kaufmann, San Francisco. H. Lieberman (Ed.).
213. Littlestone N. Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning 1988, 2(4):285-318.
214. Littlestone N. Mistake bounds and logarithmic linear-threshold learning algorithms 1989, Ph, D. Dissertation, University of California, Santa Cruz.
215. Liu B. Web data mining: Exploring hyperlinks, contents, and usage data 2009, Springer-Verlag, Berlin.
216. Liu B., Hsu W., Ma Y.M. Integrating classification and association rule mining. Proceedings of the Fourth International Conference on Knowledge Discovery and Data Mining (KDD-98) 1998, 80-86. AAAI Press, New York. Menlo Park, CA.
217. Liu H., Setiono R. A probabilistic approach to feature selection: A filter solution. Proceedings of the Thirteenth International Conference on Machine Learning 1996, 319-327. Morgan Kaufmann, Bari, Italy. San Francisco. L. Saitta (Ed.).
218. Liu H., Setiono R. Feature selection via discretization. IEEE Transactions on Knowledge and Data Engineering 1997, 9(4):642-645.
219. Luan J. Data mining and its applications in higher education. New directions for institutional research 2002, 2002(113):17-36.
220. Mann T. Library research models: A guide to classification, cataloging, and computers 1993, Oxford University Press, New York.
221. Marill T., Green D.M. On the effectiveness of receptors in recognition systems. IEEE Transactions on Information Theory 1963, 9(11):11-17.
222. Maron O. Learning from ambiguity 1998, Ph.D. Thesis, Massachusetts Institute of Technology, Cambridge, MA.
223. Maron O., Lozano-Peréz T. A framework for multiple-instance learning. Proceedings of the Conference on Neural Information Processing Systems 1997, 570-576. MIT Press, Denver. Cambridge, MA.
224. Martin B. Instance-based learning: Nearest neighbour with generalisation 1995, M.Sc. Thesis, Department of Computer Science, University of Waikato, New Zealand.
225. McCallum A., Nigam K. A comparison of event models for Naïve Bayes text classification. Proceedings of the AAAI-98 Workshop on Learning for Text Categorization 1998, 41-48. AAAI Press, Madison, WI. Menlo Park, CA.
226. Medelyan O., Witten I.H. Domain independent automatic keyphrase indexing with small training sets. Journal of the American Society for Information Science and Technology 2008, 59:1026-1040.
227. Mehta M., Agrawal R., Rissanen J. SLIQ: A fast scalable classifier for data mining. Proceedings of the Fifth International Conference on Extending Database Technology 1996, 18-32. Springer-Verlag, New York, Avignon, France. P. Apers, M. Bouzeghoub, G. Gardarin (Eds.).
228. Melville P., Mooney R.J. Creating diversity in ensembles using artificial data. Information Fusion 2005, 6(1):99-111.
229. Michalski R.S., Chilausky R.L. Learning by being told and learning from examples: An experimental comparison of the two methods of knowledge acquisition in the context of developing an expert system for soybean disease diagnosis. International Journal of Policy Analysis and Information Systems 1980, 4(2).
230. Michie D. Problems of computer-aided concept formation. Applications of expert systems 1989, Vol. 2:310-333. Addison-Wesley, Wokingham, UK.
231. Minsky M., Papert S. Perceptrons 1969, MIT Press, Cambridge, MA.
232. Mitchell T.M. Machine Learning 1997, McGraw-Hill, New York.
233. Mitchell T.M., Caruana R., Freitag D., McDermott J., Zabowski D. Experience with a learning personal assistant. Communications of the ACM 1994, 37(7):81-91.
234. Moore A.W. Efficient memory-based learning for robot control 1991, Ph.D. Dissertation, Computer Laboratory, University of Cambridge, UK.
235. Moore A.W. The anchors hierarchy: Using the triangle inequality to survive high-dimensional data. Proceedings of the Sixteenth Conference on Uncertainty in Artificial Intelligence 2000, 397-405. Morgan Kaufmann, Stanford, CA. San Francisco. C. Boutilier, M. Goldszmidt (Eds.).
236. Moore A.W., Lee M.S. Efficient algorithms for minimizing cross validation error. Proceedings of the Eleventh International Conference on Machine Learning 1994, 190-198. Morgan Kaufmann, New Brunswick, NJ. San Francisco. W.W. Cohen, H. Hirsh (Eds.).
237. Moore A.W., Lee M.S. Cached sufficient statistics for efficient machine learning with large datasets. Journal Artificial Intelligence Research 1998, 8:67-91.
238. Moore A.W., Pelleg D. X-means: Extending k-means with efficient estimation of the number of clusters. Proceedings of the Seventeenth International Conference on Machine Learning 2000, 727-734. Morgan Kaufmann, Stanford, CA. San Francisco. P. Langley (Ed.).
239. Mutter S., Hall M., Frank E. Using classification to evaluate the output of confidence-based association rule mining. Proceedings of the Seventeenth Australian Joint Conference on Artificial Intelligence 2004, 538-549. Springer-Verlag, Cairns, Australia. Berlin.
240. Nadeau C., Bengio Y. Inference for the generalization error. Machine Learning 2003, 52(3):239-281.
241. Nahm, U.Y., & Mooney, R.J. (2000). Using information extraction to aid the discovery of prediction rules from texts. In Proceedings of the Workshop on Text Mining at the Sixth International Conference on Knowledge Discovery and Data Mining (pp. 51-58). Boston. Workshop proceedings at . http://www.cs.cmu.edu/%7edunja/WshKDD2000.html.
242. Niculescu-Mizil A., Caruana R. Predicting good probabilities with supervised learning. Proceedings of the 22nd International Conference on Machine Learning 2005, 625-632. ACM Press, Bonn. New York.
243. Nie N.H., Hull C., Jenkins H., Steinbrenner J.G.K., Bent D.H. Statistical package for the social sciences 1970, McGraw-Hill, New York.
244. Nigam K., Ghani R. Analyzing the effectiveness and applicability of co-training. Proceedings of the Ninth International Conference on Information and Knowledge Management 2000, 86-93. ACM Press, McLean, VA. New York.
245. Nigam K., McCallum A.K., Thrun S., Mitchell T.M. Text classification from labeled and unlabeled documents using EM. Machine Learning 2000, 39(2/3):103-134.
246. Nilsson N.J. Learning machines 1965, McGraw-Hill, New York.
247. Nisbet R., Elder J., Miner G. Handbook of statistical analysis and data mining applications 2009, Academic Press, New York.
248. Oates T., Jensen D. The effects of training set size on decision tree complexity. Proceedings of the Fourteenth International Conference on Machine Learning 1997, 254-262. Morgan Kaufmann, Nashville. San Francisco.
249. Ohm, P. (2009). Broken promises of privacy: Responding to the surprising failure of anonymization. University of Colorado Law Legal Studies Research Paper No. 09-12, August.
250. Omohundro S.M. Efficient algorithms with neural network behavior. Journal of Complex Systems 1987, 1(2):273-347.
251. Paynter G.W. Automating iterative tasks with programming by demonstration 2000, Ph.D. Dissertation, Department of Computer Science, University of Waikato, New Zealand.
252. Pearson, R. (2005). Mining imperfect data. Society for Industrial and Applied Mechanics, Philadelphia.
253. Pei J., Han J., Mortazavi-Asi B., Wang J., Pinto H., Chen Q., et al. Mining sequential patterns by pattern-growth: The PrefixSpan approach. IEEE Transactions on Knowledge and Data Engineering 2004, 16(11):1424-1440.
254. Knowledge discovery in databases 1991, AAAI Press/MIT Press, Menlo Park, CA. G. Piatetsky-Shapiro, W.J. Frawley (Eds.).
255. Platt J. Fast training of support vector machines using sequential minimal optimization. Advances in kernel methods: Support vector learning 1998, 185-209. MIT Press, Cambridge, MA. B. Schölkopf, C. Burges, A. Smola (Eds.).
256. Power D.J. What is the true story about data mining, beer and diapers?. DSS News 2002, 3(23). http://www.dssresources.com/newsletters/66.php.
257. Provost F., Fawcett T. Analysis and visualization of classifier performance: Comparison under imprecise class and cost distributions. Proceedings of the Third International Conference on Knowledge Discovery and Data MiningHuntington Beach, CA 1997, 43-48. AAAI Press, Menlo Park, CA. D. Heckerman, H. Mannila, D. Pregibon, R. Uthurusamy (Eds.).
258. Pyle D. Data preparation for data mining 1999, Morgan Kaufmann, San Francisco, CA.
259. Quinlan J.R. Induction of decision trees. Machine Learning 1986, 1(1):81-106.
260. Quinlan J.R. Learning with continuous classes. Proceedings of the Fifth Australian Joint Conference on Artificial Intelligence 1992, 343-348. World Scientific, Hobart, Tasmania. Singapore. N. Adams, L. Sterling (Eds.).
261. Quinlan J.R. C4.5: Programs for machine learning 1993, Morgan Kaufmann, San Francisco.
262. Quinlan J.R. Improved use of continuous attributes in C4.5. Journal of Artificial Intelligence Research 1996, 4:77-90.
263. Ramon, J., & de Raedt, L. (2000). Multi instance neural networks. In Proceedings of the ICML Workshop on Attribute-Value and Relational Learning (pp. 53-60). Stanford, CA.
264. Ray S., Craven M. Supervised learning versus multiple instance learning: An empirical comparison. Proceedings of the International Conference on Machine Learning 2005, 697-704. ACM Press, Bonn. New York.
265. Read J., Pfahringer B., Holmes G., Frank E. Classifier chains for multi-label classification. Proceedings of the 13th European Conference on Principles and Practice of Knowledge Discovery in Databases and 20th European Conference on Machine Learning 2009, 254-269. Springer-Verlag, Bled, Slovenia. Berlin.
266. Rennie J.D.M., Shih L., Teevan J., Karger D.R. Tackling the poor assumptions of Naïve Bayes text classifiers. Proceedings of the Twentieth International Conference on Machine Learning 2003, 616-623. AAAI Press, Washington, DC. Menlo Park, CA. T. Fawcett, N. Mishra (Eds.).
267. Ricci F., Aha D.W. Error-correcting output codes for local learners. Proceedings of the European Conference on Machine Learning 1998, 280-291. Springer-Verlag, Chemnitz, Germany. Berlin. C. Nedellec, C. Rouveird (Eds.).
268. Richards D., Compton P. Taking up the situated cognition challenge with ripple-down rules. International Journal of Human-Computer Studies 1998, 49(6):895-926.
269. Rifkin R., Klautau A. In defense of one-vs.-all classification. Journal of Machine Learning Research 2004, 5:101-141.
270. Ripley B.D. Pattern recognition and neural networks 1996, Cambridge University Press, Cambridge, UK.
271. Rissanen J. The minimum description length principle. Encylopedia of Statistical Sciences 1985, Vol. 5:523-527. John Wiley, New York.
272. Rodriguez J.J., Kuncheva L.I., Alonso C.J. Rotation forest: A new classifier ensemble method. IEEE Transactions on Pattern Analysis and Machine Intelligence 2006, 28(10):1619-1630.
273. Rousseeuw P.J., Leroy A.M. Robust regression and outlier detection 1987, John Wiley, New York.
274. Russell S., Norvig P. Artificial intelligence: A modern approach 2009, Prentice-Hall, Upper Saddle River, NJ. 3rd ed.
275. Sahami M., Dumais S., Heckerman D., Horvitz E. A Bayesian approach to filtering junk e-mail. Proceedings of the AAAI-98 Workshop on Learning for Text Categorization 1998, 55-62. AAAI Press, Madison, WI. Menlo Park, CA.
276. Saitta L., Neri F. Learning in the "real world.". Machine Learning 1998, 30(2/3):133-163.
277. Salzberg S. A nearest hyperrectangle learning method. Machine Learning 1991, 6(3):251-276.
278. Schapire R.E., Freund Y., Bartlett P., Lee W.S. Boosting the margin: A new explanation for the effectiveness of voting methods. Proceedings of the Fourteenth International Conference on Machine Learning 1997, 322-330. Morgan Kaufmann, Nashville. San Francisco. D.H. Fisher (Ed.).
279. Scheffer T. Finding association rules that trade support optimally against confidence. Proceedings of the Fifth European Conference on Principles of Data Mining and Knowledge Discovery 2001, 424-435. Springer-Verlag, Freiburg, Germany. Berlin. L. de Raedt, A. Siebes (Eds.).
280. Schölkopf B., Bartlett P., Smola A.J., Williamson R. Shrinking the tube: A new support vector regression algorithm. Advances in Neural Information Processing Systems 1999, 330-336. MIT Press, Cambridge, MA.
281. Schölkopf B., Williamson R., Smola A., Shawe-Taylor J., Platt J. Support vector method for novelty detection. Advances in Neural Information Processing Systems 2000, 12:582-588. Cambridge, MA: MIT Press.
282. Schölkopf B., Smola A.J. Learning with kernels: Support vector machines, regularization, optimization, and beyond 2002, MIT Press, Cambridge, MA.
283. Sebastiani F. Machine learning in automated text categorization. ACM Computing Surveys 2002, 34(1):1-47.
284. Seewald A.K. How to make stacking better and faster while also taking care of an unknown weakness. Proceedings of the Nineteenth International Conference on Machine Learning 2002, 54-561. Morgan Kaufmann, Sydney. San Francisco.
285. Seewald A.K., Fürnkranz J. An evaluation of grading classifiers. Proceedings of the Fourth International Conference on Advances in Intelligent Data Analysis 2001, 115-124. Springer-Verlag, Cascais, Portugal. Berlin. F. Hoffmann, D.J. Hand, N.M. Adams, D.H. Fisher, G. Guimarães (Eds.).
286. Shafer R., Agrawal R., Metha M. SPRINT: A scalable parallel classifier for data mining. Proceedings of the Second International Conference on Very Large Databases 1996, 544-555. Morgan Kaufmann, Mumbai (Bombay). San Francisco. T.M. Vijayaraman, A.P. Buchmann, C. Mohan, N.L. Sarda (Eds.).
287. Shalev-Shwartz S., Singer Y., Srebro N. Pegasos: Primal estimated sub-gradient solver for SVM. Proceedings of the 24th international conference on Machine Learning 2007, 807-814. ACM Press, New York.
288. Shawe-Taylor J., Cristianini N. Kernel methods for pattern analysis 2004, Cambridge University Press, Cambridge, UK.
289. Slonim N., Friedman N., Tishby N. Unsupervised document classification using sequential information maximization. Proceedings of the 25th International ACM SIGIR Conference on Research and Development in Information Retrieval 2002, 120-136. ACM Press, New York.
290. Smola A.J., Schölkopf B. A tutorial on support vector regression. Statistics and Computing 2004, 14(3):199-222.
291. Soderland S., Fisher D., Aseltine J., Lehnert W. Crystal: Inducing a conceptual dictionary. Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence 1995, 1314-1319. AAAI Press, Montreal. Menlo Park, CA.
292. Srikant R., Agrawal R. Mining sequential patterns: Generalizations and performance improvements. Proceedings of the Fifth International Conference on Extending Database Technology. Avignon, France 1996, 3-17. Lecture Notes in Computer Science. Vol. 1057, Springer-Verlag, London. P.M. Apers, M. Bouzeghoub, G. Gardarin (Eds.).
293. Stevens S.S. On the theory of scales of measurement. Science 1946, 103:677-680.
294. Stone P., Veloso M. Multiagent systems: A survey from a machine learning perspective. Autonomous Robots 2000, 8(3):345-383.
295. Stout Q.F. Unimodal regression via prefix isotonic regression. Computational Statistics and Data Analysis 2008, 53:289-297.
296. Su J., Zhang H., Ling C.X., Matwin S. Discriminative parameter learning for Bayesian networks. Proceedings of the 25th International Conference on Machine Learning 2008, 1016-1023. ACM Press, New York, Helsinki.
297. Swets J. Measuring the accuracy of diagnostic systems. Science 1988, 240:1285-1293.
298. Ting K.M. An instance-weighting method to induce cost-sensitive trees. IEEE Transactions on Knowledge and Data Engineering 2002, 14(3):659-665.
299. Ting K.M., Witten I.H. Stacked generalization: When does it work?. Proceedings of the Fifteenth International Joint Conference on Artificial Intelligence 1997, 866-871. Morgan Kaufmann, Nagoya, Japan. San Francisco.
300. Ting K.M., Witten I.H. Stacking bagged and dagged models. Proceedings of the Fourteenth International Conference on Machine Learning 1997, 367-375. Morgan Kaufmann, Nashville. San Francisco. D.H. Fisher (Ed.).
301. Turney P.D. Learning to extract key phrases from text 1999, Technical Report ERB-1057, Institute for Information Technology, National Research Council of Canada, Ottawa.
302. U.S.House of Representatives Subcommittee on Aviation Hearing on aviation security with a focus on passenger profiling February 27, 2002. http://www.house.gov/transportation/aviation/02-27-02/02-27-02memo.html.
303. Utgoff P.E. Incremental induction of decision trees. Machine Learning 1989, 4(2):161-186.
304. Utgoff P.E., Berkman N.C., Clouse J.A. Decision tree induction based on efficient tree restructuring. Machine Learning 1997, 29(1):5-44.
305. Vafaie H., DeJong K. Genetic algorithms as a tool for feature selection in machine learning. Proceedings of the International Conference on Tools with Artificial Intelligence 1992, 200-203. IEEE Computer Society Press, Arlington, VA.
306. van Rijsbergen C.A. Information retrieval 1979, Butterworths, London.
307. Vapnik V. The nature of statistical learning theory 1999, Springer-Verlag, New York. 2nd ed.
308. Vitter J.S. Random sampling with a reservoir. ACM Transactions on Mathematical Software 1985, 1(11):37-57.
309. Wang J., Zucker J.-D. Solving the multiple-instance problem: A lazy learning approach. Proceedings of the International Conference on Machine Learning 2000, 1119-1125. Morgan Kaufmann, Stanford, CA. San Francisco.
310. Wang J., Han J., Pei J. CLOSET+: Searching for the best strategies for mining frequent closed itemsets. Proceedings of the International Conference on Knowledge Discovery and Data Mining 2003, 236-245. ACM Press, Washington, DC. New York.
311. Wang Y., Witten I.H. Induction of model trees for predicting continuous classes. Proceedings of the of the Poster Papers of the European Conference on Machine Learning 1997, 128-137. University of Economics, Faculty of Informatics and Statistics, Prague. Berlin. M. van Someren, G. Widmer (Eds.).
312. Wang Y., Witten I.H. Modeling for optimal probability prediction. Proceedings of the Nineteenth International Conference on Machine Learning 2002, 650-657. Morgan Kaufmann, Sydney. San Francisco. C. Sammut, A. Hoffmann (Eds.).
313. Webb G.I. Decision tree grafting from the all-tests-but-one partition. Proceedings of the Sixteenth International Joint Conference on Artificial Intelligence 1999, 702-707. Morgan Kaufmann, San Francisco.
314. Webb G.I. MultiBoosting: A technique for combining boosting and wagging. Machine Learning 2000, 40(2):159-196.
315. Webb G.I., Boughton J., Wang Z. Not so naïve Bayes: Aggregating one-dependence estimators. Machine Learning 2005, 58(1):5-24.
316. Weidmann N., Frank E., Pfahringer B. A two-level learning method for generalized multi-instance problems. Proceedings of the European Conference on Machine Learning 2003, 468-479. Springer-Verlag, Cavtat, Croatia. Berlin.
317. Weiser M., Brown J.S. The coming age of calm technology. Beyond calculation: The next fifty years 1997, 75-86. Copernicus, New York. P.J. Denning, R.M. Metcalfe (Eds.).
318. Weiss S.M., Indurkhya N. Predictive data mining: A practical guide 1998, Morgan Kaufmann, San Francisco.
319. Wettschereck D., Dietterich T.G. An experimental comparison of the nearest-neighbor and nearest-hyperrectangle algorithms. Machine Learning 1995, 19(1):5-28.
320. Wild C.J., Seber G.A.F. Introduction to probability and statistics 1995, Department of Statistics, University of Auckland, New Zealand.
321. Winston P.H. Artificial intelligence 1992, Addison-Wesley, Reading, MA.
322. Witten I.H. Text mining. Practical handbook of Internet computing 2004, 14-1-14-22. CRC Press, Boca Raton, FL. M.P. Singh (Ed.).
323. Witten I.H., Bray Z., Mahoui M., Teahan W. Text mining: A new frontier for lossless compression. Proceedings of the Data Compression Conference 1999, 198-207. IEEE Press, Snowbird, UT. Los Alamitos, CA. J.A. Storer, M. Cohn (Eds.).
324. Witten I.H., Moffat A., Bell T.C. Managing gigabytes: Compressing and indexing documents and images 1999, Morgan Kaufmann, San Francisco. 2nd ed.
325. Wolpert D.H. Stacked generalization. Neural Networks 1992, 5:241-259.
326. Wu X.V., Kumar J.R., Quinlan J, Ghosh Q., Yang H., Motoda G.J., et al. Top 10 algorithms in data mining. Knowledge and Information Systems 2008, 14(1):1-37.
327. The top ten algorithms in data mining 2009, Chapman and Hall, New York. X. Wu, V. Kumar (Eds.).
328. Xu X., Frank E. Logistic regression and boosting for labeled bags of instances. Proceedings of the 8th Pacific-Asia Conference on Knowledge Discovery and Data Mining 2004, 272-281. Springer-Verlag, Sydney. Berlin.
329. Yan X., Han J. gSpan: Graph-based substructure pattern mining. Proceedings of the IEEE International Conference on Data Mining 2002, 721-724. IEEE Computer Society, Maebashi City, Japan. Washington, DC.
330. Yan X., Han J. CloseGraph: Mining closed frequent graph patterns. Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2003, 286-295. ACM Press, Washington, DC. New York.
331. Yan X., Han J., Afshar R. CloSpan: Mining closed sequential patterns in large datasets. Proceedings of the SIAM International Conference on Data Mining 2003, 166-177. Society for Industrial and Applied Mathematics, San Francisco. Philadelphia.
332. Yang Y., Webb G.I. Proportional k-interval discretization for Naïve Bayes classifiers. Proceedings of the Twelfth European Conference on Machine Learning 2001, 564-575. Springer-Verlag, Freiburg, Germany. Berlin. L. de Raedt, P. Flach (Eds.).
333. Yang Y., Guan X., You J. CLOPE: A fast and effective clustering algorithm for transactional data. Proceedings of the Eighth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining 2002, 682-687. ACM Press, Edmonton, AB. New York.
334. Yurcik W., Barlow J., Zhou Y., Raje H., Li Y., Yin X., et al. Scalable data management alternatives to support data mining heterogeneous logs for computer network security. Proceedings of the Workshop on Data Mining for Counter Terrorism and Security 2003, Society for International and Applied Mathematics, San Francisco. Philadelphia.
335. Zadrozny B., Elkan C. Transforming classifier scores into accurate multiclass probability estimates. Proceedings of the Eighth ACM International Conference on Knowledge Discovery and Data Mining 2002, 694-699. ACM Press, Edmonton, AB. New York.
336. Zaki M.J., Parthasarathy S., Ogihara M., Li W. New algorithms for fast discovery of association rules. Proceedings Knowledge Discovery in Databases 1997, 283-286. AAAI Press, Newport Beach, CA. Menlo Park, CA.
337. Zhang H., Jiang L., Su J. Hidden Naïve Bayes. Proceedings of the 20th National Conference on Artificial Intelligence 2005, 919-924. AAAI Press, Pittsburgh. Menlo Park, CA.
338. Zhang T., Ramakrishnan R., Livny M. BIRCH: An efficient data clustering method for very large databases. Proceedings of the ACM SIGMOD International Conference on Management of Data 1996, 103-114. ACM Press, Montreal. New York.
339. Zhang T. Solving large scale linear prediction problems using stochastic gradient descent algorithms. Proceedings of the 21st International Conference on Machine Learning 2004, 919-926. Omnipress, Banff, AB. Madison, WI.
340. Zheng F., Webb G. Efficient lazy elimination for averaged one-dependence estimators. Proceedings of the 23rd International Conference on Machine Learning 2006, 1113-1120. ACM Press, New York.
341. Zheng Z., Webb G. Lazy learning of Bayesian rules. Machine Learning 2000, 41(1):53-84.
342. Zhou Z.-H., Zhang M.-L. Solving multi-instance problems with classifier ensemble based on constructive clustering. Knowledge and Information Systems 2007, 11(2):155-170.