Tweleve numerical, symbolic and hybrid supervised classification methods

International Journal of Pattern Recognition and Artificial Intelligence

Volumn 12, Issue 5, 1998, Pages 517-571

  Gascuel, Olivier ^a,h   Bouchon Meunier, Bernadette ^b,h   Caraux, Gilles ^a,h   Gallinari, Patrick ^b,h   Guénoche, Alain ^c,h   Guermeur, Yann ^b,h   Lechevallier, Yves ^d,h   Marsala, Christophe ^b,h   Miclet, Laurent ^e,h   Nicolas, Jacques ^e,h   Nock, Richard ^a,h   Ramdani, Mohammed ^b,h   Sebag, Michèle ^f,h   Tallur, Basavanneppa ^e,h   Venturini, Gilles ^g,h   Vitte, Patrick ^c,h  

^a LIRMM   (France)

^b UNIVERSITÉ PIERRE ET MARIE CURIE   (France)

^c LIM CNRS   (France)

^d INRIA ROCQUENCOURT   (France)

^e CAMPUS DE BEAULIEU   (France)

^f LABORATOIRE DE MÉCANIQUE DES SOLIDES   (France)

^g Ecole Polytechnique ^*  (France)

^h French Research Group SYMENU   (France)

Author keywords

Classification trees; Discriminant analysis; Hybrid methods; Machine learning approaches; Neural networks; Statistical methods; Supervised classification; Waveform recognition problem

Indexed keywords

EID: 0003051662     PISSN: 02180014     EISSN: None     Source Type: Journal    
DOI: 10.1142/s0218001498000336     Document Type: Article

References (76)

1. S. Augier, G. Venturini and Y. Kodratoff, "Learning first order logic rules with a genetic algorithm", Proc. Int. Conf. Knowledge Discovery in Databases (KDD'95), AAAI Press, 1995, pp. 21-26.
2. R. Battiti, "First and second order methods for learning: between steepest descent and Newton's method", Neural Comput. 4 (1992) 141-166.
3. N. Bongard, Pattern Recognition, Spartan Books, 1970.
4. L. Breiman, J. H. Friedman, R. A. Olshen and C. J. Stone, Classification and Regression Trees, Wadsworth Inc., 1984.
5. F. De Carvalho and O. Gascuel, "SDL, a stochastic algorithm for learning decision lists with limited complexity", Ann. Math. Artif. Intell. 10 (1994) 281-302.
6. J. Catlett, On changing continous attributes into ordered discrete attributes", Lectures Notes in AI 482 (1991) 164-178.
7. C. Chang, "Finding prototypes for nearest neighbor classifiers", IEEE Trans. Comput. 26 (1974) 1179-1184.
8. S. L. Chung and R. Setiono, "Efficient neural network training on a cray Y-MP", Int. J. High Speed Comput. 7 (1995) 109-123.
9. P. Clark and T. Niblett, "Induction in Noisy domains", Progress in Machine Learning, eds. I. Bratko and N. Lavrac, Sigma Press, Wimslow, 1987, pp. 11-30.
10. M. Coster and J. L. Chermant, Précis d'analyse d'images. Presses du CNRS, Paris, 1989.
11. T. M. Cover and P. E. Hart, "Nearest neighbor pattern classification", IEEE Trans. Inform. Theor. 13 (1967) 21-27.
12. Y. Le Cun, B. Boser, J. S. Denker, D. Henderson, R. E. Howard, W. Hubbard and L.D. Jackel, "Back-propagation applied to handwritten zipcode recognition", Neural Comput. 1 (1989) 541-551.
13. D. V. Dasarathy, Nearest Neighbor (NN) Norms: NN Pattern Classification Techniques, IEEE Computer Society Press, Los Alamitos, CA, 1991.
14. T. G. Dietterich and R. S. Michalski, "A comparative review of selected methods for learning from examples", Machine Learning: An Artificial Intelligence Approach, eds. R. S. Michalski, J. G. Carbonell and T. M. Mitchell, Tioga, 1983, pp. 41-81.
15. R. O. Duda and P. E. Hart, Pattern Classification and Scene Analysis, John Wiley, 1973.
16. U. M. Fayyad and K. B. Irani, "Multi-interval discretization of continuous-valued attributes for classification learning", Proc. 13th Int. Joint Conf. Artificial Intelligence, Chambery, Aug. 1993.
17. R. A. Fisher, "The use of multiple measurements in taxonomic problems", Ann. Eugenics 7 (1936) 179-188.
18. W. D. Fisher, "On grouping for maximum homogeneity", J.A.S.A. 53 (1958) 789-798.
19. H. G. Flegg, L'algèbre de Boole et son Utilisation, Dunod, Paris, 1967.
20. J. H. Friedman, J. L. Bentley and R. A. Finkel, "An algorithm for finding best matches in logarithmic expected time", ACM Trans. Math. Software 3 (1977) 209-226.
21. K. Fukunaga, Statistical Pattern Recognition, Academic Press, 1990.
22. O. Gascuel, "A way to give and use knowledge in learning", Proc. 1st European Working Session on Machine Learning, Orsay, March 1986.
23. O. Gascuel, "Quelques aspects numériques de l'analyse symbolique des données", Induction Symbolique et Numérique, eds. E. Diday and Y. Kodratoff, Cepadues-Editions, Toulouse, 1991, pp. 327-359.
24. S. Geeman, E. Bienenstock and R. Doursat, "Neural networks and the bias variance dilemna", Neural Comput. 4 (1992) 1-58.
25. A. Guénoche and P. Vitte, "Discriminant analysis for sequences analysis: application to protein kinases", Technical Report 126, Laboratoire d'Informatique de Marseille, May 1995.
26. H. Guo and S. B. Gelfand, "Classification trees with neural network feature extraction", IEEE Trans. Neural Networks 3 (1992) 925-933.
27. D. J. Hand, Discrimination and Classification, John Wiley, 1981.
28. D. J. Hand, "Recent advances in error rate estimation", Patt. Recogn. Lett. 4 (1986) 335-346.
29. P. E. Hart, "The condensed nearest neighbor rule", IEEE Trans. Inform. Theor. 14 (1968) 515-516.
30. D. Haussler, "Quantifying inductive bias: AI learning algorithms and valiant's learning framework", Artif. Intell 36 (1988) 177-221.
31. J. Hertz, A. Krogh and R. G. Palmer, Introduction to the Theory of Neural Computation, Addison Wesley, 1991.
32. J. H. Holland, Adaptation in Natural and Artificial Systems, University of Michigan Press, Ann Arbor, 1975.
33. J. J. Hopfield, "Neural networks and physical systems with emergent collective computational abilities", Proc. National Academy of Sciences, USA 79 (1982) 2554-2558.
34. K. De Jong, "Learning with genetic algorithms: an overview", Mach. Learn. 3 (1988) 121-138.
35. R. D. King, C. Feng and A. Sutherland, "STATLOG: Comparison of classification algorithms on large real-world problems", Appl. Artif. Intell. 9 (1995) 289-333.
36. J. Kuntzmann and P. Naslin, Algèbre de Boole et Machines Logiques, Dunod, Paris, 1967.
37. Y. Lechevallier, "Recherche d'une partition optimale sous contrainte d'ordre total", Technical Report 1247, INRIA, Rocquencourt, Nov. 1990.
38. I. C. Lerman, "Foundations of the likelihood linkage analysis (LLA) classification method", Proc. Applied Stochastic Models and Data Analysis, Wiley, 1991, pp. 63-76.
39. C. Marsala and B. Bouchon-Meunier, "Fuzzy partitioning using mathematical morphology in a learning scheme", Proc. Int. Conf. Fuzzy Systems (FUZZ - IEEE'96), New Orleans, 1996, pp. 1512-1517.
40. W. S. McCulloch and W. Pitts, "A logical calculus of ideas immanent in nervous activity", Bull. Math. Biophys. 5 (1943) 115-133.
41. R. S. Michalski, "A theory and methodology for inductive learning", Machine Learning: An Artificial Intelligence Approach, eds. R. S. Michalski, J. G. Carbonell and T. M. Mitchell, Tioga, 1983, pp. 83-134.
42. R. S. Michalski, I. Mozetic, J. Hong and N. Lavrac, "The multi-purpose incremental learning system AQ15 and its testing application to three medical domains", Proc. AAAI-86 5th National Conference on Artificial Intelligence, 1986.
43. T. Mitchell, "Generalization as search", Artif. Intell. 18 (1982) 203-226.
44. M. F. Möller, "A scaled conjugate gradient algorithm for fast supervised learning", Neural Networks 6 (1993) 525-533.
45. S. H. Muggleton, ed., Inductive Learning Programming, Academic Press, 1992.
46. J. Nicolas, "Une représentation efficace pour les Espaces de Versions", Proc. Journées Francophone d'Apprentissage, Apr. 1993.
47. J. Nicolas and I. C. Lerman, "Combining numeric and symbolic tools: a case study in pattern recognition", Proc. Applied Stochastic Models and Data Analysis, Wiley, May 1991.
48. R. Nock and O. Gascuel, "On learning decision committees", Proc. Int. Conf. Machine Learning, July 1995.
49. E. Parzen, "On estimation of a probability density function and mode", Ann. Math. Stat. 33 (1962) 1065-1076.
50. J. R. Quinlan, "Induction of decision trees", Mach. Learn. 1 (1986) 86-106.
51. J. R. Quinlan, "Probabilistic decision trees", Mach. Learn. 3 (1990) 140-152.
52. J. Quinqueton and J. Sallantin, "Expansion and compression of binary data to build features by learning", Proc. 6th Int. Joint. Conf. Pattern Recognition, Aug. 1983.
53. M. Ramdani, Système d'induction formelle à base de connaissances imprécises. Thèse de l'Université P. & M. Curie, 1994.
54. B. D. Ripley, "Neural networks and related methods for classification", J. R. Stat. Soc. B56 (1994) 409-456.
55. R. Rivest , "Learning decision lists", Mach. Learn. 2 (1987) 229-246.
56. F. Rosenblatt, "The perceptron: a probabilistic model for information storage and organisation of the brain", Psychol. Rev. 65 (1958) 386-407.
57. D. E. Rumelhart, G. E. Hinton and R. J. Williams, "Learning internal representations by error propagation", Parallel Distributed Processing, Vol. 1, Chap. 8, MIT Press, Cambridge, 1986, pp. 318-362.
58. M. Sebag, "A constraint-based induction algorithm in FOL", Proc. Int. Conf. Machine Learning, Morgan Kaufmann, July 1994.
59. M. Sebag, "Delaying the choice of bias: a disjunctive version space approach", Proc. Int. Conf. Machine Learning, Morgan Kaufman, July 1996.
60. T. Sejnowski and C. Rosenberg, "Parallel networks that learn to pronounce English text", Complex Syst. 1 (1987) 145-168.
61. J. Serra, Image Analysis and Mathematical Morphology, Academic Press, New York, 1982.
62. W. Shavlik, R. Mooney and G. Towell, "Symbolic and neural net learning algorithms: an artificial comparison", Mach. Learn. 6 (1991) 11-143.
63. E. Shortliffe, Computer Based Medical Consultations: MYCIN, American Elsevier, New York, 1976.
64. J. A. Sonquist and J. N. Morgan, "The detection of interaction effects", Technical Report, Institute for Social Research, University of Michigan, Ann Arbor, 1963.
65. G. T. Toussaint, "Bibliography on estimation of misclassification", IEEE Trans. Inform. Theor. 20 (1974) 472-479.
66. P. E. Utgoff, "Incremental induction of decision trees", Mach. Learn. 4 (1989) 161-186.
67. P. P. Van der Smagt, "Minimisation methods for training feedforward neural networks", Neural Networks 7 (1994) 1-11.
68. V. N. Vapnik and Y. A. Chervonenkis, "On the uniform convergence of relative frequencies of events to their probabilities", Theor. Probability Appl. 16 (1971) 264-280.
69. G. Venturini, Apprentissage adaptatif et apprentissage supervisé par algorithme génétique, Thèse de doctorat, Université de Paris XI, Orsay, 1994.
70. S. A. Vere, "Inductive learning of relational productions", Pattern-Directed Inference Systems, eds. D. A. Watterman and F. Hayes-Roth, Academic Press, New York, 1978, pp. 281-296.
71. E. R. Vidal Ruiz, "An algorithm for finding nearest neighbors in (approximately) constant average time", Patt. Recogn. Lett. 4 (1986) 145-157.
72. I. Wegener, The Complexity of Boolean Functions, John Wiley, Chichester, 1987.
73. B. Widrow and M. E. Hoff, "Adaptative switching circuits", IRE WESCON Convention Record, Part 4, New York, 1960, pp. 96-104.
74. D. Wilson, "Asymptotic properties of nearest neighbor rules using edited data", IEEE Trans. Syst. Man Cybern. 2 (1972) 408-421.
75. P. H. Winston, "Learning structural descriptions from examples", The Psychology of Computer Vision, ed. P. H. Winston, Mc Graw Hill, New York, 1975, pp. 157-209.
76. L. A. Zadeh, "Fuzzy sets", Information Control, 1965, pp. 338-353.