메뉴 건너뛰기




Volumn , Issue , 2009, Pages 708-719

Efficient identification of starters and followers in social media

Author keywords

[No Author keywords available]

Indexed keywords

EXPERIMENTAL SECTION; HUMAN ACTIVITIES; ONLINE DISCUSSIONS; ONLINE FORUMS; RANDOM SAMPLING; SOCIAL BEHAVIOR; SOCIAL MEDIA; SOCIAL NETWORKS; UNIVERSITY OF TORONTO; USER ACTIVITY; USER ENGAGEMENT; WEBLOGS;

EID: 70349122000     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1516360.1516442     Document Type: Conference Paper
Times cited : (27)

References (21)
  • 4
    • 0002103664 scopus 로고
    • On the markov chain simulation method for uniform combinatorial distributions and simulated annealing
    • D. Aldous. On the markov chain simulation method for uniform combinatorial distributions and simulated annealing. Probability in the Engineering and Informational Sciences, 1987.
    • (1987) Probability in the Engineering and Informational Sciences
    • Aldous, D.1
  • 5
    • 84922874074 scopus 로고    scopus 로고
    • Seeking stable clusters in the blogosphere
    • N. Bansal, F. Chiang, N. Koudas, and F. W. Tompa. Seeking stable clusters in the blogosphere. In VLDB, pages 806-817, 2007.
    • (2007) VLDB , pp. 806-817
    • Bansal, N.1    Chiang, F.2    Koudas, N.3    Tompa, F.W.4
  • 7
  • 11
    • 0000646152 scopus 로고    scopus 로고
    • A chernoff bound for random walks on expander graphs
    • D. Gillman. A chernoff bound for random walks on expander graphs. SIAM J. Comput., 27(4): 1203-1220, 1998.
    • (1998) SIAM J. Comput , vol.27 , Issue.4 , pp. 1203-1220
    • Gillman, D.1
  • 15
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • W. Hoeffding. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301):13-30, 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1
  • 20
    • 0024699930 scopus 로고
    • Approximate counting, uniform generation and rapidly mixing markov chains
    • A. Sinclair and M. Jerrum. Approximate counting, uniform generation and rapidly mixing markov chains. Inf. Comput, 82(1):93-133, 1989.
    • (1989) Inf. Comput , vol.82 , Issue.1 , pp. 93-133
    • Sinclair, A.1    Jerrum, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.