• Proceedings of the Korean Society for Emotion and Sensibility Conference
• /
• 2007.05a
• /
• pp.109-113
• /
• 2007

본 논문은 칼라 패턴의 감성 평가를 위해 러프 집합 이론이 효과적으로 사용될 수 있음을 보여준다. 우리는 주어진 랜덤 칼라 패턴을 보여주고 사람들로 하여금 감성 평가를 하게 하여 수집된 심리학적 실험 데이터를 기반으로 VPRS(Variable Precision Rough Set) 이론을 적용, 관련 규칙들을 추출하였다. 이러한 규칙들은 벽지 등의 컬러 패턴들에 대한 근사적인 감성 평가 뿐만 아니라, 이미지 속성 공간을 언어적 이미지 스케일로 표현된 감성 공간으로 매핑 시키기 위한 적응 퍼지 시스템 등의 초기 조건으로도 사용할 수도 있다.

• 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 the Korean Institute of Intelligent Systems
• /
• v.11 no.5
• /
• pp.441-447
• /
• 2001

In general, Rough Set theory is used for classification, inference, and decision analysis of incomplete data by using approximation space concepts in information system. Information system can include quantitative attribute values which have interval characteristics, or incomplete data such as multiple or unknown(missing) data. These incomplete data cause tole inconsistency in information system and decrease the classification ability in system using Rough Sets. In this paper, we present various types of incomplete data which may occur in information system and propose INcomplete information Processing System(INiPS) which converts incomplete information system into complete information system in using Rough Sets.

• The Transactions of the Korean Institute of Electrical Engineers A
• /
• v.48 no.2
• /
• pp.82-88
• /
• 1999

In this paper, we propose a new structure optimization method of multilayer neural networks which begin and carry out learning from a bigger network. This method redundant links and neurons according to the rough set theory. In order to find redundant links, we analyze the variations of all weights and output errors in every step of the learning process, and then make the decision table from their variation of weights and output errors. We can find the redundant links from the initial structure by analyzing the decision table using the rough set theory. This enables us to build a structure as compact as possible, and also enables mapping between input and output. We show the validity and effectiveness of the proposed algorithm by applying it to the XOR problem.

• 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 KIEE Conference
• /
• 1998.07g
• /
• pp.2222-2224
• /
• 1998

This paper presents a 3D feature extraction method using rough set theory. Using the stereo cameras, we obtain the raw images and then perform several processes including gradient computation and image matching process. Decision rule constructed via rough set theory determines whether a ceratin point in the image is 3D edge or not. We propose a method finding rules for 3D edge extraction using rough set.

• Journal of Electrical Engineering and Technology
• /
• v.3 no.3
• /
• pp.337-345
• /
• 2008

This paper presents a new approach to the design of a rough fuzzy controller for the control loop of the SVC (static VAR system) in a two area power system for stability enhancement with particular emphasis on providing effective damping for oscillatory instabilities. The performances of the rough fuzzy and the conventional fuzzy controller are compared with that of the conventional PI controller for a variety of transient disturbances, highlighting the effectiveness of the rough fuzzy controller in damping the inter-area oscillations. The effect of the rough fuzzy controller in improving the CCT (critical clearing time) of the two area system is elaborated in this paper as well.

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

This paper proposes a new data classification method based on the tolerant rough set that extends the existing equivalent rough set. Similarity measure between two data is described by a distance function of all constituent attributes and they are defined to be tolerant when their similarity measure exceeds a similarity threshold value. The determination of optimal similarity theshold value is very important for the accurate classification. So, we determine it optimally by using the genetic algorithm (GA), where the goal of evolution is to balance two requirements such that (1) some tolerant objects are required to be included in the same class as many as possible. After finding the optimal similarity threshold value, a tolerant set of each object is obtained and the data set is grounded into the lower and upper approximation set depending on the coincidence of their classes. We propose a two-stage classification method that all data are classified by using the lower approxi ation at the first stage and then the non-classified data at the first stage are classified again by using the rough membership functions obtained from the upper approximation set. We apply the proposed classification method to the handwritten numeral character classification. problem and compare its classification performance and learning time with those of the feed forward neural network's back propagation algorithm.

• Journal of Korean Society of Industrial and Systems Engineering
• /
• v.28 no.1
• /
• pp.1-7
• /
• 2005

Data mining is widely used for turning huge amounts of data into useful information and knowledge in the information industry in recent years. When analyzing data set with continuous values in order to gain knowledge utilizing data mining, we often undergo a process called discretization, which divides the attribute's value into intervals. Such intervals from new values for the attribute allow to reduce the size of the data set. In addition, discretization based on rough set theory has the advantage of being easily applied. In this paper, we suggest a discretization algorithm based on Rough Set theory and SOM(Self-Organizing Map) as a means of extracting valuable information from large data set, which can be employed even in the case where there lacks of professional knowledge for the field.

• Journal of Korea Multimedia Society
• /
• v.10 no.12
• /
• pp.1726-1732
• /
• 2007

The rapid proliferation of wireless networks and mobile computing applications has changed the landscape of network security. Anomaly detection is a pattern recognition task whose goal is to report the occurrence of abnormal or unknown behavior in a given system being monitored. This paper presents an efficient rough set based anomaly detection method that can effectively identify a group of especially harmful internal attackers - masqueraders in cellular mobile networks. Our scheme uses the trace data of wireless application layer by a user as feature value. Based on this, the used pattern of a mobile's user can be captured by rough sets, and the abnormal behavior of the mobile can be also detected effectively by applying a roughness membership function with the age of the user profile. The performance of the proposed scheme is evaluated by using a simulation. Simulation results demonstrate that the anomalies are well detected by the proposed scheme that considers the age of user profiles.