A generative model and a generalized trust region Newton method for noise reduction

被引:5
作者
Pulkkinen, Seppo [1 ,2 ]
Makela, Marko M. [2 ]
Karmitsa, Napsu [2 ]
机构
[1] Turku Ctr Comp Sci TUCS, Turku 20014, Finland
[2] Univ Turku, Turku 20014, Finland
关键词
Principal manifold; Noise reduction; Generative model; Ridge; Density estimation; Trust region; Newton method; BANDWIDTH SELECTION; MEAN-SHIFT; DIMENSIONALITY REDUCTION; PRINCIPAL MANIFOLDS; DENSITY;
D O I
10.1007/s10589-013-9581-4
中图分类号
C93 [管理学]; O22 [运筹学];
学科分类号
070105 ; 12 ; 1201 ; 1202 ; 120202 ;
摘要
In practical applications related to, for instance, machine learning, data mining and pattern recognition, one is commonly dealing with noisy data lying near some low-dimensional manifold. A well-established tool for extracting the intrinsically low-dimensional structure from such data is principal component analysis (PCA). Due to the inherent limitations of this linear method, its extensions to extraction of nonlinear structures have attracted increasing research interest in recent years. Assuming a generative model for noisy data, we develop a probabilistic approach for separating the data-generating nonlinear functions from noise. We demonstrate that ridges of the marginal density induced by the model are viable estimators for the generating functions. For projecting a given point onto a ridge of its estimated marginal density, we develop a generalized trust region Newton method and prove its convergence to a ridge point. Accuracy of the model and computational efficiency of the projection method are assessed via numerical experiments where we utilize Gaussian kernels for nonparametric estimation of the underlying densities of the test datasets.
引用
收藏
页码:129 / 165
页数:37
相关论文
共 42 条
  • [1] [Anonymous], 2008, LECT NOTES COMPUTATI
  • [2] [Anonymous], 1994, Kernel smoothing
  • [3] Connectivity of projected high dimensional data charts on one-dimensional curves
    Bas, E.
    Erdogmus, D.
    [J]. SIGNAL PROCESSING, 2011, 91 (10) : 2404 - 2409
  • [4] Bas E., 2011, THESIS NE U BOSTON
  • [5] Bas E, 2011, INT CONF ACOUST SPEE, P2276
  • [6] Laplacian eigenmaps for dimensionality reduction and data representation
    Belkin, M
    Niyogi, P
    [J]. NEURAL COMPUTATION, 2003, 15 (06) : 1373 - 1396
  • [7] Bishop C., 1999, Learning in Graphical Models, P371, DOI DOI 10.1017/S0140525X10000798
  • [8] GTM: The generative topographic mapping
    Bishop, CM
    Svensen, M
    Williams, CKI
    [J]. NEURAL COMPUTATION, 1998, 10 (01) : 215 - 234
  • [9] Gaussian mean-shift is an EM algorithm
    Carreira-Perpinan, Miguel A.
    [J]. IEEE TRANSACTIONS ON PATTERN ANALYSIS AND MACHINE INTELLIGENCE, 2007, 29 (05) : 767 - 776
  • [10] ASYMPTOTICS FOR GENERAL MULTIVARIATE KERNEL DENSITY DERIVATIVE ESTIMATORS
    Chacon, Jose E.
    Duong, Tarn
    Wand, M. P.
    [J]. STATISTICA SINICA, 2011, 21 (02) : 807 - 840