Academia.eduAcademia.edu

Outline

Title
Abstract
Introduction
Proposed Method
Experimental Results
Conclusion
References
All Topics
Computer Science
Algorithms and Data Structures

An Effective Algorithm for Computing Reducts in Decision Tables

Profile image of Lâm Thành HiểnLâm Thành Hiển

Journal of Computer Science and Cybernetics

https://doi.org/10.15625/1813-9663/38/3/17450
visibility

…

description

16 pages

link

1 file

Abstract

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 information for classification purposes as the entire set of available attributes. The classification task for the high dimensional decision table could be solved faster if a reduct, instead of the original whole set of attributes, is used. In this paper, we propose a reduct computing algorithm using attribute clustering. The proposed algorithm works in three main stages. In the first stage, irrelevant attributes are eliminated. In the second stage relevant attributes are divided into appropriately selected number of clusters by Partitioning Around Medoids (PAM) clustering method integrated with a special metric in attribute space which is the normalized variation of information. In the third stage, the representative attribute from each cluster is selected that is the most class-related. The selected attrib...

Related papers

An Interactive Rough Set Attribute Reduction Using Great Deluge Algorithm
najmeh sadat jaddi

Dimensionality reduction from an information system is a problem of eliminating unimportant attributes from the original set of attributes while avoiding loss of information in data mining process. In this process, a subset of attributes that is highly correlated with decision attributes is selected. In this paper, performance of the great deluge algorithm for rough set attribute reduction is investigated by comparing the method with other available approaches in the literature in terms of cardinality of obtained reducts (subsets), time required to obtain reducts, number of calculating dependency degree functions, number of rules generated by reducts, and the accuracy of the classification. An interactive interface is initially developed that user can easily select the parameters for reduction. This user interface is developed toward visual data mining. The carried out model has been tested on the standard datasets available in the UCI machine learning repository. Experimental results show the effectiveness of the method especially with relation to the time and accuracy of the classification using generated rules. The method outperformed other approaches in M-of-N, Exactly, and LED datasets with achieving 100% accuracy.

View PDFchevron_right
Attribute Reduction Using Bayesian Decision Theoretic Rough Set Models
Sharmistha Bhattacharya halder

International Journal of Rough Sets and Data Analysis, 2014

Bayesian Decision theoretic rough set has been invented by the author. In this paper the attribute reduction by the aid of Bayesian decision theoretic rough set has been studied. Lot of other methods are there for attribute reduction such as Variable precision method, probabilistic approach, Bayesian method, Pawlaks rough set method using Boolean function. But with the help of some example it is shown that Bayesian decision theoretic rough set model gives better result than other method. Lastly an example of HIV /AIDS is taken and attribute reduction is done by this new method and various other method. It is shown that this method gives better result than the previously defined methods. By this method the authors get only the reduced attribute age which is the best significant attribute. Though in Pawlak model age sex or age living status are the reduced attribute and variable precision method fails to work here. In this paper attribute reduction is done by the help of discernibilit...

View PDFchevron_right
An incremental rough set approach for faster attribute reduction
N Nandhini

International Journal of Information Technology, 2019

In the view of performance improvement in machine learning algorithms it is essential to feed them with minimal and most relevant features. Feature selection is one of the evident preprocessing step followed by most of the learning algorithms for choosing the relevant features towards reducing the dimensionality of the dataset as well as to improve the classification accuracy. Among various feature selection techniques, Rough Set Theory has its own major contributions in feature selection domain. However, the conventional Rough Set based Feature Selection (RSFS) procedure takes up to O(kn 2) time and space complexity, where k is the number of objects and n is the total number of attributes, which is further reduced to O(kn). In this paper, an incremental approach of RSFS is proposed to reduce the time complexity of the algorithm to O(k log n) time. Here the indiscernibility relation is estimated in an incremental fashion rather than calculating them in conventional way, hence the overall attribute reduction time is reduced significantly when compared to conventional roughest approach. The performance of the proposed Incremental Rough Set (InRS) approach is evaluated with QuickReduct feature selection algorithm. The simulation results indicate that the InRS approach is able to find the reduct with minimal time complexity than the existing rough set methods.

View PDFchevron_right
Analysis of alternative objective functions for attribute reduction in complete decision tables
Witold Pedrycz

2011

Abstract Attribute reduction and reducts are important notions in rough set theory that can preserve discriminatory properties to the highest possible extent similar to the entire set of attributes. In this paper, the relationships among 13 types of alternative objective functions for attribute reduction are systematically analyzed in complete decision tables. For inconsistent and consistent decision tables, it is demonstrated that there are only six and two intrinsically different objective functions for attribute reduction, respectively.

View PDFchevron_right
A Study on Rough Set Theory Based Dynamic Reduct for Classification System Optimization
Asit Das

International Journal of Artificial Intelligence & Applications, 2014

In the present day huge amount of data is generated in every minute and transferred frequently. Although the data is sometimes static but most commonly it is dynamic and transactional. New data that is being generated is getting constantly added to the old/existing data. To discover the knowledge from this incremental data, one approach is to run the algorithm repeatedly for the modified data sets which is time consuming. Again to analyze the datasets properly, construction of efficient classifier model is necessary. The objective of developing such a classifier is to classify unlabeled dataset into appropriate classes. The paper proposes a dimension reduction algorithm that can be applied in dynamic environment for generation of reduced attribute set as dynamic reduct, and an optimization algorithm which uses the reduct and build up the corresponding classification system. The method analyzes the new dataset, when it becomes available, and modifies the reduct accordingly to fit the entire dataset and from the entire data set, interesting optimal classification rule sets are generated. The concepts of discernibility relation, attribute dependency and attribute significance of Rough Set Theory are integrated for the generation of dynamic reduct set, and optimal classification rules are selected using PSO method, which not only reduces the complexity but also helps to achieve higher accuracy of the decision system. The proposed method has been applied on some benchmark dataset collected from the UCI repository and dynamic reduct is computed, and from the reduct optimal classification rules are also generated. Experimental result shows the efficiency of the proposed method.

View PDFchevron_right
Decision bireducts and approximate decision reducts: Comparison of two approaches to attribute subset ensemble construction
Sebastian Widz

We discuss the notion of a decision bireduct [1], which is an extension of the notion of a decision reduct developed within the theory of rough sets. We show relationships between the decision bireducts and some formulations of approximate decision reducts summarized in [2]. We investigate advantages of the decision bireducts and the approximate decision reducts within a rough-set-inspired framework for deriving attribute subset ensembles from data, wherein each of attribute subsets yields a single classifier, basically by generating its corresponding if-then decision rules from the training data. We also show how to use the above-mentioned relationships to build even more efficient rough-set-based ensembles in the future.

View PDFchevron_right
Feature Selection based on Rough Sets and Minimal Attribute Reduction Algorithm
Khaled Alwesabi

International Journal of Hybrid Information Technology, 2016

Numerous studies have focused on feature selection using many algorithms, but most of these algorithms encounter problems when the amount of data is large. In this paper, we propose an algorithm that handles a large amount of data by partitioning the data to process a reduction, and then selecting the intersection of all reducts as a stable reduct. This algorithm is successful but may suffer from loss of information if the samples are unsuitable. The proposed algorithm is based on discernibility matrix and function. Furthermore, the method can address the case in which the data consist of a significant amount of information. Our results show that the proposed algorithm is powerful and flexible enough to successfully target a range of different domains and can effectively reduce computational complexity as well as increase reduction efficiency. The efficiency of Proposed Algorithm is illustrated by experiments with UCI datasets further.

View PDFchevron_right
An efficient classifier design integrating rough set and set oriented database operations
Asit Das

Applied Soft Computing, 2011

Feature subset selection and dimensionality reduction of data are fundamental and most explored area of research in machine learning and data mining domains. Rough set theory (RST) constitutes a sound basis for data mining, can be used at different phases of knowledge discovery process. In the paper, by integrating the concept of RST and relational algebra operations, a new attribute reduction algorithm has been presented to select the minimum set of attributes, called reducts, required for classification of data. Firstly, the conditional attributes are partitioned into different groups according to their score, calculated using projection () and division (÷) operations of relational algebra. The groups based on their scores are sorted in ascending order while the first group contains maximum information is uniquely used for generating the reducts. The non-reduct attributes are combined with the elements of the next group and the modified group is considered for computing the reducts. The process continues until all groups are exhausted and thus a final set of reducts is obtained. Then applying decision tree algorithm on each reduct, decision rule sets are generated, which are later pruned by removing the extraneous components. Finally, by involving the concept of probability theory and graph theory minimum number of rules is obtained used for building an efficient classifier.

View PDFchevron_right
Generation of rough sets reducts and constructs based on inter-class and intra-class information
Roman Słowiński

Fuzzy Sets and Systems, 2015

The reduct, originating from the Classic Rough Set Approach (CRSA), is an inclusion minimal subset of attributes that provides discernibility between objects from different classes in at least the same degree as the set of all attributes. It can be thus referred to as being consistent and minimal, which are the two important characteristics of filter-based feature selection. These two characteristics have been also utilized to define reducts within the Dominance-based Rough Set Approach (DRSA). Further, the classic reduct, here referred to as an inter-class reduct, has evolved into what is known as intra-class reduct and construct in CRSA. The idea is that while inter-class reducts utilize only one part of information generated from all pairs of objects, intra-class reducts utilize the remaining part, while constructs utilize both. The paper delivers a final unification of inter-class reducts, intra-class reducts and constructs across CRSA and DRSA, showing how they can be both defined and computed uniformly, i.e. using basically the same concepts and algorithms. It also presents an exact algorithm, capable of generating all exact reduced subsets, but of considerable complexity, as well as a simple and fast heuristic, designed to generate a single reduced subset. Finally, it illustrates the computation process with examples and some experimental evaluation of CRSA constructs, which show how the use of both the inter-class and the intra-class information can assist the attribute reduction process and help obtaining useful insights into the analyzed data set.

View PDFchevron_right
A study on attribute reduction by bayesian decision theoretic rough set models
Sharmistha Bhattacharya halder

2020

Abstract. Bayesian Decision theoretic rough set AMS Classification: 54A05, 54H99 Keywords: Bayesian decision theoretic rough set model, Decision theoretic rough set, Bayesian rough set, Bayesian rough set based on coverage.

View PDFchevron_right

References (37)

  1. M. Alimoussa, A. Porebski, N. Vandenbroucke, R. Thami, and S. El Fkihi, "Clustering-based sequential feature selection approach for high dimensional data dlassification," in Proceedings of the 16th International Joint Conference on Computer Vision, Imaging and Computer Graph- ics Theory and Applications (VISIGRAPP 2021) -Volume 4: VISAPP, pp. 122-132, 2021. https://www.scitepress.org/Papers/2021/102595/102595.pdf
  2. Q.A. Al-Radaideh, M.N. Sulaiman, M.H. Selamat and H. Ibrahim, "Approximate reduct com- putation by rough sets based attribute weighting," 2005 IEEE International Conference on Granular Computing, vol. 2, 2005, pp. 383-386. Doi: 10.1109/GRC.2005.1547317.
  3. R. Bello and R. Falcon, "Rough sets in machine learning: A review." Chapter in Studies in Computational Intelligence, 2017. http://dx.doi.org/10.1007/978-3-319-54966-8 5
  4. G. Chandrashekar, and F. Sahin, "A survey on feature selection methods," Computers & Electrical Engineering, vol. 40, no. 1, pp. 16 -28. 40th-year commemorative issue, 2014. https://doi.org/10.1016/j.compeleceng.2013.11.024
  5. S. Chormunge and S. Jena, "Correlation based feature selection with clustering for high dimen- sional data", Journal of Electrical Systems and Information Technology, vol. 5, no. 3, 2018, pp. 542-549, https://doi.org/10.1016/j.jesit.2017.06.004
  6. D. Dua and C. Graff, "UCI Machine Learning Repositories", 2019, http://archive.ics.uci.edu/ml/
  7. K. Gao, M. Liu, K. Chen, N. Zhou, and J. Chen, "Sampling-based tasks schedul- ing in dynamic grid environment", Proceedings of the 5th WSEAS Int. Conf. on Sim- ulation, Modeling and Optimization, Corfu, Greece, August 17-19, 2005 (p. 25-30). https://citeseerx.ist.psu.edu/viewdoc/download?doi=10.1.1.582.5929&rep=rep1&type=pdf
  8. D.E. Goldberg, Genetic Algorithms in Search, Optimization and Machine Learning. Boston, MA, USA: Addison Wesley, 1989.
  9. E. Guyon and A. Elisseeff, "An Introduction to variable and feature selection", Journal of Machine Learning Research, vol. 3, pp. 1157-1182, 2003.
  10. D. Harris, and A.V. Niekerk, "Feature clustering and ranking for selecting stable features from high dimensional remotely sensed data," International Journal of Remote Sensing, vol. 39, no. 23, pp. 8934-8949, 2018. https://doi.org/10.1080/01431161.2018.1500730
  11. T.P. Hong and Y.L. Liou, "Attribute clustering in high dimensional feature spaces," 2007 In- ternational Conference on Machine Learning and Cybernetics, 2007, pp. 2286-2289. Doi: 10.1109/ICMLC.2007.4370526.
  12. T.P. Hong, P.C. Wang, and Y.C. Lee, "An effective attribute clustering approach for feature selection and replacement," Cybernetics and Systems: An International Journal, vol. 40, no. 8, pp. 657-669, 2009. Doi: 10.1080/01969720903294585.
  13. T.P. Hong, P.C. Wang, and C.K. Ting, "An evolutionary attribute clustering and selection method based on feature similarity," IEEE Congress on Evolutionary Computation, 2010, pp. 1-5. Doi: 10.1109/CEC.2010.5585918.
  14. T.P. Hong, Y.L. Liou, S.L. Wang, and B. Vo, "Feature selection and replacement by clustering attributes," Vietnam J Comput Sci, vol. 1, pp. 47-55, 2014. https://doi.org/10.1007/s40595- 013-0004-3
  15. T.P. Hong, C.H. Chen, and F.S. Lin, "Using group genetic algorithm to improve per- formance of attribute clustering," Applied Soft Computing, vol. 29, pp. 371-378, 2015. https://doi.org/10.1016/j.asoc.2015.01.001
  16. A. Jakulin, "Machine learning based on attribute interactions," PhD Dissertation, [na spletu], Univerza v Ljubljani, Fakulteta za računalništvo in informatiko. [Dostopano 20 september 2022].
  17. A. Janusz and D. Slezak, "Utilization of attribute clustering methods for scalable computation of reducts from high-dimensional data," 2012 Federated Conference on Computer Science and Information Systems (FedCSIS), 2012, pp. 295-302.
  18. A. Janusz and D. Slezak, "Rough set methods for attribute clustering and selection," Applied Artificial Intelligence, vol. 28, no. 3, pp. 220-242, 2014. Doi: 10.1080/08839514.2014.883902
  19. R. Jensen and Q. Shen, "A rough set-aided system for sorting WWW bookmarks," in: N. Zhong et al. (Eds.), Web Intelligence: Research and Development. WI 2001. Lecture Notes in Computer Science(), vol. 2198. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-45490-X 10
  20. L. Kaufman and P.J. Rousseeuw, Computing Groups in Data: An Introduction to Cluster Anal- ysis. John Wiley & Sons, Toronto, 1990.
  21. K. Kira and L.A. Rendell, "The feature selection problem: Traditional methods and a new algorithm," Proceedings of Nineth National Conference on Artificial Intelligence, pp. 129-134, 1992. https://www.aaai.org/Papers/AAAI/1992/AAAI92-020.pdf
  22. R. Kohavi and G.H. John, "Wrappers for feature subset selection," Artificial Intelligence, vol. 97, no. 1-2, pp. 273-324, 1997. https://doi.org/10.1016/S0004-3702(97)00043-X
  23. H. Liu and H. Motoda, Computational Methods of Feature Selection. Chapman and Hall/CRC Press, 2007.
  24. L. C. Molina, L. Belanche, and A. Nebot, "Feature selection algorithms: A survey and experi- mental evaluation," 2002 IEEE International Conference on Data Mining, 2002. Proceed- ings., 2002, pp. 306-313. Doi: 10.1109/ICDM.2002.1183917.
  25. F. Pacheco, M. Cerrada, R.V. Sánchez, D. Cabrera, C. Li, and José Valente de Oliveira, "At- tribute clustering using rough set theory for feature selection in fault severity classification of rotating machinery," Expert Systems With Applications, vol. 71, pp. 69-86, pp. 69-86, 2017. https://doi.org/10.1016/j.eswa.2016.11.024
  26. Z. Pawlak, Rough Sets, Theoretical Aspects of Reasoning About Data. Kluwer Academic Pub- lishers, 1991.
  27. P.J. Rousseeuw, "Silhouettes: A graphical aid to the interpretation and validation of cluster analysis," Journal of Computational and Applied Mathematics, vol. 20, pp. 53-65, 1987. https://doi.org/10.1016/0377-0427(87)90125-7
  28. A. Skowron, C. Rauszer, "The Discernibility Matrices and Functions in Information Systems," In: S lowiński, R. (eds) Intelligent Decision Support. Theory and Decision Library, vol.
  29. Springer, Dordrecht, 1992. https://doi.org/10.1007/978-94-015-7975-9 21
  30. Q. Song, J. Ni and G. Wang, "A fast clustering-based feature subset selection algorithm for high-dimensional data," In IEEE Transactions on Knowledge and Data Engineering, vol. 25, no. 1, pp. 1-14, Jan. 2013. Doi: 10.1109/TKDE.2011.181.
  31. H. Q. Sun and Z. Xiong, "Finding minimal reducts from incomplete information systems," Proceedings of the 2003 International Conference on Machine Learning and Cybernetics (IEEE Cat. No.03EX693), vol. 1, 2003, pp. 350-354. Doi: 10.1109/ICMLC.2003.1264500.
  32. G.Y. Wang, H. Yu, and D. Yang, "Decision table reduction based on conditional information entropy," Chinese Journal of Computers, vol. 25, no. 7, pp. 759-766, 2002.
  33. Y. Zhao, R and Data Mining: Examples and Case Studies. Published by Elsevier, December 2012. https://www.webpages.uidaho.edu/∼stevel/517/RDataMining-book.pdff
  34. J. Wroblewski, "Computing minimal reducts using genetic algorithms," in The Second Annual Join Conference on Information Sciences, pp. 186-189, 1995. http://www.cs.sjsu.edu/ khuri/Aalto 2017/ge short.pdf
  35. Q. Zhang, Q. Xie, and G. Wang, "A survey on rough set theory and its applica- tions," CAAI Transactions on Intelligence Technology, vol. 1, no. 4, pp. 323-333, 2016. https://doi.org/10.1016/j.trit.2016.11.001
  36. K. Zhu and J. Yang, "A cluster-based sequential feature selection algorithm," 2013 Ninth International Conference on Natural Computation (ICNC), 2013, pp. 848-852. Doi: 10.1109/ICNC.2013.6818094.
  37. X. Zhu, Y. Wang, Y. Li, Y. Tan, G. Wang, and Q. Song, "A new unsupervised feature selection algorithm using similarity-based feature clustering," Computational Intelligence, vol. 35, no. 1, pp. 2-22, 2019. https://doi.org/10.1111/coin.12192

Related papers

Attribute Set Weighting and Decomposition Approaches for Reduct Computation
Prof. Dr. Qasem AlRadaideh

2005

View PDFchevron_right
An Innovative Approach for Attribute Reduction in Rough Set Theory
Alex Sandro Aguiar Pessoa

Intelligent Information Management, 2014

The Rough Sets Theory is used in data mining with emphasis on the treatment of uncertain or vague information. In the case of classification, this theory implicitly calculates reducts of the full set of attributes, eliminating those that are redundant or meaningless. Such reducts may even serve as input to other classifiers other than Rough Sets. The typical high dimensionality of current databases precludes the use of greedy methods to find optimal or suboptimal reducts in the search space and requires the use of stochastic methods. In this context, the calculation of reducts is typically performed by a genetic algorithm, but other metaheuristics have been proposed with better performance. This work proposes the innovative use of two known metaheuristics for this calculation, the Variable Neighborhood Search, the Variable Neighborhood Descent, besides a third heuristic called Decrescent Cardinality Search. The last one is a new heuristic specifically proposed for reduct calculation. Considering some databases commonly found in the literature of the area, the reducts that have been obtained present lower cardinality, i.e., a lower number of attributes.

View PDFchevron_right
Rough Set Methods for Attribute Clustering and Selection
Dominik Ślęzak

Applied Artificial Intelligence, 2014

In this study we investigate methods for attribute clustering and their possible applications to the task of computation of decision reducts from information systems. We focus on high-dimensional datasets, that is, microarray data. For this type of data, the traditional reduct construction techniques either can be extremely computationally intensive or can yield poor performance in terms of the size of the resulting reducts. We propose two reduct computation heuristics that combine the greedy search with a diverse selection of candidate attributes. Our experiments confirm that by proper grouping of similar-in some sense interchangeable-attributes, it is possible to significantly decrease computation time, as well as to increase a quality of the obtained reducts (i.e., to decrease their average size). We examine several criteria for attribute clustering, and we also identify so-called garbage clusters, which contain attributes that can be regarded as irrelevant.

View PDFchevron_right
On elimination of redundant attributes in decision tables
Hung Son Nguyen

Most decision support systems based on rough set theory are related to the minimal reduct calculation problem, which is NP-hard. This paper investigates the problem of searching for the set of useful attributes that occur in at least one reduct. By compliment, this problem is equivalent to searching for the set of redundant attributes, i.e. the attributes that do not occur in any reducts of the given decision table. We show that the considered problem is equivalent to a Sperner system for relational data base system and prove that it can be solved in polynomial time. On the base of these theoretical results, we also propose some algorithms for elimination of redundant attributes in decision tables.

View PDFchevron_right
An Efficient Algorithm for Determining the Set of All Reductive Attributes in Incomplete Decision Tables
Nguyen Giang

Cybernetics and Information Technologies, 2013

In rough set theory, the number of all reducts for a given decision table can be exponential with respect to the number of attributes. This paper investigates the problem of determining the set of all reductive attributes which are present in at least one reduct of an incomplete decision table. We theoretically prove that this problem can be solved in polynomial time. This result shows that the problem of determining the union of all reducts can be solved in polynomial time, and the problem of determining the set of all redundant attributes which are not present in any reducts can also be solved in polynomial time.

View PDFchevron_right

Related topics

  • Decision Table
  • Rough Set
    • 580 California St., Suite 400
    San Francisco, CA, 94104
    © 2025 Academia. All rights reserved