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

The Rough Set theory suggested by Pawlak in 1982 has been useful in AI, machine learning, knowledge acquisition, knowledge discovery from databases, expert system, inductive reasoning. etc. The main advantages of rough set are that it does not need any preliminary or additional information about data and reduce the superfluous informations. but it is a significant disadvantage in the real application that the inference result form is not the real control value but the divided disjoint interval attribute. In order to overcome this difficulty, we will propose approach in which Rough set theory and Neuro-fuzzy fusion are combined to obtain the optimal rule base from lots of input/output datum. These results are applied to the rule construction for infering the temperatures of refrigerator's specified points.

• Journal of Digital Convergence
• /
• v.12 no.6
• /
• pp.223-229
• /
• 2014

In an attempt to retrieve useful information for an efficient decision in the large knowledge system, it is generally necessary and important for a refined feature selection. Rough set has difficulty in generating optimal reducts and classifying boundary objects. In this paper, we propose quick reduction algorithm generating optimal features by rough entropy analysis for condition and decision attributes to improve these restrictions. We define a new conditional information entropy for efficient feature extraction and describe procedure of feature selection to classify the significance of features. Through the simulation of 5 datasets from UCI storage, we compare our feature selection approach based on rough set theory with the other selection theories. As the result, our modeling method is more efficient than the previous theories in classification accuracy for feature selection.

• Proceedings of the KIEE Conference
• /
• 2002.11c
• /
• pp.333-336
• /
• 2002

In many cases, fuzzy modeling has a defect that the design procedure cannot be theoretically justified. To overcome this difficulty, we suggest a new design method for fuzzy model by combining genetic algorithm(GA) and mush set theory. GA, which has the advantages is optimization, and rule base. However, it is some what time consuming, so are introduce rough set theory to the rule reduction procedure. As a result, the decrease of learning time and the considerable rate of rule reduction is achieved without loss of useful information. The preposed algorithm is composed of three stages; First stage is quasi-optimization of fuzzy model using GA(coarse tuning). Next the obtained rule base is reduced by rough set concept(rule reduction). Finally we perform re-optimization of the membership functions by GA(fine tuning). To check the effectiveness of the suggested algorithm, examples for time series prediction are examined.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1996.10a
• /
• pp.327-332
• /
• 1996

Rough Set theory suggested by Pawlak has a property that it can describe the degree of relation between condition and decision attributes of data which don't have linguistic information. In this paper, by using this ability of rough set theory, we define a occupancy degree which is a measure can represent a degree of relational quantity between condition and decision attributes of data table. We also propose a method that can find an optimal fuzzy rule table and membership functions of input and output variables from data without linguistic information and examine the validity of the method by modeling data generated by fuzzy rule.

• 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.

• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2002.05a
• /
• pp.201-204
• /
• 2002

Kansei design knowledge acquisition stage is a crucial stage in kansei designing process and kansei engineering (KE) methodology. In kansei engineering methodology, it is essential to extract design knowledge or rules on relationships between customer's kansei and product design element. We attempt to construct a more powerful melted for extracting the design rules from kansei expremental data. We constucted a kansei experiment concerning color kansei evaluation, and analyzed the sane data by both conventional quantification theory type I and rough set theory. Finally, we compared the effectiveness of both methods for extracting rules and examined the extensions of rough set theory in kansei engineering.

• 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 Acoustical Society of Korea Conference
• /
• 1996.10a
• /
• pp.66-69
• /
• 1996

The goal of automatic speech recognition is to study techniques and systems that enable agents such that computers and robots to accept speech input. However, this paper does not provide a concrete technology in speech recognition but propose a possible mathematical tools to be employed in that area. We introduce rough set theory and suggest the possibility of the rough set approach in phonetic distinctions.

• Journal of applied mathematics & informatics
• /
• v.25 no.1_2
• /
• pp.551-562
• /
• 2007

This paper concerns a relationship between rough sets, intuitionistic fuzzy sets and ring theory. We consider a ring as a universal set and we assume that the knowledge about objects is restricted by an intuitionistic fuzzy ideal. We apply the notion of intutionistic fuzzy ideal of a ring for definitions of the lower and upper approximations in a ring. Some properties of the lower and upper approximations are investigated.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1998.03a
• /
• pp.49-52
• /
• 1998

Neural Network has good performance in pattern classification, control and many other fields by learning ability. However, there is effective rule or systematic approach to determine optimal structure. In this paper, we propose a new method to find optimal structure of feed-forward multi-layer neural network as a kind of pruning method. That eliminating redundant elements of neural network. To find redundant elements we analysis error and weight changing with Rough Set Theory, in condition of executing back-propagation leaning algorithm.