메뉴 건너뛰기




Volumn , Issue , 2006, Pages 25-34

Comparison of Similarity Models for the Relation Discovery Task

Author keywords

[No Author keywords available]

Indexed keywords

COMPUTATIONAL LINGUISTICS; EXTRACTION; NATURAL LANGUAGE PROCESSING SYSTEMS; STATISTICS;

EID: 84858953049     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.3115/1641976.1641981     Document Type: Conference Paper
Times cited : (2)

References (27)
  • 1
    • 0029546874 scopus 로고
    • Using linear algebra for intelligent information retrieval
    • Michael W. Berry, Susan T. Dumais, and Gavin W. O'Brien. 1994. Using linear algebra for intelligent information retrieval. SIAM Review, 37(4):573-595.
    • (1994) SIAM Review , vol.37 , Issue.4 , pp. 573-595
    • Berry, Michael W.1    Dumais, Susan T.2    O'Brien, Gavin W.3
  • 2
    • 85008006549 scopus 로고    scopus 로고
    • The frame-based module of the suiseki information extraction system
    • Christian Blaschke and Alfonso Valencia. 2002. The frame-based module of the suiseki information extraction system. IEEE Intelligent Systems, 17:14-20.
    • (2002) IEEE Intelligent Systems , vol.17 , pp. 14-20
    • Blaschke, Christian1    Valencia, Alfonso2
  • 7
    • 29644438050 scopus 로고    scopus 로고
    • Statistical comparisons of classifiers over multiple data sets
    • Jan
    • Janez Demšar. 2006. Statistical comparisons of classifiers over multiple data sets. Journal of Machine Learning Research, 7:1-30, Jan.
    • (2006) Journal of Machine Learning Research , vol.7 , pp. 1-30
    • Demšar, Janez1
  • 9
    • 0001837148 scopus 로고
    • A comparison of alternative tests of significance for the problem of m rankings
    • Milton Friedman. 1940. A comparison of alternative tests of significance for the problem of m rankings. The Annals of Mathematical Statistics, 11:86-92.
    • (1940) The Annals of Mathematical Statistics , vol.11 , pp. 86-92
    • Friedman, Milton1
  • 13
    • 0034818212 scopus 로고    scopus 로고
    • Unsupervised learning by probabilistic latent semantic analysis
    • Thomas Hofmann. 2001. Unsupervised learning by probabilistic latent semantic analysis. Machine Learning, 42:177-196.
    • (2001) Machine Learning , vol.42 , pp. 177-196
    • Hofmann, Thomas1
  • 16
    • 35048820500 scopus 로고    scopus 로고
    • Computing similarity
    • Robert Dale, Hermann Moisl, and Harold Somers, editors, pages Marcel Dekker, New York
    • Ludovic Lebart and Martin Rajman. 2000. Computing similarity. In Robert Dale, Hermann Moisl, and Harold Somers, editors, Handbook of Natural Language Processing, pages 477-505. Marcel Dekker, New York.
    • (2000) Handbook of Natural Language Processing , pp. 477-505
    • Lebart, Ludovic1    Rajman, Martin2
  • 21
    • 84948481845 scopus 로고
    • An algorithm for suffix stripping
    • Martin F. Porter. 1980. An algorithm for suffix stripping. Program, 14(3):130-137.
    • (1980) Program , vol.14 , Issue.3 , pp. 130-137
    • Porter, Martin F.1
  • 24
    • 0347596961 scopus 로고    scopus 로고
    • Automatic word sense discrimination
    • Hinrich Schütze. 1998. Automatic word sense discrimination. Computational Linguistics, 24(1):91-124.
    • (1998) Computational Linguistics , vol.24 , Issue.1 , pp. 91-124
    • Schütze, Hinrich1
  • 25
    • 0034247206 scopus 로고    scopus 로고
    • Multiboosting: A technique for combining boosting and wagging
    • Geoffrey I. Webb. 2000. Multiboosting: A technique for combining boosting and wagging. Machine Learning, 40(2):159-196.
    • (2000) Machine Learning , vol.40 , Issue.2 , pp. 159-196
    • Webb, Geoffrey I.1
  • 27
    • 3543085722 scopus 로고    scopus 로고
    • Empirical and theoretical comparisons of selected criterion functions for document clustering
    • Ying Zhao and George Karypis. 2004. Empirical and theoretical comparisons of selected criterion functions for document clustering. Machine Learning, 55:311-331.
    • (2004) Machine Learning , vol.55 , pp. 311-331
    • Zhao, Ying1    Karypis, George2


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