An incremental rough set approach for faster attribute reduction

  • N. NandhiniEmail author
  • K. Thangadurai
Original Research


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(kn2) 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.


Machine learning Rough set theory Quick reduct InRS 


  1. 1.
    Almuallim H, Dietterich TG (1994) Learning Boolean concepts in the presence of many irrelevant features. Artif Intell 69(1–2):279–305MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Al-Radaideh QA, Sulaiman MN, Selamat MH, Ibrahim H (2005) Approximate reduct computation by rough sets based attribute weighting. IEEE Proc Int Conf Granul Comput 2:383–386Google Scholar
  3. 3.
    Chan CC (1998) A rough set approach to attribute generalization in data mining. Inf Sci 107(1–4):169–176MathSciNetCrossRefGoogle Scholar
  4. 4.
    Cheng Y (2011) The incremental method for fast computing the rough fuzzy approximations. Data Knowl Eng 70(1):84–100CrossRefGoogle Scholar
  5. 5.
    Chouchoulas A, Shen Q (2001) Rough set-aided keyword reduction for text categorization. Appl Artif Intell 15(9):843–873CrossRefGoogle Scholar
  6. 6.
    Chouchoulas A, Halliwell J, Shen Q (2002) On the implementation of rough set attribute reduction. In: Proceedings of the workshop on computational intelligence, pp. 18–23Google Scholar
  7. 7.
    Hoa NS, Son NH (1996) Some efficient algorithms for rough set methods. Proc IPMU 96:1457–1541Google Scholar
  8. 8.
    Jensen R, Shen Q (2003) Finding rough set reducts with ant colony optimization. IEEE Proc Workshop Comput Intell 1(2):15–22Google Scholar
  9. 9.
    Korzen M, Jaroszewicz S (2005) Finding reducts without building the discernibility matrix. In: IEEE Proceedings of 5th international conference on intelligent systems design and applications, pp. 450–455Google Scholar
  10. 10.
    Lang G, Li Q, Guo L (2013) Discernibility matrix simplification with new attribute dependency functions for incomplete information systems. Knowl Inf Syst 37(3):611–638CrossRefGoogle Scholar
  11. 11.
    Li T, Ruan D, Geert W, Song J, Xu Y (2007) A rough sets based characteristic relation approach for dynamic attribute generalization in data mining. Knowl Based Syst 20(5):485–494CrossRefGoogle Scholar
  12. 12.
    Liang J, Wang F, Dang C, Qian Y (2014) A group incremental approach to feature selection applying rough set technique. IEEE Trans Knowl Data Eng 26(2):294–308CrossRefGoogle Scholar
  13. 13.
    Liu QH, Li F, Min F, Ye M, Yang GW (2005) An efficient knowledge reduction algorithm based on new conditional information entropy. Control Decis (China) 20(8):878–882zbMATHGoogle Scholar
  14. 14.
    Lu Z, Qin Z, Zhang Y, Fang J (2014) A fast feature selection approach based on rough set boundary regions. Pattern Recognit Lett 36:81–88CrossRefGoogle Scholar
  15. 15.
    Luo J, Liu Y, Qin K, Ding H (2017) Incremental update of rough set approximation under the grade indiscernibility relation. Int J Comput Intell Syst 10(1):212–233CrossRefGoogle Scholar
  16. 16.
    Nguyen SH, Nguyen HS (1996) Some efficient algorithms for rough set methods. In: Proceedings of the international conference on information processing and management of uncertainty on knowledge based systems, pp. 1451–1456Google Scholar
  17. 17.
    Pawlak Z (1991) Imprecise categories, approximations and rough sets. In: Leinfellner W, Eberlein G (eds) Rough sets. Springer, Dordrecht, pp. 9–32CrossRefGoogle Scholar
  18. 18.
    Qian J, Miao DQ, Zhang ZH, Li W (2011) Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation. Int J Approx Reason 52(2):212–230MathSciNetCrossRefzbMATHGoogle Scholar
  19. 19.
    Qing-Guo Z, Xue-feng Z, Ming-De Z, Yi-ke Y (2010) New attribute reduction algorithm of incomplete decision table of information quantity. Comput Eng Appl 46(2):19–21Google Scholar
  20. 20.
    Shu W, Shen H (2014) Incremental feature selection based on rough set in dynamic incomplete data. Pattern Recognit 47(12):3890–3906CrossRefGoogle Scholar
  21. 21.
    Sun L, Xu J, Tian Y (2012) Feature selection using rough entropy–based uncertainty measures in incomplete decision systems. Knowl Based Syst 36:206–216CrossRefGoogle Scholar
  22. 22.
    Wang PC (2007) Highly scalable rough set reducts generation. J Inf Sci Eng 23(4):1281–1298Google Scholar
  23. 23.
    Yong L, Wenliang H, Yunliang J, Zhiyong Z (2014) Quick attribute reduct algorithm for neighborhood rough set model. Inf Sci 271:65–81MathSciNetCrossRefzbMATHGoogle Scholar
  24. 24.
    Zhang J, Li T, Ruan D, Liu D (2012) Neighborhood rough sets for dynamic data mining. Int J Intell Syst 27(4):317–342CrossRefGoogle Scholar

Copyright information

© Bharati Vidyapeeth's Institute of Computer Applications and Management 2019

Authors and Affiliations

  1. 1.Department of Computer SciencePeriyar UniversitySalemIndia
  2. 2.PG and Research Department, Department of Computer ScienceGovernment Arts College (Autonomous)KarurIndia
  3. 3.Department of MCASNS College of Technology, AutonomousCoimbatoreIndia

Personalised recommendations