Information Source Finding in Networks: Querying With Budgets
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Choi, Jaeyoung | - |
dc.contributor.author | Moon, Sangwoo | - |
dc.contributor.author | Woo, Jiin | - |
dc.contributor.author | Son, Kyunghwan | - |
dc.contributor.author | Shin, Jinwoo | - |
dc.contributor.author | Yi, Yung | - |
dc.date.available | 2020-11-02T00:40:08Z | - |
dc.date.created | 2020-11-02 | - |
dc.date.issued | 2020-10 | - |
dc.identifier.issn | 1063-6692 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/gachon/handle/2020.sw.gachon/78764 | - |
dc.description.abstract | In this paper, we study a problem of detecting the source of diffused information by querying individuals, given a sample snapshot of the information diffusion graph, where two queries are asked: (i) whether the respondent is the source or not, and (ii) if not, which neighbor spreads the information to the respondent. We consider the case when respondents may not always be truthful and some cost is taken for each query. Our goal is to quantify the necessary and sufficient budgets to achieve the detection probability 1 - delta for any given 0 < delta < 1. To this end, we study two types of algorithms: adaptive and non-adaptive ones, each of which corresponds to whether we adaptively select the next respondents based on the answers of the previous respondents or not. We first provide the information theoretic lower bounds for the necessary budgets in both algorithm types. In terms of the sufficient budgets, we propose two practical estimation algorithms, each of non-adaptive and adaptive types, and for each algorithm, we quantitatively analyze the budget which ensures 1 - delta detection accuracy. This theoretical analysis not only quantifies the budgets needed by practical estimation algorithms achieving a given target detection accuracy in finding the diffusion source, but also enables us to quantitatively characterize the amount of extra budget required in non-adaptive type of estimation, referred to as adaptivity gap. We validate our theoretical findings over synthetic and real-world social network topologies. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC | - |
dc.relation.isPartOf | IEEE-ACM TRANSACTIONS ON NETWORKING | - |
dc.title | Information Source Finding in Networks: Querying With Budgets | - |
dc.type | Article | - |
dc.type.rims | ART | - |
dc.description.journalClass | 1 | - |
dc.identifier.wosid | 000579307800027 | - |
dc.identifier.doi | 10.1109/TNET.2020.3009946 | - |
dc.identifier.bibliographicCitation | IEEE-ACM TRANSACTIONS ON NETWORKING, v.28, no.5, pp.2271 - 2284 | - |
dc.description.isOpenAccess | N | - |
dc.identifier.scopusid | 2-s2.0-85101317374 | - |
dc.citation.endPage | 2284 | - |
dc.citation.startPage | 2271 | - |
dc.citation.title | IEEE-ACM TRANSACTIONS ON NETWORKING | - |
dc.citation.volume | 28 | - |
dc.citation.number | 5 | - |
dc.contributor.affiliatedAuthor | Choi, Jaeyoung | - |
dc.type.docType | Article | - |
dc.subject.keywordAuthor | Estimation | - |
dc.subject.keywordAuthor | Network topology | - |
dc.subject.keywordAuthor | IEEE transactions | - |
dc.subject.keywordAuthor | Topology | - |
dc.subject.keywordAuthor | Erbium | - |
dc.subject.keywordAuthor | Moon | - |
dc.subject.keywordAuthor | Object detection | - |
dc.subject.keywordAuthor | Information source detection | - |
dc.subject.keywordAuthor | maximum likelihood estimation | - |
dc.subject.keywordAuthor | querying | - |
dc.subject.keywordPlus | INFECTION SOURCE | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalResearchArea | Engineering | - |
dc.relation.journalResearchArea | Telecommunications | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Hardware & Architecture | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Theory & Methods | - |
dc.relation.journalWebOfScienceCategory | Engineering, Electrical & Electronic | - |
dc.relation.journalWebOfScienceCategory | Telecommunications | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
1342, Seongnam-daero, Sujeong-gu, Seongnam-si, Gyeonggi-do, Republic of Korea(13120)031-750-5114
COPYRIGHT 2020 Gachon University All Rights Reserved.
Certain data included herein are derived from the © Web of Science of Clarivate Analytics. All rights reserved.
You may not copy or re-distribute this material in whole or in part without the prior written consent of Clarivate Analytics.