1. Jonathan R.M. Hosking, Edwin P.D. Pednault, Madhu Sudan, “A statistical perspective on data mining”, Future Generation Computer Systems, 13:2-3 (1997), 117  crossref
  2. Filippo Neri, Lorenza Saitta, Lecture Notes in Computer Science, 1299, Information Extraction A Multidisciplinary Approach to an Emerging Information Technology, 1997, 171  crossref
  3. Joel Ratsaby, Vitaly Maiorov, “On the Value of Partial Information for Learning from Examples”, Journal of Complexity, 13:4 (1997), 509  crossref
  4. Joel Ratsaby, Vitaly Maiorov, Lecture Notes in Computer Science, 1208, Computational Learning Theory, 1997, 51  crossref
  5. Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, David Haussler, “Scale-sensitive dimensions, uniform convergence, and learnability”, J. ACM, 44:4 (1997), 615  crossref
  6. S.R. Kulkarni, M. Vidyasagar, “Learning decision rules for pattern classification under a family of probability measures”, IEEE Trans. Inform. Theory, 43:1 (1997), 154  crossref
  7. Evarist Gine, Lecture Notes in Mathematics, 1665, Lectures on Probability Theory and Statistics, 1997, 1  crossref
  8. D. Sarkar, “Randomness in generalization ability: a source to improve it”, IEEE Trans. Neural Netw., 7:3 (1996), 676  crossref
  9. M.C. Campi, P.R. Kumar, 2, Proceedings of 35th IEEE Conference on Decision and Control, 1996, 2308  crossref
  10. K.L. Buescher, P.R. Kumar, “Learning by canonical smooth estimation. II. Learning and choice of model complexity”, IEEE Trans. Automat. Contr., 41:4 (1996), 557  crossref
  11. Nanda Piersma, H. Edwin Romeijn, “Parallel machine scheduling: A probabilistic analysis”, Naval Research Logistics, 43:6 (1996), 897  crossref
  12. M. Vidyasagar, Identification, Adaptation, Learning, 1996, 400  crossref
  13. K.L. Buescher, P.R. Kumar, “Learning by canonical smooth estimation. I. Simultaneous estimation”, IEEE Trans. Automat. Contr., 41:4 (1996), 545  crossref
  14. Goran Peškir, Michel Weber, Convergence in Ergodic Theory and Probability, 1996, 305  crossref
  15. Michel Talagrand, “The Glivenko-Cantelli problem, ten years later”, J Theor Probab, 9:2 (1996), 371  crossref
  16. Andrew Nobel, “Histogram regression estimation using data-dependent partitions”, Ann. Statist., 24:3 (1996)  crossref
  17. Sanjeev R. Kulkarni, Learning and Geometry: Computational Approaches, 1996, 43  crossref
  18. Goran Peškir, “Uniform convergence of reversed martingales”, J Theor Probab, 8:2 (1995), 387  crossref
  19. Li-Xing Zhu, Ping Cheng, “The asymptotic tail behaviours of projection pursuit-type Kolmogorov statistics”, Statistics & Probability Letters, 25:3 (1995), 253  crossref
  20. Luc Devroye, Gábor Lugosi, “Lower bounds in pattern recognition and learning”, Pattern Recognition, 28:7 (1995), 1011  crossref
Предыдущая
1
2
3
4
5
6
7
Следующая