ACM Home Page
Please provide us with feedback. Feedback
User grouping behavior in online forums
Full text MovMov (15:14),  PdfPdf (615 KB)
Source
International Conference on Knowledge Discovery and Data Mining archive
Proceedings of the 15th ACM SIGKDD international conference on Knowledge discovery and data mining table of contents
Paris, France
SESSION: Research track papers table of contents
Pages 777-786  
Year of Publication: 2009
ISBN:978-1-60558-495-9
Authors
Xiaolin Shi  University of Michigan, Ann Arbor, MI, USA
Jun Zhu  Tsinghua University, Beijing, China
Rui Cai  Microsoft Research Asia, Beijing, China
Lei Zhang  Microsoft Research Asia, Beijing, China
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): 39,   Downloads (12 Months): 157,   Citation Count: 0
Additional Information:

abstract   references   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/1557019.1557105
What is a DOI?

ABSTRACT

Online forums represent one type of social media that is particularly rich for studying human behavior in information seeking and diffusing. The way users join communities is a reflection of the changing and expanding of their interests toward information. In this paper, we study the patterns of user participation behavior, and the feature factors that influence such behavior on different forum datasets. We find that, despite the relative randomness and lesser commitment of structural relationships in online forums, users' community joining behaviors display some strong regularities. One particularly interesting observation is that the very weak relationships between users defined by online replies have similar diffusion curves as those of real friendships or co-authorships. We build social selection models, Bipartite Markov Random Field (BiMRF), to quantitatively evaluate the prediction performance of those feature factors and their relationships. Using these models, we show that some features carry supplementary information, and the effectiveness of different features vary in different types of forums. Moreover, the results of BiMRF with two-star configurations suggest that the feature of user similarity defined by frequency of communication or number of common friends is inadequate to predict grouping behavior, but adding node-level features can improve the fit of the model.


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
O. Frank and D. Strauss. Markov graphs. Journal of the American Statistical Association, 81:832--842, 1986.
 
5
K.-I. Goh, Y.-H. Eom, H. Jeong, B. Kahng, and D. Kim. Structure and evolution of online social relationships: Heterogeneity in unrestricted discussions. Physical Review E, 73(6):066123, 2006.
6
 
7
 
8
 
9
K. Lerman. User participation in social media: Digg study. In SMA07, 2007.
10
11
 
12
 
13
M. E. J. Newman. The structure and function of complex networks. SIAM Review, 45:167, 2003.
 
14
M. E. J. Newman, D. J. Watts, and S. H. Strogatz. Random graph models of social networks. the National Academy of Sciences, 99:2566--2572, 2002.
 
15
 
16
J. M. O'Brien. The race to create a 'smart' google. FORTUNE Magazine, 2006.
 
17
G. Robins, P. Elliott, and P. Pattison. Network models for social selection processes. Social Networks, 23:1--30, 2001.
 
18
G. Robins, P. Pattison, Y. Kalish, and D. Lusher. An introduction to exponential random graph (p*) model for social networks. Social Networks, 29:173--191, 2007.
 
19
G. Robins, T. Snijders, P. Wang, M. Handcock, and P. Pattison. Recent development in exponential random graph (p*) model for social networks. Social Networks, 29:192--215, 2007.
20
 
21
T. A. B. Snijders, G. L. Robins, and M. S. Handcock. New specifications for exponential random graph models. Sociological Methodology, pages 99--153, 2006.
22
 
23
D. Strang and S. A. Soule. Diffusion in organizations and social movements: From hybrid corn to poison pills. Annual Review of Sociology, 24:265--290, 1998.
 
24
D. Strauss and M. Ikeda. Pseudo-likelihood estimation for social networks. Journal of the American Statistical Association, 85:204--212, 1990.
 
25
S. Wasserman and P. Pattison. Logit models and logistic regressions for social networks, I. an introduction to exponential random graphs and (p*). Psychometrika, 62:401--425, 1996.
 
26
S. Wasserman and G. Robins. An introduction to random graphs, dependence graphs, and p*. Models and Methods in Social Network Analysis, pages 148--161, 2005.
 
27
E. P. Xing, M. I. Jordan, and S. Russell. A generalized mean field algorithm for variational inference in exponential families. In UAI, 2003.
 
28
K. Zhongbao and Z. Changshui. Reply networks on a bulletin board system. Phys. Rev. E, 67(3):036117, 2003.

Collaborative Colleagues:
Xiaolin Shi: colleagues
Jun Zhu: colleagues
Rui Cai: colleagues
Lei Zhang: colleagues