Machine learning and data mining

Machine Learning and Data Mining

Volumn , Issue , 2007, Pages

  Kononenko, Igor ^a   Kukar, Matjaž ^a  

^a UNIVERSITY OF LJUBLJANA   (Slovenia)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 84882637032     PISSN: None     EISSN: None     Source Type: Book    
DOI: 10.1533/9780857099440     Document Type: Book

References (317)

1. R. Agrawal and R. Srikant. Fast algorithms for mining association rules in large databases. In Proc. 12th International Conference on Very Large Data Bases VLDB'94, pages 487-199, 1994.
2. D. W. Aha, D. Kibler, and M. K. Albert. Instance-based learning algorithm. Machine Learning, 6:37-66, 1991.
3. A.V. Aho, J.E. Hopcroft, and J.D. Ullman. Data Structures and Algorithms. Addison-Wesley, Reading, MA, Menclo Park, CA, London, Amsterdam, 1983.
4. H. Aizenstein and L. Pitt. Exact learning of read-twice DNF formulas. In Proc. 32th Annu. IEEE Sympos. Found. Comput. ScL, pages 170-179. IEEE Computer Society Press, 1991.
5. E. Alpaydin. Introduction to Machine Learning. MIT Press, Cambridge, Massachussetts, 2005.
6. J. A. Anderson and E. Rosenfeld, editors. Neurocomputing: Foundations of Research. Cambridge-London: MIT Press, 1988.
7. J.A. Anderson. Learning and Memory. John Wiley and Sons, New York, 1995. 3rd Extended Edition.
8. P. J. Angeline and K. E. Kinnear, editors. Advances in Genetic Programming 2. MIT Press, Cambridge, MA, 1996.
9. D. Angluin. Inductive inference of formal languages from positive data. Information and Control, 45:117-135, 1980.
10. D. Angluin. Learning regular sets from queries and counterexamples. Inform. Comput, 75(2): 87-106, 1987.
11. D. Angluin. Queries and concept learning. Machine Learning, 2:319-342, 1988.
12. D. Angluin. Negative results for equivalence queries. Machine Learning, 5:121-150, 1990.
13. D. Angluin and P. Laird. Learning from noisy examples. Machine Learning, 2:343-370, 1988.
14. D. Angluin and C. Smith. Inductive inference. In Encyclopedia of Artificial Intelligence, pages 409-418. J. Wiley and Sons, New York, NY, 1987.
15. D. Angluin, M. Frazier, and L. Pitt. Learning conjunctions of Horn clauses. Machine Learning, 9:147-164, 1992.
16. D. Angluin, L. Hellerstein, and M. Karpinski. Learning read-once formulas with queries. Journal of ACM, 40:185-210, 1993.
17. J. A. Aslam and S. E. Decatur. Specification and simulation of statistical query algorithms for efficiency and noise tolerance. Journal of Computer and System Sciences, 1997.
18. J. D. Bagley. The behavior of adaptive systems which employ genetic and correlation algorithms. PhD thesis, University of Michigan, 1967.
19. A. G. Barto, R. S. Sutton, and C. W. Anderson. Neuronlike adaptive elements that can solve difficult learning control problems. IEEE Trans, on Systems, Man, and Cybernetics, SMC-13 (5):834-846, 1983.
20. G. P. Beaumont. Probability And Random Variables. Horwood Publishing, Chichester, 2004.
21. J. M. Bernardo and A. F. M. Smith. Bayesian Theory. John Wiley, 2000.
22. M. Bevk and I. Kononenko. Towards symbolic mining of images with association rules: Preliminary results on textures. Intelligent Data Analysis, 2006. (in press).
23. A. Blum. Separating distribution-free and mistake-bound learning models over the Boolean domain. In Proc. of the 31st Symposium on the Foundations of Comp. ScL, pages 211-218, Los Alamitos, CA, 1990. IEEE Computer Society Press.
24. A. Blum, P. Chalasani, S. A. Goldman, and D. K. Slonim. Learning with unreliable boundary queries. In Proc. 8th Annu. Conf. on Comput. Learning Theory, pages 98-107, New York, NY, 1995. ACM Press.
25. L. Blum and M. Blum. Towards a mathematical theory of inductive inference. Information and Control, 28:125-155, 1975.
26. A. Blumer, A. Ehrenfeucht, D. Haussier, and M. K. Warmuth. Occam's razor. Inform. Proc. Lett., 24:377-380, 1987.
27. A. Blumer, A. Ehrenfeucht, D. Haussier, and M. K. Warmuth. Learnability and the Vapnik- Chervonenkis dimension. Journal of ACM, 36(4):929-965, 1989.
28. R. Borger and A.M. Seaborne. The Psychology of Learning. Penguin Books, Harmondsworth, 1966.
29. Z. Bosnie and I. Kononenko. Estimation of prediction reliability in regression based on a transductive approach. In B. Prasad, editor, Proc. 2nd Indian International Conference On Artificial Intelligence IICAI-05, pages 3502-3516, Pune, India December 20-22, 2005.
30. Z. Bosnie, I. Kononenko, M. Robnik Sikonja, and M. Kukar. Evaluation of prediction reliability in regression using the transduction principle. In B. Zajc and M. Tkalcic, editors, Proceedings of The IEEE Region 8 EUROCON 2003, volume 2, pages 99-103, 2003.
31. R. R. Bouckaert and E. Frank. Evaluating the replicability of significance tests for comparing learning algorithms. The University of Waikato, New Zealand, 2004.
32. R. J. Brachman and T. Anand. The process of knowledge discovery in databases. In Advances in Knowledge Discovery and Data Mining, pages 37-57. MIT Press, 1996.
33. J. Brank and J. Leskovec. The download estimation task on KDD Cup 2003. SIGKDD Explorations, 5(2): 160-162, 2003.
34. I. Bratko. Prolog Programming for Artificial intelligence. Addison-Wesley, 2000. (3rd Edition).
35. L. Breiman. Random forests. Machine Learning, 45(1):5-32, 2001.
36. L. Breiman. Bagging predictors. Machine Learning, 24(2): 123-140, 1996.
37. L. Breiman, J. H. Friedman, R. A. Olshen, and C. J. Stone. Classification and Regression Trees. Wadsforth International Group, 1984.
38. D. S. Broomhead and D. Lowe. Multivariable functional interpolation and adaptive networks. Complex Systems, 2:321-355, 1988.
39. N. H. Bshouty and Y. Mansour. Simple learning algorithms for decision trees and multivariate polynomials. In Proc. 36th Annual Symposium on Foundations of Computer Science, pages 304-311, Los Alamitos, CA, 1995. IEEE Computer Society Press.
40. N. H. Bshouty, S. A. Goldman, T. Hancock, and S. Matar. Asking questions to minimize errors. Journal of Computer and System Sciences 52, pages 268-286, 1996.
41. N. H. Bshouty, N. Eiron, and E. Kushilevitz. PAC learning with nasty noise. In Algorithmic Learning Theory, 10th International Conference, ALT '99, Tokyo, Japan, December 1999, Proceedings, volume 1720, pages 206-218. Springer, 1999.
42. M. D. Buhmann. Radial Basis Functions: Theory and Implementations. Cambridge University Press, 2003.
43. T. Buzan. Make the Most of Your Mind. Colt Books Ltd, 1977.
44. F. Capra. The Tao of Physics. Flamingo, GB, 1983.
45. G. A. Carpenter and S. Grossberg. A massively parallel architecture for a self-organizing neural pattern recognition machine. Computer Vision, Graphics, and Image Processing, 37:54-115, 1987a.
46. G. A. Carpenter and S. Grossberg. ART 2: Self-organization of stable category recognition codes for analog input patterns. Applied Optics, 26:4919-4930, 1987b.
47. G. A. Carpenter and S. Grossberg. ART 3: Hierarchical search using chemical transmitters in self-organizing pattern recognition architectures. Neural Networks, 3:129-152, 1990.
48. N. Cesa-Bianchi, Y. Freund, D. P. Helmbold, D. Haussier, R. E. Schapire, and M. K. Warmuth. How to use expert advice. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 382-391, New York, NY, 1993. ACM Press,.
49. B. Cestnik. Estimating probabilities: A crucial task in machine learning. In European Conf. on Artificial Intelligence 90, pages 147-149, August 1990.
50. B. Cestnik and I. Bratko. On estimating probabilities in tree pruning. In Y. Kodratoff, editor, European Working Session on Learning, pages 138-150. Springer Verlag, March 1991.
51. B. Cestnik, I. Kononenko, and I. Bratko. Assistant 86: A knowledge elicitation tool for sophisticated users. In I.Bratko and N. Lavrac, editors, Progress in Machine Learning. Sigma Press, Wilmslow, England, 1987.
52. J. P. Changeux. Neuronski covek (L'Homme Neuronal). Nolit, Beograd, Yugoslavia, 1986.
53. W. Chase and F. Bown. General Statistics. John Wiley & Sons, 1986.
54. P. Clark and R. Boswell. Rule induction with CN2: recent improvements. In Y. Kodratoff, editor, Proc. European Working Session on Learning, pages 151-163, Porto, March 1991, 1991. Springer Verlag.
55. P. Clark and T. Niblett. Learning if-then rules in noisy domains. In B. Phelps, editor, Interactions in Artificial Intelligence and Statistical Methods. Technical Press, Hampshire, England, 1987a.
56. P. Clark and T. Niblett. Induction in noisy domains. In I. Bratko and N. Lavrac, editors, Progress in Machine learning. Sigma Press, Wilmslow, England, 1987b.
57. M. A. Cohen and S. Grossberg. Absolute stability of global pattern formation and parallel memory storage by competitive neural networks. IEEE Transactions on Systems, Man, and Cybernetics, SMC-13:815-826, 1983.
58. T. H. Cormen, C. E. Leiserson, and R. L. Rivest. Introduction to algorithms. The MIT Press, 1990.
59. T. M. Cover and P. E. Hart. Nearest neighbor pattern classification. IEEE Trans, on Information Theory, IT-13:21-27, 1967.
60. N. Cristianini and J. Shawe-Taylor. An Introduction to Support Vector Machines and other kernel-based learning methods. Cambridge University Press, 2000.
61. H. de Garis. Genetic programming: Evolutionary approaches to multistrategy learning. In R. Michalski and G. Tecuci, editors, Machine Learning: A Multistrategy approach, volume IV. Morgan Kaufmann, 1994.
62. A. Demiriz, K. P. Bennett, and M. J. Embrechts. Semi-supervised clustering using genetic algorithms. In Artificial Neural Networks in Engineering (ANNIE-99), pages 809-814, 1999.
63. A. P. Dempster, N. M. Laird, and D.B. Rubin. Maximum likelihood from incomplete data via the EM algorithm. Journal of the Royal Statistical Society, 39( 1 ): 1-38, 1977.
64. J. Demsar. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, 2006.
65. J. Demsar, B. Zupan, and I. Bratko. Transformation of attribute space by function decomposition. In G. Delia Riccia, H. J. Lenz, and R. Kruse, editors, Data fusion and perception, pages 237-247, New York, 2001. Springer.
66. P. Diaconis and B. Efron. Computer-intensive methods in statistics. Scientific American, 248: 96-108, 1983.
67. T. G. Dietterich. Learning and inductive inference. In P. Cohen and E.A. Feigenbaum, editors, The Handbook of Artificial Intelligence, volume 3. Pitman Books Ltd, 1982.
68. T. G. Dietterich. Approximate statistical tests for comparing supervised classification learning algorithms. Neural Computation, 10(7): 1895-1924, 1998.
69. T. G. Dietterich and G. Bakiri. Solving multiclass learning problems via error-correcting output codes. Journal of Artificial Intelligence Research, 2:263-286, 1995.
70. P. Domingos. Metacost: A general method for making classifiers cost-sensitive. In Proc. of KDD-99, pages 155-164. New York: ACM Press, 1999.
71. J. Dougherty, R. Kohavi, and M. Sahami. Supervised and unsupervised discretization of continuous features. In Proc. ICML'95, pages 194-202. Morgan Kaufmann, 1995.
72. H. L. Dreyfus. What Computers Can't Do. New York: Harper & Row, 1972.
73. M.P. Driscoll. Psychology of Learning for Instruction. Allyn and Bacon, London, 1994.
74. R. O. Duda and P. E. Hart. Pattern Classification and Scene Analysis. John Wiley and Sons, 1973.
75. R. O. Duda, P. E. Hart, and D. G. Stork. Pattern Classification. Wiley Interscience, New York, 2001.
76. J. P. Egan. Signal detection theory and ROC analysis. Series in Cognition and Perception, 1975.
77. A. Ehrenfeucht and D. Haussier. A general lower bound on the number of examples needed for learning. Inform. Comput., 82(3):247-251, 1989.
78. A. Eiben and J.E. Smith. Introduction to Evolutionary Computing. Springer, Berlin, 2003. A.Einstein. Science and religion. Nature, 146:605-607, 1940.
79. B. S. Everitt, S. Landau, and M. Leese. Cluster Analysis. Arnold Publishers, 4th edition, 2001.
80. U. M. Fayyad. On the induction of decision trees for multiple concept learning. PhD thesis, The University of Michigan, 1991.
81. U. M. Fayyad. Multi-interval discretization of continuous-valued attributes for classification learning. In Proc. IJCAI1993, pages 1022-1027. Morgan Kaufmann, 1993.
82. U. M. Fayyad. Sky image cataloging and analysis tool. In Proc. IJCAI-95, pages 2067-2068, 1995. Montreal.
83. U. M. Fayyad and R. Uthurusamy. Data mining and knowledge discovery in databases (editorial). Communications of the ACM, 39(11 ):24-26, 1996.
84. D. H. Fisher. Knowledge acquisition via incremental conceptual clustering. Machine Learning, 2:139-172, 1987.
85. D. H. Fisher. Iterative optimization and simplification of hierarchical clusterings. Journal of Artificial Intelligence Research, 4:147-180, 1996.
86. D. B. Fogel. Evolutionary Computation: Toward a New Philosophy of Machine Intelligence. Piscataway, NJ, IEEE Press, 1995.
87. A.A. Freitas. Data Mining and Knowledge Discovery with Evolutionary Algorithms. Springer, Berlin, 2002.
88. Y. Freund and R. Schapire. Experiments with a new boosting algorithm. In Proceedings of the Thirteenth International Conference on Machine Learning, pages 148-156, San Mateo, CA., 1996. Morgan Kaufmann.
89. N. Friedman, D. Geiger, and M. Goldszmidt. Bayesian network classifiers. Machine Learning, 29:131-163, 1997.
90. K. Fukushima. A neural network for visual pattern recognition. IEEE Computer, pages 65-75, 3 1988.
91. A. Gammerman, V. Vovk, and V. Vapnik. Learning by transduction. In Proceedings of 14th Conference on Uncertainty in Artificial Intelligence, pages 148-155, 1998.
92. M. Gams, M. Paprzycki, and X. Wu, editors. Mind Versus Computer. IOS Press, Amsterdam, 1997.
93. G. Giacinto and F. Roli. Dynamic classifier selection based on multiple classifier behaviour. Pattern Recognition, 34:1879-1881, 2001.
94. E. M. Gold. Language identification in the limit. Information and Control, 10(5):447-474, 1967.
95. D. E. Goldberg. Genetic Algorithms in Search, Optimization and Machine Learning. Addison- Wesley, 1989.
96. S. A. Goldman. Computational learning theory. In M. J. Atallah, editor, Algorithms and Theory of Computation Handbook, chapter 30. CRC Press, 1998.
97. S. A. Goldman and R. Sloan. Can PAC learning algorithms tolerate random attribute noise? Algorithmica, 14(l):70-84, 1995.
98. D. Goleman. Emotional Intelligence: Why It Can Matter More Than IQ. Bantam, 1997.
99. D. Gondek and T. Hofmann. Non-redundant data clustering. In Proceedings of the Fourth IEEE International Conference on Data Mining, pages 75-82, 2004.
100. I. J. Good. Probability and the Weighing of Evidence. Charles Griffin, London, 1950.
101. I. J. Good. The Estimation of Probabilities - An Essay on Modern Bayesian Methods. The MIT Press, Cambridge, 1964.
102. A. D. Gordon. Classification. Chapman & Hall/CRC, 2nd edition, 1999.
103. J. C. Gower. A general coefficient of similarity and some of its properties. Biometrics, 27: 857-72, 1971.
104. J. C. Gower. Measures of similarity, dissimilarity and distance. In S. Kotz, N. L. Johnson, and C.B. Reed, editors, Encyclopaedia of statistical sciences, volume 5. John Wiley & Sons, New York, 1985.
105. R. Grossman, M. Hornick, and G. Meyer. Data mining standards initiatives. Communications of the ACM, 45-8:59-61, 2002.
106. A. Guez, V. Protopopsecu, and J. Barhen. On the stability, storage capacity and design of nonlinear continuous neural networks. IEEE Trans, on Systems, Man, and Cybernetics, 18 (l):80-87, 1988.
107. T. S. Han. Multiple mutual informations and multiple interactions in frequency data. Information and Control, 46(l):26-45, 1980.
108. D. Hand, H. Mannila, and P. Smyth. Principles of Data Mining. MIT Press, 2001.
109. T. Hastie and C. Loader. Local regression: automatic kernel carpentry. Statistical Science, 8: 120-143, 1993.
110. D. Haussier. Decision theoretic generalizations of the PAC model for neural net and other learning applications. Inform. Comput., 100(1):78-150, 1992.
111. D. Haussier, M. Kearns, N. Littlestone, and M. K. Warmuth. Equivalence of models for polynomial learnability. Inform. Comput., 95(2): 129-161, 1991.
112. D. Haussier, N. Littlestone, and M. K. Warmuth. Predicting {0,1} functions on randomly drawn points. Inform. Comput., 115(2):284-293, 1994.
113. S. Haykin. Neural Networks: A Comprehensive Foundation. Prentice Hall, 2nd edition, 1998.
114. D. O. Hebb. The Organization of Behavior. Wiley, New York, 1949.
115. S. Hettich, C.L. Blake, and C.J. Merz. UCI repository of machine learning databases, 1998. URL http://www.ics.uci.edu/~mlearn/MLRepository.html.
116. G. E. Hinton. A parallel computation that assigns canonical object based frames of reference. In Proc. 7th Int. Joint Conf. on AI IJCAI-81, 1981.
117. G. E. Hinton and T. J. Sejnowski. Learning and relearning in Boltzmann machines. In D.E. Rumelhart and J.L. McClelland, editors, Parallel Distributed Processing, Foundations, volume 1. Cambridge: MIT Press, 1986.
118. J. H. Holland. Adaptation in Natural and Artificial System. University of Michigan Press, Ann Arbor, 1975.
119. J. H. Holland. Escaping brittleness: The possibilities of general-purpose learning algorithms applied to parallel rule-based systems. In R. S. Michalski, J. G. Carbonell, and T. M. Mitchell, editors, Machine Learning: An Artificial Intelligence approach, volume 2, pages 593-623. Morgan Kaufman., Los Altos, 1986.
120. J. E. Hopcroft and J. D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979.
121. J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. National Academy of Sciences, 79:2554-2558, 1982.
122. J. J. Hopfield. Neurons with graded response have collective computational properties like those of two-state neurons. National Academy of Sciences, 81:4586-590, 1984.
123. J. J. Hopfield and D. W. Tank. Neural computation of decisions in optimization problems. Biological Cybernetics, 52:141-152, 1985.
124. D. Hosmer. Applied Logistic Regression. John Wiley & Sons, New York, 2000.
125. E. R. Hruschka and N. F. F. Ebecken. A genetic algorithm for cluster analysis. Intell. Data Anal, 7(l):15-25, 2003.
126. E. R. Hruschka, R. J. G. B. Campello, and L. N. de Castro. Evolutionary search for optimal fuzzy c-means clustering. In Proceedings of the IEEE International Conference on Fuzzy Systems, volume 2, pages 685-690, 2004a.
127. E. R. Hruschka, L. N. de Castro, and R. J. G. B. Campello. Evolutionary algorithms for clustering gene-expression data. In Proc. ICDM'04, pages 403-06, 2004b.
128. E. R. Hruschka, R. J. G. B. Campello, and L. N. de Castro. Evolving clusters in gene-expression data. Information Sciences, 176(13): 1898-1927, 2006.
129. E. Hunt, J. Martin, and P. Stone. Experiments in Induction. Academic Press, New York, 1966.
130. A. Hyvarinen, J. Karhunen, and E. Oja. Independent Component Analysis. Series on Adaptive and Learning Systems for Signal Processing, Communications and Control. Wiley, 2001.
131. R. L. Iman and J. M. Davenport. Approximations of the critical region of the Friedman statistic. Communications in Statistics, pages 571-595, 1980.
132. C. Jacob. Stochastic search methods. In M. Berthold and D.J. Hand, editors, Intelligent data analysis: An Introduction. Springer, 2003. 2nd Edition.
133. A. K. Jain, M. N. Murty, and P. J. Flynn. Data clustering: A review. ACM Computing Surveys,, 31(5):264-323, 1999.
134. A. Jakulin and I. Bratko. Analyzing attribute dependencies. In Proc. PKDD 2003, pages 229- 240, Berlin, 2003. Springer Verlag.
135. R. Jeffrey. Formal Logic: Its Scope and Limits. McGraw-Hill, 1981.
136. T. Joachims. Transductive inference for text classification using support vector machines. In Proceedings 16th International Conference on Machine Learning, pages 200-209, 1999.
137. K. De Jong. Genetic-algorithms-based learning. In Y. Kodratoff and R. S. Michalski, editors, Machine Learning, An Artificial Intelligence Approach, volume 3. Morgan Kaufmann, 1990.
138. B. Julesz, E. N. Gilbert, L. A. Shepp, and H. L. Frisch. Inability of humans to discriminate between visual textures that agree in second-order-statistics. Perception, 2:391-05, 1973.
139. S. Kaski. Dimensionality reduction by random mapping: fast similarity computation for clustering. In Proc. IEEE International Joint Conference on Neural Networks, pages 413-18, 1998.
140. L. Kaufman and P. J. Rousseeuw. Finding Groups in Data: an Introduction to Cluster Analysis. John Wiley & Sons, New York, 1990.
141. M. Kearns. Efficient noise-tolerant learning from statistical queries. In Proc. 25th Annu. ACM Sympos. Theory Comput., pages 392-401, New York, 1993. ACM Press.
142. M. Kearns and L. G. Valiant. Cryptographic limitations on learning Boolean formulae and finite automata. In Proc. of the 21st Symposium on Theory of Computing, pages 433-444, New York, 1989. ACM Press.
143. M. J. Kearns and R. E. Schapire. Efficient distribution-free learning of probabilistic concepts. In Proc. of the 31st Symposium on the Foundations of Comp. Sci. (1990), pages 382-391, Los Alamitos, CA, 1990. IEEE Computer Society Press,.
144. M. J. Kearns and U. V. Vazirani. An Introduction to Computational Learning Theory. The MIT Press., 1994.
145. R. King, S. Muggleton, R. Lewis, and M. Sternberg. Drug design by machine learning: The use of ILP to model the structure-activity relationship of trimethoprim analogues binding to dihydrofolate reductase. National Academy of Sciences, 1992.
146. R. King, K. Whelan, F. Jones, P. Reiser, C. Bryant, S. Muggleton, D. Kell, and S. Oliver. Functional genomic hypothesis generation and experimentation by a robot scientist. Nature, 427:247-252, 2004.
147. K. Kinnear, editor. Advances in Genetic Programming. MIT Press, Cambridge, MA, 1994.
148. K. Kira and L. Rendell. A practical approach to feature selection. In D. Sleeman and P. Edwards, editors, Proc. Intern. Conf. on Machine Learning, pages 249-256, Aberdeen, UK, 1992a. Morgan Kaufmann.
149. K. Kira and L. Rendell. The feature selection problem: traditional methods and new algorithm. In AAAl-92, 1992b. San Jose, CA.
150. S. Kirkpatrick, C. D. Gelatt, and M. P. Vecchi. Optimization by simulated annealing. Science, 220:671-680, 1983.
151. D. Klein, S. D. Kamvar, and C. Manning. From instance-level constraints to space-level constraints: Making the most of prior knowledge in data clustering. In Proc. of 19th Intl. Conf. on Machine Learning (ICML-2002), pages 307-314, 2002.
152. Y. Kodratoff and R. S. Michalski, editors. Machine Learning, An Artificial Intelligence Approach, volume 3. Morgan Kaufmann, 1990.
153. R. Kohavi and G. John. The wrapper approach. In H. Liu and H. Motoda, editors, Feature Extraction, Construction and Selection: A Data Mining Perspective, pages 33-50. Springer Verlag, Berlin, 1996.
154. T. Kohonen. Self-Organizing Maps. Springer, Berlin, Heidelberg, New York, 2001. 3rd Extended Edition.
155. T. Kohonen. Clustering, taxonomy, and topological maps of patterns. In Proc. Sixth Int. Conf. on Pattern Recognition, pages 1148-1151, Munich, Germany, 1982.
156. T. Kohonen. Self-Organization and Associative Memory. Berlin: Springer-Verlag, 1984.
157. I. Kononenko. Bayesian neural networks. Biological Cybernetics, 61:361-370, 1989a.
158. I. Kononenko. ID3, sequential Bayes, naive Bayes and Bayesian neural networks. In 4th European Working Session on Learning, pages 91-98, Montpellier, France, 1989b.
159. I. Kononenko. Bayesian neural network based expert system shell. International Journal on Neural Networks, 2:43-7, 1991a.
160. I. Kononenko. Semi-naive Bayesian classifier. In Y. Kodratoff, editor, European Working Session on Learning'91, pages 206-219. Springer-Verlag, 1991b. Porto, March 4-6.
161. I. Kononenko. Inductive and Bayesian learning in medical diagnosis. Applied Artificial Intelligence, 7:317-337, 1993.
162. I. Kononenko. Estimating attributes: Analysis and extensions of RELIEF. In L. De Raedt and F. Bergadano, editors, European Conf. on Machine Learning, pages 171-182, Catania, Italy, 1994. Springer Verlag.
163. I. Kononenko. On biases in estimating multivalued attributes. In Int. Joint Conf. on Artificial Intelligence 1JCAI-95, pages 1034-1040, 1995. Montreal, August 20-25.
164. I. Kononenko. Science and spirituality. Technical report, FRI, 2002. URL lkm.fri.uni-lj.si/xaigor/eng/sas.htm.
165. I. Kononenko and I. Bratko. Information based evaluation criterion for classifier's performance. Machine Learning, 6:67-80, 1991.
166. I. Kononenko and S. J. Hong. Attribute selection for modeling. Future Generation Computer Systems, 13(2-3): 181-195, 1997.
167. I. Kononenko and M. Kovacic. Stochastic generation of multiple rules. In Proc. Machine Learning Conf, Aberdeen, Scotland, 1992.
168. I. Kononenko and N. Lavrac. Prolog Through Examples. Sigma Press, Wilmslow, Cheshire, UK, 1988.
169. I. Kononenko, I. Bratko, and E. Roskar. Experiments in automatic learning of medical diagnostic rules. In Proc. International School for the Synthesis of Expert's Knowledge Workshop, Bled, Slovenia, 1984.
170. I. Kononenko, B. Cestnik, and I. Bratko. Assistant Professional User's Guide. Jozef Stefan Institute, Ljubljana, 1988.
171. I. Kononenko, M. Robnik-Sikonja, and U. Pompe. ReliefF for estimation and discretization of attributes in classification, regression, and ILP problems. In A. Ramsey, editor, AIMSA-96, pages 31-40. IOS Press, 1996. Sozopol, Bulgaria.
172. I. Kononenko, E. Simec, and M. Robnik. Overcoming the myopia of inductive learning algorithms. Applied Intelligence, 7:39-55, 1997.
173. I. Kononenko, M. Bevk, A. Sadikov, and L. Sajn. Classification of different types of coronas using parametrization of images and machine learning. In K. Korotkov, editor, Measuring energy fields: state of the science, volume 1, pages 193-208. Fair Lawn: Backbone, 2004. GDV bioelectrography series.
174. K. Korotkov. Aura and Consciousness. State Editing & Publishing Unit "Kultura", 1998. St.Petersburg, Russia.
175. B. Kosko. Constructing an associative memory. Byte, pages 137-144, 1987.
176. B. Kosko. Bidirectional associative memories. IEEE Trans, on Systems, Man, and Cybernetics, 18(l):49-50, 1988.
177. M. Kovacic. Markovian neural networks. Biological Cybernetics, 64:337-342, 1991.
178. J. R. Koza. Genetic Programming: On the Programming of Computers by Means of Natural Selection. MIT Press, Cambridge, MA, 1992.
179. M. Kubat and S. Matwin. Addressing the curse of imbalanced training sets: One sided selection. In Proc. Fourteenth Intl. Conf. Machine Learning, pages 179-186. Morgan Kaufmann, 1997.
180. M. Kukar. Transductive reliability estimation for medical diagnosis. Artif. intell. med., pages 81-106, 2003.
181. M. Kukar. Quality assessment of individual classifications in machine learning and data mining. Knowledge and Information Systems, 9(3):364-384, 2006.
182. M. Kukar and I. Kononenko. Reliable classifications with machine learning. In T. Elomaa, H. Mannila, and H. Toivonen, editors, Proc. 13th European Conference on Machine Learning, pages 219-231. Springer, 2002. Helsinki, Finland, August 19-23.
183. M. Kukar and I. Kononenko. Cost-sensitive learning with neural networks. In Proc. European Conference on Artificial Intelligence ECAI'98, pages 445-449, Brighton, UK, 1998.
184. W. Langdon, L. Spector, U. M. O'Reilly, and P. J. Angeline, editors. Advances in Genetic Programming 3. MIT Press, Cambridge, MA, 1998.
185. E. Lausch. Manipulation - Der Griff nach dem Gehirn. Deutsche Verlags-Anstalt, Stuttgart, 1972.
186. N. Lavrac and S. Dzeroski. Inductive logic programming: techniques and applications. Ellis Horwood, 1994.
187. N. Lavrac, A. Varsek, M. Gams, I. Kononenko, and I. Bratko. Automatic construction of the knowledge base for a steel classification expert system. In The 6th Int. Workshop on Expert Systems and Their Applications, pages 727-740, 1986. Avignon.
188. N. Lavrac, E. Keravnou, and B. Zupan. Intelligent data analysis in medicine. In N. Lavrac E. Keravnou, and B. Zupan, editors, Proc. Intelligent Data Analysis in Medicine and Pharmacology (IDAMAP-97), pages 33-39, Nagoya, Japan, 1997.
189. D. N. Lawley and A. E. Maxwell. Factor Analysis as a Statistical Method. Butterworths, 2nd edition, 1971.
190. D. B. Lenat. The role of heuristics in learning by discovery: Three case studies. In R. Michalski, J.G. Carbonell, and T.M. Mitchell, editors, Machine Learning, An Artificial Intelligence Approach. Tioga, 1983.
191. D. B. Lenat and J. S. Brown. Why AM and EURISKO appear to work. Artificial Intelligence, pages 269-294, 1984.
192. D. B. Lenat and E. A. Feigenbaum. On the thresholds of knowledge. In Proc. 10th International Joint Conference on Artificial Intelligence. Morgan-Kaufmann, 1987.
193. M. Li and P. Vitanyi. An Introduction to Kolmogorov Complexity and its Applications. Springer Verlag, 1993.
194. A. Likas, N. A. Vlassis, and J. J. Verbeek. The global k-means clustering algorithm. Pattern Recognition, 36(2):451-461, 2003.
195. R. Lindsay, B. Buchanan, E. Feigenbaum, and J. Lederberg. DENDRAL: A case study of the first expert system for scientific hypothesis formation. Artificial Intelligence, 61(2):209-261, 1993.
196. N. Littlestone. Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2:285-318, 1988.
197. G. L. Liu. Introduction to the combinatorial mathematics. McGraw Hill, New York, 1968.
198. H. Liu and H. Motoda. Feature Extraction, Construction and Selection: A Data Mining Perspective. Springer Verlag, Berlin, Heidelberg, New York, 1996.
199. J.W.Lloyd. Foundations of Logic Programming. Springer Verlag, 1984.
200. D. Lorimer, editor. The Spirit of Science. Floris Books, Edinburgh, 1998.
201. D. Luo. Pattern Recognition And Image Processing. Horwood Publishing, Chichester, 1998.
202. W. Maass and G Turân. Lower bound methods and separation results for on-line learning models. Machine Learning, 9:107-145, 1992.
203. W. Maass and M. K. Warmuth. Efficient learning with virtual threshold gates. In Proc. 12th International Conference on Machine Learning, pages 378-386, San Mateo, CA., 1995. Morgan Kaufmann.
204. J. MacQueen. Some methods for classification and analysis of multivariate observations. In Proceedings of the Fifth Berkeley Symposium on Mathematical Statistics and Probability, pages 281-297, 1967. Sri Nisargadatta Maharaj. I am That. Chetana, Mumbai, India, 1973.
205. Sri Nisargadatta Maharaj. I am That. Chetana, Mumbai, India, 1973.
206. Z. Manna. Mathematical Theory of Computation. McGraw-Hill, 1974.
207. R. L. Mantaras. ID3 revisited: A distance based criterion for attribute selection. In Int. Symp. Methodologies for Intelligent Systems, Charlotte, North Carolina, U.S.A. 1989.
208. K. V. Mardia, J.T. Kent, and J.M. Bibby. Multivariate Analysis. Probability and Mathematical Statistics. Academic Press, 1979.
209. J. L. McClelland and D. E. Rumelhart, editors. Parallel Distributed Processing: Psychological and Biological Models, volume 2. Cambridge: MIT Press, 1986.
210. R. J. McEliece, E. C. Posner, E. R. Rodemich, and S. S. Venkatesh. The capacity of the Hopfield associative memory. IEEE Trans, on Information Theory, IT-33(4):461-482, 1987.
211. R. Michalski and G. Tecuci, editors. Machine Learning: A Multistrategy approach, volume IV. Morgan Kaufmann, 1994.
212. R. Michalski, J. G. Carbonell, and T. M. Mitchell, editors. Machine Learning, An Artificial Intelligence Approach. Tioga, 1983.
213. R. Michalski, J. G. Carbonell, and T. M. Mitchell, editors. Machine Learning, An Artificial Intelligence Approach, volume 2. Morgan Kauffman, 1986.
214. R. S. Michalski and R. L. Chilausky. 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. Int. Journal of Policy Analysis and Information Systems, 4:125-161, 1980.
215. R. S. Michalski, I. Bratko, and M. Kubat, editors. Machine Learning, Data Mining and Knowledge Discovery: Methods and Applications. John Wiley & Sons, 1998.
216. D. Michie. Personal models of rationality. Journal of Statistical Planning and Inference, 21, 1989. Special Issue on Foundations and Philosophy of Probability and Statistics.
217. D. Michie and R. A. Chambers. BOXES: An experiment in adaptive control. In E. Dale andD. Michie, editors, Machine Intelligence 2. Edinburgh: Oliver and Boyd, 1968.
218. D. Michie and R. Johnston. The Creative Computer: Machine Intelligence and Human Knowledge. New York: Viking, 1984.
219. G. W. Milligan and M. C. Cooper. An examination of procedures for determining the number of clusters in a data set. Psychometrika, pages 159-179, 1985.
220. M. Minsky and S. Papert. Perceptrons. Cambridge, MA: MIT Press, 1969.
221. T. M. Mitchell. Machine Learning. McGraw-Hill, 1997.
222. M. Mozina, J. Demsar, M. Kattan, and B. Zupan. Nomograms for visualization of naive Bayesian classifier. In ECML-04. Springer Verlag, 2004. Pisa, Italy.
223. S. Muggleton. Inductive Logic Programming. Academic Press, 1992.
224. C. Nadeau and Y. Bengio. Inference for the generalization error. Machine learning, 52:239-281, 2003.
225. B. K. Natarajan. Machine Learning: A Theoretical Approach. Morgan Kaufmann, San Mateo, CA 1991.
226. R. Neapolitan and K. Naimipour. Foundations of Algorithms. D.C. Heath and Company, Lexington,MA, Toronto, 1996.
227. T. Niblett and I. Bratko. Learning decision rules in noisy domains. In Expert Systems 86, 1986. Brighton, UK.
228. N. Ntlsson. Learning Machines. McGraw-Hill, 1965.
229. D. Osherson and S. Weinstein. Criteria of language learning. Information and Control, 52: 123-138, 1982.
230. D. Osherson, M. Stob, and S. Weinstein. Learning strategies. Information and Control, 53: 32-51, 1982.
231. D. N. Osherson, M. Stob, and S. Weinstein. Systems That Learn. Bradford Book, The MIT Press, 1986.
232. A. Paterson and T. Niblett. The ACLS User Manual. Intelligent Terminals Ltd, Glasgow, 1982.
233. M. Pazzani, C. Merz, P. Murphy, K. Ali, T. Hume, and C. Brunk. Reducing misclassification costs: Knowledge-intensive approaches to learning from noisy data. In Proc. Eleventh Intl. Conf. Machine Learning, pages 217-225. Morgan Kaufmann, 1994.
234. J. Pearl. Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference. San Mateo, CA: Morgan Kaufmann Publishers, 1988.
235. K. Pearson. Principal components analysis. The London, Edinburgh, and Dublin Philosophical Magazine and Journal of Science, page 559, 1901.
236. R.Penrose. The Emperor's New Mind. Oxford University Press, 1989.
237. V. Pirnat, I. Kononenko, T. Jane, and I. Bratko. Medical estimation of automatically induced decision rules. In 2nd Europ. Conf. on Artificial Intelligence in Medicine, pages 24-36, 1989. City University, London, August 29-31.
238. L. Pitt and L. Valiant. Computational limitations on learning from examples. Journal of ACM 35, pages 965-984, 1988.
239. L. Pitt and M. K. Warmuth. Prediction preserving reducibility. J. of Comput. Syst. Sci. 41(3), pages 430-467, 1990.
240. W. H. Press, S. A. Teukolsky, W. T. Vettering, and B. P. Flannery. Numerical recipes in C: The art of scientific computing. Cambridge University Press, 1988.
241. F. Provost and T. Fawcett. Robust classification for imprecise environments. Machine Learning, 42:3:203231,2001.
242. F. Provost, T. Fawcett, and R. Kohavi. The case against accuracy estimation for comparing induction algorithms. In Proc. Fifteenth Intl. Conf. Machine Learning, pages 445-553. Morgan Kaufmann, 1998.
243. J. R. Quinlan. Discovering rules from large collections of examples. In D. Michie, editor, Expert Systems in the Microelectronic Age. Edinburgh University Press, 1979.
244. J. R. Quinlan. Induction of decision trees. Machine Learning, 1:81-106, 1986.
245. J. R. Quinlan. Learning logical definitions from relations. Machine Learning, 5(3):239-266, 1990.
246. J. R. Quinlan. C4.5: Programs for Machine Learning. Morgan Kaufmann, 1993.
247. H. Ragavan and L. Rendell. Lookahead feature construction for learning hard concepts. In Proc. 10th Intern. Conf. on Machine Learning, pages 252-259, Amherst, MA, 1993. Morgan Kaufmann.
248. C. Rajski. A metric space of discrete probability distributions. Information and Control, 4: 373-377, 1961.
249. A. C. Rencher. Methods of Multivariate Analysis. John Wiley & Sons, 1995.
250. J. Rissanen. Modeling by the shortest data description. Automatica- Journal IFAC, 14:465-471, 1978.
251. J. Rissanen. A universal prior for integers and estimation by minimum description length. The Annals of Statistics, 11(2):416-431, 1993.
252. M. Robnik-Sikonja and I. Kononenko. An adaptation of Relief for attribute estimation in regression. In Proc. Int. Conf. on Machine Learning ICML-97, pages 296-304, Nashville, 1997.
253. M. Robnik-Sikonja and I. Kononenko. Theoretical and empirical analysis of ReliefF and RReliefF. Machine Learning, 53:23-69, 2003.
254. H.Rogers. Theory of Recursive Functions and Effective Computability. McGraw-Hill, 1967.
255. F. Rosenblatt. Principles of Neurodynamics. Spartan Books, Washington, DC, 1962.
256. D. E. Rumelhart and J. L. McClelland, editors. Parallel Distributed Processing: Foundations, volume 1. Cambridge: MIT Press, 1986.
257. D. E. Rumelhart and D. Zipser. Feature discovery by competitive learning. In D.E. Rumelhart and J.L. McClelland, editors, Parallel Distributed Processing: Foundations, volume 1. Cambridge: MIT Press, 1986.
258. D. E. Rumelhart, G. E. Hinton, and J. L. McClelland. A general framework for parallel distributed processing. In D. E. Rumelhart and J. L. McClelland, editors, Parallel Distributed Processing: Foundations, volume 1. Cambridge: MIT Press, 1986a.
259. D. E. Rumelhart, G. E. Hinton, and R. J. Williams. Learning internal representations by error propagation. In D. E. Rumelhart and J. L. McClelland, editors, Parallel Distributed Processing: Foundations, volume 1. Cambridge: MIT Press, 1986b.
260. J. A. Rushing, H. S. Ranagath, T. H. Hinke, and S. J. Graves. Using association rules as texture features. IEEE Transactions on Pattern Analysis and Machine Intelligence, pages 845-858, 2001.
261. P. Russell. The Brain Book: Know Your Own Mind and How to Use It. Routledge and Kegan Paul, London & Hawthorne, New York, 1979.
262. O. Sacks. The Man Who Mistook His Wife for a Hat and other Clinical Tales. Harper & Row Pub, 1985.
263. S. L. Salzberg. On comparing classifiers: Pitfalls to avoid and a recommended approach. Data Mining and Knowledge Discovery, 1:317-328, 1997.
264. A. L. Samuel. Some studies in machine learning using the game of checkers. IBM Journal, 3 (3), 1959.
265. R. E. Schapire. The strength of weak learnability. Machine Learning, 5(2): 197-227, 1990.
266. P. Schauer. Interferon. DDU Univerzum, Ljubljana, 1984.
267. H. P. Schwefel. Numerical Optimization of Computer Models. Wiley, Chichester, 1981.
268. J.R. Searle. The rediscovery of the Mind. MIT Press, Cambridge, MA, 1992.
269. C. E. Shannon and W. Weaver. The Mathematical Theory of Communications. Urbana: The University of Illinois Press, 1949.
270. E. Shapiro. Inductive inference of theories from facts. Research report 192, Dept. of Computer Sc., Yale University, New Haven, 1981.
271. J. W. Shavlik and T. G. Dietterich, editors. Readings in Machine Learning. Morgan Kaufmann, 1990.
272. J. Sinkkonen, S. Kaski, and J. Nikkila. Discriminative clustering: Optimal contingency tables by learning metrics. In T. Elomaa, H. Mannila, and H. Toivonen, editors, Proc. European Conf. on Machine Learning (ECML-2002), pages 418-430. Springer, 2002.
273. L. Sirovich and M. Kirby. A low-dimensional procedure for the characterisation of human faces. Journal of the Optical Society of America, pages 519-524, 1987.
274. R. Sloan. Types of noise in data for concept learning. In Proc. 1st Annu. Workshop on Comput. Learning Theory, pages 91-96, San Mateo, CA., 1988. Morgan Kaufmann.
275. A. Sloman. The emperor's real mind: review of Roger Penrose's The Emperor's New Mind: Concerning computers, minds and laws of physics. Artificial Intelligence, 56:355-396, 1992.
276. N. Slonim and N. Tishby. Document clustering using word clusters via the information bottleneck method. In Research and Development in Information Retrieval, pages 208-215, 2000.
277. P. Smolensky. Information processing in dynamical systems: Foundations of harmony theory. In D.E. Rumelhart and J.L. McClelland, editors, Parallel Distributed Processing: Foundations, volume 1. Cambridge: MIT Press, 1986.
278. P. Smyth and R. M. Goodman. Rule induction using information theory. In G. Piatetsky-Shapiro and W. Frawley, editors, Knowledge Discovery in Databases. MIT Press, 1990.
279. R. J. Solomonoff. A formal theory of inductive inference: Parts 1 and 2. Information and Control, 7:122 and 224254, 1964.
280. R. J. Solomonoff. Complexity-based induction systems: Comparisons and convergence theorems. IEEE Transaction on Information Theory, 24:422432, 1978.
281. R. Spence. Information Visualization. Addison-Wesley, 2001.
282. R. S. Sutton and A. G. Barto. Reinforcement Learning: An Introduction. MIT Press, 1998.
283. M. Taube. Computers and Common Sense: The Myth of Thinking Machines. New York: Columbia University Press, 1961.
284. G. Tesauro. Temporal difference learning of backgammon strategy. In Int. Machine Learning Conf, 1992. Aberdeen.
285. G. Tesauro. Temporal difference learning and td-gammon. Communications of the ACM, 38(3), 1995.
286. N. Tishby, F. C. Periera, and W. Bialek. The information bottleneck method. In Proc. 37th Allerton Conference on Communication and Computation, 1999.
287. E. Tolle. The Power of NOW. Namaste Publishing Inc., Canada, 1997.
288. M. Turk and A. Pentland. Eigenfaces for recognition. Journal of Cognitive Neuroscience, pages 71-86, 1991.
289. P. Turney. Cost-sensitive classification: empirical evaluation of a hybrid genetic decision tree induction algorithm. Journal of Artificial Intelligence Research, 2:369-409, 1995.
290. T. Urbancic and I. Bratko. Constructing control rules for dynamic system: probabilistic qualitative models, lookahead and exaggeration. Int. J. Syst. Sci., 24(6): 1155-1164, 1993.
291. H. Vafie and K. DeJong. Improving a rule induction system using genetic algorithms. In R. Michalski and G. Tecuci, editors, Machine Learning: A Multistrategy approach, volume IV. Morgan Kaufmann, 1994.
292. L. G. Valiant. A theory of the learnable. Commun. ACM 27, pages 1134-1142, 1984.
293. L. G. Valiant. Learning disjunctions of conjunctions. In Proc. 9th International Joint Conference on Artificial Intelligence,, pages 560-566, 1985.
294. V. Vapnik. The nature of Statistical Learning. Springer Verlag, 2nd edition, 2000.
295. V. Vapnik. The nature of Statistical Learning. Springer Verlag, 1st edition, 1995.
296. V. Vapnik. Statistical Learning Theory. John Wiley, New York, USA, 1998.
297. V. N. Vapnik and A. Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probab. and its Applications, 16(2):264-280, 1971. A. Varsek. Qualitative model evolution. In Proc. 12th Int. Joint Conf. on Artificial Intelligence IJCAI-91, pages 1311-1316. Morgan Kaufmann, 1991.
298. A. Varsek. Qualitative model evolution. In Proc. 12th Int. Joint Conf. on Artificial Intelligence IJCAI-91, pages 1311-1316. Morgan Kaufmann, 1991.
299. V. Vovk. Asymptotic optimality of transductive confidence machine. In N. Cesa-Bianchi, M. Numao, and R. Reischuk, editors, Proc. Thirteenth International Conference on Algorithmic Learning Theory, pages 336-350, Berlin, Heidelberg, New York, 2002. Springer Verlag. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In Proc. of 18th Intl. Conf. on Machine Learning (ICML-2001), pages 577-584, 2001.
300. K. Wagstaff, C. Cardie, S. Rogers, and S. Schroedl. Constrained k-means clustering with background knowledge. In Proc. of 18th Intl. Conf. on Machine Learning (ICML-2001), pages 577-584, 2001.
301. B.A.Wallace. The Taboo of Subjectivity: Towards a New Science of Consciousness. Oxford University Press, 2000.
302. M. P. Wand and M. C. Jones. Kernel Smoothing. Chapman and Hall, London, 1995.
303. P. D. Wasserman and T. Schwartz. Neural networks: What are they and why is everybody so interested in them now. part 1: Winter 1987, pp. 10-12, part 2: Spring 1988, pp. 10-15. IEEE Expert, 1987,1988.
304. A.S. Weigend, D.E. Rumelhart, and B.A. Huberman. Generalization by weight-elimination with application to forecasting. In R.P. Lippmann, J.E. Moody, and D.S. Tburetzky, editors, Advances in Neural Information Processing Systems 3, pages 875-882. San Mateo,CA: Morgan Kaufmann, 1991.
305. S. M. Weiss and C. Kulikowski. Computer Systems that Learn. Morgan Kaufmann, 1991.
306. A. P. White and W. Z. Liu. Bias in information-based measures in decision tree induction. Machine Learning, 15:321-329, 1994.
307. B. Widrow and R. Winter. Neural nets for adaptive filtering and adaptive pattern recognition. IEEE Computer, pages 25-39, 1988.
308. R. J. Williams. The logic of activation functions. In D.E. Rumelhart and J.L. McClelland, editors, Parallel Distributed Processing: Foundations, volume 1. Cambridge: MIT Press, 1986.
309. I. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations. Morgan Kaufmann, 2000.
310. I. H. Witten and E. Frank. Data Mining: Practical Machine Learning Tools and Techniques. Morgan Kaufmann, 2 n d edition, 2005.
311. A. J. W. Wong. Recognition of general patterns using neural networks. Biological Cybernetics, 58(6):361-372, 1988.
312. K. Woods, W. P. Kegelmeyer, and K. Bowyer. Combination of multiple classifiers using local acuracy estimates. IEEE Transactions on PAMI, 19(4):405-410, 1997.
313. E. P. Xing, A. Ng, M. Jordan, and S. Russell. Distance metric learning with applications to clustering with side information. Advances in Neural Information Processing, 15, 2003.
314. P. V. Yee and S. Haykin. Regularized Radial Basis Function Networks: Theory and Applications. Wiley, Chichester, 2001.
315. F. Zheng and G.I. Webb. A comparative study of semi-naive Bayes methods in classification learning. In Proceedings of the 4th Australasian Data Mining Workshop (AusDM05), pages 141-156, 2005.
316. B. Zupan. Machine Learning with Functional Decomposition. PhD thesis, University of Ljubljana, Faculty of Computer and Information Science, 1997. (in Slovene).
317. B. Zupan, M. Bohanec, J. Demsar, and I. Bratko. Learning by discovering concept hierarchies. Artificial Intelligence, 109:211-342, 1999.