메뉴 건너뛰기




Volumn , Issue , 2014, Pages 1719-1728

Scalable vaccine distribution in large graphs given uncertain data

Author keywords

Diffusion; Graph mining; Immunization; Uncertainty

Indexed keywords

ALGORITHMS; DATA MINING; DIFFUSION; IMMUNIZATION; KNOWLEDGE MANAGEMENT; PUBLIC HEALTH; SOCIAL NETWORKING (ONLINE); VACCINES;

EID: 84937573112     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/2661829.2662088     Document Type: Conference Paper
Times cited : (29)

References (46)
  • 3
    • 20744452623 scopus 로고    scopus 로고
    • Inoculation strategies for victims of viruses and the sum-of-squares partition problem
    • J. Aspnes, K. Chang, and A. Yampolskiy. Inoculation strategies for victims of viruses and the sum-of-squares partition problem. SODA '05, pages 43-52, 2005.
    • (2005) SODA '05 , pp. 43-52
    • Aspnes, J.1    Chang, K.2    Yampolskiy, A.3
  • 4
    • 32544439820 scopus 로고    scopus 로고
    • On the robustness of centrality measures under conditions of imperfect data
    • S. P. Borgatti, K. M. Carley, and D. Krackhardt. On the robustness of centrality measures under conditions of imperfect data. Soc. Netw., 28(2):124-136, 2006.
    • (2006) Soc. Netw. , vol.28 , Issue.2 , pp. 124-136
    • Borgatti, S.P.1    Carley, K.M.2    Krackhardt, D.3
  • 6
    • 18844462726 scopus 로고    scopus 로고
    • Epidemic profiles and defense of scale-free networks
    • Oct. 27
    • L. Briesemeister, P. Lincoln, and P. Porras. Epidemic profiles and defense of scale-free networks. WORM 2003, Oct. 27 2003.
    • (2003) WORM 2003
    • Briesemeister, L.1    Lincoln, P.2    Porras, P.3
  • 9
    • 77956192689 scopus 로고    scopus 로고
    • Scalable influence maximization for prevalent viral marketing in large-scale social networks
    • W. Chen, C. Wang, and Y. Wang. Scalable influence maximization for prevalent viral marketing in large-scale social networks. KDD, 2010.
    • (2010) KDD
    • Chen, W.1    Wang, C.2    Wang, Y.3
  • 10
    • 0942268259 scopus 로고    scopus 로고
    • Efficient immunization strategies for computer networks and populations
    • Dec.
    • R. Cohen, S. Havlin, and D. ben Avraham. Efficient immunization strategies for computer networks and populations. Physical Review Letters, 91(24), Dec. 2003.
    • (2003) Physical Review Letters , vol.91 , Issue.24
    • Cohen, R.1    Havlin, S.2    Ben Avraham, D.3
  • 11
    • 0242551065 scopus 로고    scopus 로고
    • The stability of centrality measures when networks are sampled
    • E. Costenbader and T. W. Valente. The stability of centrality measures when networks are sampled. Soc. Netw., 25(4):283-307, 2003.
    • (2003) Soc. Netw. , vol.25 , Issue.4 , pp. 283-307
    • Costenbader, E.1    Valente, T.W.2
  • 13
    • 3242737285 scopus 로고    scopus 로고
    • Statistics notes: Diagnostic tests 4: Likelihood ratios
    • J. J. Deeks and D. G. Altman. Statistics notes: Diagnostic tests 4: likelihood ratios. BMJ: British Medical Journal, 329 (7458):168, 2004.
    • (2004) BMJ: British Medical Journal , vol.329 , Issue.7458 , pp. 168
    • Deeks, J.J.1    Altman, D.G.2
  • 14
    • 33644529428 scopus 로고    scopus 로고
    • Computational complexity of stochastic programming problems
    • May
    • M. Dyer and L. Stougie. Computational complexity of stochastic programming problems. Math. Program., 106(3):423-432, May 2006.
    • (2006) Math. Program. , vol.106 , Issue.3 , pp. 423-432
    • Dyer, M.1    Stougie, L.2
  • 17
    • 0034486891 scopus 로고    scopus 로고
    • The mathematics of infectious diseases
    • H. W. Hethcote. The mathematics of infectious diseases. SIAM Review, 42, 2000.
    • (2000) SIAM Review , vol.42
    • Hethcote, H.W.1
  • 19
    • 80052650977 scopus 로고    scopus 로고
    • Discovering highly reliable subgraphs in uncertain graphs
    • ACM
    • R. Jin, L. Liu, and C. C. Aggarwal. Discovering highly reliable subgraphs in uncertain graphs. In KDD, pages 992-1000. ACM, 2011.
    • (2011) KDD , pp. 992-1000
    • Jin, R.1    Liu, L.2    Aggarwal, C.C.3
  • 22
    • 0036013019 scopus 로고    scopus 로고
    • The sample average approximation method for stochastic discrete optimization
    • Feb.
    • A. J. Kleywegt, A. Shapiro, and T. Homem-de Mello. The sample average approximation method for stochastic discrete optimization. SIAM J. on Optimization, 12(2):479-502, Feb. 2002.
    • (2002) SIAM J. on Optimization , vol.12 , Issue.2 , pp. 479-502
    • Kleywegt, A.J.1    Shapiro, A.2    Homem-De Mello, T.3
  • 23
    • 33747485518 scopus 로고    scopus 로고
    • Effects of missing data in social networks
    • G. Kossinets. Effects of missing data in social networks. Soc. Netw., 28(3):247-268, 2006.
    • (2006) Soc. Netw. , vol.28 , Issue.3 , pp. 247-268
    • Kossinets, G.1
  • 24
    • 84894681477 scopus 로고    scopus 로고
    • Blocking simple and complex contagion by edge removal
    • C. J. Kuhlman, G. Tuli, S. Swarup, M. V. Marathe, and S. S. Ravi. Blocking simple and complex contagion by edge removal. In ICDM, pages 399-408, 2013.
    • (2013) ICDM , pp. 399-408
    • Kuhlman, C.J.1    Tuli, G.2    Swarup, S.3    Marathe, M.V.4    Ravi, S.S.5
  • 25
    • 0042475168 scopus 로고    scopus 로고
    • Sampling biases in IP topology measurements
    • A. Lakhina, J. W. Byers, M. Crovella, and P. Xie. Sampling biases in IP topology measurements. In In IEEE INFOCOM, pages 332-341, 2003.
    • (2003) IEEE INFOCOM , pp. 332-341
    • Lakhina, A.1    Byers, J.W.2    Crovella, M.3    Xie, P.4
  • 26
    • 84976651458 scopus 로고
    • A fast algorithm for finding dominators in a flowgraph
    • Jan.
    • T. Lengauer and R. E. Tarjan. A fast algorithm for finding dominators in a flowgraph. ACM Trans. Program. Lang. Syst., 1(1):121-141, Jan. 1979.
    • (1979) ACM Trans. Program. Lang. Syst. , vol.1 , Issue.1 , pp. 121-141
    • Lengauer, T.1    Tarjan, R.E.2
  • 29
    • 80052689976 scopus 로고    scopus 로고
    • Benefits of bias: Towards better characterization of network sampling
    • A. Maiya and T. Berger-Wolf. Benefits of bias: Towards better characterization of network sampling. In KDD, 2011.
    • (2011) KDD
    • Maiya, A.1    Berger-Wolf, T.2
  • 30
    • 84880174978 scopus 로고    scopus 로고
    • Computational epidemiology
    • July
    • M. Marathe and A. K. S. Vullikanti. Computational epidemiology. Commun. ACM, 56(7):88-96, July 2013.
    • (2013) Commun. ACM , vol.56 , Issue.7 , pp. 88-96
    • Marathe, M.1    Vullikanti, A.K.S.2
  • 32
    • 84892704954 scopus 로고    scopus 로고
    • Is the sample good enough? Comparing data from twitter's streaming api with twitter's firehose
    • F. Morstatter, J. Pfeffer, H. Liu, and K. M. Carley. Is the sample good enough? comparing data from twitter's streaming api with twitter's firehose. In ICWSM, 2013.
    • (2013) ICWSM
    • Morstatter, F.1    Pfeffer, J.2    Liu, H.3    Carley, K.M.4
  • 33
    • 0000095809 scopus 로고
    • An analysis of approximations for maximizing submodular set functions
    • G. L. Nemhauser, L. A. Wolsey, and M. L. Fisher. An analysis of approximations for maximizing submodular set functions. Mathematical Programming, (1):265-294, 1973.
    • (1973) Mathematical Programming , Issue.1 , pp. 265-294
    • Nemhauser, G.L.1    Wolsey, L.A.2    Fisher, M.L.3
  • 34
    • 79953057804 scopus 로고    scopus 로고
    • Did modeling overestimate the transmission potential of pandemic (h1n1-2009)? Sample size estimation for post-epidemic seroepidemiological studies
    • 03
    • H. Nishiura, G. Chowell, and C. Castillo-Chavez. Did modeling overestimate the transmission potential of pandemic (h1n1-2009)? sample size estimation for post-epidemic seroepidemiological studies. PLoS ONE, 6(3):e17908, 03 2011.
    • (2011) PLoS ONE , vol.6 , Issue.3
    • Nishiura, H.1    Chowell, G.2    Castillo-Chavez, C.3
  • 41
    • 38149072053 scopus 로고    scopus 로고
    • Approximation algorithms for 2-stage stochastic optimization problems
    • Helen Martin
    • C. Swamy and D. B. Shmoys. Approximation algorithms for 2-stage stochastic optimization problems. SIGACT News, 37(1):33-46, Helen Martin 2006.
    • (2006) SIGACT News , vol.37 , Issue.1 , pp. 33-46
    • Swamy, C.1    Shmoys, D.B.2
  • 44
    • 84863753859 scopus 로고    scopus 로고
    • Efficient subgraph search over large uncertain graphs
    • Y. Yuan, G. Wang, H. Wang, and L. Chen. Efficient subgraph search over large uncertain graphs. Proc. VLDB Endow, 4(11), 2011.
    • (2011) Proc. VLDB Endow , vol.4 , Issue.11
    • Yuan, Y.1    Wang, G.2    Wang, H.3    Chen, L.4
  • 45
    • 42449110882 scopus 로고
    • An information flow model for conflict and fission in small groups
    • W. Zachary. An information flow model for conflict and fission in small groups. Journal of Anthropological Research, 33:452-473, 1977.
    • (1977) Journal of Anthropological Research , vol.33 , pp. 452-473
    • Zachary, W.1


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