STRIP: Stream learning of influence probabilities

Proceedings of the ACM SIGKDD International Conference on Knowledge Discovery and Data Mining

Volumn Part F128815, Issue , 2013, Pages 275-283

  Kutzkov, Konstantin ^a   Bifet, Albert ^b   Bonchi, Francesco ^b   Gionis, Aristides ^c  

^a IT UNIVERSITY OF COPENHAGEN   (Denmark)

^b YAHOO RESEARCH   (Spain)

^c AALTO UNIVERSITY   (Finland)

Author keywords

Randomized approximation algorithms; Social influence; Social network analysis; Streaming

Indexed keywords

ACOUSTIC STREAMING; APPROXIMATION ALGORITHMS; COMPLEX NETWORKS; DATA MINING; LEARNING ALGORITHMS; PROBABILITY; SOCIAL NETWORKING (ONLINE);

EMPIRICAL PERFORMANCE; EXPERIMENTAL EVALUATION; MICRO-BLOGGING PLATFORMS; MODEL INFORMATIONS; NETWORK TOPOLOGY; RANDOMIZED APPROXIMATION; SLIDING WINDOW MODELS; SOCIAL INFLUENCE;

EDUCATION;

EID: 84906956789     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2487575.2487657     Document Type: Conference Paper

References (21)

1. Z. Bar-Yossef, T. S. Jayram, R. Kumar, D. Sivakumar, and L. Trevisan. Counting distinct elements in a data stream. In RANDOM'02.
2. M. Blum, R. W. Floyd, V. R. Pratt, R. L. Rivest, and R. E. Tarjan. Time bounds for selection. J. Comput. Syst. Sci., 7(4):448-461, 1973.
3. C. Brase and C. Brase. Understandable Statistics: Concepts and Methods. Brooks/Cole, 2011.
4. A. Z. Broder, M. Charikar, A. M. Frieze, and M. Mitzenmacher. Min-wise independent permutations. J. Comput. Syst. Sci., 60(3):630-659, 2000.
5. L. Carter and M. N. Wegman. Universal classes of hash functions. J. Comput. Syst. Sci., 18(2):143-154, 1979.
6. M. Charikar, K. Chen, and M. Farach-Colton. Finding frequent items in data streams. Theor. Comput. Sci., 312(1):3-15, 2004.
7. W. Chen, C. Wang, and Y. Wang. Scalable inuence maximization for prevalent viral marketing in large-scale social networks. In KDD'10.
8. E. Cohen, M. Datar, S. Fujiwara, A. Gionis, P. Indyk, R. Motwani, J. D. Ullman, and C. Yang. Finding interesting associations without support pruning. IEEE Trans. Knowl. Data Eng., 13(1):64-78, 2001.
9. M. Datar, A. Gionis, P. Indyk, and R. Motwani. Maintaining stream statistics over sliding windows. SIAM J. Comput., 31(6):1794-1813, 2002.
10. P. Domingos and M. Richardson. Mining the network value of customers. In KDD'01.
11. J. Feigenbaum, S. Kannan, A. McGregor, and J. Zhang. On graph problems in a semi-streaming model. In ICALP, 2004.
12. G. Feigenblat, E. Porat, and A. Shiftan. Exponential time improvement for min-wise based algorithms. Inf. Comput., 209(4):737-747, 2011.
13. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. Learning inuence probabilities in social networks. In WSDM'10.
14. A. Goyal, F. Bonchi, and L. V. S. Lakshmanan. A data-based approach to social inuence maximization. PVLDB, 5(1):73-84, 2011.
15. B. Kalyanasundaram and G. Schnitger. The probabilistic communication complexity of set intersection. SIAM J. Discrete Math., 5(4):545-557, 1992.
16. D. Kempe, J. M. Kleinberg, and E. Tardos. Maximizing the spread of inuence through a social network. In KDD'03.
17. J. Leskovec, J. Kleinberg, and C. Faloutsos. Graphs over time: Densifcation laws, shrinking diameters and possible explanations. In KDD'05.
18. J. Leskovec, A. Krause, C. Guestrin, C. Faloutsos, J. VanBriesen, and N. S. Glance. Cost-effective outbreak detection in networks. In KDD'07.
19. R. Motwani and P. Raghavan. Randomized Algorithms. CRC Press, 1997.
20. M. Patrascu and M. Thorup. The power of simple tabulation hashing. J. ACM, 59(3):14, 2012.
21. K. Saito, R. Nakano, and M. Kimura. Prediction of information diffusion probabilities for independent cascade model. In KES'08.