利用基于图的蚁群优化和广义雅卡德相似性进行多标签特征选择

S. Mahmood, Tahsin Ali Mohammed Amin, Khalid Hassan Ahmed, Rebar Dara Mohammed, Pshtiwan Jabar Karim
{"title":"利用基于图的蚁群优化和广义雅卡德相似性进行多标签特征选择","authors":"S. Mahmood, Tahsin Ali Mohammed Amin, Khalid Hassan Ahmed, Rebar Dara Mohammed, Pshtiwan Jabar Karim","doi":"10.24017/science.2024.1.4","DOIUrl":null,"url":null,"abstract":"Multi-label learning is a technique that assigns multiple class labels to each data instance. The growth of digital technology resulted in the development of high-dimensional applications in real-world scenarios. Feature selection approaches are extensively used to reduce dimensionality in multi-label learning. The main problems of the recommender system are determining the best match of futures among users but have not engaged with previously. This paper proposes a strategy for selecting features using ant colony optimization (ACO) that incorporates mutual knowledge. The proposed method utilizes ACO to rank features based on their significance. Thus, the search space is mapped to a graph, and each ant traverses the graph, selecting a predetermined number of features. A new information-theoretical metric is introduced to evaluate the features chosen by each ant. Jaccard generalized similarity coefficient is used to select the most suitable communication target for efficient learning outcomes. Mutual information is employed to assess each features relevance to a set of labels and identify redundant features. Pheromones are assigned values based on the effectiveness of the ants in solving the problem. Finally, the features are ranked based on their pheromone values, and the top-ranked features are selected as the final set of attributes. The proposed method is evaluated using real-world datasets. The findings demonstrate that the proposed method outperforms most of existing and advanced approaches. This paper presents a novel feature selection approach for multi-label learning based on ACO. The experimental results confirm the effectiveness of the proposed method compared to existing techniques.","PeriodicalId":17866,"journal":{"name":"Kurdistan Journal of Applied Research","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2024-05-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Multi-Label Feature Selection with Graph-based Ant Colony Optimization and Generalized Jaccard Similarity\",\"authors\":\"S. Mahmood, Tahsin Ali Mohammed Amin, Khalid Hassan Ahmed, Rebar Dara Mohammed, Pshtiwan Jabar Karim\",\"doi\":\"10.24017/science.2024.1.4\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Multi-label learning is a technique that assigns multiple class labels to each data instance. The growth of digital technology resulted in the development of high-dimensional applications in real-world scenarios. Feature selection approaches are extensively used to reduce dimensionality in multi-label learning. The main problems of the recommender system are determining the best match of futures among users but have not engaged with previously. This paper proposes a strategy for selecting features using ant colony optimization (ACO) that incorporates mutual knowledge. The proposed method utilizes ACO to rank features based on their significance. Thus, the search space is mapped to a graph, and each ant traverses the graph, selecting a predetermined number of features. A new information-theoretical metric is introduced to evaluate the features chosen by each ant. Jaccard generalized similarity coefficient is used to select the most suitable communication target for efficient learning outcomes. Mutual information is employed to assess each features relevance to a set of labels and identify redundant features. Pheromones are assigned values based on the effectiveness of the ants in solving the problem. Finally, the features are ranked based on their pheromone values, and the top-ranked features are selected as the final set of attributes. The proposed method is evaluated using real-world datasets. The findings demonstrate that the proposed method outperforms most of existing and advanced approaches. This paper presents a novel feature selection approach for multi-label learning based on ACO. The experimental results confirm the effectiveness of the proposed method compared to existing techniques.\",\"PeriodicalId\":17866,\"journal\":{\"name\":\"Kurdistan Journal of Applied Research\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2024-05-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Kurdistan Journal of Applied Research\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.24017/science.2024.1.4\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Kurdistan Journal of Applied Research","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.24017/science.2024.1.4","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

多标签学习是一种为每个数据实例分配多个类别标签的技术。数字技术的发展带来了现实世界中高维应用的发展。在多标签学习中,特征选择方法被广泛用于降低维度。推荐系统的主要问题是确定用户之间的最佳匹配期货,但以前没有接触过。本文提出了一种利用蚁群优化(ACO)选择特征的策略,该策略结合了相互知识。所提出的方法利用 ACO 根据特征的重要性对其进行排序。因此,搜索空间被映射为一个图,每只蚂蚁都会遍历该图,选择预定数量的特征。我们引入了一种新的信息论指标来评估每只蚂蚁选择的特征。雅卡德广义相似系数用于选择最合适的通信目标,以获得高效的学习成果。互信息用于评估每个特征与一组标签的相关性,并识别冗余特征。信息素根据蚂蚁解决问题的效率赋值。最后,根据信息素值对特征进行排序,并选择排序靠前的特征作为最终的属性集。我们使用真实世界的数据集对所提出的方法进行了评估。结果表明,所提出的方法优于大多数现有的先进方法。本文提出了一种基于 ACO 的新型多标签学习特征选择方法。实验结果证实,与现有技术相比,所提出的方法非常有效。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Multi-Label Feature Selection with Graph-based Ant Colony Optimization and Generalized Jaccard Similarity
Multi-label learning is a technique that assigns multiple class labels to each data instance. The growth of digital technology resulted in the development of high-dimensional applications in real-world scenarios. Feature selection approaches are extensively used to reduce dimensionality in multi-label learning. The main problems of the recommender system are determining the best match of futures among users but have not engaged with previously. This paper proposes a strategy for selecting features using ant colony optimization (ACO) that incorporates mutual knowledge. The proposed method utilizes ACO to rank features based on their significance. Thus, the search space is mapped to a graph, and each ant traverses the graph, selecting a predetermined number of features. A new information-theoretical metric is introduced to evaluate the features chosen by each ant. Jaccard generalized similarity coefficient is used to select the most suitable communication target for efficient learning outcomes. Mutual information is employed to assess each features relevance to a set of labels and identify redundant features. Pheromones are assigned values based on the effectiveness of the ants in solving the problem. Finally, the features are ranked based on their pheromone values, and the top-ranked features are selected as the final set of attributes. The proposed method is evaluated using real-world datasets. The findings demonstrate that the proposed method outperforms most of existing and advanced approaches. This paper presents a novel feature selection approach for multi-label learning based on ACO. The experimental results confirm the effectiveness of the proposed method compared to existing techniques.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
16
审稿时长
12 weeks
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信