arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 2002.12104cs.LGq-bio.QMstat.ML
收藏

基因组数据的高维特征选择

High-Dimensional Feature Selection for Genomic Datasets

Department of Computer Science, Memorial University of Newfoundland(纽芬兰纪念大学计算机科学系);Department of Mathematics and Statistics, Memorial University of Newfoundland(纽芬兰纪念大学数学与统计系);Memorial University of Newfoundland(纽芬兰纪念大学)

Majid Afshar, Hamid Usefi

摘要:

机器学习和模式识别中的一个核心问题是识别最重要特征的过程。在本文中,我们提供了一个新的特征选择方法(DRPT),包括第一次删除不相关的功能,然后检测剩余的功能之间的相关性。假设$D=[A\mid \mathbf{b}]$是一个数据集,其中$\mathbf{b}$是类标签,$A$是一个矩阵,其列是特征。我们使用最小二乘法和$A$的伪逆来求解$A\mathbf{x} = \mathbf{b}$。$\mathbf{x}$的每个组件都可以被视为分配给相应列(特征)的权重。我们定义了一个阈值的基础上的局部最大值的$\mathbf{x}$和删除那些功能的权重小于阈值。为了检测简化矩阵中的相关性,我们仍然称之为$A$,我们考虑$A$的扰动$\tilde A$。我们证明了相关性编码在$Δ\mathbf{x}=\mid \mathbf{x} -\tilde{\mathbf{x}}\mid $,其中$\tilde{\mathbf{x}}$是最小二乘解决方案的$\tilde A\tilde{\mathbf{x}}=\mathbf{b}$。我们首先基于$Δ\mathbf{x}$对特征进行聚类,然后利用特征的熵进行聚类。最后,从每个子聚类中选择一个特征,基于其权重和熵。DRPT的有效性已经通过在10个遗传数据集上与7种最先进的特征选择方法进行一系列比较来验证,所述遗传数据集的特征范围从9,117到267,604。实验结果表明,DRPT算法在多个方面的性能优于其他特征选择算法。\e

英文摘要:

A central problem in machine learning and pattern recognition is the process of recognizing the most important features. In this paper, we provide a new feature selection method (DRPT) that consists of first removing the irrelevant features and then detecting correlations between the remaining features. Let $D=[A\mid \mathbf{b}]$ be a dataset, where $\mathbf{b}$ is the class label and $A$ is a matrix whose columns are the features. We solve $A\mathbf{x} = \mathbf{b}$ using the least squares method and the pseudo-inverse of $A$. Each component of $\mathbf{x}$ can be viewed as an assigned weight to the corresponding column (feature). We define a threshold based on the local maxima of $\mathbf{x}$ and remove those features whose weights are smaller than the threshold. To detect the correlations in the reduced matrix, which we still call $A$, we consider a perturbation $\tilde A$ of $A$. We prove that correlations are encoded in $Δ\mathbf{x}=\mid \mathbf{x} -\tilde{\mathbf{x}}\mid $, where $\tilde{\mathbf{x}}$ is the least quares solution of $\tilde A\tilde{\mathbf{x}}=\mathbf{b}$. We cluster features first based on $Δ\mathbf{x}$ and then using the entropy of features. Finally, a feature is selected from each sub-cluster based on its weight and entropy. The effectiveness of DRPT has been verified by performing a series of comparisons with seven state-of-the-art feature selection methods over ten genetic datasets ranging up from 9,117 to 267,604 features. The results show that, over all, the performance of DRPT is favorable in several aspects compared to each feature selection algorithm. \e

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑