• Kyungpook Mathematical Journal
• /
• 제55권3호
• /
• pp.549-562
• /
• 2015

In this paper we introduce the pointfree version of rough sets. For this we consider a lattice L instead of the power set P(X) of a set X. We study the properties of lower and upper pointfree approximation, precise elements, and their relation with prime elements. Also, we study lower and upper pointfree approximation as a Galois connection, and discuss the relations between partitions and Galois connections.

• Korean Journal of Mathematics
• /
• 제29권1호
• /
• pp.81-89
• /
• 2021

In this paper, we introduce the notions of a distance function, Alexandrov topology and ⊖-upper (⊕-lower) approximation operator based on complete co-residuated lattices. Under various relations, we define (⊕, ⊖)-fuzzy rough set on complete co-residuated lattices. Moreover, we study their properties and give their examples.

• 제어로봇시스템학회:학술대회논문집
• /
• 제어로봇시스템학회 2004년도 ICCAS
• /
• pp.1302-1306
• /
• 2004

This paper proposes a model for information filtering (IF) on the Web. The user information need is described into two levels in this model: profiles on category level, and Boolean queries on document level. To efficiently estimate the relevance between the user information need and documents by fuzzy, the user information need is treated as a rough set on the space of documents. The rough set decision theory is used to classify the new documents according to the user information need. In return for this, the new documents are divided into three parts: positive region, boundary region, and negative region. We modified user profile by the user's relevance feedback and discerning words in the documents. In experimental we compared the results of three methods, firstly is to search documents that are not passed the filtering system. Second, search documents that passed the filtering system. Lastly, search documents after modified user profile. The result from using these techniques can obtain higher precision.

• 경영과정보연구
• /
• 제3권
• /
• pp.15-45
• /
• 1999

Processing techniques of remote sensed image data using computer have been recognized very necessary techniques to all social fields, such as, environmental observation, land cultivation, resource investigation, military trend grasp and agricultural product estimation, etc. Especially, accurate classification and analysis to remote sensed image da are important elements that can determine reliability of remote sensed image data processing systems, and many researches have been processed to improve these accuracy of classification and analysis. Traditionally, remote sensed image data processing systems have been processed 2 or 3 selected bands in multiple bands, in this time, their selection criterions are statistical separability or wavelength properties. But, it have be bring up the necessity of bands selection method by data distribution characteristics than traditional bands selection by wavelength properties or statistical separability. Because data sensing environments change from multispectral environments to hyperspectral environments. In this paper for efficient data classification in multispectral bands environment, a band feature extraction method using the Rough sets theory is proposed. First, we make a look up table from training data, and analyze the properties of experimental multispectral image data, then select the efficient band using indiscernibility relation of Rough set theory from analysis results. Proposed method is applied to LANDSAT TM data on 2 June 1992. From this, we show clustering trends that similar to traditional band selection results by wavelength properties, from this, we verify that can use the proposed method that centered on data properties to select the efficient bands, though data sensing environment change to hyperspectral band environments.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 추계학술대회 학술발표 논문집
• /
• pp.170-174
• /
• 1997

This paper studies a method for making more efficient classification rules in the ID3 using the rough set theory. Decision tree technique of the ID3 always uses all the attributes in a table of examples for making a new decision tree, but rough set technique can in advance eleminate dispensable attributes. And the former generates only one type of classification rules, but the latter generates all the possibles types of them. The rules generated by the rough set technique are the simplist from as proved by the rough set theory. Therefore, ID3, applying the rough set technique, can reduct the size of the table of examples, generate the simplist form of the classification rules, and also implement an effectie classification system.

• Korean Journal of Mathematics
• /
• 제20권1호
• /
• pp.61-75
• /
• 2012

We investigate the properties of various frames and connections on partially ordered sets. In particular, we study the relations between various connections and various frames.

• 한국지능시스템학회:학술대회논문집
• /
• 한국퍼지및지능시스템학회 1997년도 춘계학술대회 학술발표 논문집
• /
• pp.3-17
• /
• 1997

• 한국컴퓨터정보학회논문지
• /
• 제14권6호
• /
• pp.135-142
• /
• 2009

테이터 마이닝은 대용량의 데이터 셋을 분석하기 위하여 새로운 이론, 기법, 분석 툴을 제공하는 전산 지능분야의 새로운 영역중 하나이다. 데이터 마이닝의 주요 기법으로는 연관규칙 탐사, 분류, 클러스터링 등이 있다. 그러나 이들 기법을 기존 연구 방법들처럼 개별적으로 사용하는 것보다는 통합화하여 규칙들을 자동적으로 발견해내는 방법론이 필요하다. 이런 데이터 규칙 추출 방법론은 대량의 데이터들을 분석하여 성공적인 의사결정을 내리는데 도움을 줄 수 있기에 많은 분야에 이용될 수 있다. 본 논문에서는 계층적 클러스터링 알고리듬과 러프셋 이론을 이용하여 대량의 데이터로부터 의미 있는 규칙들을 발견해 내는 자동적인 규칙 추출 방법론을 제안한다. 또한 UCI KDD 아카이브에 포함되어 있는 데이터 셋을 이용하여 제안하는 방법에 대하여 실험을 수행하였으며, 실제 생성된 규칙들을 예시하였다. 이들 자동 생성된 규칙들은 효율적인 의사결정에 도움을 준다.

• Asia pacific journal of information systems
• /
• 제9권4호
• /
• pp.23-40
• /
• 1999

This paper proposes a hybrid intelligent system that predicts the failure of firms based on the past financial performance data, combining neural network and rough set approach, We can get reduced information table, which implies that the number of evaluation criteria such as financial ratios and qualitative variables and objects (i.e., firms) is reduced with no information loss through rough set approach. And then, this reduced information is used to develop classification rules and train neural network to infer appropriate parameters. Through the reduction of information table, it is expected that the performance of the neural network improve. The rules developed by rough sets show the best prediction accuracy if a case does match any of the rules. The rationale of our hybrid system is using rules developed by rough sets for an object that matches any of the rules and neural network for one that does not match any of them. The effectiveness of our methodology was verified by experiments comparing traditional discriminant analysis and neural network approach with our hybrid approach. For the experiment, the financial data of 2,400 Korean firms during the period 1994-1996 were selected, and for the validation, k-fold validation was used.

• 한국지능시스템학회논문지
• /
• 제8권6호
• /
• pp.27-36
• /
• 1998

본 논문은 대규모 데이터베이스에서 유용한 지식을 발견하기 위해 라프셋을 중심으로 한 통합적 방법을 제시한다. 본 방업에서는 데이터베이스에 있는 실제 데이터에서 일반화된 데이터를 추출하기 위해 속성중심의 개념계층 상승기법을 사용하고, 획득 정보량을 측정하기 위해 결정 트리에 의한 귀납법을 사용한다. 그리고 불필요한 속성 및 속성값을 제거하기 위해 라프셋 이론의 지식감축 방법을 적용한다. 통합 알고리즘은 먼저, 개념의 일반화에 의해 데이터베이스의 크기를 줄이고, 다음으로 결정속성에 영향을 적게 미치는 조건속성을 제거함으로써 속성의 수를 줄인다. 마지막으로 속성간의 종속관계를 분석함으로써 불필요한 속성값을 제거하여 간략화된 결정규칙을 유도한다.