EDGE:进化有向图集成

Xavier Fontes, D. Silva
{"title":"EDGE:进化有向图集成","authors":"Xavier Fontes, D. Silva","doi":"10.3233/HIS-190273","DOIUrl":null,"url":null,"abstract":"Classification tasks are being tackled in a plethora of scientific fields, such as astronomy, finance, healthcare, human mobility, and pharmacology, to name a few. Classification is defined as a supervised learning approach that uses labeled data to assign instances to classes. A common approach to tackle these tasks are ensemble methods. These are methods that employ a set of models, instead of just one and combine the predictions of every model to obtain the prediction of the whole. Common obstacles in ensemble learning are the choice of base models to use and how best to aggregate the predictions of each individual to produce the ensemble’s prediction. It is also expected to mitigate the weaknesses of its members while pooling their strengths together. It is in this context that Evolutionary Directed Graph Ensembles (EDGE) thrives. EDGE is a machine learning tool based on social dynamics and modeling of trust in human beings using graph theory. Evolutionary Algorithms are used to evolve ensembles of models that are arranged in a directed acyclic graph structure. The connections in the graph map the trust of each node in its predecessors. The novelty in such an approach stems from the fusion of ensemble learning with graphs and evolutionary algorithms. A limitation of EDGE is that it focuses only on changing the topology of the graph ensembles, with the authors of hypothesizing about using the learned graphs for other tasks. with gains as substantial as 30 percentage points. The bootstrap was shown to be effective in improving the prediction power, with the exploitation of previous runs improved the results on 19 out of 21 datasets. The contributions can be summarized as a novel way to evolve graph ensembles, by also evolving the weights between nodes of the graphs, coupled with the idea of bootstrapping any dataset using previous runs from other datasets. The analysis of dataset choice for the bootstrapping lead to the proposal of a similarity metric between datasets that can be used to facilitate the choice for bootstrapping, without exhaustive or random search in the available datasets. uma métrica de semelhança que pode ser utilizada em vez de uma pesquisa exaustiva nos conjuntos de dados disponíveis.","PeriodicalId":88526,"journal":{"name":"International journal of hybrid intelligent systems","volume":"57 1","pages":"243-256"},"PeriodicalIF":0.0000,"publicationDate":"2019-11-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"EDGE: Evolutionary Directed Graph Ensembles\",\"authors\":\"Xavier Fontes, D. Silva\",\"doi\":\"10.3233/HIS-190273\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Classification tasks are being tackled in a plethora of scientific fields, such as astronomy, finance, healthcare, human mobility, and pharmacology, to name a few. Classification is defined as a supervised learning approach that uses labeled data to assign instances to classes. A common approach to tackle these tasks are ensemble methods. These are methods that employ a set of models, instead of just one and combine the predictions of every model to obtain the prediction of the whole. Common obstacles in ensemble learning are the choice of base models to use and how best to aggregate the predictions of each individual to produce the ensemble’s prediction. It is also expected to mitigate the weaknesses of its members while pooling their strengths together. It is in this context that Evolutionary Directed Graph Ensembles (EDGE) thrives. EDGE is a machine learning tool based on social dynamics and modeling of trust in human beings using graph theory. Evolutionary Algorithms are used to evolve ensembles of models that are arranged in a directed acyclic graph structure. The connections in the graph map the trust of each node in its predecessors. The novelty in such an approach stems from the fusion of ensemble learning with graphs and evolutionary algorithms. A limitation of EDGE is that it focuses only on changing the topology of the graph ensembles, with the authors of hypothesizing about using the learned graphs for other tasks. with gains as substantial as 30 percentage points. The bootstrap was shown to be effective in improving the prediction power, with the exploitation of previous runs improved the results on 19 out of 21 datasets. The contributions can be summarized as a novel way to evolve graph ensembles, by also evolving the weights between nodes of the graphs, coupled with the idea of bootstrapping any dataset using previous runs from other datasets. The analysis of dataset choice for the bootstrapping lead to the proposal of a similarity metric between datasets that can be used to facilitate the choice for bootstrapping, without exhaustive or random search in the available datasets. uma métrica de semelhança que pode ser utilizada em vez de uma pesquisa exaustiva nos conjuntos de dados disponíveis.\",\"PeriodicalId\":88526,\"journal\":{\"name\":\"International journal of hybrid intelligent systems\",\"volume\":\"57 1\",\"pages\":\"243-256\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2019-11-20\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"International journal of hybrid intelligent systems\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.3233/HIS-190273\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"International journal of hybrid intelligent systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.3233/HIS-190273","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

许多科学领域正在处理分类任务,例如天文学、金融、医疗保健、人类流动性和药理学,仅举几例。分类被定义为一种监督学习方法,它使用标记数据将实例分配给类。处理这些任务的常用方法是集成方法。这些方法采用一组模型,而不仅仅是一个模型,并将每个模型的预测结合起来,以获得整体的预测。集成学习中常见的障碍是选择使用的基本模型,以及如何最好地汇总每个个体的预测以产生集成的预测。它还有望减轻其成员的弱点,同时汇集他们的优势。正是在这种背景下,进化有向图集成(EDGE)蓬勃发展。EDGE是一个基于社会动态的机器学习工具,并使用图论对人类的信任进行建模。进化算法用于进化排列在有向无环图结构中的模型集合。图中的连接映射了前一个节点对每个节点的信任。这种方法的新颖之处在于集成学习与图和进化算法的融合。EDGE的一个限制是,它只关注改变图集成的拓扑结构,作者假设将学习到的图用于其他任务。涨幅高达30%。自举被证明在提高预测能力方面是有效的,利用以前的运行改善了21个数据集中的19个数据集的结果。这些贡献可以概括为一种进化图集成的新方法,通过进化图节点之间的权重,再加上使用其他数据集的先前运行来引导任何数据集的想法。对自举的数据集选择的分析导致了数据集之间的相似性度量的建议,该度量可用于促进自举的选择,而无需在可用数据集中进行穷举或随机搜索。1 .妇女的 精神病学和精神病学和精神病学和精神病学和精神病学的结合:disponíveis。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
EDGE: Evolutionary Directed Graph Ensembles
Classification tasks are being tackled in a plethora of scientific fields, such as astronomy, finance, healthcare, human mobility, and pharmacology, to name a few. Classification is defined as a supervised learning approach that uses labeled data to assign instances to classes. A common approach to tackle these tasks are ensemble methods. These are methods that employ a set of models, instead of just one and combine the predictions of every model to obtain the prediction of the whole. Common obstacles in ensemble learning are the choice of base models to use and how best to aggregate the predictions of each individual to produce the ensemble’s prediction. It is also expected to mitigate the weaknesses of its members while pooling their strengths together. It is in this context that Evolutionary Directed Graph Ensembles (EDGE) thrives. EDGE is a machine learning tool based on social dynamics and modeling of trust in human beings using graph theory. Evolutionary Algorithms are used to evolve ensembles of models that are arranged in a directed acyclic graph structure. The connections in the graph map the trust of each node in its predecessors. The novelty in such an approach stems from the fusion of ensemble learning with graphs and evolutionary algorithms. A limitation of EDGE is that it focuses only on changing the topology of the graph ensembles, with the authors of hypothesizing about using the learned graphs for other tasks. with gains as substantial as 30 percentage points. The bootstrap was shown to be effective in improving the prediction power, with the exploitation of previous runs improved the results on 19 out of 21 datasets. The contributions can be summarized as a novel way to evolve graph ensembles, by also evolving the weights between nodes of the graphs, coupled with the idea of bootstrapping any dataset using previous runs from other datasets. The analysis of dataset choice for the bootstrapping lead to the proposal of a similarity metric between datasets that can be used to facilitate the choice for bootstrapping, without exhaustive or random search in the available datasets. uma métrica de semelhança que pode ser utilizada em vez de uma pesquisa exaustiva nos conjuntos de dados disponíveis.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
CiteScore
3.30
自引率
0.00%
发文量
0
期刊最新文献
Vision transformer-convolution for breast cancer classification using mammography images: A comparative study Comparative temporal dynamics of individuation and perceptual averaging using a biological neural network model Metaheuristic optimized electrocardiography time-series anomaly classification with recurrent and long-short term neural networks Classifications, evaluation metrics, datasets, and domains in recommendation services: A survey A hybrid approach of machine learning algorithms for improving accuracy of social media crisis detection
×
引用
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