基于XML配置框架下多维度扩展贪心算法  

Multi-dimensional Extended Greedy Algorithm Based on XML Configuration Framework

作　　者：匡珍春[1] 冼远清[1] KUANG Zhenchun;XIAN Yuanqing(School of Mathematics and Computer Science, Guangdong Ocean University Zhanjiang 524088, Guangdong Province, Chin)

机构地区：[1]广东海洋大学数学与计算机学院,广东湛江524088

出　　处：《吉林大学学报（理学版）》2018年第3期688-691,共4页Journal of Jilin University:Science Edition

基　　金：国家自然科学基金(批准号:61471133)

摘　　要：基于XML配置相关原理,给出一种贪心策略算法,并对算法进行测试.针对测试过程中存在的问题,优化得到多维度扩展贪心算法,并对不同算法进行比较实验.实验结果表明,该算法具有可信度高、执行快速和覆盖全面的优点,并且运行的数据越多,结果越精确.Based on the principle of XML configuration,we gave a greedy strategy algorithm and tested the algorithm.Aiming at the problems existing in the testing process,we optimized the algorithm to obtain the multi-dimensional extended greedy algorithm,and carried out comparative experiments on different algorithms.The experimental results show that the algorithm has the advantages of high reliability,fast execution and comprehensive coverage,and the more data are run,the more accurate the results are.

关 键 词：贪心策略算法 多维度扩展贪心算法 数据挖掘 

分 类 号：TP391[自动化与计算机技术—计算机应用技术]