메뉴 건너뛰기




Volumn , Issue , 2007, Pages 53-62

Decision trees for entity identification: Approximation algorithms and hardness results

Author keywords

Approximation algorithm; Decision tree; Ramsey theory

Indexed keywords

BINARY TABLES; RAMSEY NUMBER;

EID: 35448979553     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1265530.1265538     Document Type: Conference Paper
Times cited : (80)

References (26)
  • 2
    • 35448972740 scopus 로고    scopus 로고
    • Personal communication
    • A. Chaudhary and N. Gupta. Personal communication, 2007.
    • (2007)
    • Chaudhary, A.1    Gupta, N.2
  • 3
    • 0007614969 scopus 로고
    • A survey of bounds for classical Ramsey numbers
    • F. Chung and C. Grinstead. A survey of bounds for classical Ramsey numbers. Journal of Graph Theory, 7:25-37, 1983.
    • (1983) Journal of Graph Theory , vol.7 , pp. 25-37
    • Chung, F.1    Grinstead, C.2
  • 4
    • 0346985559 scopus 로고
    • A lower bound for Schur numbers and multicolor Ramsey numbers
    • G. Exoo. A lower bound for Schur numbers and multicolor Ramsey numbers. Electronic Journal of Combinatorics, 1(R8), 1994.
    • (1994) Electronic Journal of Combinatorics , vol.1 , Issue.R8
    • Exoo, G.1
  • 5
    • 21044440739 scopus 로고    scopus 로고
    • Approximating min sum set cover
    • U. Feige, L. Lovász, and P. Tetali. Approximating min sum set cover. Algorithmica, 40(4):219-234, 2004.
    • (2004) Algorithmica , vol.40 , Issue.4 , pp. 219-234
    • Feige, U.1    Lovász, L.2    Tetali, P.3
  • 7
    • 0015403290 scopus 로고
    • Optimal binary identification procedures
    • M. Garey. Optimal binary identification procedures. SIAM Journal on Applied Mathematics, 23(2):173-186, 1972.
    • (1972) SIAM Journal on Applied Mathematics , vol.23 , Issue.2 , pp. 173-186
    • Garey, M.1
  • 8
    • 0016331864 scopus 로고
    • Performance bounds on the splitting algorithm for binary testing
    • M. Garey and R. Graham. Performance bounds on the splitting algorithm for binary testing. Acta Informatica, 3:347-355, 1974.
    • (1974) Acta Informatica , vol.3 , pp. 347-355
    • Garey, M.1    Graham, R.2
  • 11
    • 35449001464 scopus 로고    scopus 로고
    • B. Heeringa and M. Adler. Approximating optimal decision trees. TR 05-25, University of Massachusetts, Amherst, 2005.
    • B. Heeringa and M. Adler. Approximating optimal decision trees. TR 05-25, University of Massachusetts, Amherst, 2005.
  • 12
    • 0001815269 scopus 로고
    • Constructing optimal binary decision trees is NP-complete
    • L. Hyafil and R. Rivest. Constructing optimal binary decision trees is NP-complete. Information Processing Letters, 5(1):15-17, 1976.
    • (1976) Information Processing Letters , vol.5 , Issue.1 , pp. 15-17
    • Hyafil, L.1    Rivest, R.2
  • 13
    • 0020300879 scopus 로고
    • Decision trees and diagrams
    • B. Moret. Decision trees and diagrams. ACM Computing Surveys, 14(4):593-623, 1982.
    • (1982) ACM Computing Surveys , vol.14 , Issue.4 , pp. 593-623
    • Moret, B.1
  • 14
    • 0002431740 scopus 로고    scopus 로고
    • Automatic construction of decision trees from data: A multi-disciplinary survey
    • S. Murthy. Automatic construction of decision trees from data: A multi-disciplinary survey. Data Mining and Knowledge Discovery, 2(4):345-389, 1998.
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.4 , pp. 345-389
    • Murthy, S.1
  • 15
    • 0012852770 scopus 로고    scopus 로고
    • J. Nesetril and M. Rosenfeld. I. Schur, C.E. Shannon and Ramsey numbers, a short story. Discrete Mathematics, 229(1-3):185-195, 2001.
    • J. Nesetril and M. Rosenfeld. I. Schur, C.E. Shannon and Ramsey numbers, a short story. Discrete Mathematics, 229(1-3):185-195, 2001.
  • 16
    • 35448952009 scopus 로고    scopus 로고
    • University of California, Davis. Guide to healthy lawns: Identification key to weeds. http://www.ipm.ucdavis.edu/TOOLS/TURF/PESTS/weedkey.html.
    • University of California, Davis. Guide to healthy lawns: Identification key to weeds. http://www.ipm.ucdavis.edu/TOOLS/TURF/PESTS/weedkey.html.
  • 17
    • 84908494974 scopus 로고    scopus 로고
    • University of Florida, Layman's key to the snakes of florida
    • Florida, Museum of Natural History, University of Florida,. Layman's key to the snakes of florida. http://www.flmnh.ufl.edu/herpetology/FL- GUIDE/snakekey.htm.
    • Museum of Natural History
    • Florida1
  • 18
    • 84858347287 scopus 로고    scopus 로고
    • The Stream Project, University of Virginia
    • The Stream Project, University of Virginia. Aquatic macroinvertebrate identification key. http://wsrv.clas.virginia.edu/~sos-iwIa/Stream-Study/Key/ MacroKeyIntro.HTML.
    • Aquatic macroinvertebrate identification key
  • 19
    • 0014793315 scopus 로고
    • A computer program for generating diagnostic keys
    • R. Pankhurst. A computer program for generating diagnostic keys. The Computer Journal, 13(2):145-151, 1970.
    • (1970) The Computer Journal , vol.13 , Issue.2 , pp. 145-151
    • Pankhurst, R.1
  • 21
    • 0030714232 scopus 로고    scopus 로고
    • A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP
    • Ran Raz and Shmuel Safra. A sub-constant error-probability low-degree test, and a sub-constant error-probability PCP characterization of NP. In Proc. of the 29th A CM Symposium on Theory of Computing, pages 475-484, 1997.
    • (1997) Proc. of the 29th A CM Symposium on Theory of Computing , pp. 475-484
    • Raz, R.1    Safra, S.2


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