[1] 李林,钱丹丹,黄婷婷,等.高校信息化数据治理探讨[J].中国教育信息化,2017(9):66-68.(LI L, QIAN D D, HUANG T T, et al. Discussion on the management of informationization data in colleges and universities[J]. The Chinese Journal of ICT in Education, 2017(9):66-68.) [2] 徐峰,吴旻瑜,徐萱,等.教育数据治理:问题、思考与对策[J].开放教育研究,2018,24(2):107-112.(XU F, WU M Y, XU X, et al. Educational data governance:problems, reflections and countermeasures[J]. Open Education Research, 2018, 24(2):107-112.) [3] MANNILA H, RAIHA K J. Dependency inference[C]//Proceedings of the 1987 International Conference on Very Large Data Bases. San Francisco:Morgan Kaufmann Publishers Inc., 1987:155-158. [4] HUHTALA Y, KARKKAINEN J, PORKKA P, et al. Efficient discovery of functional and approximate dependencies using partitions[C]//Proceedings of the 14th International Conference on Data Engineering. Piscataway:IEEE, 1998:392-401. [5] LOPES S, PETIT J M, LAKHAL L. Efficient discovery of functional dependencies and ARMSTRONG relations[C]//Proceedings of the 2000 International Conference on Extending Database Technology, LNCS 1777. Berlin:Springer, 2000:350-364. [6] WYSS C, GIANNELLA C, ROBERTSON E. FastFDs:a heuristic-driven, depth-first algorithm for mining functional dependencies from relation instances:extended abstract[C]//Proceedings of the 2001 International Conference on Data Warehousing and Knowledge Discovery, LNCS 2114. Berlin:Springer, 2001:101-110. [7] HUHTALA Y, KARKKAINEN J, PORKKA P, et al. TANE:an efficient algorithm for discovering functional and approximate dependencies[J]. The Computer Journal, 1999, 42(2):100-111. [8] NOVELLI N, CICCHETTI R. FUN:an efficient algorithm for mining functional and embedded dependencies[C]//Proceedings of the 2001 International Conference on Database Theory, LNCS 1973. Berlin:Springer, 2001:189-203. [9] YAO H, HAMILTON H J, BUTZ C J. FD/spl I.bar/Mine:discovering functional dependencies in a database using equivalences[C]//Proceedings of the 2002 IEEE International Conference on Data Mining. Piscataway:IEEE, 2002:729-732. [10] ABEDJAN Z, SCHULZE P, NAUMANN F. DFD:efficient functional dependency discovery[C]//Proceedings of the 23rd ACM International Conference on Conference on Information and Knowledge Management. New York:ACM, 2014:949-958. [11] FLACH P A, SAVNIK I. Database dependency discovery:a machine learning approach[J]. AI Communications, 1999, 12(3):139-160. [12] PAPENBROCK T, EHRLICH J, MARTEN J, et al. Functional dependency discovery:an experimental evaluation of seven algorithms[J]. Proceedings of the VLDB Endowment, 2015, 8(10):1082-1093. [13] AGRAWAL R, SRIKANT R. Fast algorithms for mining association rules in large databases[C]//Proceedings of the 20th International Conference on Very Large Data Bases. San Francisco:Morgan Kaufmann Publishers Inc., 1994:487-499. [14] SEBASTIAN-COLEMAN L.数据质量测量的持续改进[M].卢涛,李颖,译.北京:机械工业出版社,2016:44-64.(SEBASTIAN-COLEMAN L. Measuring Data Quality for Ongoing Improvement[M]. LU T, LI Y, translated. Beijing:China Machine Press, 2016:44-64.) [15] 余敏,赵晓南,许志.基于依赖的数据一致性研究进展[J].计算机应用,2018,38(S2):72-76,102.(YU M, ZHAO X N, XU Z. Survey on using dependencies to improve data consistency[J]. Journal of Computer Applications, 2018, 38(S2):72-76, 102.) [16] FREY B J, DUECK D. Clustering by passing messages between data points[J]. Science, 2007, 315(5814):972-976. [17] 郭秀娟,陈莹.AP聚类算法的分析与应用[J].吉林建筑大学学报,2013,30(4):58-61.(GUO X J, CHEN Y. Analysis and application on AP clustering algorithm[J]. Journal of Jilin Jianzhu University, 2013, 30(4):58-61.) [18] 王开军,张军英,李丹,等.自适应仿射传播聚类[J].自动化学报,2007,33(12):1242-1246.(WANG K J, ZHANG J Y, LI D, et al. Adaptive affinity propagation clustering[J]. Acta Automatica Sinica, 2007, 33(12):1242-1246.) [19] 董俊,王锁萍,熊范纶.可变相似性度量的近邻传播聚类[J].电子与信息学报,2010,32(3):509-514.(DONG J, WANG S P, XIONG F L. Affinity propagation clustering based on variable-similarity measure[J]. Journal of Electronics and Information Technology, 2010, 32(3):509-514.) [20] 肖宇,于剑.基于近邻传播算法的半监督聚类[J].软件学报,2008,19(11):2803-2813.(XIAO Y, YU J. Semi-supervised clustering based on affinity propagation algorithm[J]. Journal of Software, 2008, 19(11):2803-2813.) |