基于多变量聚类的高维数据粒度最优特征选择

Q4 Materials Science Solid State Technology Pub Date : 2020-04-30 DOI:10.17762/TURCOMAT.V12I3.2031
SRINIVAS KOLLI, M. Sreedevi
{"title":"基于多变量聚类的高维数据粒度最优特征选择","authors":"SRINIVAS KOLLI, M. Sreedevi","doi":"10.17762/TURCOMAT.V12I3.2031","DOIUrl":null,"url":null,"abstract":"Clustering is the most complex in multi/high dimensional data because of sub feature selection fromoverall features present in categorical data sources. Sub set feature be the aggressive approach to decreasefeature dimensionality in mining of data, identification of patterns. Main aim behind selection of feature withrespect to selection of optimal feature and decrease the redundancy. In-order to compute withredundant/irrelevant features in high dimensional sample data exploration based on feature selection calculationwith data granular described in this document. Propose aNovel Granular Feature Multi-variant Clustering basedGenetic Algorithm (NGFMCGA) model to evaluate the performance results in this implementation. This modelmain consists two phases, in first phase, based on theoretic graph grouping procedure divide features intodifferent clusters, in second phase, select strongly representative related feature from each cluster with respectto matching of subset of features. Features present in this concept are independent because of features selectfrom different clusters, proposed approach clustering have high probability in processing and increasing thequality of independent and useful features.Optimal subset feature selection improves accuracy of clustering andfeature classification, performance of proposed approach describes better accuracy with respect to optimalsubset selection is applied on publicly related data sets and it is compared with traditional supervisedevolutionary approaches.","PeriodicalId":21779,"journal":{"name":"Solid State Technology","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2020-04-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A Novel Granularity Optimal Feature Selection based on Multi-Variant Clustering for High Dimensional Data\",\"authors\":\"SRINIVAS KOLLI, M. Sreedevi\",\"doi\":\"10.17762/TURCOMAT.V12I3.2031\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Clustering is the most complex in multi/high dimensional data because of sub feature selection fromoverall features present in categorical data sources. Sub set feature be the aggressive approach to decreasefeature dimensionality in mining of data, identification of patterns. Main aim behind selection of feature withrespect to selection of optimal feature and decrease the redundancy. In-order to compute withredundant/irrelevant features in high dimensional sample data exploration based on feature selection calculationwith data granular described in this document. Propose aNovel Granular Feature Multi-variant Clustering basedGenetic Algorithm (NGFMCGA) model to evaluate the performance results in this implementation. This modelmain consists two phases, in first phase, based on theoretic graph grouping procedure divide features intodifferent clusters, in second phase, select strongly representative related feature from each cluster with respectto matching of subset of features. Features present in this concept are independent because of features selectfrom different clusters, proposed approach clustering have high probability in processing and increasing thequality of independent and useful features.Optimal subset feature selection improves accuracy of clustering andfeature classification, performance of proposed approach describes better accuracy with respect to optimalsubset selection is applied on publicly related data sets and it is compared with traditional supervisedevolutionary approaches.\",\"PeriodicalId\":21779,\"journal\":{\"name\":\"Solid State Technology\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2020-04-30\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Solid State Technology\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.17762/TURCOMAT.V12I3.2031\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"Q4\",\"JCRName\":\"Materials Science\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Solid State Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.17762/TURCOMAT.V12I3.2031","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"Materials Science","Score":null,"Total":0}
引用次数: 7

摘要

聚类在多维/高维数据中是最复杂的,因为从分类数据源中存在的总体特征中选择子特征。子集特征是数据挖掘、模式识别中降低特征维数的有效方法。特征选择的主要目的是选择最优特征,减少冗余。为了在高维样本数据探索中进行冗余/不相关特征的计算,本文介绍了基于数据粒度的特征选择计算。提出了一种新的基于颗粒特征多变量聚类的遗传算法(NGFMCGA)模型来评估该实现中的性能结果。该模型主要分为两个阶段,第一阶段,根据理论图分组过程将特征划分到不同的聚类中,第二阶段,根据特征子集的匹配,从每个聚类中选择具有较强代表性的相关特征。该概念中存在的特征是独立的,因为特征是从不同的聚类中选择的,所提出的聚类方法在处理和提高独立有用特征的质量方面具有很高的概率。最优子集特征选择提高了聚类和特征分类的准确性,将最优子集选择应用于公开相关数据集,并与传统的监督进化方法进行了比较。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A Novel Granularity Optimal Feature Selection based on Multi-Variant Clustering for High Dimensional Data
Clustering is the most complex in multi/high dimensional data because of sub feature selection fromoverall features present in categorical data sources. Sub set feature be the aggressive approach to decreasefeature dimensionality in mining of data, identification of patterns. Main aim behind selection of feature withrespect to selection of optimal feature and decrease the redundancy. In-order to compute withredundant/irrelevant features in high dimensional sample data exploration based on feature selection calculationwith data granular described in this document. Propose aNovel Granular Feature Multi-variant Clustering basedGenetic Algorithm (NGFMCGA) model to evaluate the performance results in this implementation. This modelmain consists two phases, in first phase, based on theoretic graph grouping procedure divide features intodifferent clusters, in second phase, select strongly representative related feature from each cluster with respectto matching of subset of features. Features present in this concept are independent because of features selectfrom different clusters, proposed approach clustering have high probability in processing and increasing thequality of independent and useful features.Optimal subset feature selection improves accuracy of clustering andfeature classification, performance of proposed approach describes better accuracy with respect to optimalsubset selection is applied on publicly related data sets and it is compared with traditional supervisedevolutionary approaches.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
Solid State Technology
Solid State Technology 工程技术-工程:电子与电气
CiteScore
0.30
自引率
0.00%
发文量
0
审稿时长
>12 weeks
期刊介绍: Information not localized
期刊最新文献
Dssc Performance of Zinc - Tin - Vanadium Oxide Nanocomposite Using Beetroot (Beta Vulgaris) as Dye Sensitizer On the Problem of Operation of Self-Propelled Drilling Rigs in the Harsh Winter Conditions of the Far North Design and analysis of alcohol gas sensors using nano particles for micro heaters Containerized Okra (Ladies' Fingers, Abelmoschus Esculentus): Organic Fertilizers Result For Growth Exploring The Lived Experiences Of Young Arnisadors: The Curricular and Co-Curricular Challenges
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1