Scholarly Research Excellence

Digital Open Science Index

Commenced in January 2007 Frequency: Monthly Edition: International Publications Count: 29122


Select areas to restrict search in scientific publication database:
10003115
Fuzzy Population-Based Meta-Heuristic Approaches for Attribute Reduction in Rough Set Theory
Abstract:
One of the global combinatorial optimization problems in machine learning is feature selection. It concerned with removing the irrelevant, noisy, and redundant data, along with keeping the original meaning of the original data. Attribute reduction in rough set theory is an important feature selection method. Since attribute reduction is an NP-hard problem, it is necessary to investigate fast and effective approximate algorithms. In this paper, we proposed two feature selection mechanisms based on memetic algorithms (MAs) which combine the genetic algorithm with a fuzzy record to record travel algorithm and a fuzzy controlled great deluge algorithm, to identify a good balance between local search and genetic search. In order to verify the proposed approaches, numerical experiments are carried out on thirteen datasets. The results show that the MAs approaches are efficient in solving attribute reduction problems when compared with other meta-heuristic approaches.
Digital Object Identifier (DOI):

References:

[1] R. Jensen and Q. Shen, "Fuzzy-rough sets for descriptive dimensionality reduction," presented at the Fuzzy Systems, 2002. FUZZ-IEEE'02. Proceedings of the 2002 IEEE International Conference on, 2002.
[2] L. Ke, Z. Feng, and Z. Ren, "An efficient ant colony optimization approach to attribute reduction in rough set theory," Pattern Recognition Letters, vol. 29, 2008, pp. 1351-1357.
[3] S. Theodoridis and K. Koutroumbas, Pattern Recognition, Third ed. Orlando, FL, USA Academic Press, Inc. , 2006.
[4] Z. Pawalk, "Rough sets: theoretical aspects of reasoning about data," ed: Dordrecht: Kluwer Academic Publishers, 1991.
[5] Z. Pawlak, "Rough Sets," International Journal of Information and Computer Sciences, vol. 11, 1982, pp. 341-356.
[6] Z. Pawlak, "Rough sets and data analysis," presented at the Fuzzy Systems Symposium, 1996. 'Soft Computing in Intelligent Systems and Information Processing', 1996.
[7] Z. Pawlak and A. Skowron, "Rudiments of rough sets," Information sciences, vol. 177, 2007, pp. 3-27.
[8] R. W. Swiniarski and A. Skowron, "Rough set methods in feature selection and recognition," Pattern Recognition Letters, vol. 24, 2003, pp. 833-849.
[9] A. Skowron and C. Rauszer, "The discernibility matrices and functions in information systems," Intelligent decision support–Handbook of applications and advances of the rough set theory, 1992, pp. 311–362.
[10] R. Jensen and Q. Shen, "Semantics-Preserving Dimensionality Reduction: Rough and Fuzzy-Rough-Based Approaches," IEEE Trans. on Knowl. and Data Eng., vol. 16, 2004, pp. 1457-1471.
[11] J. G. Bazan, A. Skowron, and P. Synak, "Dynamic Reducts as a Tool for Extracting Laws from Decisions Tables," presented at the Proceedings of the 8th International Symposium on Methodologies for Intelligent Systems, 1994.
[12] J. Wroblewski, "Finding minimal reducts using genetic algorithms," presented at the 2nd Annual Joint Conf. on Information Sciences, Wrightsville Beach, NC, 1995.
[13] A.-R. Hedar, J. Wang, and M. Fukushima, "Tabu search for attribute reduction in rough set theory," Soft Comput., vol. 12, 2006, pp. 909-918.
[14] J. Wang, A.-R. Hedar, G. Zheng, and S. Wang, "Scatter Search for Rough Set Attribute Reduction," presented at the Bio-Inspired Computing: Theories and Applications, 2007. BIC-TA 2007. Second International Conference on, 2007.
[15] S. Abdullah and N. S. Jaddi, "Great Deluge Algorithm for Rough Set Attribute Reduction," in Database Theory and Application, Bio-Science and Bio-Technology. vol. 118, Y. Zhang, A. Cuzzocrea, J. Ma, K.-i. Chung, T. Arslan, and X. Song, Eds., ed: Springer Berlin Heidelberg, 2010, pp. 189-197.
[16] S. K. Jihad and S. Abdullah, "Investigating composite neighbourhood structure for attribute reduction in rough set theory," presented at the Intelligent Systems Design and Applications (ISDA), 10th International Conference, 2010.
[17] Y. Z. Arajy and S. Abdullah, "Hybrid variable neighbourhood search algorithm for attribute reduction in Rough Set Theory," presented at the Intelligent Systems Design and Applications (ISDA), 2010.
[18] S. Abdullah, N. R. Sabar, M. Z. A. Nazri, H. Turabieh, and B. McCollum, "A constructive hyper-heuristics for rough set attribute reduction," presented at the Intelligent Systems Design and Applications (ISDA), 2010.
[19] M. Mafarja and S. Abdullah, "Modified great deluge for attribute reduction in rough set theory," presented at the Fuzzy Systems and Knowledge Discovery (FSKD), 2011.
[20] D. Koller and M. Sahami, "Toward Optimal Feature Selection," presented at the International Conference on Machine Learning 1996.
[21] R. Kohavi and G. H. John, "Wrappers for feature subset selection," Artificial Intelligence vol. 97, 1997, pp. 273-324.
[22] G. H. John, R. Kohavi, and K. Pfleger, "Irrelevant Features and the Subset Selection Problem", 1994.
[23] R. Jensen and Q. Shen, Computational Intelligence and Feature Selection: Rough and Fuzzy Approaches: Wiley-IEEE Press, 2008.
[24] J. Dong, N. Zhong, and S. Ohsuga, "Using Rough Sets with Heuristics for Feature Selection," presented at the Proceedings of the 7th International Workshop on New Directions in Rough Sets, Data Mining, and Granular-Soft Computing, 1999.
[25] J. Bazan, H. S. Nguyen, S. H. Nguyen, P. Synak, and J. Wróblewski, "Rough set algorithms in classification problem," Rough Set Methods and Applications. Physica Verlag, 2000, pp. 49–88.
[26] P. Moscato, "On Evolution, Search, Optimization, Genetic Algorithms and Martial Arts - Towards Memetic Algorithms," California Instiyute of Technology, Pasadena, CA1989.
[27] C. Guerra-Salcedo, S. Chen, D. Whitley, and S. Smith, "Fast and accurate feature selection using hybrid genetic strategies," presented at the Genetic and Evolutionary Computation Conf, 1999.
[28] I. S. Oh, J. S. Lee, and B. R. Moon, "Hybrid genetic algorithms for feature selection," Pattern Analysis and Machine Intelligence, IEEE Transactions on, vol. 26, 2004, pp. 1424-1437.
[29] N. Krasnogor, "Studies on the Theory and Design Space of Memetic Algorithms" PhD, University of the West of England, 2002, 2002.
[30] W. E. Hart, N. Krasnogor, and J. E. Smith, "Recent Advances in Memetic Algorithms," vol. 166, 2005.
[31] J. H. Holland, Adaptation in natural and artificial systems: MIT Press, 1992.
[32] J. Yang and V. G. Honavar, "Feature Subset Selection Using a Genetic Algorithm," IEEE Intelligent Systems, vol. 13, pp. 44-49, 1998.
[33] Z. Michalewicz, Genetic algorithms+ data structures: Springer, 1996.
[34] L. A. Zadeh, "Fuzzy sets," Information and Control, vol. 8, 1965, pp. 338-353.
[35] R. Jensen and Q. Shen, "New approaches to fuzzy-rough feature selection," Fuzzy Systems, IEEE Transactions on, vol. 17, 2009, pp. 824- 838.
[36] E. Cox, The fuzzy systems handbook: a practitioner's guide to building, using, and maintaining fuzzy systems: Academic Press Professional, Inc., 1994.
[37] H. Zimmermann, Fuzzy Set Theory and its Applications: Kluwer Academic Publishers, Boston, 1996.
[38] G. Dueck, "New Optimization Heuristics The Great Deluge Algorithm and the Record-to-Record Travel," Journal of Computational Physics,, vol. 104, 1993, pp. 86-92.
[39] R. Jensen and Q. Shen, "Finding Rough Set Reducts with Ant Colony Optimization," in Proceedings of the 2003 UK Workshop on Computational Intelligence, ed, 2003, pp. 15–22
[40] A. Øhrn, "Discernibility and rough sets in medicine: tools and applications," Department of Computer and Information Science, Norwegian University of Science and Technology, Trondheim, Norway, 1999.
[41] S. Abdullah, N.R. Sabar, M.Z. Ahmad Nazri, M. Ayob. “An Exponential Monte-Carlo algorithm for feature selection problems”, Computers & Industrial Engineering. vol 67 (2014), pp 160-167.

Vol:12 No:12 2018Vol:12 No:11 2018Vol:12 No:10 2018Vol:12 No:09 2018Vol:12 No:08 2018Vol:12 No:07 2018Vol:12 No:06 2018Vol:12 No:05 2018Vol:12 No:04 2018Vol:12 No:03 2018Vol:12 No:02 2018Vol:12 No:01 2018
Vol:11 No:12 2017Vol:11 No:11 2017Vol:11 No:10 2017Vol:11 No:09 2017Vol:11 No:08 2017Vol:11 No:07 2017Vol:11 No:06 2017Vol:11 No:05 2017Vol:11 No:04 2017Vol:11 No:03 2017Vol:11 No:02 2017Vol:11 No:01 2017
Vol:10 No:12 2016Vol:10 No:11 2016Vol:10 No:10 2016Vol:10 No:09 2016Vol:10 No:08 2016Vol:10 No:07 2016Vol:10 No:06 2016Vol:10 No:05 2016Vol:10 No:04 2016Vol:10 No:03 2016Vol:10 No:02 2016Vol:10 No:01 2016
Vol:9 No:12 2015Vol:9 No:11 2015Vol:9 No:10 2015Vol:9 No:09 2015Vol:9 No:08 2015Vol:9 No:07 2015Vol:9 No:06 2015Vol:9 No:05 2015Vol:9 No:04 2015Vol:9 No:03 2015Vol:9 No:02 2015Vol:9 No:01 2015
Vol:8 No:12 2014Vol:8 No:11 2014Vol:8 No:10 2014Vol:8 No:09 2014Vol:8 No:08 2014Vol:8 No:07 2014Vol:8 No:06 2014Vol:8 No:05 2014Vol:8 No:04 2014Vol:8 No:03 2014Vol:8 No:02 2014Vol:8 No:01 2014
Vol:7 No:12 2013Vol:7 No:11 2013Vol:7 No:10 2013Vol:7 No:09 2013Vol:7 No:08 2013Vol:7 No:07 2013Vol:7 No:06 2013Vol:7 No:05 2013Vol:7 No:04 2013Vol:7 No:03 2013Vol:7 No:02 2013Vol:7 No:01 2013
Vol:6 No:12 2012Vol:6 No:11 2012Vol:6 No:10 2012Vol:6 No:09 2012Vol:6 No:08 2012Vol:6 No:07 2012Vol:6 No:06 2012Vol:6 No:05 2012Vol:6 No:04 2012Vol:6 No:03 2012Vol:6 No:02 2012Vol:6 No:01 2012
Vol:5 No:12 2011Vol:5 No:11 2011Vol:5 No:10 2011Vol:5 No:09 2011Vol:5 No:08 2011Vol:5 No:07 2011Vol:5 No:06 2011Vol:5 No:05 2011Vol:5 No:04 2011Vol:5 No:03 2011Vol:5 No:02 2011Vol:5 No:01 2011
Vol:4 No:12 2010Vol:4 No:11 2010Vol:4 No:10 2010Vol:4 No:09 2010Vol:4 No:08 2010Vol:4 No:07 2010Vol:4 No:06 2010Vol:4 No:05 2010Vol:4 No:04 2010Vol:4 No:03 2010Vol:4 No:02 2010Vol:4 No:01 2010
Vol:3 No:12 2009Vol:3 No:11 2009Vol:3 No:10 2009Vol:3 No:09 2009Vol:3 No:08 2009Vol:3 No:07 2009Vol:3 No:06 2009Vol:3 No:05 2009Vol:3 No:04 2009Vol:3 No:03 2009Vol:3 No:02 2009Vol:3 No:01 2009
Vol:2 No:12 2008Vol:2 No:11 2008Vol:2 No:10 2008Vol:2 No:09 2008Vol:2 No:08 2008Vol:2 No:07 2008Vol:2 No:06 2008Vol:2 No:05 2008Vol:2 No:04 2008Vol:2 No:03 2008Vol:2 No:02 2008Vol:2 No:01 2008
Vol:1 No:12 2007Vol:1 No:11 2007Vol:1 No:10 2007Vol:1 No:09 2007Vol:1 No:08 2007Vol:1 No:07 2007Vol:1 No:06 2007Vol:1 No:05 2007Vol:1 No:04 2007Vol:1 No:03 2007Vol:1 No:02 2007Vol:1 No:01 2007