In this paper, firstly, we propose a new method for choosing regularization parameter λ for lasso regression, which differs from traditional method such as multifold cross-validation, our new method gives the maximum...In this paper, firstly, we propose a new method for choosing regularization parameter λ for lasso regression, which differs from traditional method such as multifold cross-validation, our new method gives the maximum value of parameter λ directly. Secondly, by considering another prior form over model space in the Bayes approach, we propose a new extended Bayes information criterion family, and under some mild condition, our new EBIC (NEBIC) is shown to be consistent. Then we apply our new method to choose parameter for sequential lasso regression which selects features by sequentially solving partially penalized least squares problems where the features selected in earlier steps are not penalized in the subsequent steps. Then sequential lasso uses NEBIC as the stopping rule. Finally, we apply our algorithm to identify the nonzero entries of precision matrix for high-dimensional linear discrimination analysis. Simulation results demonstrate that our algorithm has a lower misclassification rate and less computation time than its competing methods under considerations.展开更多
针对行人再识别过程中存在获取的训练样本较少,真实样本分布不一定线性可分和算法识别率低的问题,提出基于卡方核的正则化线性判别分析行人再识别算法(KRLDA,kemel regularized linear discriminant analysis)。该算法首先利用核函数将...针对行人再识别过程中存在获取的训练样本较少,真实样本分布不一定线性可分和算法识别率低的问题,提出基于卡方核的正则化线性判别分析行人再识别算法(KRLDA,kemel regularized linear discriminant analysis)。该算法首先利用核函数将样本从线性不可分的原始空间映射到线性可分的高维特征空间,然后在高维空间中构造描述数据之间邻近关系的散度矩阵,再利用正则化线性判别分析获得高维到低维空间的投影矩阵,使得数据在低维空间能够保持高维空间的可分性,从而提升行人再识别算法的识别率。在VIPeR、iLIDS、CAVIAR和3DPeS数据集上,实验结果表明所提出的算法具有较高识别率。展开更多
文摘In this paper, firstly, we propose a new method for choosing regularization parameter λ for lasso regression, which differs from traditional method such as multifold cross-validation, our new method gives the maximum value of parameter λ directly. Secondly, by considering another prior form over model space in the Bayes approach, we propose a new extended Bayes information criterion family, and under some mild condition, our new EBIC (NEBIC) is shown to be consistent. Then we apply our new method to choose parameter for sequential lasso regression which selects features by sequentially solving partially penalized least squares problems where the features selected in earlier steps are not penalized in the subsequent steps. Then sequential lasso uses NEBIC as the stopping rule. Finally, we apply our algorithm to identify the nonzero entries of precision matrix for high-dimensional linear discrimination analysis. Simulation results demonstrate that our algorithm has a lower misclassification rate and less computation time than its competing methods under considerations.
文摘针对行人再识别过程中存在获取的训练样本较少,真实样本分布不一定线性可分和算法识别率低的问题,提出基于卡方核的正则化线性判别分析行人再识别算法(KRLDA,kemel regularized linear discriminant analysis)。该算法首先利用核函数将样本从线性不可分的原始空间映射到线性可分的高维特征空间,然后在高维空间中构造描述数据之间邻近关系的散度矩阵,再利用正则化线性判别分析获得高维到低维空间的投影矩阵,使得数据在低维空间能够保持高维空间的可分性,从而提升行人再识别算法的识别率。在VIPeR、iLIDS、CAVIAR和3DPeS数据集上,实验结果表明所提出的算法具有较高识别率。