[go: up one dir, main page]
More Web Proxy on the site http://driver.im/ Skip to main content
Springer Nature Link
Log in

Related families-based methods for updating reducts under dynamic object sets

  • Regular Paper
  • Published:
Knowledge and Information Systems Aims and scope Submit manuscript

Abstract

Due to rapid growth of data with respect to time, feature selection in dynamic covering decision information systems (DCDISs) is an important research direction of covering rough set theory, and we have not observed researches on related families-based methods for updating reducts of DCDISs with dynamic object variations. In this paper, we first introduce the concepts of covering decision approximation spaces (CDASs) and dynamic covering decision approximation spaces (DCDASs) when varying object sets, and illustrate the relationship between related sets of CDASs and those of DCDASs. Then incremental learning methods based on related families are provided for feature selection in DCDISs with the addition and deletion of objects. Finally, we develop the corresponding heuristic incremental algorithms for feature selection in DCDISs and employ experimental results on benchmark datasets to demonstrate that these algorithms give satisfactory results in terms of running times.

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

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
£29.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price includes VAT (United Kingdom)

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4

Similar content being viewed by others

References

  1. Das AK, Sengupta S, Bhattacharyya S (2018) A group incremental feature selection for classification using rough set theory based genetic algorithm. Appl Soft Comput 65:400–411

    Article  Google Scholar 

  2. D’eer L, Cornelis C (2015) New neighborhood based rough sets. In: Proceedings of 10th international conference on rough sets and knowledge technology (RSKT2015). LNAI, vol 9436, pp 191–201

  3. D’eer L, Cornelis C (2018) A comprehensive study of fuzzy covering-based rough set models: definitions, properties and interrelationships. Fuzzy Sets Syst 336:1–26

    Article  MathSciNet  MATH  Google Scholar 

  4. D’eer L, Cornelis C, Godo L (2017) Fuzzy neighborhood operators based on fuzzy coverings. Fuzzy Sets Syst 312:17–35

    Article  MathSciNet  MATH  Google Scholar 

  5. D’eer L, Cornelis C, Yao YY (2016) A semantically sound approach to Pawlak rough sets and covering-based rough sets. Int J Approx Reason 78:62–72

    Article  MathSciNet  MATH  Google Scholar 

  6. D’eer L, Restrepo M, Cornelis C, Gómez J (2016) Neighborhood operators for covering based rough sets. Inf Sci 336:21–44

    Article  MATH  Google Scholar 

  7. Frank A, Asuncion A (2010) UCI machine learning repository [http://archive.ics.uci.edu/ml], Irvine, CA: University of California. School of Information and Computer Science

  8. Hu J, Li TR, Luo C, Fujita H, Li SY (2017) Incremental fuzzy probabilistic rough sets over two universes. Int J Approx Reason 81:28–48

    Article  MathSciNet  MATH  Google Scholar 

  9. Huang YY, Li TR, Luo C, Fujita H, Horng SJ (2017) Matrix-based dynamic updating rough fuzzy approximations for data mining. Knowl Based Syst 119:273–283

    Article  Google Scholar 

  10. Huang YY, Li TR, Luo C, Fujita H, Horng SJ (2017) Dynamic variable precision rough set approach for probabilistic set-valued information systems. Knowl Based Syst 122:131–147

    Article  Google Scholar 

  11. Jing YG, Li TR, Huang JF, Zhang YY (2016) An incremental attribute reduction approach based on knowledge granularity under the attribute generalization. Int J Approx Reason 76:80–95

    Article  MathSciNet  MATH  Google Scholar 

  12. Jing YG, Li TR, Luo C, Horng SJ, Wang GY, Yu Z (2016) An incremental approach for attribute reduction based on knowledge granularity. Knowl Based Syst 104:23–48

    Article  Google Scholar 

  13. Jing YG, Li TR, Huang JF, Chen HM, Horng SJ (2017) A group incremental reduction algorithm with varying data values. Int J Intell Syst 32(9):900–925

    Article  Google Scholar 

  14. Jing YG, Li TR, Fujita H, Yu Z, Wang B (2017) An incremental attribute reduction approach based on knowledge granularity with a multi-granulation view. Inf Sci 411:23–38

    Article  MathSciNet  Google Scholar 

  15. Lang GM, Cai MJ, Fujita H, Xiao QM (2018) Related families-based attribute reduction of dynamic covering decision information systems. Knowl Based Syst 162:161–173

    Article  Google Scholar 

  16. Liu JH, Lin YJ, Li YW, Weng W, Wu SX (2018) Online multi-label streaming feature selection based on neighborhood rough set. Pattern Recognit 84:273–287

    Article  Google Scholar 

  17. Luo C, Li TR, Yao YY (2017) Dynamic probabilistic rough sets with incomplete data. Inf Sci 417:39–54

    Article  Google Scholar 

  18. Luo C, Li TR, Chen HM, Fujita H, Zhang Y (2018) Incremental rough set approach for hierarchical multicriteria classification. Inf Sci 429:72–87

    Article  MathSciNet  Google Scholar 

  19. Ma LW (2018) The investigation of covering rough sets by Boolean matrices. Int J Approx Reason 100:69–84

    Article  MathSciNet  MATH  Google Scholar 

  20. Ma MH, Chakraborty MK (2016) Covering-based rough sets and modal logics: part I. Int J Approx Reason 77:55–65

    Article  MathSciNet  MATH  Google Scholar 

  21. Ma MH, Chakraborty MK (2018) Covering-based rough sets and modal logics: part II. Int J Approx Reason 95:113–123

    Article  MathSciNet  MATH  Google Scholar 

  22. Restrepo M, Cornelis C, Gómez J (2014) Partial order relation for approximation operators in covering based rough sets. Inf Sci 284:44–59

    Article  MathSciNet  MATH  Google Scholar 

  23. Restrepo M, Cornelis C, Gómez J (2014) Duality, conjugacy and adjointness of approximation operators in covering based rough sets. Int J Approx Reason 55(1):469–485

    Article  MathSciNet  MATH  Google Scholar 

  24. Shakiba A, Hooshmandasl MR (2016) Data volume reduction in covering approximation spaces with respect to twenty-two types of covering based rough sets. Int J Approx Reason 75:13–38

    Article  MathSciNet  MATH  Google Scholar 

  25. Tian G, Huang JJ, Peng M, Zhu JH, Zhang YC (2017) Dynamic sampling of text streams and its application in text analysis. Knowl Inf Syst 53(2):507–531

    Article  Google Scholar 

  26. Wang JQ, Zhang XH (2019) Matrix approaches for some issues about minimal and maximal descriptions in covering-based rough sets. Int J Approx Reason 104:126–143

    Article  MathSciNet  MATH  Google Scholar 

  27. Yang YY, Chen DG, Wang H, Tsang ECC, Zhang DL (2017) Fuzzy rough set based incremental attribute reduction from dynamic data with sample arriving. Fuzzy Sets Syst 312:66–86

    Article  MathSciNet  MATH  Google Scholar 

  28. Yang B, Hu BQ (2016) A fuzzy covering-based rough set model and its generalization over fuzzy lattice. Inf Sci 367:463–486

    Article  Google Scholar 

  29. Yang X, Li TR, Liu D, Chen HM, Luo C (2017) A unified framework of dynamic three-way probabilistic rough sets. Inf Sci 420:126–147

    Article  MathSciNet  Google Scholar 

  30. Yang X, Li TR, Fujita H, Liu D, Yao YY (2017) A unified model of sequential three-way decisions and multilevel incremental processing. Knowl Based Syst 134:172–188

    Article  Google Scholar 

  31. Yang T, Li QG, Zhou BL (2013) Related family: a new method for attribute reduction of covering information systems. Inf Sci 228:175–191

    Article  MathSciNet  MATH  Google Scholar 

  32. Yao YY (2018) Three-way decision and granular computing. Int J Approx Reason 103:107–123

    Article  MATH  Google Scholar 

  33. Yao YY, Yao BX (2012) Covering based rough set approximations. Inf Sci 200:91–107

    Article  MathSciNet  MATH  Google Scholar 

  34. Yuan PP, Xie CF, Jin H, Liu L, Yang G, Shi XH (2014) Dynamic and fast processing of queries on large-scale RDF data. Knowl Inf Syst 41(2):311–334

    Article  Google Scholar 

  35. Yu JH, Chen MH, Xu WH (2017) Dynamic computing rough approximations approach to time-evolving information granule interval-valued ordered information system. Appl Soft Comput 60:18–29

    Article  Google Scholar 

  36. Yu ZM, Li JJ, Wang P, Zhang YL, Yun ZQ (2018) Axiomatization of covering-based approximation operators generated by general or irreducible coverings. Int J Approx Reason 103:383–393

    Article  MathSciNet  MATH  Google Scholar 

  37. Yue XD, Chen YF, Miao DQ, Fujita H (2018) Fuzzy neighborhood covering for three-way classification. Inf Sci. https://doi.org/10.1016/j.ins.2018.07.065

  38. Zakowski W (1983) Approximations in the space \((u, \pi )\). Demonstr Math 16:761–769

    MathSciNet  MATH  Google Scholar 

  39. Zhan JM, Sun BZ, Alcantud JCR (2019) Covering based multigranulation (I, T)-fuzzy rough set models and applications in multi-attribute group decision-making. Inf Sci 476:290–318

    Article  MathSciNet  Google Scholar 

  40. Zhu W (2009) Relationship between generalized rough sets based on binary relation and coverings. Inf Sci 179(3):210–225

    Article  MathSciNet  MATH  Google Scholar 

Download references

Acknowledgements

We are very grateful to the anonymous reviewers for their valuable suggestions. This work is supported by the National Natural Science Foundation of China (Nos. 61603063, 11771059, 61573255, 61673301), the Natural Science Foundation of Hunan Province (Nos. 2018JJ3518, 2018JJ2027), and the Scientific Research Fund of Hunan Provincial Key Laboratory of Mathematical Modeling and Analysis in Engineering (No. 2018MMAEZD10).

Author information

Authors and Affiliations

  1. School of Mathematics and Statistics, Changsha University of Science and Technology, Changsha, 410114, Hunan, People’s Republic of China

    Guangming Lang

  2. Department of Computer Science and Technology, Tongji University, Shanghai, 201804, People’s Republic of China

    Guangming Lang & Hongyun Zhang

  3. Hunan Provincial Key Laboratory of Mathematical Modeling and Analysis in Engineering, Changsha, 410114, Hunan, People’s Republic of China

    Guangming Lang

  4. College of Mathematics and Econometrics, Hunan University, Changsha, 410004, Hunan, People’s Republic of China

    Qingguo Li & Mingjie Cai

  5. Faculty of Software and Information Science, Iwate Prefectural University, Iwate, 020-0693, Japan

    Hamido Fujita

Authors
  1. Guangming Lang
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Qingguo Li
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Mingjie Cai
    View author publications

    You can also search for this author in PubMed Google Scholar

  4. Hamido Fujita
    View author publications

    You can also search for this author in PubMed Google Scholar

  5. Hongyun Zhang
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Mingjie Cai.

Additional information

Publisher's Note

Springer Nature remains neutral with regard to jurisdictional claims in published maps and institutional affiliations.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Lang, G., Li, Q., Cai, M. et al. Related families-based methods for updating reducts under dynamic object sets. Knowl Inf Syst 60, 1081–1104 (2019). https://doi.org/10.1007/s10115-019-01359-w

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10115-019-01359-w

Keywords

Search

Navigation