共查询到20条相似文献,搜索用时 140 毫秒
1.
多智能主体决策在决策支持系统中的应用越来越广泛,但也带来了各智能主体决策一致性,以及选择最优决策方案的问题,为解决以上问题,该文提出了基于模糊偏好关系的多智能主体决策方法,该方法利用模糊聚合算子对多智能主体的决策结果进行聚合,并利用模糊偏好关系对决策方案进行排序,从而选择最优决策方案。 相似文献
2.
3.
4.
5.
二叉决策图(BDDs)是布尔函数的一个表示方法,最近它被广泛于逻辑综合、布尔电路的模拟和测试等领域。在这些应用中,有些基本问题需要解决,其中包括电路图到决策图的转换。本文提出一个转换的方法。文中分两步叙述,首先是对无扇出电路的转换,然后是对有扇出电路的转换,最后把两者结合为一个通用算法。 相似文献
6.
基于RBF网络的信息融合在机器人足球中的应用 总被引:4,自引:2,他引:2
机器人足球系统是综合性的人工智能研究平台。决策在机器人足球比赛中起着至关重要的作用。通过对机器人足球系统的分析,论证了信息融合应用于机器人足球系统的可行性。针对机器人足球比赛决策中的实际问题,提出了基于径向基函数(RBF)神经网络的信息融合方法,并设计了足球机器人射门实验。实验结果证明该方法有助于提高整个系统决策的准确性。 相似文献
7.
8.
徐涛 《计算机应用与软件》2001,18(4):18-21
本文介绍了数据库技术的现状、数据挖掘的方法以及它在Bayesian网建网技术中的应用:通过数据挖掘解决Bayesian网络建模过程中所遇到的具体问题,即如何从大规模数据库中寻找各变量之间的关系以及如何确定条件概率问题。通过将该方法应用于实际问题中的例子:绿化决策系统中如何选取树种,我们将看到此技术是有效和实用的。 相似文献
9.
孟朝晖 《计算机工程与应用》2005,41(30):72-74
证据理论是信息融合、数据挖掘、决策系统等应用模型的理论基础。研究了证据理论中信任函数与似然函数的可加性问题,定义了双联信度函数,证明了该函数为可加集函数的充要条件是基本概率分配函数的非零赋值局限于单点集和两点集。 相似文献
10.
在模糊知识表示与推理中,否定信息扮演了一个重要角色.从概念层面上区分了模糊知识中存在的3 种否定关系,即矛盾否定关系、对立否定关系和中介否定关系.为了建立能够完全描述这些不同否定关系的逻辑基础,提出一种区分矛盾否定、对立否定和中介否定的模糊命题逻辑形式系统FLCOM.讨论了FLCOM 特有的性质与意义,给出了FLCOM 的一种语义解释,并证明了可靠性定理.为了表明FLCOM 处理实际问题的适用性,进一步研究了FLCOM在一个模糊决策实例中的应用.具体地,基于FLCOM讨论了决策规则中的模糊命题及其不同否定的区分与形式表示,给出一种确定模糊命题及其不同否定的真值及其真值范围阈值的方法,并采用模糊产生式规则讨论了实例中的模糊推理与决策.从而表明,运用FLCOM 处理具有模糊性并且存在不同否定的实际问题是有效的. 相似文献
11.
12.
The phenomenon of demand for novelty is defined and explored as a unique and under‐examined aspect of certain markets. Demand for novelty is the portion of demand not explained by practical utility or marketing effects – it is the demand for the new and unique. We explore markets characterized by high demand for novelty and how they differ from typical markets. Primarily, this involves the central role of novelty in the product or service value proposition as well as rapid growth rates and product or service obsolescence. Within this context, we consider the dynamics of innovating and imitating and suggest several ways that first mover competition is unique in markets with high demand for novelty. From the perspective of the knowledge‐based theory of the firm, we consider the implications of organizational learning and knowledge and decision making as they relate to new product development routines, improvisation, and top management team decision making. We conclude by considering several avenues for future empirical research. 相似文献
13.
决策表的一种知识约简与规则获取方法 总被引:1,自引:0,他引:1
粗糙集理论是一种新型的数据挖掘和决策分析方法,利用粗糙集理论进行决策表的知识约简与决策规则挖掘已经成为研究热点。文中介绍了粗糙集的基本理论,在此基础上运用该理论对从决策表中获取最小规则进行了研究,提出了决策表约简的启发式方法,并通过一个具体实例详细说明了决策规则获取过程,实例分析表明了其有效性。 相似文献
14.
针对相似度碰撞引发证据融合结果错误的问题,提出一种新的证据融合方法。首先,提取证据的焦元序列特征并将其转化为排序矩阵以弥补证据相似度易碰撞的不足;其次,联合证据的排序矩阵和信息熵完成对证据权重的确定;最后,生成归一化证据(MAE)并使用Dempster融合公式将MAE融合n-1次获得最终的结果。基于在线的鸢尾花数据集对证据平均融合方法、余弦相似度证据融合方法、证据距离融合方法和证据信誉度融合方法进行了花类型识别准确性的F-Score对比,上述四种方法的F-Score分别为0.84、0.88、0.88和0.88,而所提方法的F-Score为0.91。实验结果表明,所提方法的决策准确率更高,融合结果更加可靠,能为证据决策提供了有效的解决方案。 相似文献
15.
16.
Judgment aggregation deals with the problem of how collective judgments on logically connected propositions can be formed based on individual judgments on the same propositions. The existing literature on judgment aggregation mainly focuses on the anonymity condition requiring that individual judgments be treated equally. However, in many real‐world situations, a group making collective judgments may assign individual members or subgroups different priorities to determine the collective judgment. Based on this consideration, this article relaxes the anonymity condition by giving a hierarchy over individuals so as to investigate how the judgment from each individual affects the group judgment in such a hierarchical environment. Moreover, we assume that an individual can abstain from voting on a proposition and the collective judgment on a proposition can be undetermined, which means that we do not require completeness at both individual and collective levels. In this new setting, we first identify an impossibility result and explore a set of plausible conditions in terms of abstentions. Secondly, we develop an aggregation rule based on the hierarchy of individuals and show that the aggregation rule satisfies those plausible conditions. The computational complexity of this rule is also investigated. Finally, we show that the proposed rule is (weakly) oligarchic over a subset of agenda. This is by no means a negative result. In fact, our result reveals that with abstentions, oligarchic aggregation is not necessary to be a single‐level determination but can be a multiple‐level collective decision making, which partially explains its ubiquity in the real world. 相似文献
17.
该文讨论在复杂的大型辅助决策系统中,构造智能决策规则模型的一种方法。这是一种基于决策表的知识表示方法。它在传统决策表的基础上,吸收了产生式规则、框架表示法、模糊理论、关系模型等多种方法的思想和技术,把传统决策表加以扩展,得到了一种结构性好、表达能力强、可操作性较好的智能决策表达工具,用来表示大型辅助决策系统中的复杂领域知识,将其中松散的经验规则形式化成智能决策规则模型,从而增强其结构性和可操作性,有效支持对其它信息的操作。 相似文献
18.
传统关联规则挖掘在面临分类决策问题时,易出现非频繁规则遗漏、预测精度不高的问题。为得到正确合理且更为完整的规则,提出了一种改进方法 DT-AR(decision tree-association rule algorithm),利用决策树剪枝策略对关联规则集进行补充。该方法利用FP-Growth(frequent pattern growth)算法得到关联规则集,利用C4.5算法构建后剪枝决策树并提取分类规则,在进行置信度迭代筛选后与关联规则集取并集修正,利用置信度作为权重系数采取投票法进行分类。实验结果表明,与传统关联规则挖掘和决策树剪枝方法相比,该方法得到的规则在数据集分类结果上更准确。 相似文献
19.
基于粗糙集理论的客户关系管理 总被引:1,自引:0,他引:1
粗糙集理论是一种新型的数据挖掘和决策分析方法,利用粗糙集理论进行决策表的知识约简与决策规则挖掘已经成为研究热点。本文介绍了粗糙集的基本理论,通过决策属性支持度定义的条件属性对决策属性重要性的启发式信息,求取决策表的最小约简。并将该方法用于对企业客户进行分类,为客户关系管理的决策支持提供了新的解决方法。 相似文献
20.
Hideyasu Sasaki 《Information Systems Frontiers》2011,13(2):207-220
In this paper, we present a computing theory on the accelerated critical point of selection of proper strategies between collaboration
and competition and its mathematical analysis for collaborative and transparent decision making under “time constraint”, i.e., cost of time pressure, which decision makers face in negotiation. Web 2.0 provides a useful digital environment to support
various time-stressed human behaviors for collaborative decision making. However, little research has examined the collaborative
behavior under time constraint on the Internet in its designs and implementations on electronically supported decision making.
Those systems are implemented in black boxes so that we need transparent designs of decision support systems to promote collaboration
by time-stressed decision makers. The essential problem on collaborative decision making under time constraint is the discovery
and evaluation on the critical point of selection of proper strategies between collaboration and competition. Most of the
current decision support systems accept the half of maximum acceptable time for negotiation as a critical point, a priori, though that conventional point is often late for proper decision making. The proposed theory shows that a critical point
is to be accelerated at the one-third of maximum acceptable time for negotiation. We have formulated the proposed computing
theory based on mathematical formulation, and checked its feasibility in its applications to a case study. The proposed theory
promotes collaborative and transparent decision making in consideration of the properties of stakes under time pressure by
selecting the strategy of collaboration or competition at the much earlier stage. 相似文献