Skip to main content
SpringerLink
Log in

Bidirectional heuristic attribute reduction based on conflict region

  • Methodologies and Application
  • Published:
Soft Computing Aims and scope Submit manuscript

Abstract

Attribute reduction is one of the key issues in rough set theory. Many heuristic reduction strategies such as forward heuristic reduction, backward heuristic reduction and for-backward heuristic reduction have been proposed to obtain a subset of attributes which has the same discernibility as the original attribute set. However, some methods are usually computationally time consuming for large data sets. Therefore, this paper focuses on solving the attribute reduction efficiency in the decision system. We first introduce the quotient of approximation, positive region and conflict region, and then research the heuristic reduction algorithm based on conflict region. Sequentially, we put forward to a mechanism of bidirectional heuristic attribute reduction based on conflict region quotient and design a bidirectional heuristic attribute reduction algorithm. Finally, the experimental results with UCI data sets show that the proposed reduction algorithm is an effective technique to deal with large high-dimensional data sets.

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

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  • Amaldi E, Kann V (1998) On the approximation of minimizing non zero variables or unsatisfied relations in linear systems. Theor Comput Sci 209(1–2):237–260

    Article  MATH  MathSciNet  Google Scholar 

  • Chouchoulas A, Shen Q (2001) Rough set-aided key word reduction for text categorization. Appl Artif Intell 15(9):843–873

    Article  Google Scholar 

  • Dash M, Liu H (2003) Consistency-based search in feature selection. Artif Intell 151(1–2):155–176

    Article  MATH  MathSciNet  Google Scholar 

  • Düntsch I, Gediga G (1998) Uncertainty measures of rough set prediction. Artif Intell 106(1):109–137

    Article  MATH  Google Scholar 

  • Fayyad UM, Shapiro LP, Smyth P, Uthurusamy R (1996) Advances in knowledge discovery and data mining. MIT Press, California

    Google Scholar 

  • Ge H, Li LS, Yang CJ (2012) A efficient attribute reduction algorithm based on conflict region. Chin J Comput 35(2):342–350

    Article  MathSciNet  Google Scholar 

  • Guan LH (2007) A new algorithm for attribute reduction based on discernibility matrix. In: Proceedings of the second international conference of fuzzy information and engineering, pp 373–381

  • Guyon I, Elisseeff A (2003) An introduction to variable feature selection. J Mach Learn Res 3(3):1157–1182

    MATH  Google Scholar 

  • Hu XH, Cercone N (1995) Learning in relational databases: a rough set approach. Int J Comput Intel 11(2):323–338

    Article  Google Scholar 

  • Jain AK, Duin RPW, Mao JC (2000) Statistical pattern recognition: a review. IEEE Trans Pattern Anal 22(1):224–37

    Article  Google Scholar 

  • Kohavi R, John GH (1997) Wrappers for feature subset selection. Artif Intell 97(1–2):273–324

    Article  MATH  Google Scholar 

  • Korze M, Jaroszewicz S (2005) Finding reducts without building the discernibility matrix. In: Proceedings of 5th international conference on intelligent systems design and applications, pp 450–455

  • Kryszkiewicz M (2001) Comparative studies of alternative type of knowledge reduction in inconsistent systems. Int J Intell Syst 16(1):105–120

    Article  MATH  Google Scholar 

  • Kryszkiewicz M (2007) Certain, generalized decision, and membership distribution reducts versus functional dependencies in incomplete systems. In: Proceedings of rough sets and intelligent systems paradigms, pp 162–174

  • Li M, Shang CX, Feng SZ, Fan JP (2014) Quick attribute reduction in inconsistent decision tables. Inf Sci 254:155–180

    Article  MathSciNet  Google Scholar 

  • Liang JY, Xu ZB (2002) The algorithm on knowledge reduction in incomplete information systems. Int J Uncert Fuzziness Knowl-Based Syst 10(1):95–103

    Article  MATH  MathSciNet  Google Scholar 

  • Liang JY, Mi JR, Wei W, Wang F (2013) An accelerator for attribute reduction based on perspective of objects and attributes. Knowl-Based Syst 44:90–100

    Article  Google Scholar 

  • Liang JY, Wang F, Deng CY, Qian YH (2012) An efficient rough feature selection algorithm with a multi-granulation view. Int J Approx Reson 53(6):912–926

    Article  Google Scholar 

  • Liu H, Motoda H (1998) Feature selection for knowledge discovery and data mining. Kluwer, Boston

    Book  MATH  Google Scholar 

  • Liu H, Yu L (2005) Toward integrating feature selection algorithms for classification and clustering. IEEE Trans Knowl Data Eng 17(4):491–502

  • Liu QH, Cai HB, Min F, Wang GW (2005) Knowledge reduction in a new information view. In: Proceedings of international conference on communications, pp 1051–1055

  • Liu SH, Seng QJ, Wu B, Shi ZZ, Hu F (2003) Research on efficient algorithms for rough set methods. Chin J Comput 26(5):524–529

    Google Scholar 

  • Liu Y, Huang WL, Jiang YL, Zeng ZY (2014) Quick attribute reduct algorithm for neighborhood rough set model. Inf Sci. doi:10.1016/j.ins.2014.02.093

  • Liu Y, Xiong R, Chu J (2009) Quick attribute reduction algorithm with hash. Chin J Comput 32(8):1494–1499

    Google Scholar 

  • Meng ZQ, Shi ZZ (2009) Novel heuristic algorithm for knowledge reduction. J Chin Comput Syst 30(7):1249–1255

    Google Scholar 

  • Miao DQ, Hu GR (1996) A heuristic algorithm for reduction of knowledge. Chin J Comput Res Develop 36(6):681–684

    Google Scholar 

  • Miao DQ, Wang J (1999) An information representation of the concepts and operations in rough set theory. Chin J Soft 10(2):113–116

    Google Scholar 

  • Miao DQ, Zhao Y, Yao YY, Li HX, Xu FF (2009) Relative reducts in consistent and inconsistent decision tables of the Pawlak rough set model. Inf Sci 179(24):4140–4150

    Article  MATH  MathSciNet  Google Scholar 

  • Modrzejewski M (1993) Feature selection using rough sets theory. In: Proceedings of the European conference on machine learning, pp 213–226

  • 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–1456

  • Pawlak Z (1982) Rough sets. Int J Comput Inf Sci 5(11):341–356

    Article  MathSciNet  Google Scholar 

  • Pawlak Z (1991) Rough sets theoretical aspects of reasoning about data. Kluwer, Boston

    MATH  Google Scholar 

  • Pawlak Z (2002) Rough sets and intelligent data analysis. Inf Sci 147(1–4):1–12

    Article  MATH  MathSciNet  Google Scholar 

  • Peng H, Long F, Ding C (2005) Feature selection based on mutual information criteria of max-dependency, max-relevance, and min-redundancy. IEEE Trans Pattern Anal Mach Intell 27(8):1226–1238

    Article  Google Scholar 

  • Qian YH, Liang JY (2008) Combination entropy and combination granulation in rough set theory. Int J Uncert Fuzziness Knowle-Based Syst 16(2):179–193

    Article  MATH  MathSciNet  Google Scholar 

  • Qian YH, Liang JY, Pedrycz W, Dang CY (2010) Positive approximation: an accelerator for attribute reduction in rough set theory. Artif Intell 174:597–618

    Article  MATH  MathSciNet  Google Scholar 

  • Qian YH, Liang JY, Pedrycz W, Dang CY (2011a) An efficient accelerator for attribute reduction from incomplete data in rough set framework. Pattern Recogn 44(8):1658–1670

    Article  MATH  Google Scholar 

  • Qian J, Miao DQ, Zhang ZH, Li W (2011b) Hybrid approaches to attribute reduction based on indiscernibility and discernibility relation. Int J Approx Reason 52(2):212–230

    Article  MATH  MathSciNet  Google Scholar 

  • Quinlan R (1986) Induction of decision rules. Mach Learn 1(1):81–106

    Google Scholar 

  • Saeys Y, Inza I, Larrañaga P (2007) A review of feature selection techniques in bioinformatics. Bioinformatics 23(19):2507–2517

    Article  Google Scholar 

  • Shen Q, Chouchoulas A (2000) A modular approach to generating fuzzy rules with reduced attributes for the monitoring of complex systems. Eng Appl Artif Intell 13(3):263–278

    Article  Google Scholar 

  • Shen Q, Chouchoulas A (2002) A rough-fuzzy approach for generating classification rules. Pattern Recogn 35(11):2438–2452

    Google Scholar 

  • Shen Q, Jensen R (2004) Selecting informative features with fuzzy-rough sets and its application for complex systems monitoring. Pattern Recogn 37(7):1351–1363

    Article  MATH  Google Scholar 

  • Skowron A, Rauszer C (1992) The discernibility matrices and functions in information systems. Intelligent decision support, handbook of applications and advances of the rough sets theory. Kluwer, Dordrecht, pp 331–362

    Google Scholar 

  • Slezak D (2002) Approximate entropy reducts. Fund Inf 53(3–4):365–390

    MathSciNet  Google Scholar 

  • Swiniarski RW, Skowron A (2003) Rough set methods in feature selection and recognition. Pattern Recogn Lett 24(6):833–849

    Article  MATH  Google Scholar 

  • Wang GY, Hu F (2007) Quick knowledge reduction based on divide and conquer method in huge data sets. In: Proceedings of the 2nd international conference on pattern recognition and machine intelligence, pp 312–315

  • Wang GY, Yu H, Yang DC (2002) Decision Table Reduction based on conditional information entropy. Chin J Comput 25(7):759–766

    MathSciNet  Google Scholar 

  • Wang GY, Zhao J, An JJ, Wu Y (2005) A comparative study of algebra viewpoint and information viewpoint in attribute reduction. Fund Inform 68(3):289–301

    MATH  MathSciNet  Google Scholar 

  • Wang J, Wang R, Miao DQ, Guo M, Ruan YS, Yuan XH, Zhao K (1998) Data enriching based on rough set theory. C J Comput 21(5):393–400

    Google Scholar 

  • Wang J, Wang J (2001) Reduction algorithms based on discernibility matrix: the ordered attributes method. J Comput Sci Technol 16(6):489–04

    Article  MATH  Google Scholar 

  • Wong S, Ziarko W (1985) On optimal decision rules in decision tables. University of Regina, Department of Computer Science, pp 693–696

  • Xu ZY, Liu ZP, Yang BR, Song W (2006) A quick attribute reduction algorithm with complexity of max(O(\(\vert C\vert \vert U\vert )\), O(\(\vert C\vert ^{2}\vert U\)/\(C\vert ))\). Chin J Comput 29(3):611–615

  • Yao YY, Zhao Y (2009) Discernibility matrix simplification for constructing attribute reducts. Inf Sci 179(7):867–882

  • Zhang J, Wang J, Li D, He H, Sun J (2003a) A new heuristic reduct algorithm base on rough sets theory. LNCS 2762. Springer, Berlin

    Google Scholar 

  • Zhang WX, Mi JS, Wu WZ (2003b) Approaches to knowledge reductions in inconsistent systems. Int J Intell Syst 18(9):989–1000

    Article  MATH  Google Scholar 

  • Zhang WX, Mi JS, Wu WZ (2003c) Knowledge reduction in inconsistent information systems. Chin J Comput 1:12–18

    MathSciNet  Google Scholar 

  • Zhang Z, Ye N (2011) Locality preserving multimodal discriminative learning for supervised feature selection. Knowl Inf Syst 27(3):473–490

    Article  Google Scholar 

  • Zhong N, Dong J, Ohsuga S (2001) Using rough sets with heuristics for feature selection. J Int Inform Syst 16(3):199–214

    Article  MATH  Google Scholar 

  • Zhou J, Miao DQ, Pedrycz W, Zhang HY (2011) Analysis of alternative objective functions for attribute reduction in complete decision tables. Soft Comput 15:1601–1616

    Article  MATH  Google Scholar 

Download references

Acknowledgments

Research on this work is partially supported by the grants from the National Science Foundation of China (No. 5130711), by the funds from Anhui Provincial Natural Science Foundation (No. 1308085QF114), by the funds from Anhui Education Natural Science Foundation (Nos. KJ2013A015, KJ2012A212), and by the fund from Key Laboratory of Computation Intelligence and Signal Processing of Education Ministry Foundation.

Author information

Authors and Affiliations

  1. Key Laboratory of Computation Intelligence and Signal Processing of Education Ministry, School of Computer Science and Technology, Anhui University, Hefei, 230601, People’s Republic of China

    Hao Ge, Longshu Li & Yi Xu

  2. School of Mechanical and Electronic Engineering, Chuzhou University, Chuzhou, 239000, People’s Republic of China

    Hao Ge

  3. School of Computer and Information Engineering, Chuzhou University, Chuzhou, 239000, People’s Republic of China

    Chuanjian Yang

Authors
  1. Hao Ge
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Longshu Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Yi Xu
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Chuanjian Yang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Hao Ge.

Additional information

Communicated by V. Loia.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Ge, H., Li, L., Xu, Y. et al. Bidirectional heuristic attribute reduction based on conflict region. Soft Comput 19, 1973–1986 (2015). https://doi.org/10.1007/s00500-014-1382-x

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00500-014-1382-x

Keywords

Search

Navigation