Building Credit-Risk Evaluation Expert Systems Using Neural Network Rule Extraction and Decision Tables.

In this paper, we evaluate and contrast four neural network rule extraction approaches for credit scoring. Experiments are carried out on three real life credit scoring data sets. Both the continuous and the discretised versions of all data sets are analysed. The rule extraction algorithms, Neurolinear, Neurorule, Trepan and Nefclass, have different characteristics with respect to their perception of the neural network and their way of representing the generated rules or knowledge. It is shown that Neurolinear, Neurorule and Trepan are able to extract very concise rule sets or trees with a high predictive accuracy when compared to classical decision tree (rule) induction algorithms like C4.5(rules). Especially Neurorule extracted easy to understand and powerful propositional ifthen rules for all discretised data sets. Hence, the Neurorule algorithm may offer a viable alternative for rule generation and knowledge discovery in the domain of credit scoring.Credit; Information systems; International; Systems;

Self-organizing fuzzy sliding-mode control for a voice coil motor

[[abstract]]Voice coil motor (VCM) is widely known as its topquality of free friction, low noise, fast transient response and well repeatability. Yet the dynamic characteristic of a VCM is nonlinear and time-varying, thus the model-based conventional controller is difficult to achieve high-precision control performance for a VCM. To attack this problem, a selforganizing fuzzy sliding-mode control (SFSC) system is proposed in this paper. All of the fuzzy rules are online grown and pruned by the structure learning phase and the parameter learning phase is designed to tune the controller parameter in the gradient-descent-learning algorithm. From the experiment results, it shows that the proposed SFSC system can successfully control a VCM with favorable control response with enhanced disturbance rejection performance.[[notice]]補正完畢[[conferencetype]]國際[[conferencedate]]April 9-11[[booktype]]紙本[[iscallforpapers]]Y[[conferencelocation]]Taipei, Taiwa

Evaluation of IoT-Based Computational Intelligence Tools for DNA Sequence Analysis in Bioinformatics

In contemporary age, Computational Intelligence (CI) performs an essential role in the interpretation of big biological data considering that it could provide all of the molecular biology and DNA sequencing computations. For this purpose, many researchers have attempted to implement different tools in this field and have competed aggressively. Hence, determining the best of them among the enormous number of available tools is not an easy task, selecting the one which accomplishes big data in the concise time and with no error can significantly improve the scientist's contribution in the bioinformatics field. This study uses different analysis and methods such as Fuzzy, Dempster-Shafer, Murphy and Entropy Shannon to provide the most significant and reliable evaluation of IoT-based computational intelligence tools for DNA sequence analysis. The outcomes of this study can be advantageous to the bioinformatics community, researchers and experts in big biological data

Learning Opposites with Evolving Rules

The idea of opposition-based learning was introduced 10 years ago. Since then a noteworthy group of researchers has used some notions of oppositeness to improve existing optimization and learning algorithms. Among others, evolutionary algorithms, reinforcement agents, and neural networks have been reportedly extended into their opposition-based version to become faster and/or more accurate. However, most works still use a simple notion of opposites, namely linear (or type- I) opposition, that for each $x\in[a,b]$ assigns its opposite as $\breve{x}_I=a+b-x$. This, of course, is a very naive estimate of the actual or true (non-linear) opposite $\breve{x}_{II}$, which has been called type-II opposite in literature. In absence of any knowledge about a function $y=f(\mathbf{x})$ that we need to approximate, there seems to be no alternative to the naivety of type-I opposition if one intents to utilize oppositional concepts. But the question is if we can receive some level of accuracy increase and time savings by using the naive opposite estimate $\breve{x}_I$ according to all reports in literature, what would we be able to gain, in terms of even higher accuracies and more reduction in computational complexity, if we would generate and employ true opposites? This work introduces an approach to approximate type-II opposites using evolving fuzzy rules when we first perform opposition mining. We show with multiple examples that learning true opposites is possible when we mine the opposites from the training data to subsequently approximate $\breve{x}_{II}=f(\mathbf{x},y)$.Comment: Accepted for publication in The 2015 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE 2015), August 2-5, 2015, Istanbul, Turke