ACM Home Page
Please provide us with feedback. Feedback
Structural and temporal analysis of the blogosphere through community factorization
Full text PdfPdf (1.79 MB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 13th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
San Jose, California, USA
SESSION: Research track papers table of contents
Pages: 163 - 172  
Year of Publication: 2007
ISBN:978-1-59593-609-7
Authors
Yun Chi  NEC Laboratories America
Shenghuo Zhu  NEC Laboratories America
Xiaodan Song  NEC Laboratories America
Junichi Tatemura  NEC Laboratories America
Belle L. Tseng  NEC Laboratories America
Sponsors
ACM: Association for Computing Machinery
SIGKDD: ACM Special Interest Group on Knowledge Discovery in Data
SIGMOD: ACM Special Interest Group on Management of Data
Publisher
ACM  New York, NY, USA
Bibliometrics
Downloads (6 Weeks): 32,   Downloads (12 Months): 276,   Citation Count: 6
Additional Information:

abstract   references   cited by   index terms   collaborative colleagues  

Tools and Actions: Request Permissions Request Permissions    Review this Article  
DOI Bookmark: Use this link to bookmark this Article: http://doi.acm.org/10.1145/1281192.1281213
What is a DOI?

ABSTRACT

The blogosphere has unique structural and temporal properties since blogs are typically used as communication media among human individuals. In this paper, we propose a novel technique that captures the structure and temporal dynamics of blog communities. In our framework, a community is a set of blogs that communicate with each other triggered by some events (such as a news article). The community is represented by its structure and temporal dynamics: a community graph indicates how often one blog communicates with another, and a community intensity indicates the activity level of the community that varies over time. Our method, community factorization, extracts such communities from the blogosphere, where the communication among blogs is observed as a set of subgraphs (i.e., threads of discussion). This community extraction is formulated as a factorization problem in the framework of constrained optimization, in which the objective is to best explain the observed interactions in the blogosphere over time. We further provide a scalable algorithm for computing solutions to the constrained optimization problems. Extensive experimental studies on both synthetic and real blog data demonstrate that our technique is able to discover meaningful communities that are not detectable by traditional methods.


REFERENCES

Note: OCR errors may be found in this Reference List extracted from the full text article. ACM has opted to expose the complete List rather than only correct and linked references.

1
2
3
 
4
A. Clauset, M. E. J. Newman, and C. Moore. Finding community structure in very large networks. Physical Review E, 70:066111, 2004.
 
5
 
6
C. Ding, T. Li, and M. Jordan. Convex and semi-nonnegative matrix factorizations for clustering and low-dimension representation. Technical Report LBNL-60428, Lawrence Berkeley National Laboratory, 2006.
7
 
8
G. Golub and C. V. Loan. Matrix Computations. Johns Hopkins University Press, third edition, 1996.
9
 
10
D. A. Harville. Matrix Algebra From a Statistician's Perspective. Springer, first edition, 2000.
 
11
T. Hastie, R. Tibshirani, and J. H. Friedman. The Elements of Statistical Learning. Springer, first edition, 2003.
12
13
14
 
15
D. D. Lee and H. S. Seung. Learning the parts of objects by non-negative matrix factorization. Nature, 401, 1999.
16
17
 
18
M. E. J. Newman. Modularity and community structure in networks. Proc. Natl. Acad. Sci., 2006.
19
 
20
 
21
 
22
G. Wahba. Spline Models for Observational Data. Society for Industrial and Applied Mathematics, 1990.
23
 
24
S. White and P. Smyth. A spectral clustering approach to finding communities in graph. In SDM, 2005.
25
26

CITED BY  6

Collaborative Colleagues:
Yun Chi: colleagues
Shenghuo Zhu: colleagues
Xiaodan Song: colleagues
Junichi Tatemura: colleagues
Belle L. Tseng: colleagues