[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ skip to main content
10.1145/1367497.1367590acmconferencesArticle/Chapter ViewAbstractPublication PagesthewebconfConference Proceedingsconference-collections
research-article

Facetnet: a framework for analyzing communities and their evolutions in dynamic networks

Published: 21 April 2008 Publication History

Abstract

We discover communities from social network data, and analyze the community evolution. These communities are inherent characteristics of human interaction in online social networks, as well as paper citation networks. Also, communities may evolve over time, due to changes to individuals' roles and social status in the network as well as changes to individuals' research interests. We present an innovative algorithm that deviates from the traditional two-step approach to analyze community evolutions. In the traditional approach, communities are first detected for each time slice, and then compared to determine correspondences. We argue that this approach is inappropriate in applications with noisy data. In this paper, we propose FacetNet for analyzing communities and their evolutions through a robust unified process. In this novel framework, communities not only generate evolutions, they also are regularized by the temporal smoothness of evolutions. As a result, this framework will discover communities that jointly maximize the fit to the observed data and the temporal evolution. Our approach relies on formulating the problem in terms of non-negative matrix factorization, where communities and their evolutions are factorized in a unified way. Then we develop an iterative algorithm, with proven low time complexity, which is guaranteed to converge to an optimal solution. We perform extensive experimental studies, on both synthetic datasets and real datasets, to demonstrate that our method discovers meaningful communities and provides additional insights not directly obtainable from traditional methods.

References

[1]
S. Asur, S. Parthasarathy, and D. Ucar. An event-based framework for characterizing the evolutionary behavior of interaction graphs. In Proc. of the 13th ACM SIGKDD Conference, 2007.
[2]
D. Chakrabarti, R. Kumar, and A. Tomkins. Evolutionary clustering. In Proc. of the 12th ACM SIGKDD Conference, 2006.
[3]
Y. Chi, X. Song, D. Zhou, K. Hino, and B. L. Tseng. Evolutionary spectral clustering by incorporating temporal smoothness. In Proc. of the 13th ACM SIGKDD Conference, 2007.
[4]
F. R. K. Chung. Spectral Graph Theory. American Mathematical Society, 1997.
[5]
S. Dhillon, Y. Guan, and B. Kulis. Kernel k-means: spectral clustering and normalized cuts. In Proc. of the 10th ACM SIGKDD Conference, 2004.
[6]
G. Flake, S. Lawrence, and C. Giles. Efficient identification of web communities. In Proc. of the 6th ACM SIGKDD Conference, 2000.
[7]
J. M. Kleinberg. Authoritative sources in a hyperlinked environment. J. of the ACM, 46(5), 1999.
[8]
R. Kumar, J. Novak, P. Raghavan, and A. Tomkins. On the bursty evolution of blogspace. In Proc. of the 12th WWW Conference, 2003.
[9]
R. Kumar, J. Novak, and A. Tomkins. Structure and evolution of online social networks. In Proc. of the 12th ACM SIGKDD Conference, 2006.
[10]
J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: densification laws, shrinking diameters and possible explanations. In Proc. of the 11th ACM SIGKDD Conference, 2005.
[11]
Y. Lin, H. Sundaram, Y. Chi, J. Tatemura, and B. L. Tseng. Blog community discovery and evolution based on mutual awareness expansion. In Proc. of the Int. Conf. on Web Intelligence, 2007.
[12]
Q. Mei and C. Zhai. Discovering evolutionary theme patterns from text: an exploration of temporal text mining. In Proc. of the 11th ACM SIGKDD Conference, 2005.
[13]
M. E. J. Newman and M. Girvan. Finding and evaluating community structure in networks. Phys. Rev. E, 2004.
[14]
H. Ning, W. Xu, Y. Chi, Y. Gong, and T. Huang. Incremental spectral clustering with application to monitoring of evolving blog communities. In SIAM Int. Conf. on Data Mining, 2007.
[15]
L. Page, S. Brin, R. Motwani, and T. Winograd. The PageRank citation ranking: Bringing order to the web. In Technical report, Stanford Digital Library Technologies Project, Stanford University, Stanford, CA, USA, 1998.
[16]
G. Palla, A.-L. Barabasi, and T. Vicsek. Quantifying social group evolution. Nature, 446, 2007.
[17]
P. Sarkar and A. W. Moore. Dynamic social network analysis using latent space models. SIGKDD Explor. Newsl., 7(2), 2005.
[18]
J. Shi and J. Malik. Normalized cuts and image segmentation. IEEE Trans. on Pattern Analysis and Machine Intelligence, 22(8), 2000.
[19]
M. Spiliopoulou, I. Ntoutsi, Y. Theodoridis, and R. Schult. Monic: modeling and monitoring cluster transitions. In Proc. of the 12th ACM SIGKDD Conference, 2006.
[20]
J. Sun, C. Faloutsos, S. Papadimitriou, and P. S. Yu. GraphScope: parameter-free mining of large time-evolving graphs. In Proc. of the 13th ACM SIGKDD Conference, 2007.
[21]
M. Toyoda and M. Kitsuregawa. Extracting evolution of web communities from a series of web archives. In HYPERTEXT '03: Proc. of the 14th ACM conference on hypertext and hypermedia, 2003.
[22]
S. Wasserman and K. Faust. Social Network Analysis: Methods and Applications. Cambridge University Press, 1994.
[23]
S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM, 2005.
[24]
K. Yu, S. Yu, and V. Tresp. Soft clustering on graphs. In NIPS, 2005.
[25]
H. Zha, X. He, C. H. Q. Ding, M. Gu, and H. D. Simon. Spectral relaxation for k-means clustering. In NIPS, 2001.

Cited By

View all
  • (2024)Vertex clustering in diverse dynamic networksPLOS Complex Systems10.1371/journal.pcsy.00000231:4(e0000023)Online publication date: 5-Dec-2024
  • (2024)On Reporting Durable Patterns in Temporal Proximity GraphsProceedings of the ACM on Management of Data10.1145/36511442:2(1-26)Online publication date: 14-May-2024
  • (2024)Optimization of Graph Clustering Inspired by Dynamic Belief SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.327454736:11(6773-6785)Online publication date: Nov-2024
  • Show More Cited By

Recommendations

Comments

Please enable JavaScript to view thecomments powered by Disqus.

Information & Contributors

Information

Published In

cover image ACM Conferences
WWW '08: Proceedings of the 17th international conference on World Wide Web
April 2008
1326 pages
ISBN:9781605580852
DOI:10.1145/1367497
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

In-Cooperation

Publisher

Association for Computing Machinery

New York, NY, United States

Publication History

Published: 21 April 2008

Permissions

Request permissions for this article.

Check for updates

Author Tags

  1. community
  2. community net
  3. evolution
  4. evolution net
  5. non-negative matrix factorization
  6. soft membership

Qualifiers

  • Research-article

Conference

WWW '08
Sponsor:

Acceptance Rates

Overall Acceptance Rate 1,899 of 8,196 submissions, 23%

Contributors

Other Metrics

Bibliometrics & Citations

Bibliometrics

Article Metrics

  • Downloads (Last 12 months)73
  • Downloads (Last 6 weeks)8
Reflects downloads up to 11 Dec 2024

Other Metrics

Citations

Cited By

View all
  • (2024)Vertex clustering in diverse dynamic networksPLOS Complex Systems10.1371/journal.pcsy.00000231:4(e0000023)Online publication date: 5-Dec-2024
  • (2024)On Reporting Durable Patterns in Temporal Proximity GraphsProceedings of the ACM on Management of Data10.1145/36511442:2(1-26)Online publication date: 14-May-2024
  • (2024)Optimization of Graph Clustering Inspired by Dynamic Belief SystemsIEEE Transactions on Knowledge and Data Engineering10.1109/TKDE.2023.327454736:11(6773-6785)Online publication date: Nov-2024
  • (2024)Higher Order Knowledge Transfer for Dynamic Community Detection With Great ChangesIEEE Transactions on Evolutionary Computation10.1109/TEVC.2023.325756328:1(90-104)Online publication date: Feb-2024
  • (2024)Targeted worker removal reveals a lack of flexibility in brood transport specialisation with no compensatory gain in efficiencyScientific Reports10.1038/s41598-024-55244-w14:1Online publication date: 28-Feb-2024
  • (2024)A multi-objective optimization approach for overlapping dynamic community detectionSoft Computing10.1007/s00500-024-09895-628:19(11323-11342)Online publication date: 24-Jul-2024
  • (2024)Research on Dynamic Community Detection Method Based on Multi-dimensional Feature Information of Community NetworkTrends and Applications in Knowledge Discovery and Data Mining10.1007/978-981-97-2650-9_4(44-56)Online publication date: 28-Apr-2024
  • (2024)A Novel Method for Vertex Clustering in Dynamic NetworksComplex Networks & Their Applications XII10.1007/978-3-031-53499-7_36(445-456)Online publication date: 29-Feb-2024
  • (2023)Social network position is a major predictor of ant behavior, microbiota composition, and brain gene expressionPLOS Biology10.1371/journal.pbio.300220321:7(e3002203)Online publication date: 24-Jul-2023
  • (2023)HB-DSBM: Modeling the Dynamic Complex Networks From Community Level to Node LevelIEEE Transactions on Neural Networks and Learning Systems10.1109/TNNLS.2022.314928534:11(8310-8323)Online publication date: Nov-2023
  • Show More Cited By

View Options

Login options

View options

PDF

View or Download as a PDF file.

PDF

eReader

View online with eReader.

eReader

Media

Figures

Other

Tables

Share

Share

Share this Publication link

Share on social media