z-logo
open-access-imgOpen Access
Alternative models for the modified form of ridge regularized linear model in discovering Markov boundary
Author(s) -
Shaomin Yan,
Xiaobo Hu,
Rujing Wang
Publication year - 2019
Publication title -
journal of physics. conference series
Language(s) - English
Resource type - Journals
SCImago Journal Rank - 0.21
H-Index - 85
eISSN - 1742-6596
pISSN - 1742-6588
DOI - 10.1088/1742-6596/1324/1/012033
Subject(s) - collinearity , lasso (programming language) , markov chain , boundary (topology) , markov model , linear regression , mathematics , covariance , computer science , linear model , variable (mathematics) , permutation (music) , variable order markov model , algorithm , markov process , design matrix , machine learning , statistics , mathematical analysis , physics , world wide web , acoustics
It has been proved that the modified form of ridge regularized linear model (MRRLM) can discover a subset of Markov boundary of the target variable under some constrained conditions. However, MRRLM cannot be applied to the data sets with collinear variables due to covariance matrix is employed. To develop a suitable alternative model for MRRLM, we study the relationships of discovery performance of Markov boundary among MRRLM, ridge regression linear model (RRLM), and LASSO combining with permutation test through empirical method. In addition, we also proposed a new NVRRLM to discover Markov boundary of the target variable. The experimental results show that: (1) On the binary data sets, MRRLM has a basically similar performance with LASSO and RRLM; (2) On the continuous data sets, MRRLM has a basically similar discovery performance with LASSO but has higher discovery performance than RRLM; (3) The new NVRRLM can replace MRRLM on the data sets with collinear variables. The above experimental results demonstrate NVRRLM can effectively deal with variable collinearity problems.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here