메뉴 건너뛰기




Volumn 3, Issue 1, 2010, Pages 208-219

Evaluating entity resolution results

Author keywords

[No Author keywords available]

Indexed keywords

FUNCTION EVALUATION;

EID: 79960270026     PISSN: None     EISSN: 21508097     Source Type: Conference Proceeding    
DOI: 10.14778/1920841.1920871     Document Type: Article
Times cited : (68)

References (25)
  • 4
    • 84976666835 scopus 로고
    • On the complexity of the extended string-to-string correction problem
    • R. A. Wagner, "On the complexity of the extended string-to-string correction problem," in STOC, 1975, pp. 218-223.
    • (1975) STOC , pp. 218-223
    • Wagner, R.A.1
  • 5
    • 9444274777 scopus 로고    scopus 로고
    • Comparing clusterings by the variation of information
    • M. Meila, "Comparing clusterings by the variation of information," in COLT, 2003, pp. 173-187.
    • (2003) COLT , pp. 173-187
    • Meila, M.1
  • 6
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • Boston, MA
    • A. K. McCallum, K. Nigam, and L. Ungar, "Efficient clustering of high-dimensional data sets with application to reference matching," in Proc. of KDD, Boston, MA, 2000, pp. 169-178.
    • (2000) Proc. of KDD , pp. 169-178
    • McCallum, A.K.1    Nigam, K.2    Ungar, L.3
  • 7
    • 33750287715 scopus 로고    scopus 로고
    • Efficient name disambiguation for large-scale databases
    • J. Huang, S. Ertekin, and C. L. Giles, "Efficient name disambiguation for large-scale databases," in PKDD, 2006, pp. 536-544.
    • (2006) PKDD , pp. 536-544
    • Huang, J.1    Ertekin, S.2    Giles, C.L.3
  • 8
    • 59249101599 scopus 로고    scopus 로고
    • A heuristic-based hierarchical clustering method for author name disambiguation in digital libraries
    • R. G. Cota, M. A. Gonçcalves, and A. H. F. Laender, "A heuristic-based hierarchical clustering method for author name disambiguation in digital libraries," in SBBD, 2007, pp. 20-34.
    • (2007) SBBD , pp. 20-34
    • Cota, R.G.1    Gonçcalves, M.A.2    Laender, A.H.F.3
  • 10
    • 31844440880 scopus 로고    scopus 로고
    • Comparing clusterings: an axiomatic view
    • M. Meila, "Comparing clusterings: an axiomatic view," in ICML, 2005, pp. 577-584.
    • (2005) ICML , pp. 577-584
    • Meila, M.1
  • 11
    • 18744416559 scopus 로고    scopus 로고
    • Grouping search-engine returned citations for person-name queries
    • R. Al-Kamha and D. W. Embley, "Grouping search-engine returned citations for person-name queries," in WIDM, 2004, pp. 96-103.
    • (2004) WIDM , pp. 96-103
    • Al-Kamha, A.1    Embley, D.W.2
  • 13
    • 0042920396 scopus 로고
    • On the functional equation f(x+y, z) + f(x, y) = f(x, y+z) + f(y, z)
    • 09
    • M. Hosszú, "On the functional equation f(x+y,z) + f(x,y) = f(x,y+z) + f(y,z)," Periodica Mathematica Hungarica, vol. 1, no. 3, pp. 213-216, 09 1971.
    • (1971) Periodica Mathematica Hungarica , vol.1 , Issue.3 , pp. 213-216
    • Hosszú, M.1
  • 14
    • 0001139918 scopus 로고
    • Record linkage: making maximum use of the discriminating power of identifying information
    • H. B. Newcombe and J. M. Kennedy, "Record linkage: making maximum use of the discriminating power of identifying information," Commun. ACM, vol. 5, no. 11, pp. 563-566, 1962.
    • (1962) Commun. ACM , vol.5 , Issue.11 , pp. 563-566
    • Newcombe, H.B.1    Kennedy, J.M.2
  • 16
    • 4944248042 scopus 로고    scopus 로고
    • An efficient domain-independent algorithm for detecting approximately duplicate database records
    • A. E. Monge and C. Elkan, "An efficient domain-independent algorithm for detecting approximately duplicate database records," in DMKD, 1997, pp. 23-29.
    • (1997) DMKD , pp. 23-29
    • Monge, A.E.1    Elkan, C.2
  • 17
    • 26444550791 scopus 로고    scopus 로고
    • Robust identification of fuzzy duplicates
    • Tokyo, Japan
    • S. Chaudhuri, V. Ganti, and R. Motwani, "Robust identification of fuzzy duplicates," in Proc. of ICDE, Tokyo, Japan, 2005.
    • (2005) Proc. of ICDE
    • Chaudhuri, S.1    Ganti, V.2    Motwani, R.3
  • 18
    • 84943425383 scopus 로고    scopus 로고
    • Efficient record linkage in large data sets
    • L. Jin, C. Li, and S. Mehrotra, "Efficient record linkage in large data sets," in DASFAA, 2003, pp. 137-.
    • (2003) DASFAA , pp. 137
    • Jin, L.1    Li, C.2    Mehrotra, S.3
  • 19
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. A. Hernández and S. J. Stolfo, "The merge/purge problem for large databases," in Proc. of ACM SIGMOD, 1995, pp. 127-138.
    • (1995) Proc. of ACM SIGMOD , pp. 127-138
    • Hernández, M.A.1    Stolfo, S.A.2
  • 20
    • 2342576574 scopus 로고    scopus 로고
    • Eliminating fuzzy duplicates in data warehouses
    • R. Ananthakrishna, S. Chaudhuri, and V. Ganti, "Eliminating fuzzy duplicates in data warehouses." in Proc. of VLDB, 2002, pp. 586-597.
    • (2002) Proc. of VLDB , pp. 586-597
    • Ananthakrishna, R.1    Chaudhuri, S.2    Ganti, V.3
  • 23
    • 72649086387 scopus 로고    scopus 로고
    • Framework for evaluating clustering algorithms in duplicate detection
    • O. Hassanzadeh, F. Chiang, R. J. Miller, and H. C. Lee, "Framework for evaluating clustering algorithms in duplicate detection," PVLDB, vol. 2, no. 1, pp. 1282-1293, 2009.
    • (2009) PVLDB , vol.2 , Issue.1 , pp. 1282-1293
    • Hassanzadeh, O.1    Chiang, F.2    Miller, R.J.3    Lee, H.C.4
  • 24
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • M. Bilenko and R. Mooney, "Adaptive duplicate detection using learnable string similarity measures," in KDD, 2003.
    • (2003) KDD
    • Bilenko, M.1    Mooney, R.2
  • 25


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