메뉴 건너뛰기




Volumn , Issue , 2014, Pages 555-563

BLISS: Budget LImited robuSt crowdSensing through online learning

Author keywords

[No Author keywords available]

Indexed keywords

BUDGET CONTROL;

EID: 84921026033     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/SAHCN.2014.6990395     Document Type: Conference Paper
Times cited : (29)

References (28)
  • 1
    • 81355138524 scopus 로고    scopus 로고
    • Mobile crowdsensing: Current state and future challenges
    • R. K. Ganti, F. Ye, and H. Lei, "Mobile Crowdsensing: Current State and Future Challenges," IEEE Communications Magazine, vol. 6, no. 11, pp. 32-39, 2011.
    • (2011) IEEE Communications Magazine , vol.6 , Issue.11 , pp. 32-39
    • Ganti, R.K.1    Ye, F.2    Lei, H.3
  • 3
    • 84861598178 scopus 로고    scopus 로고
    • Incentive mechanisms for smartphone collaboration in data acquisition and distributed computing
    • L. Duan, T. Kubo, K. Sugiyama, J. Huang, T. Hasegawa, and J. Walrand, "Incentive Mechanisms for Smartphone Collaboration in Data Acquisition and Distributed Computing," in Proc. IEEE INFOCOM, 2012, pp. 1701-1709.
    • (2012) Proc. IEEE INFOCOM , pp. 1701-1709
    • Duan, L.1    Kubo, T.2    Sugiyama, K.3    Huang, J.4    Hasegawa, T.5    Walrand, J.6
  • 4
    • 84866627852 scopus 로고    scopus 로고
    • Crowdsourcing to smartphones: Incentive mechanism design for mobile phone sensing
    • D. Yang, G. Xue, X. Fang, and J. Tang, "Crowdsourcing to Smartphones: Incentive Mechanism Design for Mobile Phone Sensing," in Proc. ACM MobiCom, 2012, pp. 173-184.
    • (2012) Proc. ACM MobiCom , pp. 173-184
    • Yang, D.1    Xue, G.2    Fang, X.3    Tang, J.4
  • 5
    • 84883131780 scopus 로고    scopus 로고
    • Optimal incentive-driven design of participatory sensing systems
    • I. Koutsopoulos, "Optimal Incentive-driven Design of Participatory Sensing Systems," in Proc. IEEE INFOCOM, 2013.
    • (2013) Proc. IEEE INFOCOM
    • Koutsopoulos, I.1
  • 6
    • 84880113760 scopus 로고    scopus 로고
    • Providing privacy-aware incentives for mobile sensing
    • Q. Li and G. Cao, "Providing Privacy-Aware Incentives for Mobile Sensing," in Proc. IEEE PerCom, 2013, pp. 76-84.
    • (2013) Proc. IEEE PerCom , pp. 76-84
    • Li, Q.1    Cao, G.2
  • 8
    • 84860530728 scopus 로고    scopus 로고
    • On truth discovery in social sensing: A maximum likelihood estimation approach
    • D. Wang, L. Kaplan, H. Le, and T. Abdelzaher, "On Truth Discovery in Social Sensing: a Maximum Likelihood Estimation Approach," in Proc. ACM/IEEE IPSN, 2012, pp. 233-244.
    • (2012) Proc. ACM/IEEE IPSN , pp. 233-244
    • Wang, D.1    Kaplan, L.2    Le, H.3    Abdelzaher, T.4
  • 10
    • 79959863512 scopus 로고    scopus 로고
    • A framework for data quality and feedback in participatory sensing
    • S. Reddy, J. Burke, D. Estrin, M. Hansen, and M. Srivastava, "A Framework for Data Quality and Feedback in Participatory Sensing," in Proc. ACM SenSys, 2007, pp. 417-418.
    • (2007) Proc. ACM SenSys , pp. 417-418
    • Reddy, S.1    Burke, J.2    Estrin, D.3    Hansen, M.4    Srivastava, M.5
  • 11
    • 84867449261 scopus 로고    scopus 로고
    • Automatically characterizing places with opportunistic crowdsensing using smartphones
    • Y. Chon, N. D. Lane, F. Li, H. Cha, and F. Zhao, "Automatically Characterizing Places with Opportunistic Crowdsensing Using Smartphones," in Proc. ACM UbiComp, 2012, pp. 481-490.
    • (2012) Proc. ACM UbiComp , pp. 481-490
    • Chon, Y.1    Lane, N.D.2    Li, F.3    Cha, H.4    Zhao, F.5
  • 12
    • 84883316908 scopus 로고    scopus 로고
    • Quality of contributed service and market equilibrium for participatory sensing
    • C.-K. Tham and T. Luo, "Quality of Contributed Service and Market Equilibrium for Participatory Sensing," in Proc. IEEE DCOSS, 2013.
    • (2013) Proc. IEEE DCOSS
    • Tham, C.-K.1    Luo, T.2
  • 15
    • 84864358846 scopus 로고    scopus 로고
    • CoMon: Cooperative ambience monitoring platform with continuity and benefit awareness
    • Y. Lee, Y. Ju, C. Min, S. Kang, I. Hwang, and J. Song, "CoMon: Cooperative Ambience Monitoring Platform with Continuity and Benefit Awareness," in Proc. ACM MobiSys, 2012, pp. 43-56.
    • (2012) Proc. ACM MobiSys , pp. 43-56
    • Lee, Y.1    Ju, Y.2    Min, C.3    Kang, S.4    Hwang, I.5    Song, J.6
  • 17
    • 77953494555 scopus 로고    scopus 로고
    • Recruitment framework for participatory sensing data collections
    • S. Reddy, D. Estrin, and M. Srivastava, "Recruitment Framework for Participatory Sensing Data Collections," in Proc. Pervasive, 2010, pp. 138-155.
    • (2010) Proc. Pervasive , pp. 138-155
    • Reddy, S.1    Estrin, D.2    Srivastava, M.3
  • 19
    • 0036568025 scopus 로고    scopus 로고
    • Finite-time analysis of the multiarmed bandit problem
    • P. Auer, N. Cesa-Bianchi, and P. Fischer, "Finite-Time Analysis of the Multiarmed Bandit Problem," Machine Learning, vol. 47, no. 2-3, pp. 235-256, 2002.
    • (2002) Machine Learning , vol.47 , Issue.2-3 , pp. 235-256
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 21
    • 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, vol. 58, no. 301, pp. 13-30, 1963.
    • (1963) Journal of the American Statistical Association , vol.58 , Issue.301 , pp. 13-30
    • Hoeffding, W.1
  • 22
    • 84867858040 scopus 로고    scopus 로고
    • Combinatorial network optimization with unknown variables: Multi-armed bandits with linear rewards and individual observations
    • Y. Gai, B. Krishnamachari, and R. Jain, "Combinatorial Network Optimization with Unknown Variables: Multi-Armed Bandits with Linear Rewards and Individual Observations," IEEE/ACM Transactions on Networking, vol. 20, no. 5, pp. 1466-1478, 2012.
    • (2012) IEEE/ACM Transactions on Networking , vol.20 , Issue.5 , pp. 1466-1478
    • Gai, Y.1    Krishnamachari, B.2    Jain, R.3
  • 23
    • 84921060822 scopus 로고    scopus 로고
    • IBM ILOG CPLEX Optimizer
    • "IBM ILOG CPLEX Optimizer." [Online]. Available: http://www.ibm. com/software/integration/optimization/cplex-optimizer
  • 24
    • 0002899547 scopus 로고
    • Asymptotically efficient adaptive allocation rules
    • T. L. Lai and H. Robbins, "Asymptotically Efficient Adaptive Allocation Rules," Advances in Applied Mathematics, vol. 6, no. 1, pp. 4-22, 1985.
    • (1985) Advances in Applied Mathematics , vol.6 , Issue.1 , pp. 4-22
    • Lai, T.L.1    Robbins, H.2
  • 25
    • 84874045238 scopus 로고    scopus 로고
    • Regret analysis of stochastic and nonstochastic multi-armed bandit problems
    • S. Bubeck and N. Cesa-Bianchi, "Regret Analysis of Stochastic and Nonstochastic Multi-armed Bandit Problems," Foundations and Trends in Machine Learning, vol. 5, no. 1, pp. 1-122, 2012.
    • (2012) Foundations and Trends in Machine Learning , vol.5 , Issue.1 , pp. 1-122
    • Bubeck, S.1    Cesa-Bianchi, N.2
  • 26
    • 84868281643 scopus 로고    scopus 로고
    • Knapsack based optimal policies for budget-limited multi-armed bandits
    • L. Tran-Thanh, A. C. Chapman, A. Rogers, and N. R. Jennings, "Knapsack Based Optimal Policies for Budget-Limited Multi-Armed Bandits," in Proc. AAAI, 2012, pp. 1134-1140.
    • (2012) Proc. AAAI , pp. 1134-1140
    • Tran-Thanh, L.1    Chapman, A.C.2    Rogers, A.3    Jennings, N.R.4


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