|
P. Lyman and H. R Varian, “How Much Information?,” (http://www2.sims.berkeley.edu/research/projects/how much-info-2003/execsum.htm, accessed 27th October 2003)
|
|
A. K. Elmagarmid, P. G. Ipeirotis, and V. S. Verykios, “Duplicate Record Detection: A Survey,” IEEE Transactions on Knowledge and Data Engineering, Vol. 19, No. 1, pp. 1-16, 2007
|
|
E. K. Rezig, E. C. Dragut, M. Ouzzani, A. K. Elmagarmid, and W. G. Aref, “ORLF: A Flexible Framework for Online Record Linkage and Fusion,” in Proceedings of 2016 IEEE 32nd International Conference on Data Engineering, Helsinki, Finland, pp. 16-20, May 2016
|
|
X. L. Dong and F. Naumann, “Data Fusion-Resolving Data Conflicts for Integration,” in Proceedings of 2009 the 35th International Conference on Very Large Data Bases, 2009
|
|
D. L. Davies and D. W. Bouldin, “A Cluster Separation Measure,” IEEE Transactions on Pattern Analysis and Machine Intelligence, Vol. 1, No. 2, pp. 224-227, 1979
|
|
J. C. Dunn, “Well Separated Clusters and Optimal Fuzzy Partitions,” Journal of Cybernetics, Vol. 4, No. 1, pp. 95-104, 1974
|
|
P. J. Rousseeuw, “Silhouettes: A Graphical Aid to the Interpretation and Validation of Cluster Analysis,” Journal of Computational and Applied Mathematics, Vol. 20, No. 1, pp. 53-65, 1987
|
|
C. Legany, S. Juhasz, and A. Babos, “Cluster Validity Measurement Techniques,” in Proceedings of the 5th International Conference on Artificial Intelligence, Knowledge Engineering and Data Bases, Madrid, Spain: WSEAS, pp. 388-393, 2006
|
|
S. Petrovi?, “A Comparison Between the Silhouette Index and the Davies-Bouldin Index in Labelling IDS Clusters,” in Proceedings of the 11th Nordic Workshop on Secure IT-Systems, Linkoping, Sweden: NORDSEC, pp. 53-64, 2006
|
|
W. W. Cohen, P. Ravikumar, and S. E. Fienberg, “A Comparison of String Distance Metrics for Name-Matching Tasks,” in Proceedings of the IJCAI Workshop on Information Integration on the Web, Acapulco, Mexico: IIWEB, pp. 73-78, 2003
|
|
T. F. Gonzalez, “On the Computational Complexity of Clustering and Related Problems,” System Modeling and Optimization, pp. 174-182, 2005
|
|
J. Sima and S. E. Schaeffer, “On the NP-completeness of Some Graph Cluster Measures,” Lecture Notes in Control and Information Sciences, Vol. 3831, pp. 530-537, 2006
|
|
M. W. Krentel, “The Complexity of Optimization Problems,” Journal of Computer and System Sciences, Vol. 36, No. 3, pp. 490-509, 1988
|
|
X. L. Dong, L. Bertiequille, and D. Srivastava, “Integrating Conflicting Data: the Role of Source Dependence,” in Proceedings of the VLDB Endowment, Vol. 2, No. 1, pp. 50-561, 2009
|
|
N. Koudas, S. Sarawagi, and D. Srivastava, “Record Linkage: Similarity Measures and Algorithms,” in Proceedings of the 2006 ACM SIGMOD International Conference on Management of Data, NY, USA:ACM, pp. 802-803, 2006
|
|
E. K. Rezig, E. C. Dragut, and M. Ouzzani, “Query-Time Record Linkage and Fusion over Web Databases,” in Proceedings of 2015 IEEE 31st International Conference on Data Engineering, Seoul, South Korea, pp. 13-17:42-53, April 2015
|