• Kyungpook Mathematical Journal
• /
• v.55 no.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.

• Journal of applied mathematics & informatics
• /
• v.37 no.5_6
• /
• pp.459-467
• /
• 2019

In this work, via Orlicz functions, we have obtained a generalization of rough statistical convergence of asymptotically equivalent triple sequences a new non-matrix convergence method, which is intermediate between the ordinary convergence and the rough statistical convergence. We also have examined some inclusion relations related to this concept. We obtain the results are non negative real numbers with respect to the partial order on the set of real numbers.

• Journal of the Korean Institute of Intelligent Systems
• /
• v.17 no.7
• /
• pp.881-886
• /
• 2007

Fuzzy inference has the advantage which can process the ambiguous knowledge. However the associated attributes of fuzzy rules are difficult to determine useful and important rules because the redundant attribute of rules is more than enough. In this paper, we propose a method to minimize the number of rules and preserve the accuracy of inference results by using fuzzy relative cardinality after removing unnecessary attributes from rough set. From the experimental results, we can see the fact that the proposed method provides better results (e.g the number of rules) than those of general rough set with the redundant attributes.

• Transactions of Materials Processing
• /
• v.25 no.2
• /
• pp.102-108
• /
• 2016

The aim of the current study was to develop an advanced prediction model for the slab width spread during hot rough rolling. Rough rolling consists of both vertical rolling using a set of profiled edger rolls and horizontal rolling using a set of plain work rolls. FE-simulations were performed to investigate the influences of process variables such as initial slab width, initial thickness, sizing draft, edger roll draft and work roll draft on the final slab width variation. From a statistical analysis of the simulation results, an advanced model, which can predict the slab width spread during the edger rolling and horizontal rolling, was developed. The experimental hot rolling trials showed that the newly developed model provided fairly accurate predictions on the slab width spread during hot rough rolling process using a profiled edger rolls.

• Journal of Intelligence and Information Systems
• /
• v.16 no.3
• /
• pp.77-97
• /
• 2010

Market timing is an investment strategy which is used for obtaining excessive return from financial market. In general, detection of market timing means determining when to buy and sell to get excess return from trading. In many market timing systems, trading rules have been used as an engine to generate signals for trade. On the other hand, some researchers proposed the rough set analysis as a proper tool for market timing because it does not generate a signal for trade when the pattern of the market is uncertain by using the control function. The data for the rough set analysis should be discretized of numeric value because the rough set only accepts categorical data for analysis. Discretization searches for proper "cuts" for numeric data that determine intervals. All values that lie within each interval are transformed into same value. In general, there are four methods for data discretization in rough set analysis including equal frequency scaling, expert's knowledge-based discretization, minimum entropy scaling, and na$\ddot{i}$ve and Boolean reasoning-based discretization. Equal frequency scaling fixes a number of intervals and examines the histogram of each variable, then determines cuts so that approximately the same number of samples fall into each of the intervals. Expert's knowledge-based discretization determines cuts according to knowledge of domain experts through literature review or interview with experts. Minimum entropy scaling implements the algorithm based on recursively partitioning the value set of each variable so that a local measure of entropy is optimized. Na$\ddot{i}$ve and Booleanreasoning-based discretization searches categorical values by using Na$\ddot{i}$ve scaling the data, then finds the optimized dicretization thresholds through Boolean reasoning. Although the rough set analysis is promising for market timing, there is little research on the impact of the various data discretization methods on performance from trading using the rough set analysis. In this study, we compare stock market timing models using rough set analysis with various data discretization methods. The research data used in this study are the KOSPI 200 from May 1996 to October 1998. KOSPI 200 is the underlying index of the KOSPI 200 futures which is the first derivative instrument in the Korean stock market. The KOSPI 200 is a market value weighted index which consists of 200 stocks selected by criteria on liquidity and their status in corresponding industry including manufacturing, construction, communication, electricity and gas, distribution and services, and financing. The total number of samples is 660 trading days. In addition, this study uses popular technical indicators as independent variables. The experimental results show that the most profitable method for the training sample is the na$\ddot{i}$ve and Boolean reasoning but the expert's knowledge-based discretization is the most profitable method for the validation sample. In addition, the expert's knowledge-based discretization produced robust performance for both of training and validation sample. We also compared rough set analysis and decision tree. This study experimented C4.5 for the comparison purpose. The results show that rough set analysis with expert's knowledge-based discretization produced more profitable rules than C4.5.

• Journal of the Korean Institute of Telematics and Electronics S
• /
• v.36S no.9
• /
• pp.49-57
• /
• 1999

The fusion of fuzzy set theory and neural networks technologies have concentrated on applying neural networks to obtain the optimal rule bases of fuzzy logic system. Unfortunately, this is very hard to achieve due to limited learning capabilities of neural networks. To overcome this difficulty, we propose a new approach in which rough set theory and neuro-fuzzy fusion are combined to obtain the optimal rule base from input/output data. Compared with conventional FNN, the proposed algorithm is considerably more realistic because it reduces overlapped data when construction a rule base. This results are applied to the construction of inference rules for controlling the temperature at specified points in a refrigerator.

• 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
• /
• 2007.11a
• /
• pp.261-264
• /
• 2007

퍼지 추론은 애매한 지식을 효과적으로 처리할 수 있는 장점이 있다. 그러나 규칙의 연관속성은 규칙을 과다하게 생성하기 때문에 유용하고 중요한 규칙을 결정하는데 여러 가지 문제점이었다. 본 논문에서는 퍼지 규칙에서 규칙간의 상관성을 고려하여 불필요한 속성을 제거하고, 퍼지규칙의 상대농도를 이용하여 추론결과의 정확성을 유지하면서 규칙의 수를 최소화 하는 방법을 제안한다. 제안한 방법의 타당성을 검증하기 위하여 기존의 규칙 감축 방법에 따른 출론 결과와 비교 검증하였다.

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

This paper is concerned about the classification of objects together with muti-attributes such as remote sensing image data by using tolerance rough set. To produce more reliable relations from given attributes in the data, we define new similarity measures by using scaling. Our Method will be applied to classify multi-spectral image data.

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