Skip to main content

Intelligent Double Treatment Iterative Algorithm for Attribute Reduction Problems

  • Conference paper
Computational Intelligence in Information Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 331))

  • 1296 Accesses

Abstract

Attribute reduction is a combinatorial optimization problem in data mining that aims to find minimal reducts from large set of attributes. The problem is exacerbated if the number of instances is large. Therefore, this paper concentrates on a double treatment iterative improvement algorithm with intelligent selection on composite neighbourhood structure to solve the attribute reduction problems and to obtain near optimal reducts. The algorithm works iteratively with only accepting an improved solution. The proposed approach has been tested on a set of 13 benchmark datasets taken from the University of California, Irvine (UCI) machine learning repository in line with the state-of-the-art methods. The 13 datasets have been chosen due to the differences in size and complexity in order to test the stability of the proposed algorithm. The experimental results show that the proposed approach is able to produce competitive results for the tested datasets.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 84.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 109.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Jensen, R., Shen, Q.: Semantics-preserving dimensionality reduction: rough and fuzzy-rough-based approaches. IEEE Transactions on Knowledge and Data Engineering 16, 1457–1471 (2004)

    Article  Google Scholar 

  2. Jensen, R., Shen, Q.: Finding rough set reducts with ant colony optimization. In: Proc. UK Workshop on Computational Intelligence, pp. 15–22 (2003)

    Google Scholar 

  3. Ke, L., Feng, Z., Ren, Z.: An efficient ant colony optimization approach to attribute reduction in rough set theory. Pattern Recognition Letters 29, 1351–1357 (2008)

    Article  Google Scholar 

  4. Hedar, A.R., Wang, J., Fukushima, M.: Tabu search for attribute reduction in rough set theory, Soft Computing-A Fusion of Foundations. Methodologies and Applications 12, 909–918 (2008)

    MATH  Google Scholar 

  5. Jue, W., Hedar, A., Shouyang, W.: Scatter Search for Rough Set Attribute Reduction. In: Second International Conference on Bio-Inspired Computing: Theories and Applications, BIC-TA 2007, pp. 236–240 (2007)

    Google Scholar 

  6. Mafarja, M., Abdullah, S.: Modified great deluge for attribute reduction in roughset theory. In: Proceedings of International Conference on Fuzzy Systems and Knowledge Discovery, pp. 1464–1469 (2011)

    Google Scholar 

  7. Jaddi, N.S., Abdullah, S.: Nonlinear Great Deluge Algorithm for Rough Set Attribute Reduction. Journal of Information Science and Engineering 29, 49–62 (2013)

    Google Scholar 

  8. Arajy, Y.Z., Abdullah Hybrid, S.: variable neighbourhood search algorithm for attribute reduction in Rough Set Theory. In: 2010 10th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 1015–1020. IEEE (2010)

    Google Scholar 

  9. Grabowski, J., Pempera, J.: Sequencing of jobs in some production system. European Journal of Operational Research 125, 535–550 (2000)

    Article  MATH  MathSciNet  Google Scholar 

  10. Pawlak, Z.: Rough sets. Internat. J. Comput. Inform. Sci. 11, 341–356 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  11. Pawlak, Z.: Rough sets: Theoretical aspects of reasoning about data. Springer (1991)

    Google Scholar 

  12. Liaw, C.-F.: An efficient tabu search approach for the two-machine preemptive open shop scheduling problem. Computers & Operations Research 30, 2081–2095 (2003)

    Article  MATH  MathSciNet  Google Scholar 

  13. Gopalakrishnan, M., Mohan, S., He, Z.: A tabu search heuristic for preventive maintenance scheduling. Computers & Industrial Engineering 40, 149–160 (2001)

    Article  Google Scholar 

  14. Bilge, Ü., Kiraç, F., Kurtulan, M., Pekgün, P.: A tabu search algorithm for parallel machine total tardiness problem. Computers & Operations Research 31, 397–414 (2004)

    Article  MATH  Google Scholar 

  15. Abdullah, S., Burke, E.K., McCollum, B.: Using a Randomised Iterative Improvement Algorithm with Composite Neighbourhood Structures for the University Course Timetabling Problem. In: Metaheuristics, pp. 153–169 (2007)

    Google Scholar 

  16. Jihad, S., Abdullah, S.: Investigating composite neighbourhood structure for attribute reduction in rough set theory. In: 2010 10th International Conference on Intelligent Systems Design and Applications (ISDA), pp. 1183–1188 (2010)

    Google Scholar 

  17. Oh, I.S., Lee, J.S., Moon, B.R.: Hybrid genetic algorithms for feature selection. IEEE Transactions on Pattern Analysis and Machine Intelligence, 1424-1437 (2004)

    Google Scholar 

  18. Bandyopadhyay, S., Maulik, U., Wang, J.T.L.: Analysis of biological data: a soft computing approach. World Scientific Pub. Co. Inc. (2007)

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Saif Kifah .

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2015 Springer International Publishing Switzerland

About this paper

Cite this paper

Kifah, S., Abdullah, S., Arajy, Y.Z. (2015). Intelligent Double Treatment Iterative Algorithm for Attribute Reduction Problems. In: Phon-Amnuaisuk, S., Au, T. (eds) Computational Intelligence in Information Systems. Advances in Intelligent Systems and Computing, vol 331. Springer, Cham. https://doi.org/10.1007/978-3-319-13153-5_10

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-13153-5_10

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-13152-8

  • Online ISBN: 978-3-319-13153-5

  • eBook Packages: EngineeringEngineering (R0)

Publish with us

Policies and ethics