메뉴 건너뛰기




Volumn 40, Issue 2, 2013, Pages 211-239

Meme ranking to maximize posts virality in microblogging platforms

Author keywords

Feed ranking; Information propagation; Social network analysis

Indexed keywords

APPROXIMATED SOLUTIONS; COMMUNICATION PARADIGM; EXTENSIVE SIMULATIONS; INFORMATION PROPAGATION; MICRO-BLOGGING PLATFORMS; RANKING PROBLEMS; USER COMMUNITIES; USER INTERESTING;

EID: 84879694782     PISSN: 09259902     EISSN: 15737675     Source Type: Journal    
DOI: 10.1007/s10844-011-0181-4     Document Type: Article
Times cited : (18)

References (38)
  • 1
    • 33748871742 scopus 로고    scopus 로고
    • Tracking information epidemics in blogspace
    • Adar, E.; Adamic, L. A. (2005). Tracking information epidemics in blogspace. In Web Intelligence.
    • (2005) Web Intelligence
    • Adar, E.1    Adamic, L.A.2
  • 14
    • 33845467053 scopus 로고    scopus 로고
    • Inferring binary trust relationships in web-based social networks
    • 10.1145/1183463.1183470
    • Golbeck, J.; Hendler, J. (2006). Inferring binary trust relationships in web-based social networks. ACM Transactions on Internet Technology, 6(4), 497-529.
    • (2006) ACM Transactions on Internet Technology , vol.6 , Issue.4 , pp. 497-529
    • Golbeck, J.1    Hendler, J.2
  • 18
    • 84947403595 scopus 로고
    • Probability inequalities for sums of bounded random variables
    • 144363 0127.10602 10.1080/01621459.1963.10500830
    • Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 58(301), 13-30.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1
  • 20
    • 84879694775 scopus 로고    scopus 로고
    • Twitterrank: Finding topic-sensitive influential twitterers
    • Jianshu Weng, J. J.; Lim, Ee-P.; He, Q. (2010). Twitterrank: Finding topic-sensitive influential twitterers. In WSDM, p. 10.
    • (2010) WSDM , pp. 10
    • Jianshu Weng, J.J.1    Lim, E.-P.2    He, Q.3
  • 35
    • 0000142982 scopus 로고
    • The complexity of enumeration and reliability problems
    • 539258 0419.68082 10.1137/0208032
    • Valiant, L. G. (1979). The complexity of enumeration and reliability problems. SIAM Journal on Computing, 8(3), 410-421.
    • (1979) SIAM Journal on Computing , vol.8 , Issue.3 , pp. 410-421
    • Valiant, L.G.1
  • 37
    • 24344486868 scopus 로고    scopus 로고
    • Efficiently mining frequent trees in a forest: Algorithms and applications
    • 10.1109/TKDE.2005.125 (special issue on Mining Biological Data)
    • Zaki, M. J. (2005). Efficiently mining frequent trees in a forest: Algorithms and applications. IEEE Transactions on Knowledge and Data Engineering, 17(8), 1021-1035 (special issue on Mining Biological Data).
    • (2005) IEEE Transactions on Knowledge and Data Engineering , vol.17 , Issue.8 , pp. 1021-1035
    • Zaki, M.J.1
  • 38
    • 29844444091 scopus 로고    scopus 로고
    • Propagation models for trust and distrust in social networks
    • 10.1007/s10796-005-4807-3
    • Ziegler, C.-N.; Lausen, G. (2005). Propagation models for trust and distrust in social networks. Information Systems Frontiers, 7(4-5), 337-358.
    • (2005) Information Systems Frontiers , vol.7 , Issue.4-5 , pp. 337-358
    • Ziegler, C.-N.1    Lausen, G.2


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