skip to main content
10.1145/2433396.2433423acmconferencesArticle/Chapter ViewAbstractPublication PageswsdmConference Proceedingsconference-collections
research-article

Bursty subgraphs in social networks

Published: 04 February 2013 Publication History

Abstract

Data available through social media and content sharing platforms present opportunities for analysis and mining. In the context of social networks, it is interesting to formalize and locate bursts of activities amongst users, related to a particular event and to report sets of socially connected users participating in such bursts. Such collections present new opportunities for understanding social events, and render new ways of online marketing.
In this paper, we model social information using two conceptualized graph models. The first one (the action graph) provides a detailed model of all activities of all users while the second one (the holistic graph) provides an aggregate view on each user in the social media. We also propose two models to define the notion of "burst". The first model (intrinsic burst model) takes the intrinsic characteristics of each user into account to recognize the bursty behaviors; while the second model (social burst model) considers neighbors' influences when identifying bursts. We provide two linear algorithms to detect bursts based on the proposed models. These algorithms have been extensively evaluated on a month of full Twitter dataset certifying the practicality of our approach. A detailed qualitative study of our techniques is also presented.

References

[1]
G. De Francisci Morales, A. Gionis, and C. Lucchese. From chatter to headlines: harnessing the real-time web for personalized news recommendation. WSDM, pages 153--162, 2012.
[2]
P. Domingos and M. Richardson. Mining the network value of customers. SIGKDD, pages 57--66, 2001.
[3]
J. Edmonds and R. M. Karp. Theoretical improvements in algorithmic effciency for network flow problems. J. ACM, 19:248--264, 1972.
[4]
J. Ford, L.R. and D. Fulkerson. Maximal flow through a network. Canadian Journal of Mathematics, 8:399--404, 1956.
[5]
M. R. Garey and D. S. Johnson. Computers and Intractability; A Guide to the Theory of NP-Completeness. W. H. Freeman & Co., New York, NY, USA, 1990.
[6]
A. V. Goldberg and R. E. Tarjan. A new approach to the maximum-flow problem. J. ACM, 35(4):921--940, 1988.
[7]
D. M. Greig, B. T. Porteous, and A. H. Seheult. Exact maximum a posteriori estimation for binary images. Journal of the Royal Statistical Society. Series B, 51:271--279, 1989.
[8]
D. Kempe, J. Kleinberg, and E. Tardos. Maximizing the spread of influence in a social network. SIGKDD, pages 137--146, 2003.
[9]
J. Kleinberg. Bursty and hierarchical structure in streams. SIGKDD, pages 91--101, 2002.
[10]
A. Kotov, C. Zhai, and R. Sproat. Mining named entities with temporally correlated bursts from multilingual web news streams. WSDM, pages 237--246, 2011.
[11]
C. X. Lin, B. Zhao, Q. Mei, and J. Han. Pet: a statistical model for popular events tracking in social communities. SIGKDD, pages 929--938, 2010.
[12]
M. Mathioudakis, N. Bansal, and N. Koudas. Identifying, attributing and describing spatial bursts. VLDB Endowment, 3(1-2):1091--1102, Sept. 2010.
[13]
A. Pal and S. Counts. Identifying topical authorities in microblogs. WSDM, pages 45--54, 2011.
[14]
E. J. Ruiz, V. Hristidis, C. Castillo, A. Gionis, and A. Jaimes. Correlating financial time series with micro-blogging activity. WSDM, pages 513--522, 2012.
[15]
J. Weng, E.-P. Lim, J. Jiang, and Q. He. Twitterrank: finding topic-sensitive in uential twitterers. WSDM, pages 261--270, 2010.
[16]
Y. Zhu and D. Shasha. Effcient elastic burst detection in data streams. SIGKDD, pages 336--345, 2003.

Cited By

View all
  • (2021)Tracking triadic cardinality distributions for burst detection in high-speed graph streamsKnowledge and Information Systems10.1007/s10115-021-01543-x63:4(939-969)Online publication date: 1-Apr-2021
  • (2018)Social InfluenceEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_80694(3523-3528)Online publication date: 7-Dec-2018

Recommendations

Comments

Information & Contributors

Information

Published In

cover image ACM Conferences
WSDM '13: Proceedings of the sixth ACM international conference on Web search and data mining
February 2013
816 pages
ISBN:9781450318693
DOI:10.1145/2433396
Permission to make digital or hard copies of all or part of this work for personal or classroom use is granted without fee provided that copies are not made or distributed for profit or commercial advantage and that copies bear this notice and the full citation on the first page. Copyrights for components of this work owned by others than ACM must be honored. Abstracting with credit is permitted. To copy otherwise, or republish, to post on servers or to redistribute to lists, requires prior specific permission and/or a fee. Request permissions from [email protected]

Sponsors

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 04 February 2013

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. bursty subgraphs
  2. information burst
  3. social networks
  4. twitter

Qualifiers

  • Research-article

Conference

WSDM 2013

Acceptance Rates

Overall Acceptance Rate 498 of 2,863 submissions, 17%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)6
  • Downloads (Last 6 weeks)0
Reflects downloads up to 08 Mar 2025

Other Metrics

Citations

Cited By

View all
  • (2021)Tracking triadic cardinality distributions for burst detection in high-speed graph streamsKnowledge and Information Systems10.1007/s10115-021-01543-x63:4(939-969)Online publication date: 1-Apr-2021
  • (2018)Social InfluenceEncyclopedia of Database Systems10.1007/978-1-4614-8265-9_80694(3523-3528)Online publication date: 7-Dec-2018

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Figures

Tables

Media

Share

Share

Share this Publication link

Share on social media