Efficient label propagation for classification on information networks

N. K. Anh, V. Thanh, Ngo Van Linh
{"title":"Efficient label propagation for classification on information networks","authors":"N. K. Anh, V. Thanh, Ngo Van Linh","doi":"10.1145/2350716.2350725","DOIUrl":null,"url":null,"abstract":"Classification on networked data plays an important role in many problems such as web page categorization, classification of bibliographic information network, etc... Most classification algorithms on information networks work by iteratively propagating information through network graphs. One important issue concerning iterative classifiers is that false inferences made at some point in iteration might propagate further causing an \"avalanche\". To address this problem, we propose an efficient label propagation learning algorithm based on the graph-based regularization framework with adjusting network structure iteratively to improve the accuracy of classification algorithm for noisy data. We show empirically that this adjusting network structure improves significantly the performance of the algorithm for web page classification. In particular, we demonstrate that the proposed algorithm achieves good classification accuracy even for relatively large overlap across the classes.","PeriodicalId":208300,"journal":{"name":"Proceedings of the 3rd Symposium on Information and Communication Technology","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2012-08-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"3","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 3rd Symposium on Information and Communication Technology","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2350716.2350725","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 3

Abstract

Classification on networked data plays an important role in many problems such as web page categorization, classification of bibliographic information network, etc... Most classification algorithms on information networks work by iteratively propagating information through network graphs. One important issue concerning iterative classifiers is that false inferences made at some point in iteration might propagate further causing an "avalanche". To address this problem, we propose an efficient label propagation learning algorithm based on the graph-based regularization framework with adjusting network structure iteratively to improve the accuracy of classification algorithm for noisy data. We show empirically that this adjusting network structure improves significantly the performance of the algorithm for web page classification. In particular, we demonstrate that the proposed algorithm achieves good classification accuracy even for relatively large overlap across the classes.
用于信息网络分类的高效标签传播
网络数据的分类在网页分类、书目信息网络分类等许多问题中起着重要的作用。大多数信息网络上的分类算法都是通过网络图迭代传播信息来实现的。关于迭代分类器的一个重要问题是,在迭代的某个点上做出的错误推断可能会进一步传播,导致“雪崩”。为了解决这一问题,本文提出了一种基于基于图的正则化框架的高效标签传播学习算法,通过迭代调整网络结构来提高算法对噪声数据的分类精度。我们的经验表明,这种调整网络结构显著提高了算法对网页分类的性能。特别是,我们证明了所提出的算法即使在类之间相对较大的重叠情况下也能获得良好的分类精度。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信