Discovering shared interests in online social networks

Research output: Chapter in Book/Report/Conference proceedingConference contribution

6 Citations (Scopus)

Abstract

The capacity of rapidly disseminating information such as latest news headlines has made online social networks a popular and disruptive venue for spreading influence and distributing contents. Given the importance of online social networks, it becomes increasingly imperative to understand the shared interests of users on the popular information or contents that circulate through these networks. This paper proposes a novel graphical approach based on bipartite graphs and one-mode projection graphs to model the interactions of users and information and to capture the shared interests of users on the information. The experiments based on data-sets collected from Digg, a popular social news aggregation site, have demonstrated the proposed approach is able to discover inherent clusters of users and information within online social networks. The evaluation results also show that these clusters exhibit distinct characteristics. To the best of our knowledge, this paper is the first attempt to apply bipartite graphs and one-mode projections to shed light on the interactions of people and information in online social networks and to discover the clustered nature of users and contents.

Original languageEnglish (US)
Title of host publicationProceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012
Pages163-168
Number of pages6
DOIs
StatePublished - 2012
Event32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012 - Macau, China
Duration: Jun 18 2012Jun 21 2012

Other

Other32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012
CountryChina
CityMacau
Period6/18/126/21/12

Fingerprint

Agglomeration
Experiments

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Control and Systems Engineering

Cite this

Wang, F., Xu, K., & Wang, H. (2012). Discovering shared interests in online social networks. In Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012 (pp. 163-168). [6258151] https://doi.org/10.1109/ICDCSW.2012.15

Discovering shared interests in online social networks. / Wang, Feng; Xu, Kuai; Wang, Haiyan.

Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012. 2012. p. 163-168 6258151.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Wang, F, Xu, K & Wang, H 2012, Discovering shared interests in online social networks. in Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012., 6258151, pp. 163-168, 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012, Macau, China, 6/18/12. https://doi.org/10.1109/ICDCSW.2012.15
Wang F, Xu K, Wang H. Discovering shared interests in online social networks. In Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012. 2012. p. 163-168. 6258151 https://doi.org/10.1109/ICDCSW.2012.15
Wang, Feng ; Xu, Kuai ; Wang, Haiyan. / Discovering shared interests in online social networks. Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012. 2012. pp. 163-168
@inproceedings{944a0c7bfe7e4816a79e3d7d7db1ea95,
title = "Discovering shared interests in online social networks",
abstract = "The capacity of rapidly disseminating information such as latest news headlines has made online social networks a popular and disruptive venue for spreading influence and distributing contents. Given the importance of online social networks, it becomes increasingly imperative to understand the shared interests of users on the popular information or contents that circulate through these networks. This paper proposes a novel graphical approach based on bipartite graphs and one-mode projection graphs to model the interactions of users and information and to capture the shared interests of users on the information. The experiments based on data-sets collected from Digg, a popular social news aggregation site, have demonstrated the proposed approach is able to discover inherent clusters of users and information within online social networks. The evaluation results also show that these clusters exhibit distinct characteristics. To the best of our knowledge, this paper is the first attempt to apply bipartite graphs and one-mode projections to shed light on the interactions of people and information in online social networks and to discover the clustered nature of users and contents.",
author = "Feng Wang and Kuai Xu and Haiyan Wang",
year = "2012",
doi = "10.1109/ICDCSW.2012.15",
language = "English (US)",
pages = "163--168",
booktitle = "Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012",

}

TY - GEN

T1 - Discovering shared interests in online social networks

AU - Wang, Feng

AU - Xu, Kuai

AU - Wang, Haiyan

PY - 2012

Y1 - 2012

N2 - The capacity of rapidly disseminating information such as latest news headlines has made online social networks a popular and disruptive venue for spreading influence and distributing contents. Given the importance of online social networks, it becomes increasingly imperative to understand the shared interests of users on the popular information or contents that circulate through these networks. This paper proposes a novel graphical approach based on bipartite graphs and one-mode projection graphs to model the interactions of users and information and to capture the shared interests of users on the information. The experiments based on data-sets collected from Digg, a popular social news aggregation site, have demonstrated the proposed approach is able to discover inherent clusters of users and information within online social networks. The evaluation results also show that these clusters exhibit distinct characteristics. To the best of our knowledge, this paper is the first attempt to apply bipartite graphs and one-mode projections to shed light on the interactions of people and information in online social networks and to discover the clustered nature of users and contents.

AB - The capacity of rapidly disseminating information such as latest news headlines has made online social networks a popular and disruptive venue for spreading influence and distributing contents. Given the importance of online social networks, it becomes increasingly imperative to understand the shared interests of users on the popular information or contents that circulate through these networks. This paper proposes a novel graphical approach based on bipartite graphs and one-mode projection graphs to model the interactions of users and information and to capture the shared interests of users on the information. The experiments based on data-sets collected from Digg, a popular social news aggregation site, have demonstrated the proposed approach is able to discover inherent clusters of users and information within online social networks. The evaluation results also show that these clusters exhibit distinct characteristics. To the best of our knowledge, this paper is the first attempt to apply bipartite graphs and one-mode projections to shed light on the interactions of people and information in online social networks and to discover the clustered nature of users and contents.

UR - http://www.scopus.com/inward/record.url?scp=84866383479&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84866383479&partnerID=8YFLogxK

U2 - 10.1109/ICDCSW.2012.15

DO - 10.1109/ICDCSW.2012.15

M3 - Conference contribution

AN - SCOPUS:84866383479

SP - 163

EP - 168

BT - Proceedings - 32nd IEEE International Conference on Distributed Computing Systems Workshops, ICDCSW 2012

ER -