检索规则说明:AND代表“并且”;OR代表“或者”;NOT代表“不包含”;(注意必须大写,运算符两边需空一格)
检 索 范 例 :范例一: (K=图书馆学 OR K=情报学) AND A=范并思 范例二:J=计算机应用与软件 AND (U=C++ OR U=Basic) NOT M=Visual
机构地区:[1]西安电子科技大学计算机学院,西安710071
出 处:《模式识别与人工智能》2013年第1期106-113,共8页Pattern Recognition and Artificial Intelligence
基 金:国家自然科学基金重点项目(No.60933009);国家自然科学基金项目(No.61070137);陕西省科技攻关项目(No.2009K01-56)资助
摘 要:目前特征选择方法中常用的特征相关性测度可有效评估两个特征之间的相关性,但却将特征孤立看待,没有考虑其它特征对它们相关性的影响.文中在整体考虑特征之间关系的前提下,提出用稀疏表示系数评估特征的相关性,它与现有特征相关性测度的不同之处在于可揭示特征在其它所有特征影响下与目标的相关性,反映特征间的相互影响.为验证稀疏表示系数评估特征相关性的有效性,在典型的高维小样本数据上,比较了ReliefF方法及分别以稀疏表示系数、对称不确定性和皮尔森相关系数为相关性测度的特征选择方法选择的特征集的分类能力.实验结果表明文中方法选择的特征集的分类能力高且较稳定.The feature relevance measures employed by current feature selection methods can effectively evaluate the relevance between two features, but they do not consider the influence of the other features on them. On the premise of considering feature interaction overall, sparse representation coefficient is proposed as a feature relevance measure. The difference between the proposed method and the existing relevance measures is that it reveals the relevance between feature and target under the influence of the other features, which reflects feature interaction. In order to verify the effectiveness of sparse representation coefficient to measure relevance of feature, the classification performance is compared among feature subsets selected by Relief F and the feature selection methods using sparse coefficient, symmetrical uncertainty and Pearson correlation coefficient as relevance measures respectively. The experimental results show that the classification performance of the features selected by the proposed method is higher and more stable.
分 类 号:TN911.7[电子电信—通信与信息系统]
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在载入数据...
正在链接到云南高校图书馆文献保障联盟下载...
云南高校图书馆联盟文献共享服务平台 版权所有©
您的IP:216.73.216.229