Skip to main content
Have a personal or library account? Click to login
Random Projection RBF Nets for Multidimensional Density Estimation Cover
Open Access
|Dec 2008

References

  1. Achlioptas D. (2001). Database friendly random projections,, Santa Barbara, CA, USA, pp. 274-281.
  2. Ailon N. and Chazelle B. (2006). Approximate nearest neighbors and the fast Johnson-Lindenstrauss transform,, Seattle, WA, USA, pp. 557-563.
  3. Arriaga R. and Vempala S. (1999). An algorithmic theory of learning: Robust concepts and random projection,, New York, NY, USA, pp. 616-623.
  4. Bishop C. M. (1994). Novelty detection and neural-network validation,, 141:217-222.
  5. Bishop C. M. (1995)., Oxford University Press, Oxford.
  6. Bowman A. W. (1995). An alternative method of cross-validation for the smoothing of density estimates,71(2): 353-360.
  7. Broomhead D. and Lowe D. (1988). Multivariable functional interpolation and adaptive networks,2(11): 321-323.
  8. Buhmann M. D. (1988)., Cambridge University Press, Cambridge.
  9. Chen S., Cowan C. F. N. and Grant P. M. (1991). Orthogonal least squares learning algorithm for radial basisfunction networks,2(2): 302-307.
  10. Chen S., Hong X. and Harris C. J. (2004). Sparse kernel density construction using orthogonal forward regression with leave-one-out test score and local regularization,, 34(4): 1708-1717.
  11. Dasgupta S. and Gupta A. (2003). An elementary proof of a theorem of Johnson and Lindenstrauss,22(1): 60-65.
  12. Devroye L. and Györfi L. (1985).Wiley, New York, NY.
  13. Devroye L., Györfi L. and Lugosi G. (1996)., Springer-Verlag, New York, NY.
  14. Frankl P. and Maehara H. (1987). The Johnson-Lindenstrauss lemma and the sphericity of some graphs,44(3): 355-362.
  15. Gertler J. J. (1998)., Marcel Dekker, New York, NY.
  16. Guh R. (2005). A hybrid learning based model for on-line detection and analysis of control chart patterns,49(1): 35-62.
  17. Holmström L. and Hämäläinen A. (1993). The self-organizing reduced kernel density estimator,, San Francisco, CA, USA, 1: 417-421.
  18. Haykin S. (1999)., Prentice-Hall, Upper Saddle River, NJ.
  19. Indyk P. and Motwani R. (1998). Approximate nearest neighbors: Towards removing the curse of dimensionality,, Dallas, TX, USA, pp. 604-613.
  20. Indyk P. and Naor A. (2006). Nearest neighbor preserving embeddings,(to appear).
  21. Johnson W. B. and Lindenstrauss J. (1984). Extensions of Lipshitz mapping into Hilbert space,26: 189-206.
  22. Jones M. C., Marron J. S. and Sheather S. J. (1996). A brief survey of bandwidth selection for density estimation,91(433): 401-407.
  23. Karayiannis N. B. (1999). Reformulated radial basis neural networks trained by gradient descent,10(3): 657-671.
  24. Krzyżak A. (2001). Nonlinear function learning using optimal radial basis function networks,47(1): 293-302.
  25. Krzyżak A., Linder T. and Lugosi G. (2001). Nonparametric estimation and classification using radial basis function nets and empirical risk minimization,7(2): 475-487.
  26. Krzyżak A. and Niemann H. (2001). Convergence and rates of convergence of radial basis functions networks in function learning,47(1): 281-292.
  27. Krzyżak A. and Skubalska-Rafajłowicz E. (2004). Combining space-filling curves and radial basis function networks,, 3070: 229-234, Springer-Verlag, Berlin.
  28. Korbicz J., Kościelny J. M., Kowalczuk Z. and Cholewa W. (Eds) (2004)., Springer-Verlag, Berlin.
  29. Leonard J. A., and Kramer M. A. (1990). Classifying process behaviour with neural networks: Strategies for improved training and generalization,, San Diego, CA, USA, pp. 2478-2483.
  30. Leonard J. A., and Kramer M. A. (1991). Radial basis networks for classifying process faults,11(3): 31-38.
  31. Li Y., Pont M. J. and Jones N. B. (2002). Improving the performance of radial basis function classifiers in condition monitoring and fault diagnosis applications where ‘unknown’ faults may occur,23(5): 569-577.
  32. Li P., Hastie T. J. and Church K. W. (2007). Nonlinear Estimators and tail bounds for dimension reduction in 11 using Cauchy random projections,8(10): 2497-2532.
  33. Li P., Hastie T. J. and Church K. W. (2006)., Technical report, Stanford University.
  34. Magdon-Ismail M. and Atiya A. (2002). Density estimation and random variate generation using multilayer networks,13(3): 497-520.
  35. Moody J. and Darken C. J. (1989). Fast learning in networks of locally tuned processing units,1(2): 281-294.
  36. Patton R. J. (1994). Robust model-based fault diagnosis: The state of the art,, Espoo, Finland, pp. 1-24.
  37. Patton R. J., Chen J. and Benkhedda H. (2000). A study on neurofuzzy systems for fault diagnosis,31(11): 1441-1448.
  38. Parzen E. (1962). On estimation of a probability density function and mode,33(3): 1065-1076.
  39. Poggio T. and Girosi F. (1990). Networks for approximation and learning,78(9): 484-1487.
  40. Powell M. J. D. (1987). Radial basis functions for multivariable interpolation: A review,(J. C. Mason, M. G. Cox, Eds.), Clarendon Press, Oxford, pp. 143-167.
  41. Rafajłowicz E. (2006). RBF nets in fault localization,, LNCS, Springer-Verlag, Berlin/Heidelberg, 4029/2006: 113-122.
  42. Rafajłowicz E., Skubalska- Rafajłowicz E. (2003). RBF nets based on equidistributed points,, Szczecin, Poland, 2: 921-926.
  43. Roberts S. (2000). Extreme value statistics for novelty detection in biomedical data processing,147 (6): 363-367.
  44. Schlorer H. and Hartman U. (1992). Mapping neural networks derived from the Parzen window estimator,5(6): 903-909.
  45. Skubalska-Rafajłowicz E. (2000). On using space-filling curves and vector quantization for constructing multidimensional control charts,, Zakopane, Poland, pp. 162-167.
  46. Skubalska-Rafajłowicz E. (2006a). RBF neural network for probability density function estimation and detecting changes in multivariate processes,, LNCS, Springer-Verlag, Berlin/Heidelberg 4029/2006: 133-141.
  47. Skubalska-Rafajłowicz E. (2006b). Self-organizing RBF neural network for probability density function estimation,, Międzyzdroje, Poland, pp. 985-988.
  48. Specht D. F. (1990). Probabilistic neural networks,3(1): 109-118.
  49. Vempala S. (2004)., American Mathematical Society, Providence, RI.
  50. Wettschereck D. and Dietterich T. (1992). Improving the performance of radial basis function networks by learning center locations,(B. Spatz, Ed.), Morgan Kaufmann, San Mateo, CA, Vol. 4, pp. 1133-1140.
  51. Willsky A. S. (1976). A survey of design methods for failure detection in dynamic systems,12(6): 601-611.
  52. Xu L., Krzyżak A. and Yuille A. (1994). On radial basis function nets and kernel regression: Statistical consistency, convergence rates, and receptive field size,7(4): 609-628.
  53. Yee P. V. and Haykin S. (2001)., John Wiley, New York, NY.
  54. Yin H. and Allinson N. M. (2001). Self-organising mixture networks for probability density estimation,12(2): 405-411.
  55. Zorriassatine F., Tannock J. D. T. and O'Brien C. (2003). Using novelty detection to identify abnormalities caused by mean shifts in bivariate processes,44(3): 385-408.
DOI: https://doi.org/10.2478/v10006-008-0040-9 | Journal eISSN: 2083-8492 | Journal ISSN: 1641-876X
Language: English
Page range: 455 - 464
Published on: Dec 30, 2008
Published by: University of Zielona Góra
In partnership with: Paradigm Publishing Services
Publication frequency: 4 issues per year

© 2008 Ewa Skubalska-Rafajłowicz, published by University of Zielona Góra
This work is licensed under the Creative Commons License.