메뉴 건너뛰기




Volumn 2, Issue 2, 2011, Pages

On graph-based name disambiguation

Author keywords

Clustering; Graph; Name disambiguation; Similarity

Indexed keywords

AFFINITY PROPAGATION; CLUSTERING; COAUTHORSHIP; DATA SETS; DOCUMENT RETRIEVAL; GRAPH; GRAPH-BASED; HIGH PRECISION; INFORMATION INTEGRATION; INTERMEDIATE RESULTS; NAME DISAMBIGUATION; NON-TRIVIAL TASKS; OTHER APPLICATIONS; SIMILARITY; SIMILARITY MATRIX; SIMILARITY METRICS; USER FEEDBACK; WEB SEARCHES;

EID: 79951738363     PISSN: 19361955     EISSN: 19361963     Source Type: Journal    
DOI: 10.1145/1891879.1891883     Document Type: Article
Times cited : (137)

References (36)
  • 6
    • 38949090436 scopus 로고    scopus 로고
    • Comment on "clustering by passing messages between data points"
    • DOI 10.1126/science.1150938
    • BRUSCO, M. J. AND KÖHN, H.-F. 2008. Comment on "clustering by passing messages between data points". Sci. 319, 726c. (Pubitemid 351225876)
    • (2008) Science , vol.319 , Issue.5864
    • Brusco, M.J.1    Kohn, H.-F.2
  • 8
    • 36348962508 scopus 로고    scopus 로고
    • Adaptive graphical approach to entity resolution
    • DOI 10.1145/1255175.1255215, Proceedings of the 7th ACM/IEEE Joint Conference on Digital Libraries, JCDL 2007: Building and Sustaining the Digital Environment
    • CHEN, Z.,KALASHNIKOV, D. V., AND MEHROTRA, S. 2007. Adaptive graphical approach to entity resolution. In Proceedings of the ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL'07). 204-213. (Pubitemid 350157982)
    • (2007) Proceedings of the ACM International Conference on Digital Libraries , pp. 204-213
    • Chen, Z.1    Kalashnikov, D.V.2    Mehrotra, S.3
  • 9
    • 79951744013 scopus 로고    scopus 로고
    • DBLP. bibliography
    • DBLP. 2010. bibliography. http://www.informatik.uni-trier.de/~ley/db/.
    • (2010)
  • 14
    • 84947399464 scopus 로고
    • A theory for record linkage
    • FELLEGI, I. P. AND SUNTER, A. B. 1969. A theory for record linkage. J. Amer. Statist. Assoc. 64, 328, 1183-1210.
    • (1969) J. Amer. Statist. Assoc , vol.64 , Issue.328 , pp. 1183-1210
    • Fellegi, I.P.1    Sunter, A.B.2
  • 15
    • 33847172327 scopus 로고    scopus 로고
    • Clustering by passing messages between data points
    • DOI 10.1126/science.1136800
    • FREY, B. J. AND DUECK, D. 2007. Clustering by passing messages between data points. Sci. 315, 972-976. (Pubitemid 46281181)
    • (2007) Science , vol.315 , Issue.5814 , pp. 972-976
    • Frey, B.J.1    Dueck, D.2
  • 16
    • 38949137845 scopus 로고    scopus 로고
    • Response to comment on "clustering by passing messages between data points"
    • DOI 10.1126/science.1151268
    • FREY, B. J. AND DUECK, D. 2008. Response to comment on "clustering by passing messages between data points". Sci. 319, 726d. (Pubitemid 351225877)
    • (2008) Science , vol.319 , Issue.5864
    • Frey, B.J.1    Dueck, D.2
  • 18
    • 27544488429 scopus 로고    scopus 로고
    • Name disambiguation in author citations using a K-way spectral clustering method
    • Proceedings of the 5th ACM/IEEE Joint Conference on Digital Libraries - Digital Libraries: Cyberinfrastructure for Research and Education
    • HAN, H., ZHA, H., AND GILES, C. L. 2005. Name disambiguation in author citations using a k-way spectral clustering method. In Proceedings of the ACM/IEEE-CS Joint Conference on Digital Libraries (JCDL'05). 334-343. (Pubitemid 41543574)
    • (2005) Proceedings of the ACM/IEEE Joint Conference on Digital Libraries , pp. 334-343
    • Han, H.1    Zha, H.2    Giles, C.L.3
  • 21
    • 33745266392 scopus 로고    scopus 로고
    • Domain-independent data cleaning via analysis of entity-relationship graph
    • DOI 10.1145/1138394.1138401
    • KALASHNIKOV, D. V. AND MEHROTRA, S. 2006. Domain-independent data cleaning via analysis of entityrelationship graph. ACM Trans. Datab. Syst. 31, 2, 716-767. (Pubitemid 43924953)
    • (2006) ACM Transactions on Database Systems , vol.31 , Issue.2 , pp. 716-767
    • Kalashnikov, D.V.1    Mehrotra, S.2
  • 24
    • 35748982103 scopus 로고    scopus 로고
    • Clustering by soft-constraint affinity propagation: Applications to gene-expression data
    • DOI 10.1093/bioinformatics/btm414
    • LEONE, M., SUMEDHA, AND WEIGT, M. 2007. Clustering by soft-constraint affinity propagation: Applications to gene-expression data. Bioinf. 23, 20, 2708-2715. (Pubitemid 350048335)
    • (2007) Bioinformatics , vol.23 , Issue.20 , pp. 2708-2715
    • Leone, M.1    Weigt, S.2    Weigt, M.3
  • 31
    • 79951739171 scopus 로고    scopus 로고
    • PUBMED. bibliography
    • PUBMED. 2010. bibliography. http://www.ncbi.nlm.nih.gov/pubmed/
    • (2010)
  • 33
    • 0001504032 scopus 로고
    • An experimental study of the small world problem
    • TRAVERS, J. AND MILGRAM, S. 1969. An experimental study of the small world problem. Sociometry 32, 4, 425-443.
    • (1969) Sociometry , vol.32 , Issue.4 , pp. 425-443
    • Travers, J.1    Milgram, S.2
  • 34
    • 0012866045 scopus 로고    scopus 로고
    • The state of record linkage and current research problems
    • Statistical Research Division, U.S. Bureau of the Census
    • WINKLER, W. 1999. The state of record linkage and current research problems. Tech. rep., Statistical Research Division, U.S. Bureau of the Census.
    • (1999) Tech. Rep.
    • Winkler, W.1


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