期刊文献+
共找到3篇文章
< 1 >
每页显示 20 50 100
Computational Intelligence Determines Effective Rationality
1
作者 edward p.k.tsang 《International Journal of Automation and computing》 EI 2008年第1期63-66,共4页
Rationality is a fundamental concept in economics. Most researchers will accept that human beings are not fully rational. Herbert Simon suggested that we are "bounded rational". However, it is very difficult to quan... Rationality is a fundamental concept in economics. Most researchers will accept that human beings are not fully rational. Herbert Simon suggested that we are "bounded rational". However, it is very difficult to quantify "bounded rationality", and therefore it is difficult to pinpoint its impact to all those economic theories that depend on the assumption of full rationality. Ariel Rubinstein proposed to model bounded rationality by explicitly specifying the decision makers' decision-making procedures. This paper takes a computational point of view to Rubinstein's approach. From a computational point of view, decision procedures can be encoded in algorithms and heuristics. We argue that, everything else being equal, the effective rationality of an agent is determined by its computational power - we refer to this as the computational intelligence determines effective rationality (CIDER) theory. This is not an attempt to propose a unifying definition of bounded rationality. It is merely a proposal of a computational point of view of bounded rationality. This way of interpreting bounded rationality enables us to (computationally) reason about economic systems when the full rationality assumption is relaxed. 展开更多
关键词 RATIONALITY bounded rationality computational intelligence ECONOMICS computational intelligence determines effective rationality (CIDER) theory.
下载PDF
Evolving Decision Rules to Predict Investment Opportunities
2
作者 Alma Lilia Garcia-Almanza edward p.k.tsang 《International Journal of Automation and computing》 EI 2008年第1期22-31,共10页
This paper is motivated by the interest in finding significant movements in financial stock prices. However, when the number of profitable opportunities is scarce, the prediction of these cases is difficult. In a prev... This paper is motivated by the interest in finding significant movements in financial stock prices. However, when the number of profitable opportunities is scarce, the prediction of these cases is difficult. In a previous work, we have introduced evolving decision rules (EDR) to detect financial opportunities. The objective of EDR is to classify the minority class (positive eases) in imbalaneed environments. EDR provides a range of classifications to find the best balance between not making mistakes and not missing opportunities. The goals of this paper are: 1) to show that EDR produces a range of solutions to suit the investor's preferences and 2) to analyze the factors that benefit the performance of EDR. A series of experiments was performed. EDR was tested using a data set from the London Financial Market. To analyze the EDR behaviour, another experiment was carried out using three artificial data sets, whose solutions have different levels of complexity. Finally, an illustrative example was provided to show how a bigger collection of rules is able to classify more positive eases in imbalanced data sets. Experimental results show that: 1) EDR offers a range of solutions to fit the risk guidelines of different types of investors, and 2) a bigger collection of rules is able to classify more positive eases in imbalanced environments. 展开更多
关键词 Machine learning genetic programming (GP) classification imbalanced classes evolution of rules
下载PDF
DEPICT:A High-level Formal Language for Modeling Constraint Satisfaction Problems
3
作者 Abdulwahed M.Abbas edward p.k.tsang Ahmad H.Nasri 《International Journal of Automation and computing》 EI 2008年第2期208-216,共9页
The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently de... The past decade witnessed rapid development of constraint satisfaction technologies, where algorithms are now able to cope with larger and harder problems. However, owing to the fact that constraints are inherently declarative, attention is quickly turning toward developing high-level programming languages within which such problems can be modeled and also solved. Along these lines, this paper presents DEPICT, the language. Its use is illustrated through modeling a number of benchmark examples. The paper continues with a description of a prototype system within which such models may be interpreted. The paper concludes with a description of a sample run of this interpreter showing how a problem modeled as such is typically solved. 展开更多
关键词 Constraint satisfaction problems (CSPs) and languages formal specifications typed predicate calculus language interpreter
下载PDF
上一页 1 下一页 到第
使用帮助 返回顶部