Rule Selection Problem Research Articles

On Recurrent Neural Network Based Theorem Prover For First Order Minimal Logic

There are three main problems for theorem proving with a standard cut-free system for the first order minimal logic. The first problem is the possibility of looping. Secondly, it might generate proofs which are permutations of each other. Finally, during the proof some choice should be made to decide which rules to apply and where to use them. New systems with history mechanisms were introduced for solving the looping problems of automated theorem provers in the first order minimal logic. In order to solve the rule selection problem, recurrent neural networks are deployed and they are used to determine which formula from the context should be used on further steps. As a result, it yields to the reduction of time during theorem proving.

Dynamic dispatching system using a deep denoising autoencoder for semiconductor manufacturing

Deep denoising autoencoders (DDAE), which are variants of the autoencoder, have shown outstanding performance in various machine learning tasks. In this study, we propose using a DDAE to address a dispatching rule selection problem that represents a major problem in semiconductor manufacturing. Recently, the significance of dispatching systems for storage allocation has become more apparent because operational issues lead to transfer inefficiency, resulting in production losses. Further, recent approaches have overlooked the possibility of a class imbalance problem in predicting the best dispatching rule. The main purpose of this study is to examine DDAE-based predictive control of the storage dispatching systems to reduce idle machines and production losses. We conducted an experimental evaluation to compare the predictive performance of DDAE with those of five other novelty detection algorithms. Finally, we compared our adaptive approach with the optimization and existing heuristic approaches to demonstrate the effectiveness and efficiency of the proposed method. The experimental results demonstrated that the proposed method outperformed the existing methods in terms of machine utilizations and throughputs.

Knowledge Refinement via Rule Selection

In several different applications, including data transformation and entity resolution, rules are used to capture aspects of knowledge about the application at hand. Often, a large set of such rules is generated automatically or semi-automatically, and the challenge is to refine the encapsulated knowledge by selecting a subset of rules based on the expected operational behavior of the rules on available data. In this paper, we carry out a systematic complexity-theoretic investigation of the following rule selection problem: given a set of rules specified by Horn formulas, and a pair of an input database and an output database, find a subset of the rules that minimizes the total error, that is, the number of false positive and false negative errors arising from the selected rules. We first establish computational hardness results for the decision problems underlying this minimization problem, as well as upper and lower bounds for its approximability. We then investigate a bi-objective optimization version of the rule selection problem in which both the total error and the size of the selected rules are taken into account. We show that testing for membership in the Pareto front of this bi-objective optimization problem is DP-complete. Finally, we show that a similar DP-completeness result holds for a bi-level optimization version of the rule selection problem, where one minimizes first the total error and then the size.

A minimax linear programming model for dispatching rule selection

Abstract Dispatching rule selection is an important problem in production scheduling. This paper introduces a minimax linear programming (LP) model for dispatching rule selection in the presence of multiple criteria. The multi-criteria dispatching rule selection problem is first converted into a preference voting system, and a minimax LP model is then introduced for solving the corresponding problem. The advantage of this conversion is that it provides a way to identify dispatching rules that are moderately good in all criteria, rather than selecting dispatching rules that are good respect to only a few variables. An experimental study considering two different production priority settings is used to show the applicability of the proposed method.

Fuzzy classification knowledge base construction based on trend rules and inverse inference

In this paper, an approach to fuzzy classification rules construction within the framework of fuzzy relation equations is proposed. At the same time, the system of fuzzy trend rules serves as a carrier of expert information and generator of rules - solutions of fuzzy relation equations. The system of fuzzy classification rules can be rearranged as a set of linguistic solutions of fuzzy relation equations using the composite system of fuzzy terms, e.g. “significant rise”, “essential drop” etc., where causes and effects significance measures are described by fuzzy quantifiers. The problem of inverse logical inference, which lies in restoring the coordinates of the maximum of the fuzzy input terms membership functions for each output class is reduced to solving the system of fuzzy relation equations using a genetic algorithm. The proposed approach allows to avoid the alternative rule selection. The aim of the rule selection methods is to reduce the system complexity by removing inefficient and redundant rules and improve the system accuracy by introducing alternative rules into the final rule base. Using expert knowledge cannot guarantee the optimal cooperation activity among rules. The rule selection problem is still relevant since there is currently no single methodical standard for the optimal structural adjustment of fuzzy classification knowledge bases. Solving fuzzy relation equations using the genetic algorithm ensures the optimal number of fuzzy rules for each output term and optimal form of the membership functions of the fuzzy input terms for each linguistic solution. Consecutive solution of the optimization problems provides complexity reduction of the problem of fuzzy classification knowledge bases generation.

Modeling interestingness of streaming association rules as a benefit-maximizing classification problem

In a typical application of association rule learning from market basket data, a set of transactions for a fixed period of time is used as input to rule learning algorithms. For example, the well-known Apriori algorithm can be applied to learn a set of association rules from such a transaction set. However, learning association rules from a set of transactions is not a one time only process. For example, a market manager may perform the association rule learning process once every month over the set of transactions collected through the last month. For this reason, we will consider the problem where transaction sets are input to the system as a stream of packages. The sets of transactions may come in varying sizes and in varying periods. Once a set of transactions arrive, the association rule learning algorithm is executed on the last set of transactions, resulting in new association rules. Therefore, the set of association rules learned will accumulate and increase in number over time, making the mining of interesting ones out of this enlarging set of association rules impractical for human experts. We refer to this sequence of rules as “association rule set stream” or “streaming association rules” and the main motivation behind this research is to develop a technique to overcome the interesting rule selection problem. A successful association rule mining system should select and present only the interesting rules to the domain experts. However, definition of interestingness of association rules on a given domain usually differs from one expert to another and also over time for a given expert. This paper proposes a post-processing method to learn a subjective model for the interestingness concept description of the streaming association rules. The uniqueness of the proposed method is its ability to formulate the interestingness issue of association rules as a benefit-maximizing classification problem and obtain a different interestingness model for each user. In this new classification scheme, the determining features are the selective objective interestingness factors related to the interestingness of the association rules, and the target feature is the interestingness label of those rules. The proposed method works incrementally and employs user interactivity at a certain level. It is evaluated on a real market dataset. The results show that the model can successfully select the interesting ones.

Application of reinforcement learning for agent-based production scheduling

Reinforcement learning (RL) has received some attention in recent years from agent-based researchers because it deals with the problem of how an autonomous agent can learn to select proper actions for achieving its goals through interacting with its environment. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored yet. In this paper, Q-learning, a popular RL algorithm, is applied to a single machine dispatching rule selection problem. This paper investigates the application potential of Q-learning, a widely used RL algorithm to a dispatching rule selection problem on a single machine to determine if it can be used to enable a single machine agent to learn commonly accepted dispatching rules for three example cases in which the best dispatching rules have been previously defined. This study provided encouraging results that show the potential of RL for application to agent-based production scheduling.

Learning policies for single machine job dispatching

Reinforcement learning (RL) has received some attention in recent years from agent-based researchers because it deals with the problem of how an autonomous agent can learn to select proper actions for achieving its goals through interacting with its environment. Each time after an agent performs an action, the environment's response, as indicated by its new state, is used by the agent to reward or penalize its action. The agent's goal is to maximize the total amount of reward it receives over the long run. Although there have been several successful examples demonstrating the usefulness of RL, its application to manufacturing systems has not been fully explored. In this study, a single machine agent employs the Q-learning algorithm to develop a decision-making policy on selecting the appropriate dispatching rule from among three given dispatching rules. The system objective is to minimize mean tardiness. This paper presents a factorial experiment design for studying the settings used to apply Q-learning to the single machine dispatching rule selection problem. The factors considered in this study include two related to the agent's policy table design and three for developing its reward function. This study not only investigates the main effects of this Q-learning application but also provides recommendations for factor settings and useful guidelines for future applications of Q-learning to agent-based production scheduling.

결합적 방법에 의한 귀납법칙 집합의 생성

귀납법칙 생성 시스템은 데이터에서부터 법칙을 자동으로 발견하는 시스템으로서 현재 많은 연구가 진행되고 있다. 본 논문은 정보이론을 이용하여 데이터로부터 귀납법칙을 자동으로 생성하는 시스템을 제시하고 또한 귀납법칙 생성 시스템에 의하여 생성되는 규칙들 중에서 가장 좋은 성능을 보이는 규칙 집합을 구하기 위하여 이를 유전자 알고리즘과 결합시켜 최적화된 귀납법칙 집합을 탐색하는 방법을 제시하였다. 제안된 시스템의 성능을 평가하기 위하여 다수의 기계학습 데이터를 사용하여 기존의 다른 방법들과 비교하였으며, 제안된 시스템은 대부분의 경우에 좋은 정확도를 제공하였다. The rule induction system generates a set of inductive rules, and the task of selecting an optimal rule subset is one of the important problem in the area of rule induction. This paper proposes a new learning method which combines rule induction system with the paradigm of genetic algorithm. This paper shows that genetic algorithm can be effectively applied to optimal rule selection problem. The proposed system was evaluated using a set of different machine learning data sets and, showed better performance in all cases than other traditional methods.

Guidelines for creating a rule-based knowledge learning system and their application to a Chinese business card layout analysis

Rule selection has long been a problem of great challenge that has to be solved when developing a rule-based knowledge learning system. Many methods have been proposed to evaluate the eligibility of a single rule based on some criteria. However, in a knowledge learning system there is usually a set of rules. These rules are not independent, but interactive. They tend to affect each other and form a rule-system. In such case, it is no longer reasonable to isolate each rule from others for evaluation. A best rule according to certain criterion is not always the best one for the whole system. Furthermore, the data in the real world from which people want to create their learning system are often ill-defined and inconsistent. In this case, the completeness and consistency criteria for rule selection are no longer essential. In this paper, some ideas about how to solve the rule-selection problem in a systematic way are proposed. These ideas have been applied in the design of a Chinese business card layout analysis system and gained a good result on the training data set of 425 images. The implementation of the system and the result are presented in this paper.

Performance evaluation of fuzzy rule-based classification systems obtained by multi-objective genetic algorithms

In this paper, we examine the classification performance of fuzzy if-then rules selected by a GA-based multi-objective rule selection method. This rule selection method can be applied to high-dimensional pattern classification problems with many continuous attributes by restricting the number of antecedent conditions of each candidate fuzzy if-then rule. As candidate rules, we only use fuzzy if-then rules with a small number of antecedent conditions. Thus it is easy for human users to understand each rule selected by our method. Our rule selection method has two objectives: to minimize the number of selected fuzzy if-then rules and to maximize the number of correctly classified patterns. In our multi-objective fuzzy rule selection problem, there exist several solutions ( i.e., several rule sets) called “non-dominated solutions” because two conflicting objectives are considered. In this paper, we examine the performance of our GA-based rule selection method by computer simulations on a real-world pattern classification problem with many continuous attributes. First we examine the classification performance of our method for training patterns by computer simulations. Next we examine the generalization ability for test patterns. We show that a fuzzy rule-based classification system with an appropriate number of rules has high generalization ability.

Single-objective and two-objective genetic algorithms for selecting linguistic rules for pattern classification problems

This paper proposes various methods for constructing a compact fuzzy classification system consisting of a small number of linguistic classification rules. First we formulate a rule selection problem of linguistic classification rules with two objectives: to maximize the number of correctly classified training patterns and to minimize the number of selected rules. Next we propose three methods for finding a set of non-dominated solutions of the rule selection problem. These three methods are based on a single-objective genetic algorithm. We also propose a method based on a multi-objective genetic algorithm for finding a set of non-dominated solutions. We examine the performance of the proposed methods by applying them to the well-known iris data. Finally we propose a hybrid algorithm by combining a learning method of linguistic classification rules with the multi-objective genetic algorithm. High performance of the hybrid algorithm is demonstrated by computer simulations on the iris data.

Selecting fuzzy if-then rules for classification problems using genetic algorithms

This paper proposes a genetic-algorithm-based method for selecting a small number of significant fuzzy if-then rules to construct a compact fuzzy classification system with high classification power. The rule selection problem is formulated as a combinatorial optimization problem with two objectives: to maximize the number of correctly classified patterns and to minimize the number of fuzzy if-then rules. Genetic algorithms are applied to this problem. A set of fuzzy if-then rules is coded into a string and treated as an individual in genetic algorithms. The fitness of each individual is specified by the two objectives in the combinatorial optimization problem. The performance of the proposed method for training data and test data is examined by computer simulations on the iris data of Fisher.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>

Construction of fuzzy classification systems with rectangular fuzzy rules using genetic algorithms

This paper proposes a genetic-algorithm-based approach to the construction of fuzzy classification systems with rectangular fuzzy rules. In the proposed approach, compact fuzzy classification systems are automatically constructed from numerical data by selecting a small number of significant fuzzy rules using genetic algorithms. Since significant fuzzy rules are selected and unnecessary fuzzy rules are removed, the proposed approach can be viewed as a knowledge acquisition tool for classification problems. In this paper, we first describe a generation method of rectangular fuzzy rules from numerical data for classification problems. We next formulate a rule selection problem for constructing a compact fuzzy classification system as a combinatorial optimization problem with two objectives: to minimize the number of selected fuzzy rules and to maximize the number of correctly classified patterns. We then show how genetic algorithms are applied to the rule selection problem. Last, we illustrate the proposed approach by computer simulations on numerical examples and the iris data of Fisher.

Selection of fuzzy if‐then rules by a genetic method

AbstractThis paper proposes a genetic algorithm‐based method for constructing a fuzzy classification system with fuzzy if‐then rules. In the proposed method, a rule selection problem for constructing a compact fuzzy system with high classification power is formulated as a combinatorial optimization problem with two objectives: to maximize the classification rate and to minimize the number of rules. Then a method of implementing genetic algorithms is proposed for the application to this problem and its effectiveness is demonstrated by computer simulations. The implementation of genetic algorithms in this paper employs an approach where a set of fuzzy if‐then rules is coded as a single individual.