메뉴 건너뛰기




Volumn 4, Issue 2, 2013, Pages

Adaptive connection strength models for relationship-based Entity Resolution

Author keywords

Connection strength; Entity Resolution; Graph based disambiguation; Lookup; Reference disambiguation; Relationship analysis

Indexed keywords

CONNECTION STRENGTH; ENTITY RESOLUTIONS; GRAPH-BASED; LOOKUPS; REFERENCE DISAMBIGUATION; RELATIONSHIP ANALYSIS;

EID: 84876240193     PISSN: 19361955     EISSN: 19361963     Source Type: Journal    
DOI: 10.1145/2435221.2435224     Document Type: Article
Times cited : (23)

References (49)
  • 6
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • Bilenko, M. and Mooney, R. 2003. Adaptive duplicate detection using learnable string similarity measures. In Proceedings of SIGKDD.
    • (2003) Proceedings of SIGKDD
    • Bilenko, M.1    Mooney, R.2
  • 13
    • 84876268730 scopus 로고    scopus 로고
    • CiteSeer Dataset. 2005. CiteSeer Dataset. http://citeseer.ist.psu.edu/ oai.html.
    • (2005) CiteSeer Dataset
  • 20
    • 84947399464 scopus 로고
    • A theory for record linkage
    • Fellegi, I. and Sunter, A. 1969. A theory for record linkage. J. Amer. Stat. Assoc. 64, 328, 1183-1210.
    • (1969) J. Amer. Stat. Assoc , vol.64 , Issue.328 , pp. 1183-1210
    • Fellegi, I.1    Sunter, A.2
  • 23
    • 70349248411 scopus 로고    scopus 로고
    • Scaling up duplicate detection in graph data
    • Herschel, M. and Naumann, F. 2008. Scaling up duplicate detection in graph data. In Proceedings of CIKM. 1325-1326.
    • (2008) Proceedings of CIKM , pp. 1325-1326
    • Herschel, M.1    Naumann, F.2
  • 24
  • 25
    • 84876238203 scopus 로고    scopus 로고
    • HomePageSearch 2005. http://hpsearch.uni-trier.de.
    • (2005)
  • 27
    • 33745266392 scopus 로고    scopus 로고
    • Domain-independent data cleaning via analysis of entity-relationship graph
    • Kalashnikov, D. V. and Mehrotra, S. 2006. Domain-independent data cleaning via analysis of entity-relationship graph. ACM Trans. Datab. Syst. 31, 2, 716-767.
    • (2006) ACM Trans. Datab. Syst. , vol.31 , Issue.2 , pp. 716-767
    • Kalashnikov, D.V.1    Mehrotra, S.2
  • 33
    • 84880866959 scopus 로고    scopus 로고
    • Improving author coreference by resource-bounded information gathering from the web
    • Kanani, P., McCallum, A., and Pal, C. 2007. Improving author coreference by resource-bounded information gathering from the web. In Proceedings of IJCAI.
    • (2007) Proceedings of IJCAI
    • Kanani, P.1    McCallum, A.2    Pal, C.3
  • 34
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • Levenshtein, V. 1966. Binary codes capable of correcting deletions, insertions, and reversals. In Soviet Physics Doklady 10, 707-710.
    • (1966) Soviet Physics Doklady , vol.10 , pp. 707-710
    • Levenshtein, V.1
  • 35
    • 31044447006 scopus 로고    scopus 로고
    • Unsupervised name disambiguation via social network similarity
    • Counterterrorism, and Security
    • Malin, B. 2005. Unsupervised name disambiguation via social network similarity. In Proceedings of Workshop on Link Analysis, Counterterrorism, and Security.
    • (2005) Proceedings of Workshop on Link Analysis
    • Malin, B.1
  • 36
    • 36849089968 scopus 로고    scopus 로고
    • Object consolidation by graph partitioning with a conditionally-trained distance metric
    • Record Linkage and Object Consolidation
    • McCallum, A. and Wellner, B. 2003. Object consolidation by graph partitioning with a conditionally-trained distance metric. In Proceedings of KDD Workshop on Data Cleaning, Record Linkage and Object Consolidation.
    • (2003) Proceedings of KDD Workshop on Data Cleaning
    • McCallum, A.1    Wellner, B.2
  • 37
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of high-dimensional data sets with application to reference matching
    • McCallum, A. K., Nigam, K., and Ungar, L. 2000. Efficient clustering of high-dimensional data sets with application to reference matching. In Proceedings of ACM SIGKDD.
    • (2000) Proceedings of ACM SIGKDD
    • McCallum, A.K.1    Nigam, K.2    Ungar, L.3
  • 38
    • 33750347523 scopus 로고    scopus 로고
    • Contextual search and name disambiguation in email using graphs
    • Minkov, E., Cohen, W. W., and Ng, A. 2006. Contextual search and name disambiguation in email using graphs. In Proceedings of SIGIR.
    • (2006) Proceedings of SIGIR
    • Minkov, E.1    Cohen, W.W.2    Ng, A.3
  • 42
    • 84859012047 scopus 로고    scopus 로고
    • Attribute and object selection queries on objects with probabilistic attributes
    • Nuray-Turan, R., Kalashnikov, D. V., Mehrotra, S., and Yu, Y. 2012a. Attribute and object selection queries on objects with probabilistic attributes. ACM Trans. Datab. Syst. 37, 1.
    • (2012) ACM Trans. Datab. Syst. , vol.37 , pp. 1
    • Nuray-Turan, R.1    Kalashnikov, D.V.2    Mehrotra, S.3    Yu, Y.4


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