메뉴 건너뛰기




Volumn , Issue , 2011, Pages 1067-1078

Efficient Spectral neighborhood blocking for entity resolution

Author keywords

[No Author keywords available]

Indexed keywords

BIPARTITION; BLOCKING ALGORITHMS; DATA OBJECTS; DATA SETS; FAST ALGORITHMS; LARGE DATASETS; MULTIPLE DATA SOURCES; MULTIPLE SERVICES; REAL WORLD DATA; REAL-WORLD ENTITIES; SCALABLE SOLUTION; SOCIAL NETWORKS; SPECTRAL CLUSTERING; STOPPING CRITERIA; TELECOM; UNIQUE IDENTIFIERS; WEB APPLICATION;

EID: 79957852084     PISSN: 10844627     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDE.2011.5767835     Document Type: Conference Paper
Times cited : (27)

References (47)
  • 3
    • 0001592068 scopus 로고
    • Automatic linkage of vital records
    • H. B. Newcombe, J. M. Kennedy, S. J. Axford, and A. P. James, "Automatic linkage of vital records," Science, vol. 130, no. 3381, pp. 954-959, 1959.
    • (1959) Science , vol.130 , Issue.3381 , pp. 954-959
    • Newcombe, H.B.1    Kennedy, J.M.2    Axford, S.J.3    James, A.P.4
  • 6
    • 77952372966 scopus 로고    scopus 로고
    • Adaptive duplicate detection using learnable string similarity measures
    • M. Bilenko and R. J. Mooney, "Adaptive duplicate detection using learnable string similarity measures," in SIGKDD, 2003.
    • (2003) SIGKDD
    • Bilenko, M.1    Mooney, R.J.2
  • 9
    • 0013331361 scopus 로고    scopus 로고
    • Real-world data is dirty: Data cleansing and the merge/purge problem
    • M. Hernandez, M. A. H. Andez, S. Stolfo, and U. Fayyad, "Real-world data is dirty: Data cleansing and the merge/purge problem," Data Mining and Knowlege Discovery, vol. 2, no. 1, pp. 9-37, 1998. (Pubitemid 128696797)
    • (1998) Data Mining and Knowledge Discovery , vol.2 , Issue.1 , pp. 9-37
    • Hernandez, M.A.1    Stolfo, S.J.2
  • 11
    • 0034592784 scopus 로고    scopus 로고
    • Efficient clustering of highdimensional data sets with application to reference matching
    • A. McCallum, K. Nigam, and L. Ungar, "Efficient clustering of highdimensional data sets with application to reference matching," in Knowledge Discovery and Data Mining, 2000, pp. 169-178.
    • (2000) Knowledge Discovery and Data Mining , pp. 169-178
    • McCallum, A.1    Nigam, K.2    Ungar, L.3
  • 14
    • 84899013108 scopus 로고    scopus 로고
    • On spectral clustering: Analysis and an algorithm
    • A. Y. Ng, M. Jordan, and Y. Weiss, "On spectral clustering: Analysis and an algorithm," in NIPS 14, 2002.
    • (2002) NIPS , vol.14
    • Ng, A.Y.1    Jordan, M.2    Weiss, Y.3
  • 15
    • 51049104834 scopus 로고    scopus 로고
    • Consistency of spectral clustering
    • U. von Luxburg, M. Belkin, and O. Bousquet, "Consistency of spectral clustering," Ann. Statist., vol. 36, no. 2, pp. 555-586, 2008.
    • (2008) Ann. Statist. , vol.36 , Issue.2 , pp. 555-586
    • Von Luxburg, U.1    Belkin, M.2    Bousquet, O.3
  • 17
    • 70350657266 scopus 로고    scopus 로고
    • Fast approximate spectral clustering
    • D. Yan, L. Huang, and M. I. Jordan, "Fast approximate spectral clustering," in SIGKDD, 2009, pp. 907-916.
    • (2009) SIGKDD , pp. 907-916
    • Yan, D.1    Huang, L.2    Jordan, M.I.3
  • 19
    • 37649028224 scopus 로고    scopus 로고
    • Finding and evaluating community structure in networks
    • Feb
    • M. E. J. Newman and M. Girvan, "Finding and evaluating community structure in networks," Physical Review E, vol. 69, no. 2, pp. 026113, Feb 2004.
    • (2004) Physical Review e , vol.69 , Issue.2 , pp. 026113
    • Newman, M.E.J.1    Girvan, M.2
  • 20
    • 79957830647 scopus 로고    scopus 로고
    • ser. Number 92 CBMS Regional Conference Series in Mathematics. American Mathematical Society
    • F. Chung, Spectral Graph Theory, ser. Number 92 in CBMS Regional Conference Series in Mathematics. American Mathematical Society, 1997.
    • (1997) Spectral Graph Theory
    • Chung, F.1
  • 22
    • 75849140057 scopus 로고    scopus 로고
    • A nonparametric view of network models and Newman-Girvan and other modularities
    • P. J. Bickel and A. Chen, "A nonparametric view of network models and Newman-Girvan and other modularities," PNAS, vol. 106, no. 50, pp. 21068-21073, 2009.
    • (2009) PNAS , vol.106 , Issue.50 , pp. 21068-21073
    • Bickel, P.J.1    Chen, A.2
  • 23
    • 0016572913 scopus 로고
    • A vector space model for automatic indexing
    • G. Salton, A. Wong, and C. S. Yang, "A vector space model for automatic indexing," Communications of the ACM, vol. 18, no. 11, pp. 613-620, 1975.
    • (1975) Communications of the ACM , vol.18 , Issue.11 , pp. 613-620
    • Salton, G.1    Wong, A.2    Yang, C.S.3
  • 24
    • 3843127500 scopus 로고    scopus 로고
    • Character n-gram tokenization for European language text retrieval
    • P. McNamee and J. Mayfield, "Character o-gram tokenization for european language text retrieval," Information Retrieval, vol. 7, no. 1, pp. 73-97, 2004. (Pubitemid 39046509)
    • (2004) Information Retrieval , vol.7 , Issue.1-2 , pp. 73-97
    • McNamee, P.1    Mayfield, J.2
  • 25
    • 0004236492 scopus 로고    scopus 로고
    • (3rd Edition), The Johns Hopkins University Press
    • G. Golub and C. van Loan, Matrix Computations (3rd Edition). The Johns Hopkins University Press, 1996.
    • (1996) Matrix Computations
    • Golub, G.1    Van Loan, C.2
  • 27
    • 0242456811 scopus 로고    scopus 로고
    • Interactive deduplication using active learning
    • S. Sarawagi and A. Bhamidipaty, "Interactive deduplication using active learning," in SIGKDD, 2002, pp. 269-278.
    • (2002) SIGKDD , pp. 269-278
    • Sarawagi, S.1    Bhamidipaty, A.2
  • 28
    • 85166310944 scopus 로고    scopus 로고
    • Methods for linking and mining massive heterogeneous databases
    • J. C. Pinheiro and D. X. Sun, "Methods for linking and mining massive heterogeneous databases," in SIGKDD, 1998.
    • (1998) SIGKDD
    • Pinheiro, J.C.1    Sun, D.X.2
  • 29
    • 79953162324 scopus 로고    scopus 로고
    • Merging the results of approximate match operations
    • S. Guha, N. Koudas, A. Marathe, and D. Srivastava, "Merging the results of approximate match operations," in VLDB, 2004.
    • (2004) VLDB
    • Guha, S.1    Koudas, N.2    Marathe, A.3    Srivastava, D.4
  • 30
    • 0034228352 scopus 로고    scopus 로고
    • Automating the approximate record matching process
    • V. S. Verykios and A. K. Elmagarmid, "Automating the approximate record matching process," Information Sciences, vol. 126, pp. 83-98, 1999.
    • (1999) Information Sciences , vol.126 , pp. 83-98
    • Verykios, V.S.1    Elmagarmid, A.K.2
  • 31
    • 79957866123 scopus 로고    scopus 로고
    • A latent topic model for complete entity resolution
    • L. Shu, B. Long, and W. Meng, "A latent topic model for complete entity resolution," in ICDE, 2009.
    • (2009) ICDE
    • Shu, L.1    Long, B.2    Meng, W.3
  • 33
    • 72649086387 scopus 로고    scopus 로고
    • Framework for evaluating clustering algorithms in duplicate detection
    • O. Hassanzadeh, F. Chiang, H. C. Lee, and R. J. Miller, "Framework for evaluating clustering algorithms in duplicate detection," in VLDB, 2009.
    • (2009) VLDB
    • Hassanzadeh, O.1    Chiang, F.2    Lee, H.C.3    Miller, R.J.4
  • 34
    • 0242540438 scopus 로고    scopus 로고
    • Learning to match and cluster large highdimensional data sets for data integration
    • W. Cohen and J. Richman, "Learning to match and cluster large highdimensional data sets for data integration," in SIGKDD, 2002.
    • (2002) SIGKDD
    • Cohen, W.1    Richman, J.2
  • 35
    • 84872255037 scopus 로고    scopus 로고
    • Netflix
    • Netflix, "Netflix prize," http://www.netflixprize.com/index.
    • Netflix Prize
  • 37
    • 33845615644 scopus 로고    scopus 로고
    • Overview of record linkage and current research directions
    • N. P [Online]
    • W. E. Winkler, W. E. Winkler, and N. P, "Overview of record linkage and current research directions," US Bureau of the Census, Tech. Rep., 2006. [Online]. Available: http://www.census.gov/srd/papers/pdf/rrs2006- 02.pdf
    • (2006) US Bureau of the Census, Tech. Rep.
    • Winkler, W.E.1    Winkler, W.E.2
  • 39
    • 77956497723 scopus 로고    scopus 로고
    • Power iteration clustering
    • F. Lin and W. W. Cohen, "Power iteration clustering," in ICML, 2010.
    • (2010) ICML
    • Lin, F.1    Cohen, W.W.2
  • 40
    • 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
    • H. Han, H. Zha, and C. L. Giles, "Name disambiguation in author citations using a k-way spectral clustering method," in JCDL'05: Proceedings of the 5th ACM/IEEE-CS joint conference on Digital libraries. New York, NY, USA: ACM, 2005, pp. 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
  • 41
    • 0017631930 scopus 로고
    • Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees
    • D. T. Lee and C. K. Wong, "Worst-case analysis for region and partial region searches in multidimensional binary search trees and balanced quad trees," Acta Informatica, vol. 9, no. 1, pp. 23-29, 1977. (Pubitemid 8574823)
    • (1977) Acta Informatica , vol.9 , Issue.1 , pp. 23-29
    • Lee, D.T.1    Wong, C.K.2
  • 44
    • 0001116877 scopus 로고
    • Binary codes capable of correcting deletions, insertions, and reversals
    • V. I. Levenshtein, "Binary codes capable of correcting deletions, insertions, and reversals," Soviet Physics Doklady, vol. 10, no. 8, pp. 707-710, 1966.
    • (1966) Soviet Physics Doklady , vol.10 , Issue.8 , pp. 707-710
    • Levenshtein, V.I.1
  • 45
    • 84880467474 scopus 로고    scopus 로고
    • Text joins in an RDBMS for web data integration
    • L. Gravano, P. G. Ipeirotis, N. Koudas, and D. Srivastava, "Text joins in an RDBMS for web data integration," in WWW, 2003, pp. 90-101.
    • (2003) WWW , pp. 90-101
    • Gravano, L.1    Ipeirotis, P.G.2    Koudas, N.3    Srivastava, D.4
  • 46
    • 0027113212 scopus 로고
    • Approximate string matching with o-grams and maximal matches
    • E. Ukkonen, "Approximate string matching with o-grams and maximal matches," Theoretical Computer Science, vol. 92, no. 1, pp. 191-211, 1992.
    • (1992) Theoretical Computer Science , vol.92 , Issue.1 , pp. 191-211
    • Ukkonen, E.1
  • 47
    • 0024863169 scopus 로고
    • The inter-database instance identification problem in integrating autonomous systems
    • Y. R. Wang and S. E. Madnick, "The inter-database instance identification problem in integrating autonomous systems," in ICDE, 1989, pp. 46-55.
    • (1989) ICDE , pp. 46-55
    • Wang, Y.R.1    Madnick, S.E.2


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