A dynamic multiple classifier system using graph neural network for high dimensional overlapped data

计算机科学 分类器(UML) 人工智能 维数之咒 机器学习 人工神经网络 地点 图形 模式识别(心理学) 数据挖掘 理论计算机科学 哲学 语言学
作者
Mariana Assunção de Souza,Robert Sabourin,George D. C. Cavalcanti,Rafael M. O. Cruz
出处
期刊:Information Fusion [Elsevier]
卷期号:103: 102145-102145
标识
DOI:10.1016/j.inffus.2023.102145
摘要

Dynamic selection techniques select a subset of the classifiers from a pool according to their perceived competence in labeling each given query instance in particular. To do so, most techniques rely on the locality assumption for the selection task, meaning that similar instances should share a set of adequate classifiers, so their competencies are usually estimated over a local region surrounding the query. However, as the local distribution is crucial to these techniques, a poor region definition due to the presence of high dimensionality and class overlap can have a negative impact on their performance, thus limiting their application. Thus, we propose in this work a dynamic selection technique to better deal with sparse and overlapped data in which the instance-instance and the classifier-classifier relationships are leveraged to learn the dynamic classifier combination rule. The proposed technique uses a multi-label graph neural network as a meta-learner, so both the data modeled as a graph, without directly defining the local region, and the classifiers’ inter-dependencies modeled in the meta-labels are used to learn an embedded space where the dynamic selection task is more straightforward. Experimental results over 35 high dimensional datasets show that the proposed method significantly outperforms the static selection baseline and most evaluated dynamic selection techniques when using a diverse ensemble. Moreover, the proposed technique surpassed the contending state-of-the-art techniques over the problems with the highest excess of incompetent classifiers in overlap regions, further suggesting its suitability to deal with challenging local distributions. Code available at: github.com/marianaasouza/gnn_des.
最长约 10秒,即可获得该文献文件

科研通智能强力驱动
Strongly Powered by AbleSci AI
更新
大幅提高文件上传限制,最高150M (2024-4-1)

科研通是完全免费的文献互助平台,具备全网最快的应助速度,最高的求助完成率。 对每一个文献求助,科研通都将尽心尽力,给求助人一个满意的交代。
实时播报
iVANPENNY应助Yayadedidi采纳,获得10
1秒前
一路硕博应助高高凡采纳,获得10
2秒前
斯文败类应助Mashiro采纳,获得10
3秒前
4秒前
小邓发布了新的文献求助10
8秒前
加油完成签到 ,获得积分10
13秒前
会飞的鸟完成签到,获得积分10
16秒前
柴郡喵完成签到,获得积分10
21秒前
22秒前
Mashiro发布了新的文献求助10
25秒前
103x完成签到 ,获得积分10
29秒前
31秒前
33秒前
36秒前
谷歌发布了新的文献求助10
38秒前
40秒前
41秒前
风中老三完成签到,获得积分10
44秒前
Lucas应助lsy采纳,获得10
44秒前
45秒前
我想快点毕业啊完成签到,获得积分10
46秒前
莱芙完成签到 ,获得积分10
49秒前
51秒前
52秒前
Maestro_S应助科研通管家采纳,获得10
52秒前
53秒前
Akim应助科研通管家采纳,获得10
53秒前
Himejima应助科研通管家采纳,获得10
53秒前
53秒前
53秒前
脑洞疼应助科研通管家采纳,获得10
53秒前
Himejima应助科研通管家采纳,获得10
53秒前
53秒前
53秒前
53秒前
小正完成签到,获得积分10
55秒前
1分钟前
李爱国应助我爱妹妹采纳,获得10
1分钟前
ljs完成签到,获得积分10
1分钟前
精明白风发布了新的文献求助10
1分钟前
高分求助中
The Illustrated History of Gymnastics 800
The Bourse of Babylon : market quotations in the astronomical diaries of Babylonia 680
Herman Melville: A Biography (Volume 1, 1819-1851) 600
Division and square root. Digit-recurrence algorithms and implementations 500
機能營養學前瞻(3 Ed.) 300
Improving the ductility and toughness of Fe-Cr-B cast irons 300
Problems of transcultural communication 300
热门求助领域 (近24小时)
化学 材料科学 医学 生物 有机化学 工程类 生物化学 纳米技术 物理 内科学 计算机科学 化学工程 复合材料 遗传学 基因 物理化学 催化作用 电极 光电子学 量子力学
热门帖子
关注 科研通微信公众号,转发送积分 2507307
求助须知:如何正确求助?哪些是违规求助? 2158774
关于积分的说明 5525823
捐赠科研通 1879123
什么是DOI,文献DOI怎么找? 934717
版权声明 564046
科研通“疑难数据库(出版商)”最低求助积分说明 499243