메뉴 건너뛰기




Volumn , Issue , 2013, Pages 512-519

Learning optimal classifier chains for real-time big data mining

Author keywords

[No Author keywords available]

Indexed keywords

BIG DATA; CHAINS; DATA HANDLING; DATA MINING; FEEDBACK; LEARNING ALGORITHMS;

EID: 84897723649     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/Allerton.2013.6736568     Document Type: Conference Paper
Times cited : (8)

References (25)
  • 2
    • 78149334786 scopus 로고    scopus 로고
    • P rivacy-preserving distributed clustering using generative models
    • S. Merugu and J. Ghosh, "P rivacy-preserving distributed clustering using generative models," in Proc. Int. Con! Data Mining (ICDM), 2003.
    • (2003) Proc. Int. Con! Data Mining (ICDM)
    • Merugu, S.1    Ghosh, J.2
  • 4
    • 1142291592 scopus 로고    scopus 로고
    • Adaptive filters for continuous queries over distributed data streams
    • C. Olston,J . Jiang,a nd J. Widom," Adaptive filters for continuous queries over distributed data streams;' in ACM SIGMOD 2003.
    • (2003) ACM SIGMOD
    • Olston, C.1    Jiang, J.2    Widom, J.3
  • 7
    • 1142267347 scopus 로고    scopus 로고
    • Chain: Operator scheduling for memory minimization in data stream systems
    • B. Babcock, S. Babu, M. Datar, and R. Motwani, "Chain: operator scheduling for memory minimization in data stream systems," in ACM SIGMOD, 2003.
    • (2003) ACM SIGMOD
    • Babcock, B.1    Babu, S.2    Datar, M.3    Motwani, R.4
  • 11
    • 78049282889 scopus 로고    scopus 로고
    • A distributed approach for optimizing cascaded classifier topologies in real-time stream mining systems
    • Nov
    • [II] B. Foo and M. van der Schaar, "A distributed approach for optimizing cascaded classifier topologies in real-time stream mining systems," IEEE Trans. Image Process., vol. 19,n o. II,p p. 3035-3048,N ov. 2010.
    • (2010) IEEE Trans. Image Process , vol.19 , Issue.2 , pp. 3035-3048
    • Foo, B.1    Schaar Der M.Van2
  • 12
    • 70349205717 scopus 로고    scopus 로고
    • A rules-based approach for configuring chains of classifiers in real-time stream mining systems
    • Article ID
    • B. Foo and M. van der Schaar, "A rules-based approach for configuring chains of classifiers in real-time stream mining systems," EURASIP Journal on Advances in Signal Processing, vol. 2009, Article ID 975640, 2009.
    • (2009) EURASIP Journal on Advances in Signal Processing , vol.2009 , pp. 975640
    • Foo, B.1    Schaar Der M.Van2
  • 14
    • 0000248624 scopus 로고
    • Multi-armed bandits and the Gittins index
    • Series B (Methodological)
    • P. Whittle, "Multi-armed bandits and the Gittins index;' Journal of the Royal Statistical Society, Series B (Methodological), 1980.
    • (1980) Journal of the Royal Statistical Society
    • Whittle, P.1
  • 15
    • 0002899547 scopus 로고
    • Asymptotically efficient adaptive allocation rules
    • T. Lai and H. Robbins, "Asymptotically efficient adaptive allocation rules;' Adv. Appl. Math., vol. 6, no. I, 1985.
    • (1985) Adv. Appl. Math , vol.6 , Issue.1
    • Lai, T.1    Robbins, H.2
  • 16
    • 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," Mach. Learn., vol. 47, no. 2-3, 2002.
    • (2002) Mach. Learn , vol.47 , pp. 2-3
    • Auer, P.1    Cesa-Bianchi, N.2    Fischer, P.3
  • 17
    • 0023450663 scopus 로고
    • Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-Part I: IlD reward
    • Y. Anantharam, P. Varaiya, and J. Walrand, "Asymptotically efficient allocation rules for the multiarmed bandit problem with multiple plays-P art I: I. l. D. reward;' IEEE Trans. Autom. Control, vol. AC-32, no. II, 1987.
    • (1987) IEEE Trans. Autom. Control , vol.32 , Issue.2
    • Anantharam, Y.1    Varaiya, P.2    Walrand, J.3
  • 19
    • 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," IEEEIACM Trans. Networking, vol. 20, no. 5,2012.
    • IEEEIACM Trans. Networking , vol.20 , Issue.5 , pp. 2012
    • Gai, Y.1    Krishnamachari, B.2    Jain, R.3
  • 21
    • 0041966002 scopus 로고    scopus 로고
    • Using confidence bounds for exploitation-exploration tradeoffs 1
    • P. Auer, "Using confidence bounds for exploitation-exploration tradeoffs," 1. Mach. Learn. Res., vol. 3, pp. 397-422, 2002.
    • (2002) Mach. Learn. Res , vol.3 , pp. 397-422
    • Auer, P.1
  • 23
    • 84863956678 scopus 로고    scopus 로고
    • Online learning in rested and restless bandits
    • c. Tekin and M. Liu," Online Learning in Rested and Restless Bandits," IEEE Trans. on Information Theory, 58.5, pp 5588-5611, 2012.
    • (2012) IEEE Trans. on Information Theory , vol.585 , pp. 5588-5611
    • Tekin, C.1    Liu, M.2
  • 24
    • 84873932839 scopus 로고    scopus 로고
    • Learning in a changing world: Restless multi-armed bandit with unknown dynamics
    • H. Liu, K. Liu and Q. Zhao, "Learning in a changing world: restless multi-armed bandit with unknown dynamics," IEEE Trans. on If!formation Theory, 59.3, pp 1902-1916,2012.
    • (2012) IEEE Trans. on If!formation Theory , vol.593 , pp. 1902-1916
    • Liu, H.1    Liu, K.2    Zhao, Q.3


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