Javascript must be enabled to continue!
About a Distance Measure and Application for Finding Reduct in Incomplete Decision Tables
View through CrossRef
Tolerance rough set model is an effective tool to reduce attributes in incomplete decision tables. Over 40 years, several attribute reduction methods have been proposed to improve the efficiency of execution time and the number of attributes of the reduct. However, they are classical filter algorithms, in which the classification accuracy of decision tables is computed after obtaining the reducts. Therefore, the obtained reducts of these algorithms are not optimal in terms of reduct cardinality and classification accuracy. In this paper, we propose a filter-wrapper algorithm to find a reduct in incomplete decision tables. We then use this measure to determine the importance of the property and select the attribute based on the calculated importance (filter phase). In the next step, we find the reduct with the highest classification accuracy by iterating over elements of the set containing the sequence of attributes selected in the first step (wrapper phase). To verify the effectiveness of the method, we conduct experiments on 6 famous UCI data sets. Experimental results show that the proposed method increase classification accuracy as well as reduce the cardinality of reduct compared to Algorithm 1 [12].
Blue Eyes Intelligence Engineering and Sciences Engineering and Sciences Publication - BEIESP
Title: About a Distance Measure and Application for Finding Reduct in Incomplete Decision Tables
Description:
Tolerance rough set model is an effective tool to reduce attributes in incomplete decision tables.
Over 40 years, several attribute reduction methods have been proposed to improve the efficiency of execution time and the number of attributes of the reduct.
However, they are classical filter algorithms, in which the classification accuracy of decision tables is computed after obtaining the reducts.
Therefore, the obtained reducts of these algorithms are not optimal in terms of reduct cardinality and classification accuracy.
In this paper, we propose a filter-wrapper algorithm to find a reduct in incomplete decision tables.
We then use this measure to determine the importance of the property and select the attribute based on the calculated importance (filter phase).
In the next step, we find the reduct with the highest classification accuracy by iterating over elements of the set containing the sequence of attributes selected in the first step (wrapper phase).
To verify the effectiveness of the method, we conduct experiments on 6 famous UCI data sets.
Experimental results show that the proposed method increase classification accuracy as well as reduce the cardinality of reduct compared to Algorithm 1 [12].
Related Results
Hybrid Rough Set With Black Hole Optimization-Based Feature Selection Algorithm for Protein Structure Prediction
Hybrid Rough Set With Black Hole Optimization-Based Feature Selection Algorithm for Protein Structure Prediction
In this paper, a new approach for hybridizing Rough Set Quick Reduct and Relative Reduct approaches with Black Hole optimization algorithm is proposed. This algorithm is inspired o...
AN EFFECTIVE ALGORITHM FOR COMPUTING REDUCTS IN DECISION TABLES
AN EFFECTIVE ALGORITHM FOR COMPUTING REDUCTS IN DECISION TABLES
Attribute reduction is one important part researched in rough set theory. A reduct from a decision table is a minimal subset of the conditional attributes which provide the same in...
Autonomy on Trial
Autonomy on Trial
Photo by CHUTTERSNAP on Unsplash
Abstract
This paper critically examines how US bioethics and health law conceptualize patient autonomy, contrasting the rights-based, individualist...
Rough Set Based Analysis of Document Images
Rough Set Based Analysis of Document Images
Rough set is a well-studied subject with a theoretical foundation and many applications. However, its usage in image processing has been very sparse. Most of the well-known algori...
Efficient Algorithms for Dynamic Incomplete Decision Systems
Efficient Algorithms for Dynamic Incomplete Decision Systems
Attribute reduction is a crucial problem in the process of data mining and knowledge discovery in big data. In incomplete decision systems, the model using tolerance rough set is f...
Relationships Among the Concepts of Reduct in Incomplete Decision Tables
Relationships Among the Concepts of Reduct in Incomplete Decision Tables
With regard to attribute reduction research directions in tolerance rough set, this paper studies the relationships among concepts of reduct of incomplete decision tables. These re...
Contextual factors influencing incomplete immunization and investigation of its geospatial heterogeneity in Pakistan: a cross-sectional study based on PDHS (2017–18)
Contextual factors influencing incomplete immunization and investigation of its geospatial heterogeneity in Pakistan: a cross-sectional study based on PDHS (2017–18)
Abstract
Background
Immunization is one of the most effective public health initiatives, saving millions of lives and lowering the risk of diseases ...
Applying a user-centered approach to evaluate the usability of a mobile application for health professionals in home care services (Preprint)
Applying a user-centered approach to evaluate the usability of a mobile application for health professionals in home care services (Preprint)
BACKGROUND
Mobile health (mHealth), or the use of mobile devices in medicine and health, is a sub-category of e-health. mHealth interventions are designed t...

