메뉴 건너뛰기




Volumn 3056, Issue , 2004, Pages 638-647

Febrl – A parallel open source data linkage system

Author keywords

Data cleaning and standardisation; Data matching; Data mining preprocessing; Parallel processing; Record linkage

Indexed keywords

DATA HANDLING; OPEN DATA; OPEN SOURCE SOFTWARE; OPEN SYSTEMS; STANDARDIZATION; ALGORITHMS; COMPUTER SOFTWARE; INFORMATION RETRIEVAL; PROBABILITY; PROJECT MANAGEMENT; USER INTERFACES;

EID: 7444251738     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-24775-3_75     Document Type: Conference Paper
Times cited : (82)

References (21)
  • 3
    • 84884417241 scopus 로고    scopus 로고
    • Preparation of name and address data for record linkage using hidden Markov models
    • Dec., Available online at
    • Churches, T., Christen, P., Lim, K. and Zhu, J.X.: Preparation of name and address data for record linkage using hidden Markov models. BioMed Central Medical Informatics and Decision Making, Dec. 2002. Available online at: http://www.biomedcentral.com/1472-6947/2/9/
    • (2002) Biomed Central Medical Informatics and Decision Making
    • Churches, T.1    Christen, P.2    Lim, K.3    Zhu, J.X.4
  • 4
    • 0032091575 scopus 로고    scopus 로고
    • Integration of heterogeneous databases without common domains using queries based on textual similarity
    • Seattle
    • Cohen, W.: Integration of heterogeneous databases without common domains using queries based on textual similarity. Proceedings of SIGMOD, Seattle, 1998.
    • (1998) Proceedings of SIGMOD
    • Cohen, W.1
  • 8
    • 2942687314 scopus 로고    scopus 로고
    • Adaptive sparse grids
    • Hegland, M.: Adaptive sparse grids. ANZIAM J., vol. 44, 2003, pp. C335-C353.
    • (2003) ANZIAM J. , vol.44 , pp. C335-C353
    • Hegland, M.1
  • 10
    • 0013331361 scopus 로고    scopus 로고
    • Real-world data is dirty: Data cleansing and the merge/purge problem
    • Kluwer Academic Publishers
    • Hernandez, M.A. and Stolfo, S.J.: Real-world data is dirty: Data cleansing and the merge/purge problem. In Data Mining and Knowledge Discovery 2, Kluwer Academic Publishers, 1998.
    • (1998) Data Mining and Knowledge Discovery 2
    • Hernandez, M.A.1    Stolfo, S.J.2
  • 12
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • McCallum, A., Nigam, K. and Ungar, L.H.: Efficient clustering of high-dimensional data sets with application to reference matching. Knowledge Discovery and Data Mining, pp. 169-178, 2000.
    • (2000) Knowledge Discovery and Data Mining , pp. 169-178
    • McCallum, A.1    Nigam, K.2    Ungar, L.H.3
  • 15
    • 0001139918 scopus 로고
    • Record Linkage: Making Maximum Use of the Discriminating Power of Identifying Information
    • Newcombe, H.B. and Kennedy, J.M.: Record Linkage: Making Maximum Use of the Discriminating Power of Identifying Information. Communications of the ACM, vol. 5, no. 11, 1962.
    • (1962) Communications of the ACM , vol.5 , Issue.11
    • Newcombe, H.B.1    Kennedy, J.M.2
  • 17
    • 0024610919 scopus 로고
    • A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition
    • Feb
    • Rabiner, L.R.: A Tutorial on Hidden Markov Models and Selected Applications in Speech Recognition. Proceedings of the IEEE, vol. 77, no. 2, Feb. 1989.
    • (1989) Proceedings of the IEEE , vol.77 , Issue.2
    • Rabiner, L.R.1


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