DC Field | Value | Language |
---|---|---|
dc.contributor.advisor | Yi, Yung | - |
dc.contributor.advisor | 이융 | - |
dc.contributor.author | Woo, Jiin | - |
dc.date.accessioned | 2019-09-04T02:43:47Z | - |
dc.date.available | 2019-09-04T02:43:47Z | - |
dc.date.issued | 2018 | - |
dc.identifier.uri | http://library.kaist.ac.kr/search/detail/view.do?bibCtrlNo=828691&flag=dissertation | en_US |
dc.identifier.uri | http://hdl.handle.net/10203/266896 | - |
dc.description | 학위논문(석사) - 한국과학기술원 : 전기및전자공학부, 2018.8,[iii, 27 p. :] | - |
dc.description.abstract | Graph learning is an inference problem of estimating the nodes’ connectivity from a collection of epidemic cascades, with many useful applications in the areas of in online/offline social networks, p2p networks, computer security, and epidemiology. We consider a case when the information of cascade samples are only partially observed under the IC (Independent Cascade) epidemic model, where our interest is to compute the sample complexity, i.e., a required number of cascade samples to achieve a given target inference accuracy. We first provide a fundamental lower bound on the sample complexity. Then, motivated by the fact that the famous Maximum Likelihood Estimator (MLE) is computationally intractable, we propose a greedy heuristic that works based on counting the estimated number of possible activation path, which we call counting of virtual activation paths, where the key strength lies in having much smaller computational complexity than the algorithm based on the approximation of MLE. We analyze the sample complexity of our greedy heuristic, which is close to optimal for some graphs where activation propagates ceaselessly. We evaluate the performance of our algorithm over various types of graph topologies. | - |
dc.language | eng | - |
dc.publisher | 한국과학기술원 | - |
dc.subject | Social network▼acascade▼aconnectivity learning▼agreedy algorithm▼asample complexity | - |
dc.subject | 사회 관계망▼a확산▼a연결성 학습▼a탐욕적 알고리즘▼a샘플 복잡도 | - |
dc.title | Greedy learning of graph connectivity from partially-observed cascade samples | - |
dc.title.alternative | 불완전 확산 샘플을 통한 탐욕적 그래프 연결성 학습 | - |
dc.type | Thesis(Master) | - |
dc.identifier.CNRN | 325007 | - |
dc.description.department | 한국과학기술원 :전기및전자공학부, | - |
dc.contributor.alternativeauthor | 우지인 | - |
Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.