共查询到20条相似文献,搜索用时 15 毫秒
1.
规则提取是RST中一个重要的研究方向,本文提出了不完备信息系统的相对正域的概念,通过简单的集合运算就可以求得相对正域;利用相对正域选择决策树的结点,构造一棵决策树,完成对不完备信息系统的规则提取。 相似文献
2.
决策树算法是一种采用分治策略的自顶向下的归纳算法,传统的决策树算法往往是基于信息论度量的.文章以粗糙集合理论中的区分观点为基础,提出了两种新型的属性选择判据:区分度和区分价值.实验结果表明,采用区分价值的属性选择策略所生成的决策树要明显优于基于熵的属性选择策略. 相似文献
3.
4.
A. Norman A. Ahmed J. Chou A. Dalal K. Fortson M. Jindal C. Kurz H. Lee K. Payne R. Rando K. Sheppard E. Sublett J. Sussman I. White 《Computational Economics》2004,23(2):173-192
A consumer entering a new bookstore can face more than 250,000alternatives. The efficiency of compensatory and noncompensatory decisionrulesfor finding a preferred item depends on the efficiency of their associatedinformation operators. At best, item-by-item information operators lead tolinear computational complexity; set information operators, on the other hand,can lead to constant complexity. We perform an experiment demonstrating thatsubjects are approximately rational in selecting between sublinear and linearrules. Many markets are organized by attributes that enable consumers toemploya set-selection-by-aspect rule using set information operations. In cyberspacedecision rules are encoded as decision aids. 相似文献
5.
基于决策熵的决策树规则提取方法 总被引:2,自引:0,他引:2
在决策表中,决策规则的可信度和对象覆盖度是衡量决策能力的重要指标。以知识粗糙熵为基础,提出决策熵的概念,并定义其属性重要性;然后以条件属性子集的决策熵来度量其对决策分类的重要性,自顶向下递归构造决策树;最后遍历决策树,简化所获得的决策规则。该方法的优点在于构造决策树及提取规则前不进行属性约简,计算直观,时间复杂度较低。实例分析的结果表明,该方法能获得更为简化有效的决策规则。 相似文献
6.
在决策表中,决策规则的可信度和对象覆盖度是衡量决策能力的重要指标。以知识粗糙熵为基础,提出决策熵的概念,并定义其属性重要性;然后以条件属性子集的决策熵来度量其对决策分类的重要性,自顶向下递归构造决策树;最后遍历决策树,简化所获得的决策规则。该方法的优点在于构造决策树及提取规则前不进行属性约简,计算直观,时间复杂度较低。实例分析的结果表明,该方法能获得更为简化有效的决策规则。 相似文献
7.
基于Rough Set带结论域的关联规则挖掘 总被引:2,自引:0,他引:2
论文构建了一种基于RoughSet(RS)带结论域的强关联规则挖掘模型,采用约简决策表和改进的Apriori算法来挖掘关联规则,提高了关联规则的挖掘效率和挖掘质量,提出并实现了带结论域的关联规则挖掘的解决方案。 相似文献
8.
k-Decision lists and decision trees play important roles in learning theory as well as in practical learning systems.k-Decision lists generalize classes such as monomials,k-DNF, andk-CNF, and like these subclasses they are polynomially PAC-learnable [R. Rivest,Mach. Learning2(1987), 229–246]. This leaves open the question of whetherk-decision lists can be learned as efficiently ask-DNF. We answer this question negatively in a certain sense, thus disproving a claim in a popular textbook [M. Anthony and N. Biggs, “Computational Learning Theory,” Cambridge Univ. Press, Cambridge, UK, 1992]. Decision trees, on the other hand, are not even known to be polynomially PAC-learnable, despite their widespread practical application. We will show that decision trees are not likely to be efficiently PAC-learnable. We summarize our specific results. The following problems cannot be approximated in polynomial time within a factor of 2logδ nfor anyδ<1, unlessNP⊂DTIME[2polylog n]: a generalized set cover,k-decision lists,k-decision lists by monotone decision lists, and decision trees. Decision lists cannot be approximated in polynomial time within a factor ofnδ, for some constantδ>0, unlessNP=P. Also,k-decision lists withl0–1 alternations cannot be approximated within a factor logl nunlessNP⊂DTIME[nO(log log n)] (providing an interesting comparison to the upper bound obtained by A. Dhagat and L. Hellerstein [in“FOCS '94,” pp. 64–74]). 相似文献
9.
10.
11.
属性约简是决策系统规则获取的基础,而Skowron分辨矩阵是粗集求核与约简的重要方法之一.本文以Skowron分辨矩阵讨论一致性决策系统的属性约简的结果为基础,提出基于分辨矩阵的一致性决策系统的规则获取算法和它的应用. 应用例子表明本文提出的方法的有效性 相似文献
12.
13.
决策树中基于基尼指数的属性分裂方法 总被引:2,自引:0,他引:2
决策树是数据挖掘中的一个重要算法。文中首先介绍了决策树的生成思想,和生成过程中关于多值属性的分离问题。基尼指数是多值属性分离的一种方法,文中详细介绍了基尼指数作为一种不纯度分裂方法的原理,并通过一个分别用两种方式进行基尼分裂的实例。最后参阅国内外文献将基尼指数与其他一些算法如信息增益、χ2统计作了比较来说明其在多值属性分裂时的一些优点和缺点。 相似文献
14.
15.
基于VPRS的信息系统近似决策规则优化 总被引:1,自引:0,他引:1
基于变精度粗糙集模型,在决策信息系统中定义近似协调等价类的一种近似约简;构造相应的区分函数,利用布尔推理理论求取近似协调等价类的近似约简,并由此获取近似决策规则的简化决策规则。利用这个方法得到的简化决策规则,与原系统中的近似决策规则是相容的。 相似文献
16.
基于决策规则的条件属性支持度和规则支持度,结合Apriori算法思想,本文提出了一种利用决策规则支持度对粗糙集中决策表进行值约简的算法。实例表明该算法可以有效地对决策表进行值约简。 相似文献
17.
在任何融合律定后最优传感器律能求得的假设下,我们分析了导致融合律之间等价性和优越性的条件,应用如上结果,欲获全局最优的系统性能,我们可以划分所有可能的融合律为若干等价类和比较某些等价类之间的性能,于是有价值的融合律等价类数目将大大减少,而且上面的分析并不依赖于观测数据的统计性质和优化系统性能的目标。 相似文献
18.
交通流量数据的分类规则挖掘 总被引:2,自引:0,他引:2
巩帅 《计算机工程与应用》2006,42(6):219-220,232
概述了数据挖掘的分类算法,并简要介绍了C5.0决策树算法。以北京市“三横两纵”主干道交通流量数据为例,采用C5.0决策树算法提取交通流量的分类规则,用于分析交通流量规律、信息模式和数据趋势,并对分类树进行量化,为交通信号设计、路网规划、道路设计、路网节点设计等提供决策支持。 相似文献
19.
20.
An incremental algorithm generating satisfactory decision rules and a rule post-processing technique are presented. The rule induction algorithm is based on the Apriori algorithm. It is extended to handle preference-ordered domains of attributes (called criteria) within Variable Consistency Dominance-based Rough Set Approach. It deals, moreover, with the problem of missing values in the data set. The algorithm has been designed for medical applications which require: (i) a careful selection of the set of decision rules representing medical experience and (ii) an easy update of these decision rules because of data set evolving in time, and (iii) not only a high predictive capacity of the set of decision rules but also a thorough explanation of a proposed decision. To satisfy all these requirements, we propose an incremental algorithm for induction of a satisfactory set of decision rules and a post-processing technique on the generated set of rules. Userʼns preferences with respect to attributes are also taken into account. A measure of the quality of a decision rule is proposed. It is used to select the most interesting representatives in the final set of rules. 相似文献