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

• Journal of applied mathematics & informatics
• /
• v.30 no.5_6
• /
• pp.1023-1030
• /
• 2012

Rough sets and rough filter in BE-algebras are established an some related their properties are discussed.

• Proceedings of the Korean Institute of Intelligent Systems Conference
• /
• 1997.11a
• /
• pp.248-251
• /
• 1997

In this paper, We propose the concept of approximate Classification in the field of two group discriminan analysis. In our approach, an attribute space is divided into three subspaces. Two subspaces are for given two group and one subspace is for a boundary area between the two groups. We propose Approximate Pattern Classification with Rough set. We also propose learning procedures of neural networks for approximate classification. We propose two weighting methods which lead to possibility analysis and necessity analysis. We illustrate the proposed methods by numerical examples.

• Korean Journal of Mathematics
• /
• v.29 no.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.

• Communications of the Korean Mathematical Society
• /
• v.31 no.3
• /
• pp.451-460
• /
• 2016

The notion of a rough fuzzy filter in a BE-algebra is introduced and some properties of such a filter are investigated. The relations between the upper (lower) rough filters and the upper (lower) approximations of their homomorphism images are discussed.

• Honam Mathematical Journal
• /
• v.43 no.1
• /
• pp.47-58
• /
• 2021

In this paper, we introduce rough statistical convergence of difference double sequences in normed linear spaces as an extension of rough convergence. We define the set of rough statistical limit points of a difference double sequence and analyze the results with proofs.

• The Transactions of the Korea Information Processing Society
• /
• v.6 no.8
• /
• pp.2106-2112
• /
• 1999

In decision-making, information is the thing manufactured as the useful type for decision -making. We can improve the efficiency of decision-making by elimination of unnecessary information. Rough set is the theory that can classify and reduce the unnecessary. But the reduction process of rough set becomes more complex according to the number of attribute and tuple. After eliminating of the dispensable attributes using $\chi$2 and rough set, the indispensable attributes are used for the units of input layers in neural network. This rough-neural network can support more correct decision-making of neural network.

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

• Journal of applied mathematics & informatics
• /
• v.38 no.3_4
• /
• pp.201-209
• /
• 2020

We introduce and study some basic properties of rough I-convergent of triple sequence spaces and also study the set of all rough I-limits of a triple sequence spaces.

• International Journal of Fuzzy Logic and Intelligent Systems
• /
• v.15 no.3
• /
• pp.208-215
• /
• 2015

Since upper and lower approximations could be induced from the rough set structures, rough sets are considered as approximations. The concept of fuzzy rough sets was proposed by replacing crisp binary relations with fuzzy relations by Dubois and Prade. In this paper, we introduce and investigate some properties of intuitionistic fuzzy rough approximation operators and intuitionistic fuzzy relations by means of topology.