[1] Pawlak Z. Rough Sets[J]. International Journal of Computer and Information Science, 1982, 11(5): 341-356. [2] Pawlak Z, Slowinski R. Rough Set Approach to Multi-attribute Decision Analysis[J]. European Journal of Operational Research, 1994, 72(3): 443-459. [3] Wong S K M, Ziarko W. On Optimal Decision Rules in Decision Tables[D]. Regina, Canada: University of Regina, 1985. [4] Guan J W, Bell D A. Rough Computational Methods for Information Systems[J]. Artificial Intelligences, 1998, 105(1/2): 77-103. [5] Zielosko B, Piliszczuk M. Greedy Algorithm for Attribute Reduction[J]. Fundamenta Informaticae, 2008, 85(1-4): 579-561. [6] 刘少辉, 盛秋戬, 吴 斌, 等. Rough集高效算法的研究[J]. 计算机学报, 2003, 26(5): 524-529. [7] 苗夺谦, 胡桂荣. 知识约简的一种启发式算法[J]. 计算机研究与发展, 1999, 36(6): 681-684. [8] 王国胤, 于 洪, 杨大春. 基于条件信息熵的决策表约简[J]. 计算机学报, 2002, 25(7): 759-766. [9] 叶东毅, 陈昭炯. 一个新的差别矩阵及其求核方法[J]. 电子学报, 2002, 28(7): 1086-1088. [10] 杨 明. 一种基于改进差别矩阵的属性约简增量式更新算法[J]. 计算机学报, 2007, 30(5): 815-822. [11] 徐章艳, 刘作鹏, 杨炳儒, 等. 一个复杂度为max(O(|C||U|), O(|C|2|U/C|))的快速约简算法[J]. 计算机学报, 2006, 29(3): 391- 399. [12] 刘 勇, 熊 蓉, 褚 健. Hash快速属性约简算法[J]. 计算机学报, 2009, 32(8): 1493-1499. [13] Hassin R, Levin A. A Better-Than-Greedy Approximation Approximation Algorithm for the Minimum Set Cover Problem[J]. SIAM Journal on Computing, 2005, 35(1): 189-200. [14] Hassin R, Keinan A. Greedy Heuristics with Regret, with Application to the Cheapest Insertion Algorithm for the TSP[J]. Operations Research Letters, 2008, 36(2): 243-246. [15] Huang Wenqi, Li Yu, Gerard S, et al. A “Learning from Human” Heuristic for Solving Unequal Circle Packing Problem[C]//Proc. of the 1st International Workshop on Heuristics. Beijing, China: [s. n.], 2002: 39-45. [16] 陈卫东, 李吉桂. 基于拟人策略的高校排课算法[J]. 计算机科学, 2003, 30(12): 172-175.
|