Fast detection of overlapping communities in online social networks

Research output: Contribution to conferencePaper

1 Citation (Scopus)

Abstract

In today's world, social media networks capture interactions among people through comments on blogs, posts and feeds. The public availability of these networks has allowed researchers and businesses alike to delve more into these preferences so as to extract communities of similar interests which define their formation. Although community detection has been well applied to social networks, only recently has the need been felt for detecting overlapping communities. As people tend to have more than one preference over different products, it makes it difficult to put them in a single community. Also, the volume and scale of social media data makes it difficult to detect communities in real time which calls for faster implementations of existing algorithms. In this paper we first describe an existing algorithm which applies a game theoretic approach to determine overlapping communities within networks and show how a parallel implementation of the algorithm can be used to detect communities in lesser time than its previous implementations. We validate our implementation, by running experiments on some real world on-line social networks. We conclude by suggesting efficient ways to implement faster algorithms and topics of further research to detect and analyze social networks.

Original languageEnglish (US)
Pages3379-3388
Number of pages10
StatePublished - Jan 1 2012
Event62nd IIE Annual Conference and Expo 2012 - Orlando, FL, United States
Duration: May 19 2012May 23 2012

Other

Other62nd IIE Annual Conference and Expo 2012
CountryUnited States
CityOrlando, FL
Period5/19/125/23/12

Fingerprint

Blogs
Availability
Industry
Experiments

All Science Journal Classification (ASJC) codes

  • Industrial and Manufacturing Engineering

Cite this

Ghurye, A., & Tirupatikumara, S. R. (2012). Fast detection of overlapping communities in online social networks. 3379-3388. Paper presented at 62nd IIE Annual Conference and Expo 2012, Orlando, FL, United States.
Ghurye, Akshay ; Tirupatikumara, Soundar Rajan. / Fast detection of overlapping communities in online social networks. Paper presented at 62nd IIE Annual Conference and Expo 2012, Orlando, FL, United States.10 p.
@conference{467eb23b823d490fa5717fb4150f137e,
title = "Fast detection of overlapping communities in online social networks",
abstract = "In today's world, social media networks capture interactions among people through comments on blogs, posts and feeds. The public availability of these networks has allowed researchers and businesses alike to delve more into these preferences so as to extract communities of similar interests which define their formation. Although community detection has been well applied to social networks, only recently has the need been felt for detecting overlapping communities. As people tend to have more than one preference over different products, it makes it difficult to put them in a single community. Also, the volume and scale of social media data makes it difficult to detect communities in real time which calls for faster implementations of existing algorithms. In this paper we first describe an existing algorithm which applies a game theoretic approach to determine overlapping communities within networks and show how a parallel implementation of the algorithm can be used to detect communities in lesser time than its previous implementations. We validate our implementation, by running experiments on some real world on-line social networks. We conclude by suggesting efficient ways to implement faster algorithms and topics of further research to detect and analyze social networks.",
author = "Akshay Ghurye and Tirupatikumara, {Soundar Rajan}",
year = "2012",
month = "1",
day = "1",
language = "English (US)",
pages = "3379--3388",
note = "62nd IIE Annual Conference and Expo 2012 ; Conference date: 19-05-2012 Through 23-05-2012",

}

Ghurye, A & Tirupatikumara, SR 2012, 'Fast detection of overlapping communities in online social networks', Paper presented at 62nd IIE Annual Conference and Expo 2012, Orlando, FL, United States, 5/19/12 - 5/23/12 pp. 3379-3388.

Fast detection of overlapping communities in online social networks. / Ghurye, Akshay; Tirupatikumara, Soundar Rajan.

2012. 3379-3388 Paper presented at 62nd IIE Annual Conference and Expo 2012, Orlando, FL, United States.

Research output: Contribution to conferencePaper

TY - CONF

T1 - Fast detection of overlapping communities in online social networks

AU - Ghurye, Akshay

AU - Tirupatikumara, Soundar Rajan

PY - 2012/1/1

Y1 - 2012/1/1

N2 - In today's world, social media networks capture interactions among people through comments on blogs, posts and feeds. The public availability of these networks has allowed researchers and businesses alike to delve more into these preferences so as to extract communities of similar interests which define their formation. Although community detection has been well applied to social networks, only recently has the need been felt for detecting overlapping communities. As people tend to have more than one preference over different products, it makes it difficult to put them in a single community. Also, the volume and scale of social media data makes it difficult to detect communities in real time which calls for faster implementations of existing algorithms. In this paper we first describe an existing algorithm which applies a game theoretic approach to determine overlapping communities within networks and show how a parallel implementation of the algorithm can be used to detect communities in lesser time than its previous implementations. We validate our implementation, by running experiments on some real world on-line social networks. We conclude by suggesting efficient ways to implement faster algorithms and topics of further research to detect and analyze social networks.

AB - In today's world, social media networks capture interactions among people through comments on blogs, posts and feeds. The public availability of these networks has allowed researchers and businesses alike to delve more into these preferences so as to extract communities of similar interests which define their formation. Although community detection has been well applied to social networks, only recently has the need been felt for detecting overlapping communities. As people tend to have more than one preference over different products, it makes it difficult to put them in a single community. Also, the volume and scale of social media data makes it difficult to detect communities in real time which calls for faster implementations of existing algorithms. In this paper we first describe an existing algorithm which applies a game theoretic approach to determine overlapping communities within networks and show how a parallel implementation of the algorithm can be used to detect communities in lesser time than its previous implementations. We validate our implementation, by running experiments on some real world on-line social networks. We conclude by suggesting efficient ways to implement faster algorithms and topics of further research to detect and analyze social networks.

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

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

M3 - Paper

AN - SCOPUS:84900295681

SP - 3379

EP - 3388

ER -

Ghurye A, Tirupatikumara SR. Fast detection of overlapping communities in online social networks. 2012. Paper presented at 62nd IIE Annual Conference and Expo 2012, Orlando, FL, United States.