1MONGE AE, ELKAN CP. An efficient do- main independent algorithm for detecting ap- proximately duplicate database records [A]. In proc o f the ACMSIGMOD Workshop on Research Issues on Knowledge Discovery and Data Mining [C]. Tucson, AZ, 1997:: 23- 29.
2MONGE AN. Matching algorithm within a duplicate detection system [J]. IEEE Data Engineering Bullet. 2000, 23(4).
3Ahmed K, Panagiotis G, Vassilos, et al. Duplicate record detection: a survey[J]. IEEE Transactions on Knowledge and Data Engineering, 2007, 19 (1) : 1- 16.
4Anestis Sitas, Sarantos Kapidakis. Duplicate detection algorithms of bibliographic descriptions[J]. Library Hi Tech, 2008, 26(2): 287-301.
5McCallum A, Nigam K, Ungar L H. Efficient clustering of high-dimensional data sets with application to reference matching[C]//Sixth ACM SIGKDD Int'l Conf Knowledge Discovery and Data Mining. New York: ACM Press, 2000: 169-178.
6Chaudhuri S, Ganjam, K, Ganti V, et al. Robust and efficient fuzzy match for online data cleaning [C]// ACM SIGMOD International Conference on Management of Data. New York: ACM, 2003: 313- 324.
7Jaewoo Kang. Toward the scalable integration of internet information sources[D]. Madison: Computer Sciences Department, University of Wisconsin-Madison, 2004.
8Omar B, David M, Jennifer W, et al. Swoosh: a generic approach to entity resolution[J]. The VLDB Journal, 2009, 18: 255-276.
9Steven Euijong Whang. Generic entity resolution with negative rules[J]. The VLDB Journal. 2009, 18(6) : 1 261-1 277.
10Shahri H H. Eliminating duplicates in information integration: an adaptive, extensible framework[J]. IEEE Intelligent Systems, 2006, 12(5): 63-71.
