CFP last date
20 January 2025
Call for Paper
February Edition
IJCA solicits high quality original research papers for the upcoming February edition of the journal. The last date of research paper submission is 20 January 2025

Submit your paper
Know more
The week's pick
Responsive image
SFLA-Based Line Balancing and Task Optimization in Master-Slave Controlled Hanger Transportation Systems for Garment Production

Duc Hoang Nguyen
Random Articles
Reseach Article

Comparative Review on Classical Rough Set Theory based Feature Selection Methods

by R.k. Bania
journal cover thumbnail

International Journal of Computer Applications
Foundation of Computer Science (FCS), NY, USA
Volume 114 - Number 19
Year of Publication: 2015
Authors: R.k. Bania
10.5120/20089-2125

R.k. Bania . Comparative Review on Classical Rough Set Theory based Feature Selection Methods. International Journal of Computer Applications. 114, 19 ( March 2015), 31-35. DOI=10.5120/20089-2125

@article{ 10.5120/20089-2125,
author = { R.k. Bania },
title = { Comparative Review on Classical Rough Set Theory based Feature Selection Methods },
journal = { International Journal of Computer Applications },
issue_date = { March 2015 },
volume = { 114 },
number = { 19 },
month = { March },
year = { 2015 },
issn = { 0975-8887 },
pages = { 31-35 },
numpages = {9},
url = { https://ijcaonline.org/archives/volume114/number19/20089-2125/ },
doi = { 10.5120/20089-2125 },
publisher = {Foundation of Computer Science (FCS), NY, USA},
address = {New York, USA}
}
%0 Journal Article
%1 2024-02-06T22:53:20.258693+05:30
%A R.k. Bania
%T Comparative Review on Classical Rough Set Theory based Feature Selection Methods
%J International Journal of Computer Applications
%@ 0975-8887
%V 114
%N 19
%P 31-35
%D 2015
%I Foundation of Computer Science (FCS), NY, USA
Abstract

Real world big data are uncertain and imprecise in nature. Receiving higher accuracy in data analysis from those data is an important and challenging task. For the analysis task significant and informative set of data is more required. Feature selection (FS) refers to a problem for selecting maximum relevant and less redundant data, which can provide a superior precision for data analysis purpose. Rough set theory (RST), one of the successful compelling components of soft computing is used for analyzing different data. It has been widely used as a mathematical tool for FS. This paper starts with an outline of the basic concepts of FS and RST. A theoretical comparative review on some existing RST methods are discussed with their pros and cons. Three RST based FS algorithms like Quickreduct (QR), Relative Reduct (RR) and Entropy based Reduct (EBR) are presented briefly. An experimental study on these three algorithms is carried out. Six public domain datasets available in UCI machine learning repository is analyzed for their performance.

References
  1. M. Dash and H. Liu, "Feature selection for classification". Elsevier, Intelligent Data Analysis, vol. 3, pp. 131-156, 1997.
  2. J. Han and M. Kanmber, "Data Mining concepts and techniques 2nd Edition", Morgan Kaufmann Publishers March, 2006.
  3. H. Liu and L. Yu, "Toward integrating feature selection algorithms for classification and clustering. " IEEE Transactions on Knowledge and Data Engineering, vol. 17, pp. 491-502, 2005.
  4. I. L. Kuncheva, "Combining pattern classifiers: methods and algorithms",A Wiley-Interscience publication, 2004.
  5. I. Guyon and A. Elisseeff, "An introduction to variable and feature selection", Journal of Machine Learning. Res, vol. 3, pp. 1157-1182, 2003.
  6. A. P. Englebrecht, "Computational intelligence an introduction 2nd Edition", Wiley 2007.
  7. R. Bello and L. J. Verdegay, "Rough sets in the soft computing environment", Elsevier, Information Sciences, vol. 212, pp. 1-14, 2012.
  8. A. Chouchoulas and Q. Shen, "Rough set-aided keyword reduction for text categorization". Applied Artificial Intelligence, vol. 15, pp. 843-873, 2001.
  9. J. Bazan, "Dynamic reducts as a tool for extracting laws from decision tables", In Proceedings of the 8th Symposium on Methodologies forIntelligent Systems, Lecture Notes in Artificial Intelligence vol. 869, pp. 346–355,1994.
  10. R. Jensen and Q. Shen, "Fuzzy-Rough attribute reduction with application to web categorization". Fuzzy Sets and Systems, vol. 141, pp. 469-485, 2004.
  11. J. Han, "Feature subset selection based on relative dependency between attributes", Rough Sets and Current Trends in Computing: 4th International Conference, RSCTC, Uppsala, Sweden, pp. 176–185, 2004.
  12. L. Liang, "An efficient rough feature selection algorithm with a multi-granulation view", International Journal of Approximate Reasoning vol. 53, pp. 912–926, 2012.
  13. Y Chen, "A rough set approach to feature selection based on ant colony optimization", Pattern Recognition Letters vol. 31, pp. 226–233, 2010.
  14. R. Jensen, "Performing feature selection with ACO", To appear in Swarm Intelligence and Data Mining, Springer SCI book series, 2006.
  15. N. Suguna and K. Thanushkodi, "A novel rough set reduct algorithm for medical domain based on bee Colony optimization", Journal of Computing vol. 6, pp. 49-54, 2010.
  16. C. Velayutham and K. Thangavel, "Improved Rough set algorithms for optimal attribute reduct" Journal of Electronic Science and Technology, Vol. 9 No. 2, pp. 108-117, 2011.
Index Terms

Computer Science
Information Sciences

Keywords

Feature selection Rough set Soft computing Supervised Filter Dependency

Powered by PhDFocusTM