A New Knowledge Reduction Algorithm Based on Decision Power in Rough Set

Author(s):  
Jiucheng Xu ◽  
Lin Sun
2013 ◽  
Vol 347-350 ◽  
pp. 3119-3122
Author(s):  
Yan Xue Dong ◽  
Fu Hai Huang

The basic theory of rough set is given and a method for texture classification is proposed. According to the GCLM theory, texture feature is extracted and generate 32 feature vectors to form a decision table, find a minimum set of rules for classification after attribute discretization and knowledge reduction, experimental results show that using rough set theory in texture classification, accompanied by appropriate discrete method and reduction algorithm can get better classification results


Author(s):  
Hasrat Selpia Simorangkir

In analyzing data with data mining using the Rough Set algorithm which has results in the form of rules (rules). The process of determining the rules in the Rough Set method starts from processing the Microsoft Excel database, and continues testing with the Rough Set method. Thus producing General Rules which will become new knowledge in this research.With the existence of data mining using the rough set penilus algorithm, it can analyze data and provide solutions to the weaknesses faced in the menteng Medan field agents that have occurred so that it can be used as an alternative to solving problems in packet expedition encountered so far.Keyword: Data Mining, Descision System, Equivalen Class, ,General Rules, Rough set,Reduction


2021 ◽  
pp. 1-15
Author(s):  
Rongde Lin ◽  
Jinjin Li ◽  
Dongxiao Chen ◽  
Jianxin Huang ◽  
Yingsheng Chen

Fuzzy covering rough set model is a popular and important theoretical tool for computation of uncertainty, and provides an effective approach for attribute reduction. However, attribute reductions derived directly from fuzzy lower or upper approximations actually still occupy large of redundant information, which leads to a lower ratio of attribute-reduced. This paper introduces a kind of parametric observation sets on the approximations, and further proposes so called parametric observational-consistency, which is applied to attribute reduction in fuzzy multi-covering decision systems. Then the related discernibility matrix is developed to provide a way of attribute reduction. In addition, for multiple observational parameters, this article also introduces a recursive method to gradually construct the multiple discernibility matrix by composing the refined discernibility matrix and incremental discernibility matrix based on previous ones. In such case, an attribute reduction algorithm is proposed. Finally, experiments are used to demonstrate the feasibility and effectiveness of our proposed method.


Sign in / Sign up

Export Citation Format

Share Document