메뉴 건너뛰기




Volumn 9, Issue 4, 2004, Pages

On identifying name equivalences in digital libraries

Author keywords

[No Author keywords available]

Indexed keywords


EID: 4644298073     PISSN: 13681613     EISSN: None     Source Type: Journal    
DOI: None     Document Type: Review
Times cited : (24)

References (8)
  • 1
    • 0002696312 scopus 로고    scopus 로고
    • Matching records in a national medical patient index
    • Bell, G.B. & Sethi, A. (2001). Matching records in a national medical patient index. Communications of the ACM, 44(9), 83-88.
    • (2001) Communications of the ACM , vol.44 , Issue.9 , pp. 83-88
    • Bell, G.B.1    Sethi, A.2
  • 2
    • 4644243617 scopus 로고
    • Retrieval of misspelled names in an airlines passenger record system
    • Davidson, L. (1962). Retrieval of misspelled names in an airlines passenger record system. Communications of the ACM, 5(3), 169-171.
    • (1962) Communications of the ACM , vol.5 , Issue.3 , pp. 169-171
    • Davidson, L.1
  • 3
    • 84956995762 scopus 로고    scopus 로고
    • Cooperative indexing, classification, and evaluation in BoW
    • 7th IFCIS international conference on cooperative information systems Berlin: Springer-Verlag
    • Feitelson, D.G. (2000). Cooperative indexing, classification, and evaluation in BoW. In 7th IFCIS international conference on cooperative information systems (pp. 66-77). Berlin: Springer-Verlag. (Lecture notes on computer science volume 1901).
    • (2000) Lecture Notes on Computer Science , vol.1901 , pp. 66-77
    • Feitelson, D.G.1
  • 6
    • 0032640910 scopus 로고    scopus 로고
    • Digital libraries and autonomous citation indexing
    • Lawrence, S., Giles, C.L., & Bollacker, K. (1999). Digital libraries and autonomous citation indexing. Computer, 32(6), 67-71.
    • (1999) Computer , vol.32 , Issue.6 , pp. 67-71
    • Lawrence, S.1    Giles, C.L.2    Bollacker, K.3
  • 7
    • 0012620707 scopus 로고
    • Hanging on the metaphone
    • Philips, L. (1990). Hanging on the metaphone. Computer Language Magazine, 7(12), 38-44.
    • (1990) Computer Language Magazine , vol.7 , Issue.12 , pp. 38-44
    • Philips, L.1
  • 8
    • 35248814346 scopus 로고    scopus 로고
    • An efficient branch-and-bound algorithm for finding a maximum clique
    • Discrete mathematics and theoretical computer science Berlin: Springer-Verlag
    • Tomita, E. & Seki, T. (2003). An efficient branch-and-bound algorithm for finding a maximum clique. In Discrete mathematics and theoretical computer science. (pp. 278-289). Berlin: Springer-Verlag. (Lecture notes on computer science volume 2731).
    • (2003) Lecture Notes on Computer Science , vol.2731 , pp. 278-289
    • Tomita, E.1    Seki, T.2


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