QuickCent:一种快速、节约的网络中心性估计启发式算法

Francisco Plana, Jorge Pérez
{"title":"QuickCent:一种快速、节约的网络中心性估计启发式算法","authors":"Francisco Plana, Jorge Pérez","doi":"10.1109/WI.2018.00-84","DOIUrl":null,"url":null,"abstract":"We present a simple and quick method to estimate a network centrality measure. Our method, called QuickCent, is inspired in so called fast and frugal heuristics, which are heuristics initially proposed to model the human quantitative estimation process. The centrality index that we estimate is the harmonic index which is a measure based on shortest-path distances, so infeasible to compute on large networks. We compare QuickCent with known machine learning algorithms on synthetic data. Our experiments show that QuickCent is able to make robust estimates compared with alternative methods achieving low-error variance estimates even with a small training set. Moreover, QuickCent is comparable in efficiency -accuracy and time cost-to more complex methods. Our initial results show that simple heuristics and biologically inspired computational methods are a promising line of research in the context of network measure estimations.","PeriodicalId":405966,"journal":{"name":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","volume":"120 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-12-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"QuickCent: A Fast and Frugal Heuristic for Centrality Estimation on Networks\",\"authors\":\"Francisco Plana, Jorge Pérez\",\"doi\":\"10.1109/WI.2018.00-84\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"We present a simple and quick method to estimate a network centrality measure. Our method, called QuickCent, is inspired in so called fast and frugal heuristics, which are heuristics initially proposed to model the human quantitative estimation process. The centrality index that we estimate is the harmonic index which is a measure based on shortest-path distances, so infeasible to compute on large networks. We compare QuickCent with known machine learning algorithms on synthetic data. Our experiments show that QuickCent is able to make robust estimates compared with alternative methods achieving low-error variance estimates even with a small training set. Moreover, QuickCent is comparable in efficiency -accuracy and time cost-to more complex methods. Our initial results show that simple heuristics and biologically inspired computational methods are a promising line of research in the context of network measure estimations.\",\"PeriodicalId\":405966,\"journal\":{\"name\":\"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)\",\"volume\":\"120 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-12-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WI.2018.00-84\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE/WIC/ACM International Conference on Web Intelligence (WI)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WI.2018.00-84","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

提出了一种简单快速的网络中心性测度估计方法。我们的方法被称为QuickCent,它的灵感来自于所谓的快速和节俭的启发式,这是最初提出的用来模拟人类定量估计过程的启发式。我们估计的中心性指数是谐波指数,它是一种基于最短路径距离的度量,因此在大型网络中不可行。我们将QuickCent与已知的机器学习算法在合成数据上进行比较。我们的实验表明,与其他方法相比,即使使用较小的训练集,QuickCent也能够获得低误差方差估计。此外,QuickCent在效率-准确性和时间成本方面与更复杂的方法相当。我们的初步结果表明,在网络测量估计的背景下,简单的启发式和生物学启发的计算方法是一个有前途的研究方向。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
QuickCent: A Fast and Frugal Heuristic for Centrality Estimation on Networks
We present a simple and quick method to estimate a network centrality measure. Our method, called QuickCent, is inspired in so called fast and frugal heuristics, which are heuristics initially proposed to model the human quantitative estimation process. The centrality index that we estimate is the harmonic index which is a measure based on shortest-path distances, so infeasible to compute on large networks. We compare QuickCent with known machine learning algorithms on synthetic data. Our experiments show that QuickCent is able to make robust estimates compared with alternative methods achieving low-error variance estimates even with a small training set. Moreover, QuickCent is comparable in efficiency -accuracy and time cost-to more complex methods. Our initial results show that simple heuristics and biologically inspired computational methods are a promising line of research in the context of network measure estimations.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信