• Journal of the Korean Institute of Intelligent Systems
• /
• v.11 no.7
• /
• pp.666-674
• /
• 2001

Classical methods to find a minimal set of rules based on the rough set theory are known to be ineffective in dealing with new instances added to the universe. This paper introduces an inductive learning algorithm for incrementally retrieving a minimal set of rules from a given decision table. Then, the algorithm is validated via simulations with two sets of data, in comparison with a classical non-incremental algorithm. The simulation results show that the proposed algorithm is effective in dealing with new instances, especially in practical use.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.10a
• /
• pp.331-337
• /
• 1997

In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general descriptions of concepts from specific instances of these concepts. In many real life situations however new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overall set of instances. The method of learning presented here is based on a rough set concept proposed by Pawlak[2]. It is shown an algorithm to fund minimal set of rules using reduct change theorems giving criteria for minimum recalculation and an illustrative example.

• Industrial Engineering and Management Systems
• /
• v.10 no.1
• /
• pp.65-73
• /
• 2011

In rough set literatures, methods for inducing minimal rules from a given decision table have been proposed. When the decision attribute is ordinal, inducing rules about upward and downward unions of decision classes is advantageous in the simplicity of obtained rules. However, because of independent applications of the rule induction method, inclusion relations among upward/downward unions in conclusion parts are not inherited to the condition parts of obtained rules. This non-inheritance may debase the quality of obtained rules. To ensure that inclusion relations among conclusions are inherited to conditions, we propose two rule induction approaches. The performances of the proposed approaches considering the inclusion relations between conclusions are examined by numerical experiments.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.06a
• /
• pp.308-313
• /
• 1998

In this paper we will discuss a type of inductive learning called learning from examples, whose task is to induce general description of concepts from specific instances of these concepts. In many real life situations, however, new instances can be added to the set of instances. It is first proposed within the framework of rough set theory, for such cases, an algorithm to find minimal set of rules for decision tables without recalculation for overcall set of instances. The method of learning presented here is base don a rough set concept proposed by Pawlak[2][11]. It is shown an algorithm to find minimal set of rules using reduct change theorems giving criteria for minimum recalculation with an illustrative example. Finally, the proposed learning algorithm is applied to fuzzy system to learn sampled I/O data.

• Proceedings of the Korea Inteligent Information System Society Conference
• /
• 1999.10a
• /
• pp.347-354
• /
• 1999

The credit rating represents an assessment of the relative level of risk associated with the timely payments required by the debt obligation. In this paper, we present a new approach to credit rating of customers based on the rough set theory. The concept of a rough set appeared to be an effective tool for the analysis of customer information systems representing knowledge gained by experience. The customer information system describes a set of customers by a set of multi-valued attributes, called condition attributes. The customers are classified into groups of risk subject to an expert's opinion, called decision attribute. A natural problem of knowledge analysis consists then in discovering relationships, in terms of decision rules, between description of customers by condition attributes and particular decisions. The rough set approach enables one to discover minimal subsets of condition attributes ensuring an acceptable quality of classification of the customers analyzed and to derive decision rules from the customer information system which can be used to support decisions about rating new customers. Using the rough set approach one analyses only facts hidden in data, it does not need any additional information about data and does not correct inconsistencies manifested in data; instead, rules produced are categorized into certain and possible. A real problem of the evaluation of the evaluation of credit rating by a department store is studied using the rough set approach.

• Journal of Korean Institute of Industrial Engineers
• /
• v.17 no.2
• /
• pp.63-74
• /
• 1991

An expert scheduling system on real time basis for computer-aided manufacturing systems has been developed. In developing expert scheduling system, the most time-consuming job is to obtain rules from expert schedulers. An efficient process of obtaining rules directly form the schedules produced by expert schedulers is proposed. By the process, a set of complete and minimal set of rules is obtained. During a real time scheduling, when given information on possible values of elements, the rules produce possible values of decision elements, where logical explanations of the result may be offered in terms of chaining rules. The learning and scheduling processes have been simulated with an automated manufacturing line engaged in the production of circuit boards.

• Proceedings of the Korea Society for Simulation Conference
• /
• 2003.06a
• /
• pp.91-100
• /
• 2003

In this paper we investigate the role that warfare played In the formation of the network of alliances between sites that are associated with the formation of the state in the Valley of Oaxaca, Mexico. A model of state formation proposed by Marcos and Flannery (1996) is used as the basis for an agent-based simulation model. Agents reside in sites and their actions are constrained by knowledge extracted from the Oaxaca Surface Archaeological Survey (Kowalewski 1989). The simulation is run with two different sets of constraint rules for the agents. The first set is based upon the raw data collected in the surface survey. This represents a total of 79 sites and constitutes a minimal level of warfare (raiding) in the Valley. The other site represents the generalization of these constraints to sites with similar locational characteristics. This set corresponds to 987 sites and represents a much more active role for warfare in the Valley. The rules were produced by a data mining technique, Decision Trees, guided by Genetic Algorithms. Simulations were run using the two different rule sets and compared with each other and the archaeological data for the Valley. The results strongly suggest that warfare was a necessary process in the aggregations of resources needed to support the emergence of the state in the Valley.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.12 no.3
• /
• pp.202-209
• /
• 2002

This paper deals with simplification of classification rules for data mining and rule bases for control systems. Datamining that extracts useful information from such a large amount of data is one of important issues. There are various ways in classification methodologies for data mining such as the decision trees and neural networks, but the result should be explicit and understandable and the classification rules be short and clear. The rough sets theory is an effective technique in extracting knowledge from incomplete and inconsistent data and provides a good solution for classification and approximation by using various attributes effectively This paper investigates granularity of knowledge for reasoning of uncertain concopts by using rough set approximations and uses a hierarchical classification structure that is more effective technique for classification by applying core to upper level. The proposed classification methodology makes analysis of an information system eary and generates minimal classification rules.

• Journal of the Institute of Convergence Signal Processing
• /
• v.12 no.4
• /
• pp.341-347
• /
• 2011

This paper presents the performance evaluation. optimal design. and complex obstacle detection of an overlapped ultrasonic sensor ring by introducing a new concept of effective beam width. It is assumed that a set of ultrasonic sensors of the same type are arranged along a circle of nonzero radius at regular spacings with their beams overlapped. First, the global positional uncertainty of an overlapped ultrasonic sensor ring is expressed by the average value of local positional uncertainty over the entire obstacle detection range. The effective beam width of an overlapped ultrasonic sensor ring is assessed as the beam width of a single ultrasonic sensor having the same amount of global positional uncertainty, from which a normalized obstacle detection performance index is defined. Second. using the defined index, the design parameters of an overlapped ultrasonic sensor ring are optimized for minimal positional uncertainty in obstacle detection. For a given number of ultrasonic sensors, the optimal radius of an overlapped ultrasonic sensor ring is determined, and for a given radius of an overlapped ultrasonic sensor ring, the optimal number of ultrasonic sensors is determined. Third, the decision rules of positional uncertainty zone for multiple obstacle detection are provided based on the inequality relationships among obstacle distances by three adjacent ultrasonic sensors. Using the provided rules, the obstacle outline detection is performed in a rather complex environment consisting of several obstacles of different shapes.