# American Institute of Mathematical Sciences

November  2020, 3(4): 263-277. doi: 10.3934/mfc.2020010

## Modeling interactive components by coordinate kernel polynomial models

 1 Department of Applied Mathematics, The Hong Kong Polytechnic University, Hong Kong, China 2 Division of Biostatistics, University of California, Berkeley, Berkeley, CA 94720, USA 3 Department of Mathematical Sciences, Middle Tennessee State University, Murfreesboro, TN 37132, USA

* Corresponding author: Xin Guo

Received  October 2019 Published  June 2020

Fund Project: The work described in this paper is partially supported by FRCAC of Middle Tennessee State University, and is partially supported by a grant from the Research Grants Council of the Hong Kong Special Administrative Region, China (Project No. PolyU 25301115). All the three authors contributed equally to the paper

We proposed the use of coordinate kernel polynomials in kernel regression. This new approach, called coordinate kernel polynomial regression, can simultaneously identify active variables and effective interactive components. Reparametrization refinement is found critical to improve the modeling accuracy and prediction power. The post-training component selection allows one to identify effective interactive components. Generalization error bounds are used to explain the effectiveness of the algorithm from a learning theory perspective and simulation studies are used to show its empirical effectiveness.

Citation: Xin Guo, Lexin Li, Qiang Wu. Modeling interactive components by coordinate kernel polynomial models. Mathematical Foundations of Computing, 2020, 3 (4) : 263-277. doi: 10.3934/mfc.2020010
##### References:

show all references

##### References:
Variable selection accuracy and average MSE for Example 1
 Algorithm TPR($x_1$) TPR($x_2$) FPR MSE CKPR-L 1.00 1.00 0.000 0.008 (0.000) CKPR-G 1.00 1.00 0.011 0.109 (0.015) LASSO 1.00 0.18 0.040 1.129 (0.015) COSSO 0.90 0.02 0.020 10.879 (8.345) SR-SIR (AIC) 1.00 0.89 0.460 - SR-SIR (BIC) 1.00 0.85 0.181 - SR-SIR (RIC) 1.00 0.75 0.053 -
 Algorithm TPR($x_1$) TPR($x_2$) FPR MSE CKPR-L 1.00 1.00 0.000 0.008 (0.000) CKPR-G 1.00 1.00 0.011 0.109 (0.015) LASSO 1.00 0.18 0.040 1.129 (0.015) COSSO 0.90 0.02 0.020 10.879 (8.345) SR-SIR (AIC) 1.00 0.89 0.460 - SR-SIR (BIC) 1.00 0.85 0.181 - SR-SIR (RIC) 1.00 0.75 0.053 -
Average and standard error of MSEs for Example 2
 $m=100$ $m=200$ $m=400$ CKPR-G 0.119 (0.003) 0.054 (0.001) 0.025 (0.0004) COSSO(GCV) 0.358 (0.009) 0.100 (0.003) 0.045 (0.001) COSSO(5CV) 0.378 (0.005) 0.094 (0.004) 0.043 (0.001) MARS 0.239 (0.008) 0.109 (0.003) 0.084 (0.001)
 $m=100$ $m=200$ $m=400$ CKPR-G 0.119 (0.003) 0.054 (0.001) 0.025 (0.0004) COSSO(GCV) 0.358 (0.009) 0.100 (0.003) 0.045 (0.001) COSSO(5CV) 0.378 (0.005) 0.094 (0.004) 0.043 (0.001) MARS 0.239 (0.008) 0.109 (0.003) 0.084 (0.001)
RMSE on three UCI data sets
 Ionosphere Sonar MR Wisc. BC $n$ 351 208 683 $p$ 33 60 9 CKPR-L $0.64 (0.04)$ $0.75 (0.06)$ $0.34 (0.02)$ CKPR-G $0.54 (0.03)$ $0.77 (0.06)$ $0.34 (0.02)$ Best in [5] $0.60 (0.05)$ $0.80 (0.04)$ $0.70 (0.01)$
 Ionosphere Sonar MR Wisc. BC $n$ 351 208 683 $p$ 33 60 9 CKPR-L $0.64 (0.04)$ $0.75 (0.06)$ $0.34 (0.02)$ CKPR-G $0.54 (0.03)$ $0.77 (0.06)$ $0.34 (0.02)$ Best in [5] $0.60 (0.05)$ $0.80 (0.04)$ $0.70 (0.01)$
 [1] Pierre Baras. A generalization of a criterion for the existence of solutions to semilinear elliptic equations. Discrete & Continuous Dynamical Systems - S, 2021, 14 (2) : 465-504. doi: 10.3934/dcdss.2020439 [2] Bahaaeldin Abdalla, Thabet Abdeljawad. Oscillation criteria for kernel function dependent fractional dynamic equations. Discrete & Continuous Dynamical Systems - S, 2020  doi: 10.3934/dcdss.2020443 [3] Liam Burrows, Weihong Guo, Ke Chen, Francesco Torella. Reproducible kernel Hilbert space based global and local image segmentation. Inverse Problems & Imaging, 2021, 15 (1) : 1-25. doi: 10.3934/ipi.2020048 [4] Kengo Nakai, Yoshitaka Saiki. Machine-learning construction of a model for a macroscopic fluid variable using the delay-coordinate of a scalar observable. Discrete & Continuous Dynamical Systems - S, 2021, 14 (3) : 1079-1092. doi: 10.3934/dcdss.2020352 [5] Hui Gao, Jian Lv, Xiaoliang Wang, Liping Pang. An alternating linearization bundle method for a class of nonconvex optimization problem with inexact information. Journal of Industrial & Management Optimization, 2021, 17 (2) : 805-825. doi: 10.3934/jimo.2019135 [6] Marc Homs-Dones. A generalization of the Babbage functional equation. Discrete & Continuous Dynamical Systems - A, 2021, 41 (2) : 899-919. doi: 10.3934/dcds.2020303 [7] Hongliang Chang, Yin Chen, Runxuan Zhang. A generalization on derivations of Lie algebras. Electronic Research Archive, , () : -. doi: 10.3934/era.2020124 [8] Peizhao Yu, Guoshan Zhang, Yi Zhang. Decoupling of cubic polynomial matrix systems. Numerical Algebra, Control & Optimization, 2021, 11 (1) : 13-26. doi: 10.3934/naco.2020012 [9] Bimal Mandal, Aditi Kar Gangopadhyay. A note on generalization of bent boolean functions. Advances in Mathematics of Communications, 2021, 15 (2) : 329-346. doi: 10.3934/amc.2020069 [10] Liupeng Wang, Yunqing Huang. Error estimates for second-order SAV finite element method to phase field crystal model. Electronic Research Archive, 2021, 29 (1) : 1735-1752. doi: 10.3934/era.2020089 [11] Wai-Ki Ching, Jia-Wen Gu, Harry Zheng. On correlated defaults and incomplete information. Journal of Industrial & Management Optimization, 2021, 17 (2) : 889-908. doi: 10.3934/jimo.2020003 [12] Nicolas Rougerie. On two properties of the Fisher information. Kinetic & Related Models, 2021, 14 (1) : 77-88. doi: 10.3934/krm.2020049 [13] Yahia Zare Mehrjerdi. A new methodology for solving bi-criterion fractional stochastic programming. Numerical Algebra, Control & Optimization, 2020  doi: 10.3934/naco.2020054 [14] Cheng He, Changzheng Qu. Global weak solutions for the two-component Novikov equation. Electronic Research Archive, 2020, 28 (4) : 1545-1562. doi: 10.3934/era.2020081 [15] Ningyu Sha, Lei Shi, Ming Yan. Fast algorithms for robust principal component analysis with an upper bound on the rank. Inverse Problems & Imaging, 2021, 15 (1) : 109-128. doi: 10.3934/ipi.2020067 [16] Shengxin Zhu, Tongxiang Gu, Xingping Liu. AIMS: Average information matrix splitting. Mathematical Foundations of Computing, 2020, 3 (4) : 301-308. doi: 10.3934/mfc.2020012 [17] Jan Bouwe van den Berg, Elena Queirolo. A general framework for validated continuation of periodic orbits in systems of polynomial ODEs. Journal of Computational Dynamics, 2021, 8 (1) : 59-97. doi: 10.3934/jcd.2021004 [18] Honglin Yang, Jiawu Peng. Coordinating a supply chain with demand information updating. Journal of Industrial & Management Optimization, 2020  doi: 10.3934/jimo.2020181 [19] M. S. Lee, H. G. Harno, B. S. Goh, K. H. Lim. On the bang-bang control approach via a component-wise line search strategy for unconstrained optimization. Numerical Algebra, Control & Optimization, 2021, 11 (1) : 45-61. doi: 10.3934/naco.2020014 [20] Yueyang Zheng, Jingtao Shi. A stackelberg game of backward stochastic differential equations with partial information. Mathematical Control & Related Fields, 2020  doi: 10.3934/mcrf.2020047

Impact Factor: