Active learning and inference method for within network classification

Tomasz Kajdanowicz, Radosław Michalski, Katarzyna Musial, Przemyslaw Kazienko
{"title":"Active learning and inference method for within network classification","authors":"Tomasz Kajdanowicz, Radosław Michalski, Katarzyna Musial, Przemyslaw Kazienko","doi":"10.1145/2492517.2500259","DOIUrl":null,"url":null,"abstract":"In relational learning tasks such as within network classification the main problem arises from the inference of nodes' labels based on the the ground true labels of remaining nodes. The problem becomes even harder if the nodes from initial network do not have any labels assigned and they have to be acquired. However, labels of which nodes should be obtained in order to provide fair classification results? Active learning and inference is a practical framework to study this problem. The method for active learning and inference in within network classification based on node selection is proposed in the paper. Based on the structure of the network it is calculated the utility score for each node, the ranking is formulated and for selected nodes the labels are acquired. The paper examines several distinct proposals for utility scores and selection methods reporting their impact on collective classification results performed on various real-world networks.","PeriodicalId":442230,"journal":{"name":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","volume":"21 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-08-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 IEEE/ACM International Conference on Advances in Social Networks Analysis and Mining (ASONAM 2013)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2492517.2500259","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

In relational learning tasks such as within network classification the main problem arises from the inference of nodes' labels based on the the ground true labels of remaining nodes. The problem becomes even harder if the nodes from initial network do not have any labels assigned and they have to be acquired. However, labels of which nodes should be obtained in order to provide fair classification results? Active learning and inference is a practical framework to study this problem. The method for active learning and inference in within network classification based on node selection is proposed in the paper. Based on the structure of the network it is calculated the utility score for each node, the ranking is formulated and for selected nodes the labels are acquired. The paper examines several distinct proposals for utility scores and selection methods reporting their impact on collective classification results performed on various real-world networks.
网络内分类的主动学习与推理方法
在网络分类等关系学习任务中,主要问题是基于剩余节点的真实标签来推断节点的标签。如果初始网络中的节点没有分配任何标签,则需要获取标签,则问题变得更加困难。但是,为了提供公平的分类结果,应该获取哪些节点的标签呢?主动学习与推理是研究这一问题的实用框架。提出了一种基于节点选择的网络内分类主动学习与推理方法。根据网络的结构计算每个节点的效用得分,制定排名,并为选定的节点获取标签。本文研究了几种不同的效用分数和选择方法的建议,报告了它们对在各种现实世界网络上执行的集体分类结果的影响。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
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学术官方微信