A community-based sampling method using DPL for online social networks
DC Field | Value | Language |
---|---|---|
dc.contributor.author | Yoon, Seok-Ho | - |
dc.contributor.author | Kim, Ki-Nam | - |
dc.contributor.author | Hong, Jiwon | - |
dc.contributor.author | Kim, Sang-Wook | - |
dc.contributor.author | Park, Sunju | - |
dc.date.accessioned | 2022-07-15T22:42:28Z | - |
dc.date.available | 2022-07-15T22:42:28Z | - |
dc.date.created | 2021-05-12 | - |
dc.date.issued | 2015-06 | - |
dc.identifier.issn | 0020-0255 | - |
dc.identifier.uri | https://scholarworks.bwise.kr/hanyang/handle/2021.sw.hanyang/157125 | - |
dc.description.abstract | In this paper, we propose a new graph sampling method for online social networks that achieves the following. First, a sample graph should reflect the ratio between the number of nodes and the number of edges of the original graph. Second, a sample graph should reflect the topology of the original graph. Third, sample graphs should be consistent with each other when they are sampled from the same original graph. The proposed method employs two techniques: hierarchical community extraction and densification power law. The proposed method partitions the original graph into a set of communities to preserve the topology of the original graph. It also uses the densification power law which captures the ratio between the number of nodes and the number of edges in online social networks. In experiments, we use several real-world online social networks, create sample graphs using the existing methods and ours, and analyze the differences between the sample graph by each sampling method and the original graph. | - |
dc.language | 영어 | - |
dc.language.iso | en | - |
dc.publisher | ELSEVIER SCIENCE INC | - |
dc.title | A community-based sampling method using DPL for online social networks | - |
dc.type | Article | - |
dc.contributor.affiliatedAuthor | Kim, Sang-Wook | - |
dc.identifier.doi | 10.1016/j.ins.2015.02.014 | - |
dc.identifier.scopusid | 2-s2.0-84926211696 | - |
dc.identifier.wosid | 000351803800004 | - |
dc.identifier.bibliographicCitation | INFORMATION SCIENCES, v.306, pp.53 - 69 | - |
dc.relation.isPartOf | INFORMATION SCIENCES | - |
dc.citation.title | INFORMATION SCIENCES | - |
dc.citation.volume | 306 | - |
dc.citation.startPage | 53 | - |
dc.citation.endPage | 69 | - |
dc.type.rims | ART | - |
dc.type.docType | Article | - |
dc.description.journalClass | 1 | - |
dc.description.isOpenAccess | Y | - |
dc.description.journalRegisteredClass | scie | - |
dc.description.journalRegisteredClass | scopus | - |
dc.relation.journalResearchArea | Computer Science | - |
dc.relation.journalWebOfScienceCategory | Computer Science, Information Systems | - |
dc.subject.keywordPlus | INFORMATION DIFFUSION | - |
dc.subject.keywordPlus | INTERNET | - |
dc.subject.keywordPlus | ALGORITHMS | - |
dc.subject.keywordAuthor | Graph sampling | - |
dc.subject.keywordAuthor | Online social network | - |
dc.subject.keywordAuthor | Densification power law | - |
dc.identifier.url | https://www.sciencedirect.com/science/article/pii/S0020025515001073?via%3Dihub | - |
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.
222, Wangsimni-ro, Seongdong-gu, Seoul, 04763, Korea+82-2-2220-1365
COPYRIGHT © 2021 HANYANG UNIVERSITY.
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.