메뉴 건너뛰기




Volumn 1, Issue , 2012, Pages 855-862

Comparison-based learning with rank nets

Author keywords

[No Author keywords available]

Indexed keywords

ACTUAL DISTANCE; ADAPTIVE STRATEGY; DATA SETS;

EID: 84867125516     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper
Times cited : (15)

References (15)
  • 3
    • 0033453107 scopus 로고    scopus 로고
    • Nearest neighbor queries in metric spaces
    • Clarkson, K.L. Nearest neighbor queries in metric spaces. Discrete & Computational Geometry, 22(1):63-93, 1999.
    • (1999) Discrete & Computational Geometry , vol.22 , Issue.1 , pp. 63-93
    • Clarkson, K.L.1
  • 4
    • 84898947320 scopus 로고    scopus 로고
    • Analysis of a greedy active learning strategy
    • Dasgupta, S. Analysis of a greedy active learning strategy. NIPS, 2005.
    • (2005) NIPS
    • Dasgupta, S.1
  • 5
    • 0004319960 scopus 로고
    • How good is the information theory bound in sorting?
    • Fredman, M. L. How good is the information theory bound in sorting? In Theoretical Computer Science, 1976.
    • (1976) Theoretical Computer Science
    • Fredman, M.L.1
  • 6
    • 77956509565 scopus 로고    scopus 로고
    • Adaptive submodularity: A new approach to active learning and stochastic optimization
    • Golovin, D. and Krause, A. Adaptive submodularity: A new approach to active learning and stochastic optimization. In COLT, 2010.
    • (2010) COLT
    • Golovin, D.1    Krause, A.2
  • 7
    • 42549130490 scopus 로고    scopus 로고
    • Disorder inequality: A combinatorial approach to nearest neighbor search
    • Goyal, N., Lifshits, Y., and Schutze, H. Disorder inequality: a combinatorial approach to nearest neighbor search. In WSDM, 2008.
    • (2008) WSDM
    • Goyal, N.1    Lifshits, Y.2    Schutze, H.3
  • 10
    • 70349088564 scopus 로고    scopus 로고
    • Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design
    • Lifshits, Y. and Zhang, S. Combinatorial algorithms for nearest neighbors, near-duplicates and small-world design. In SODA, 2009.
    • (2009) SODA
    • Lifshits, Y.1    Zhang, S.2
  • 11
    • 33745184635 scopus 로고    scopus 로고
    • Exploratory search: From finding to understanding
    • Marchionini, G. Exploratory search: from finding to understanding. Communications of the ACM, 2006.
    • (2006) Communications of the ACM
    • Marchionini, G.1


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