메뉴 건너뛰기




Volumn 2, Issue , 2003, Pages 520-527

The Set Covering Machine with Data-Dependent Half-Spaces

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL COMPLEXITY; COMPUTATIONAL METHODS; DATA REDUCTION; ERROR ANALYSIS; LEARNING ALGORITHMS; MATHEMATICAL MODELS; VECTORS;

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

References (11)
  • 1
    • 0000301097 scopus 로고
    • A greedy heuristic for the set covering problem
    • Chvátal, V. (1979). A greedy heuristic for the set covering problem. Mathematics of Operations Research, 4, 233-235.
    • (1979) Mathematics of Operations Research , vol.4 , pp. 233-235
    • Chvátal, V.1
  • 2
    • 0029521676 scopus 로고
    • Sample compression, learnability, and the Vapnik-Chervonenkis dimension
    • Floyd, S., & Warmuth, M. (1995). Sample compression, learnability, and the Vapnik-Chervonenkis dimension. Machine Learning, 21, 269-304.
    • (1995) Machine Learning , vol.21 , pp. 269-304
    • Floyd, S.1    Warmuth, M.2
  • 4
    • 0024082469 scopus 로고
    • Quantifying inductive bias: AI learning algorithms and Valiant's learning framework
    • Haussler, D. (1988). Quantifying inductive bias: AI learning algorithms and Valiant's learning framework. Artificial Intelligence, 36, 177-221.
    • (1988) Artificial Intelligence , vol.36 , pp. 177-221
    • Haussler, D.1


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