Results 31 to 40 of about 4,802 (220)
On Finding All Reducts of Consistent Decision Tables
Cybernetics and Information Technologies, 2015 The problem of finding reducts plays an important role in processing information on decision tables. The objective of the attribute reduction problem is to reject a redundant attribute in order to find a core attribute for data processing.
Janos Demetrovics +2 more
doaj +1 more source
Prediction of cancer using customised fuzzy rough machine learning approaches
Healthcare Technology Letters, 2018 This Letter proposes a customised approach for attribute selection applied to the fuzzy rough quick reduct algorithm. The unbalanced data is balanced using synthetic minority oversampling technique.
Chinnaswamy Arunkumar +2 more
doaj +1 more source
About a Fuzzy Distance between Two Fuzzy Partitions and Application in Attribute Reduction Problem
Cybernetics and Information Technologies, 2016 According to traditional rough set theory approach, attribute reduction methods are performed on the decision tables with the discretized value domain, which are decision tables obtained by discretized data methods.
Nghia Cao Chinh +3 more
doaj +1 more source
, 2015 We reduce non-deterministic time $T \ge 2^n$ to a 3SAT instance $ϕ$ of quasilinear size $|ϕ| = T \cdot \log^{O(1)} T$ such that there is an explicit circuit $C$ that on input an index $i$ of $\log |ϕ|$ bits outputs the $i$th clause, and each output bit of $C$ depends on $O(1)$ input bits. The previous best result was $C$ in NC$^1$.
Hamidreza Jahanjou +2 more
openaire +4 more sources
Theory of Computing Systems, 1998 26 pages; 1 figure; will appear in Theory of Computing Systems; earlier versions appear as UR-CS-TR-666 and in COCOON ...
Jin-yi Cai +2 more
openaire +4 more sources
An algorithm for reduct cardinality minimization
, 2013 This is devoted to the consideration of a new algorithm for reduct cardinality minimization. This algorithm transforms the initial table to a decision table of a special kind, simplify this table, and use a dynamic programming algorithm to finish the ...
Moshkov, Mikhail +7 more
core +1 more source
Attribute reduction based on maximal rules in decision formal context [PDF]
International Journal of Computational Intelligence Systems, 2014 One of the key issues in the theory of concept lattices is to extract the useful rules from the decision formal context. The maximal rules implicate the others, thus people are interested in them.
Leijun Li, Jusheng Mi, Bin Xie
doaj +1 more source
Test-Cost-Sensitive Quick Reduct
, 2019 In real-world applications, the data gathering process is necessarily bounded by costs in terms of money, time or resources that need to be spent in order to sample a sufficient amount of good quality data.
Antonio Maratea +5 more
core +1 more source
Generation and Mapping of Multi-Reducts Based on Nearest Neighbor Relation [PDF]
International Journal of Networked and Distributed Computing (IJNDC), 2014 Dimension reduction of data is an important theme in the data processing to represent and manipulate higher dimensional data. Rough set is fundamental and useful to process higher dimensional data. Reduct in the rough set is a minimal subset of features,
Naohiro Ishii +3 more
doaj +1 more source
A DISTANCE BASED INCREMENTAL FILTER-WRAPPER ALGORITHM FOR FINDING REDUCT IN INCOMPLETE DECISION TABLES [PDF]
, 2019 Tolerance rough set model is an effective tool for attribute reduction in incomplete decision tables. In recent years, some incremental algorithms have been proposed to find reduct of dynamic incomplete decision tables in order to reduce computation time.
Oanh, Dang Thi +2 more
core +1 more source