메뉴 건너뛰기




Volumn 4443 LNCS, Issue , 2007, Pages 325-336

Self-tuning in graph-based reference disambiguation

Author keywords

[No Author keywords available]

Indexed keywords

DECISION MAKING; GRAPH THEORY; LEARNING SYSTEMS; PROBLEM SOLVING;

EID: 38049174910     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/978-3-540-71703-4_29     Document Type: Conference Paper
Times cited : (6)

References (30)
  • 1
    • 0344756851 scopus 로고    scopus 로고
    • Eliminating fuzzy duplicates in data warehouses
    • R. Ananthakrishna, S. Chaudhuri, and V. Ganti. Eliminating fuzzy duplicates in data warehouses. In VLDB, 2002.
    • (2002) VLDB
    • Ananthakrishna, R.1    Chaudhuri, S.2    Ganti, V.3
  • 2
    • 38049112491 scopus 로고    scopus 로고
    • R. Bekkerman and A. McCallum. Disambiguating web appearances of people in a social network. In WWW, 2005.
    • R. Bekkerman and A. McCallum. Disambiguating web appearances of people in a social network. In WWW, 2005.
  • 3
    • 80052662115 scopus 로고    scopus 로고
    • Relational clustering for multi-type entity resolution
    • I. Bhattacharya and L. Getoor. Relational clustering for multi-type entity resolution. In MRDM Workshop, 2005.
    • (2005) MRDM Workshop
    • Bhattacharya, I.1    Getoor, L.2
  • 4
    • 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 SIGKDD, 2003.
    • (2003) SIGKDD
    • Bilenko, M.1    Mooney, R.2
  • 9
    • 29844452555 scopus 로고    scopus 로고
    • Reference reconciliation in complex information spaces
    • X. Dong, A. Y. Halevy, and J. Madhavan. Reference reconciliation in complex information spaces. In SIGMOD, 2005.
    • (2005) SIGMOD
    • Dong, X.1    Halevy, A.Y.2    Madhavan, J.3
  • 12
    • 84976856849 scopus 로고
    • The merge/purge problem for large databases
    • M. Hernandez and S. Stolfo. The merge/purge problem for large databases. In SIGMOD, 1995.
    • (1995) SIGMOD
    • Hernandez, M.1    Stolfo, S.2
  • 15
    • 38049117543 scopus 로고    scopus 로고
    • D. V. Kalashnikov and S. Mehrotra. ReIDC project, http ://www.ics.uci.edu/∼dvk/RelDC.
    • D. V. Kalashnikov and S. Mehrotra. ReIDC project, http ://www.ics.uci.edu/∼dvk/RelDC.
  • 16
    • 33745266392 scopus 로고    scopus 로고
    • Domain-independent data cleaning via analysis of entity-relationship graph. ACM
    • June
    • D. V. Kalashnikov and S. Mehrotra. Domain-independent data cleaning via analysis of entity-relationship graph. ACM Transactions on Database Systems (ACM TODS), 31(2):716-767, June 2006.
    • (2006) Transactions on Database Systems (ACM TODS) , vol.31 , Issue.2 , pp. 716-767
    • Kalashnikov, D.V.1    Mehrotra, S.2
  • 18
    • 36348983081 scopus 로고    scopus 로고
    • Identification and tracing of ambiguous names: Discriminative and generative approaches
    • X. Li, P. Morie, and D. Roth. Identification and tracing of ambiguous names: Discriminative and generative approaches. In AAAI, 2004.
    • (2004) AAAI
    • Li, X.1    Morie, P.2    Roth, D.3
  • 20
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • A. McCallum, K. Nigam, and L. Ungar. Efficient clustering of high-dimensional data sets with application to reference matching. In ACM SIGKDD, 2000.
    • (2000) ACM SIGKDD
    • McCallum, A.1    Nigam, K.2    Ungar, L.3
  • 22
    • 33750347523 scopus 로고    scopus 로고
    • Contextual search and name disambiguation in email using graphs
    • E. Minkov, W. W. Cohen, and A. Ng. Contextual search and name disambiguation in email using graphs. In SIGIR, 2006.
    • (2006) SIGIR
    • Minkov, E.1    Cohen, W.W.2    Ng, A.3
  • 25
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • S. Sarawagi and A. Bhamidipaty. Interactive deduplication using active learning. In SIGKDD, 2002.
    • (2002) SIGKDD
    • Sarawagi, S.1    Bhamidipaty, A.2
  • 28
    • 0242456803 scopus 로고    scopus 로고
    • Learning domain-independent string tranformation weights for high accuracy object identification
    • S. Tejada, C. A. Knoblock, and S. Minton. Learning domain-independent string tranformation weights for high accuracy object identification. In SIGKDD, 2002.
    • (2002) SIGKDD
    • Tejada, S.1    Knoblock, C.A.2    Minton, S.3
  • 30
    • 77952376110 scopus 로고    scopus 로고
    • Algorithms for estimating relative importance in networks
    • S. White and P. Smyth. Algorithms for estimating relative importance in networks. In SIGKDD, 2003.
    • (2003) SIGKDD
    • White, S.1    Smyth, P.2


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