The Infona portal uses cookies, i.e. strings of text saved by a browser on the user's device. The portal can access those files and use them to remember the user's data, such as their chosen settings (screen view, interface language, etc.), or their login data. By using the Infona portal the user accepts automatic saving and using this information for portal operation purposes. More information on the subject can be found in the Privacy Policy and Terms of Service. By closing this window the user confirms that they have read the information on cookie usage, and they accept the privacy policy and the way cookies are used by the portal. You can change the cookie settings in your browser.
A new algorithm for rough set theory attribute reduction is proposed, which is based on knowledge quantity theory. Through the introduction of relative distinction precision to measure the significance of attribute, which can be used as heuristic information put forward a new kind of reduction method. The time complexity of this algorithm is only O(|A|2|U|), an example shows that the method is effective...
After analyzing the attribute reduction algorithm based on Rough Set that has arisen at present, a new formula for measuring the importance of attribution was given, and the property of this formula was analyzed. Then a new algorithm for attribution reduction was provided. The time complexity of the provided algorithm is O(|C|2*|U|). At last, the efficiency of the new algorithm was illustrated with...
It is very time-consuming to discover association rules from the mass of data, but not all the rules are interesting to the user, a lot of irrelevant information to the user's requirements may be generated when traditional mining methods are applied. In addition, most of the existing algorithms are for discovering one-dimensional association rules. Therefore, this paper defines a mining language which...
Rough set theory is a new mathematical tool to deal with vagueness and uncertainty. And now it has been widely applied in constructing decision tree which has no hierarchical attributes inside. However, hierarchical attributes exist generally in realistic environment, which leads that decision making has max rules. Using max rules to build decision trees can optimize decision trees and has practical...
The paper studies the fuzziness measure in fuzzy rough sets. By making use of the support set of fuzzy sets, a rough membership function for fuzzy sets based on fuzzy relation is introduced. Simultaneously, a fuzziness measure of fuzzy rough sets from total mean fuzzy degree is proposed. And then, it is proved that the fuzziness measure of fuzzy rough sets, denoted by, equals to zero if the set is...
Reduction of attribute is one of the key problems in rough set theory. In this paper, Using recursive idea, we design a new approach to calculate partition U/C, whose time complexity is O(\C \\U\). Then two new and relatively reasonable formulas measuring attribute significance are designed for reducing searching space, which are used as heuristic information to develop a quick attribute reduction...
In incomplete information systems, the rough set model based on dominance relation has some limitations. In this paper, by means of set-pair analysis we will define the set-pair (alpha, beta) -dominance relation for incomplete information systems, propose a rough set model based on set-pair (alpha, beta) -dominance relation to extend the classical rough set theory, and then present a corresponding...
Reduction of attribute is one of the key problems in rough set theory. In this paper, first, the notion of different quantity of partition is defined in information systems; from the viewpoint of which two new and relatively reasonable formulas measuring attribute significance are designed for reducing searching space. Then the two formulas are used as heuristic information to develop an efficient...
Set the date range to filter the displayed results. You can set a starting date, ending date or both. You can enter the dates manually or choose them from the calendar.