Common neighbour similarity-based approach to support intimacy measurement in social networks
- Authors
- Seol, Kwangsoo; Kim, Jeong-Dong; Baik, Doo-Kwon
- Issue Date
- 4월-2016
- Publisher
- SAGE PUBLICATIONS LTD
- Keywords
- common neighbour similarity; intimacy measurement; social data analysis; social networking service
- Citation
- JOURNAL OF INFORMATION SCIENCE, v.42, no.2, pp.128 - 137
- Indexed
- SCIE
SSCI
SCOPUS
- Journal Title
- JOURNAL OF INFORMATION SCIENCE
- Volume
- 42
- Number
- 2
- Start Page
- 128
- End Page
- 137
- URI
- https://scholar.korea.ac.kr/handle/2021.sw.korea/89120
- DOI
- 10.1177/0165551515589230
- ISSN
- 0165-5515
- Abstract
- A large amount of social data is being generated every day, as the Internet becomes more pervasive and mobile devices more ubiquitous. Accordingly, Internet users often experience difficulty finding the content they want, resulting in the popularity of personalized services that provide user-customized content. Intimacy between users of social network services can be utilized as a foundational technology for personalized services. In this paper, an intimacy measurement method for social networking services based on common neighbour similarity is proposed. The proposed method uses the link relationship between users for intimacy measurements and can be applied to general users. Further, it promotes easy data collection using publicly available data. To evaluate the proposed intimacy measurement method experimentally, a significant amount of user data was collected from Twitter. In addition, various statistical datasets were presented, and regression analyses conducted on graphs extracted from user data were collected to interpret the meaning of the intimacy index measured using the proposed method with existing social networking services.
- Files in This Item
- There are no files associated with this item.
- Appears in
Collections - College of Informatics > Department of Computer Science and Engineering > 1. Journal Articles
Items in ScholarWorks are protected by copyright, with all rights reserved, unless otherwise indicated.