Artificial realization of human on-off decision making based on the conditional probability of a database

As human on-off decisions are the basic problems in our human lives, the analysis of human on-off decision making is an interesting topic. The procedures of qualified human decision making include many intuitive factors which have been acquired from previous valuable experience and gained through learning, but they may not be easily understood by others within a short period. By the use of a database of causes and decisions made by qualified experts for an objective event, human decision making for that event can be realizable artificially. This paper investigates a general method for realizing artificial human on-off decision making based on the conditional probability of the database. As on-off decision making is a discrete event and the causes for that decision making are continuous events, a mathematical treatment of a Dirac delta function in a probability density function is required to derive the conditional probability for the decision making. Several examples of artificial human decision making by the proposed method were demonstrated, and the results obtained showed good agreement with those of human experts in the respective fields. This work was presented, in part, at the Fourth International Symposium on Artifical Life and Robotics, Oita, Japan, January 19–22, 1999     

COMPUTATIONAL METHODS THROUGH GENETIC ALGORITHMS FOR OBTAINING STACKELBERG SOLUTIONS TO TWO-LEVEL INTEGER PROGRAMMING PROBLEMS

ABSTRACT

In this article, we present a method for obtaining Stackelberg solutions to two-level integer problems through genetic algorithms, which have received much attention as a promising computational method for complex problems. Assuming that there exist the upper- and the lower-bounds constraints with respect to integer variables, we employ a zero-one bit string as an individual in our artificial genetic systems. It is required that each individual satisfies the constraints of the given problem and a response of the lower level decision maker with respect to a decision that the upper level decision maker is rational. Therefore, individuals not satisfying the two conditions are penalized in the artificial genetic systems. To demonstrate the feasibility and efficiency of the proposed methods, computational experiments are carried out and comparisons between the Moore and Bard method based on the branch-and-bound techniques and the proposed methods are provided.     

油层识别与储层追踪决策支持系统开发与应用

研究针对油气勘查中油层识别与储层追踪问题的半结构化和非结构化特点，设计开发出以人工神经网络为核心技术的决策支持系统，并实际地应用于我国某油田的油气勘查问题中，试图为油层识别与储层追踪工作提供有力的辅助决策支持。     

Fisher’s decision tree

Univariate decision trees are classifiers currently used in many data mining applications. This classifier discovers partitions in the input space via hyperplanes that are orthogonal to the axes of attributes, producing a model that can be understood by human experts. One disadvantage of univariate decision trees is that they produce complex and inaccurate models when decision boundaries are not orthogonal to axes. In this paper we introduce the Fisher’s Tree, it is a classifier that takes advantage of dimensionality reduction of Fisher’s linear discriminant and uses the decomposition strategy of decision trees, to come up with an oblique decision tree. Our proposal generates an artificial attribute that is used to split the data in a recursive way.The Fisher’s decision tree induces oblique trees whose accuracy, size, number of leaves and training time are competitive with respect to other decision trees reported in the literature. We use more than ten public available data sets to demonstrate the effectiveness of our method.     

Mining classification rules in multistrategy learning approach

Classification, which involves finding rules that partition a given dataset into disjoint groups, is one class of data mining problems. Approaches proposed so far for mining classification rules from databases are mainly decision tree based on symbolic learning methods. In this paper, we combine artificial neural network and genetic algorithm to mine classification rules. Some experiments have demonstrated that our method generates rules of better performance than the decision tree approach and the number of extracted rules is fewer than that of C4.5.     

Discovering Classification from Data of Multiple Sources

In many large e-commerce organizations, multiple data sources are often used to describe the same customers, thus it is important to consolidate data of multiple sources for intelligent business decision making. In this paper, we propose a novel method that predicts the classification of data from multiple sources without class labels in each source. We test our method on artificial and real-world datasets, and show that it can classify the data accurately. From the machine learning perspective, our method removes the fundamental assumption of providing class labels in supervised learning, and bridges the gap between supervised and unsupervised learning.     

Exploring point-of-interest data from social media for artificial surface validation with decision trees

Artificial surfaces represent one of the key land cover types, and validation is an indispensable component of land cover mapping that ensures data quality. Traditionally, validation has been carried out by confronting the produced land cover map with reference data, which is collected through field surveys or image interpretation. However, this approach has limitations, including high costs in terms of money and time. Recently, geo-tagged photos from social media have been used as reference data. This procedure has lower costs, but the process of interpreting geo-tagged photos is still time-consuming. In fact, social media point of interest (POI) data, including geo-tagged photos, may contain useful textual information for land cover validation. However, this kind of special textual data has seldom been analysed or used to support land cover validation. This paper examines the potential of textual information from social media POIs as a new reference source to assist in artificial surface validation without photo recognition and proposes a validation framework using modified decision trees. First, POI datasets are classified semantically to divide POIs into the standard taxonomy of land cover maps. Then, a decision tree model is built and trained to classify POIs automatically. To eliminate the effects of spatial heterogeneity on POI classification, the shortest distances between each POI and both roads and villages serve as two factors in the modified decision tree model. Finally, a data transformation based on a majority vote algorithm is then performed to convert the classified points into raster form for the purposes of applying confusion matrix methods to the land cover map. Using Beijing as a study area, social media POIs from Sina Weibo were collected to validate artificial surfaces in GlobeLand30 in 2010. A classification accuracy of 80.68% was achieved through our modified decision tree method. Compared with a classification method without spatial heterogeneity, the accuracy is 10% greater. This result indicates that our modified decision tree method displays considerable skill in classifying POIs with high spatial heterogeneity. In addition, a high validation accuracy of 92.76% was achieved, which is relatively close to the official result of 86.7%. These preliminary results indicate that social media POI datasets are valuable ancillary data for land cover validation, and our proposed validation framework provides opportunities for land cover validation with low costs in terms of money and time.     

一种R＆D项目选择的人工智能方法

针对目前Ｒ＆Ｄ项目选择方法中存在的种种不足，提出了一种人工智能方法。该方法分为两部分：第一部分采用信息树方法来帮助决策者提高对Ｒ＆Ｄ项目选择过程的认识，说明了Ｒ＆Ｄ项目选择信息树模型实际上是一个认知图模型；第二部分采用前馈式神经网络的方法来进行Ｒ＆Ｄ项目选择中的多准则决策。     

Predicting financial distress of the South Korean manufacturing industries

The financial distress forecasting has long been of great interest both to scholars and practitioners. The financial distress forecasting is basically a dichotomous decision, either being financial distress or not. Most statistical and artificial intelligence methods estimate the probability of financial distress, and if this probability is greater than the cutoff value, then the prediction is to be financial distress. To improve the accuracy of the financial distress prediction, this paper first analyzed the yearly financial data of 1888 manufacturing corporations collected by the Korea Credit Guarantee Fund (KODIT). Then we developed a financial distress prediction model based on radial basis function support vector machines (RSVM). We compare the classification accuracy performance between our RSVM and artificial intelligence techniques, and suggest a better financial distress predicting model to help a chief finance officer or a board of directors make better decision in a corporate financial distress. The experiments demonstrate that RSVM always outperforms other models in the performance of corporate financial distress predicting, and hence we can predict future financial distress more correctly than any other models. This enhancement in predictability of future financial distress can significantly contribute to the correct valuation of a company, and hence those people from investors to financial managers to any decision makers of a company can make use of RSVM for the better financing and investing decision making which can lead to higher profits and firm values eventually.     

C-Net: A Method for Generating Non-deterministic and Dynamic Multivariate Decision Trees

Despite the fact that artificial neural networks (ANNs) are universal function approximators, their black box nature (that is, their lack of direct interpretability or expressive power) limits their utility. In contrast, univariate decision trees (UDTs) have expressive power, although usually they are not as accurate as ANNs. We propose an improvement, C-Net, for both the expressiveness of ANNs and the accuracy of UDTs by consolidating both technologies for generating multivariate decision trees (MDTs). In addition, we introduce a new concept, recurrent decision trees, where C-Net uses recurrent neural networks to generate an MDT with a recurrent feature. That is, a memory is associated with each node in the tree with a recursive condition which replaces the conventional linear one. Furthermore, we show empirically that, in our test cases, our proposed method achieves a balance of comprehensibility and accuracy intermediate between ANNs and UDTs. MDTs are found to be intermediate since they are more expressive than ANNs and more accurate than UDTs. Moreover, in all cases MDTs are more compact (i.e., smaller tree size) than UDTs. Received 27 January 2000 / Revised 30 May 2000 / Accepted in revised form 30 October 2000     

Artificial immune‐based supervised classifier for land‐cover classification

This paper explores the potential of an artificial immune‐based supervised classification algorithm for land‐cover classification. This classifier is inspired by the human immune system and possesses properties similar to nonlinear classification, self/non‐self identification, and negative selection. Landsat ETM+ data of an area lying in Eastern England near the town of Littleport are used to study the performance of the artificial immune‐based classifier. A univariate decision tree and maximum likelihood classifier were used to compare its performance in terms of classification accuracy and computational cost. Results suggest that the artificial immune‐based classifier works well in comparison with the maximum likelihood and the decision‐tree classifiers in terms of classification accuracy. The computational cost using artificial immune based classifier is more than the decision tree but less than the maximum likelihood classifier. Another data set from an area in Spain is also used to compare the performance of immune based supervised classifier with maximum likelihood and decision‐tree classification algorithms. Results suggest an improved performance with the immune‐based classifier in terms of classification accuracy with this data set, too. The design of an artificial immune‐based supervised classifier requires several user‐defined parameters to be set, so this work is extended to study the effect of varying the values of six parameters on classification accuracy. Finally, a comparison with a backpropagation neural network suggests that the neural network classifier provides higher classification accuracies with both data sets, but the results are not statistically significant.     

An interactive multi-objective artificial neural network approach for machine setup optimization

In this paper, we develop an artificial neural network method for machine setup problems. We show that our new approach solves a very challenging problem in the area of machining i.e. machine setup. A review of machine setup concepts and methods, along with feedforward artificial neural network is presented. We define the problem of machine setup to assessing the values of machine speed, feed and depth of cut (process inputs) for a particular objective such as minimize cost, maximize productivity or maximize surface finish. We use cutting temperature, cutting force, tool life, and surface roughness (process outputs) rather than objective functions to communicate with the decision maker. We show the relationship between process inputs to process outputs. This relationship is used in determining machine setup parameters (speed, feed, and depth of cut). Back propagation neural network is used as a decision support tool. The network maps, the forward relationship, and backward relationship between process inputs and process outputs. This mapping facilitates an interactive session with the decision maker. The process input is appropriately selected. Our method has the advantage of forecasting machine setup parameters with very little resource requirement in terms of time, machine tool, and people. Forecast time is almost instantaneous. Accuracy of the forecast depends on training and a well determined training sample provides very high accuracy. Trained network replaces the knowledge of an experienced worker, hence labor cost can be potentially reduced.     

Application of an emotional neural network to facial recognition

In our attempts to model human intelligence by mimicking the brain structure and function, we overlook an important aspect in human cognition, which is the emotional factor. It may currently sound unthinkable to have emotional machines; however, it is possible to simulate certain artificial emotions with the aim of improving machine learning. This paper investigates the efficiency of an emotional neural network, which uses a modified back propagation learning algorithm. The modifed algorithm, namely the emotional BP learning algorithm, has two emotional parameters, anxiety and confidence, that are modeled during machine learning and decision making. The emotional neural network will be implemented to a facial recognition problem using images of faces with different orientations and contrast levels, and its performance will be compared to that of a conventional neural network. Experimental results suggest that artificial emotions can be successfully modeled and efficiciently implemented to improve neural networks learning and generaliztion.     

A new methodology for Decisions in Medical Informatics using fuzzy cognitive maps based on fuzzy rule-extraction techniques

In this research work, a novel framework for the construction of augmented Fuzzy Cognitive Maps based on Fuzzy Rule-Extraction methods for decisions in medical informatics is investigated. Specifically, the issue of designing augmented Fuzzy Cognitive Maps combining knowledge from experts and knowledge from data in the form of fuzzy rules generated from rule-based knowledge discovery methods is explored. Fuzzy cognitive maps are knowledge-based techniques which combine elements of fuzzy logic and neural networks and work as artificial cognitive networks. The knowledge extraction methods used in this study extract the available knowledge from data in the form of fuzzy rules and insert them into the FCM, contributing to the development of a dynamic decision support system. The fuzzy rules, which derived by these extraction algorithms (such as fuzzy decision trees, association rule-based methods and neuro-fuzzy methods) are implemented to restructure the FCM model, producing new weights into the FCM model, that initially structured by experts. Concluding, our scope is to present a new methodology through a framework for decision making tasks using the soft computing technique of FCMs based on knowledge extraction methods. A well known medical decision making problem pertaining to the problem of radiotherapy treatment planning selection is presented to illustrate the application of the proposed framework and its functioning.     

Pipelined functional link artificial recurrent neural network with the decision feedback structure for nonlinear channel equalization

This paper presents a computationally efficient nonlinear adaptive filter by a pipelined functional link artificial decision feedback recurrent neural network (PFLADFRNN) for the design of a nonlinear channel equalizer. It aims to reduce computational burden and improve nonlinear processing capabilities of the functional link artificial recurrent neural network (FLANN). The proposed equalizer consists of several simple small-scale functional link artificial decision feedback recurrent neural network (FLADFRNN) modules with less computational complexity. Since it is a module nesting architecture comprising a number of modules that are interconnected in a chained form, its performance can be further improved. Moreover, the equalizer with a decision feedback recurrent structure overcomes the unstableness thanks to its nature of infinite impulse response structure. Finally, the performance of the PFLADFRNN modules is evaluated by a modified real-time recurrent learning algorithm via extensive simulations for different linear and nonlinear channel models in digital communication systems. The comparisons of multilayer perceptron, FLANN and reduced decision feedback FLANN equalizers have clearly indicated the convergence rate, bit error rate, steady-state error and computational complexity, respectively, for nonlinear channel equalization.     

基于决策树集成的偏标记学习算法*

为了克服偏标记学习中监督信息缺失的问题,根据偏标记样本的性质设计决策树生成过程中的样本分裂规则,改造决策树的建立算法.文中算法首先对样本进行bootstrap采样并建立多棵决策树,然后对各决策树结果进行投票得出最终预测结果.在人工数据集和真实数据集上的实验表明,文中算法具有较好的分类性能.     

TREE STRUCTURES OF LINEAR THRESHOLD UNITS FOR THE CLASSIFICATION OF NUMERIC EXAMPLES

A decision tree-based system for learning from numeric data is described. Results from linear algebra (pseudoinverse matrices) help the system to generate decision trees where the nodes are represented by linear threshold units minimizing the mean square error. The system's capability to provide good classifications with small decision trees is demonstrated on artificial and benchmark data.     

在人事管理中的模糊处理和支持决策

在人事管理中有许多不确定和模糊的因素,有时在某种情况下模糊因素对决策是非常重要的.如果我们要在管理决策中利用人工智能,必须处理好模糊因素以及建立合适的决策模型.本文论述了一种模糊处理辅助决策的方法和原理.     

Multi-focus image fusion using dictionary-based sparse representation

Multi-focus image fusion has emerged as a major topic in image processing to generate all-focus images with increased depth-of-field from multi-focus photographs. Different approaches have been used in spatial or transform domain for this purpose. But most of them are subject to one or more of image fusion quality degradations such as blocking artifacts, ringing effects, artificial edges, halo artifacts, contrast decrease, sharpness reduction, and misalignment of decision map with object boundaries. In this paper we present a novel multi-focus image fusion method in spatial domain that utilizes a dictionary which is learned from local patches of source images. Sparse representation of relative sharpness measure over this trained dictionary are pooled together to get the corresponding pooled features. Correlation of the pooled features with sparse representations of input images produces a pixel level score for decision map of fusion. Final regularized decision map is obtained using Markov Random Field (MRF) optimization. We also gathered a new color multi-focus image dataset which has more variety than traditional multi-focus image sets. Experimental results demonstrate that our proposed method outperforms existing state-of-the-art methods, in terms of visual and quantitative evaluations.