Skip to main content
Log in

Representative-based classification through covering-based neighborhood rough sets

  • Published:
Applied Intelligence Aims and scope Submit manuscript

Abstract

Considerable progress has been made in the theory of covering-based rough sets. However, there has been a lack of research on their application to classification tasks, especially for nominal data. In this paper, we propose a representative-based classification approach for nominal data using covering-based rough sets. The classifier training task considers three issues. First, we define the neighborhood of an instance. The size of the neighborhood is determined by a similarity threshold θ. Second, we determine the maximal neighborhood of each instance in the positive region by computing its minimal θ value. These neighborhoods form a covering of the positive region. Third, we employ two covering reduction techniques to select a minimal set of instances called representatives. To classify a new instance, we compute its similarity with each representative. The similarity and minimal θ of the representative determine the distance. Representatives with the minimal distance are employed to obtain the class label. Experimental results on different datasets indicate that the classifier is comparable with or better than the ID3, C4.5, NEC, and NCR algorithms.

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6

Similar content being viewed by others

References

  1. Fayyad U, Piatetsky-Shapiro G, Smyth P (1996) From data mining to knowledge discovery in databases. AI Mag 17(3):37

    Google Scholar 

  2. Quinlan J (1986) Induction of decision trees. Mach Learn 1:81–106

    Google Scholar 

  3. Li HX, Zhou XZ (2011) Risk decision making based on decision-theoretic rough set: a three-way view decision model. Int J Comput Intell Syst 4(1):1–11

    Article  Google Scholar 

  4. Homaifar A, McCormick E (1995) Simultaneous design of membership functions and rule sets for fuzzy controllers using genetic algorithms. Fuzzy Syst 3:129–139

    Article  Google Scholar 

  5. Li HX, Yao YY, Zhou XZ, Huang B (2009) A two-phase model for learning rules from incomplete data. Fundam Inform 94:219–232

    MATH  MathSciNet  Google Scholar 

  6. Liu D, Li TR, Li HX (2012) A multiple-category classification approach with decision-theoretic Rough sets. Fundam Inform 155(2–3):173–188

    Google Scholar 

  7. Hornik K, Stinchcombe M, White H (1989) Multilayer feedforward networks are universal approximators. Neural Netw 2:359–366

    Article  Google Scholar 

  8. Joachims T (1999) Making large scale svm learning practical

  9. Schuldt C, Laptev I, Caputo B (2004) Recognizing human actions: a local svm approach. In: Proceedings of the 17th international conference on pattern recognition, 2004, vol 3. ICPR 2004. IEEE, pp 32–36

  10. Zhang ML, Zhou ZH (2007) Ml-knn: a lazy learning approach to multi-label learning. Pattern Recognit 40

  11. Atkeson CG, Moore AW, Schaal S (1997) Locally weighted learning for control. Lazy Learn 54:75–113

    Article  Google Scholar 

  12. Zakowski W (1983) Approximations in the space (u, π). Demonstr Math 16(40):7x61–769

    MathSciNet  Google Scholar 

  13. Yao J, Ciucci D, Zhang Y (2015) Generalized rough sets. Springer, Berlin

    Book  Google Scholar 

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

    Article  MATH  Google Scholar 

  15. Zhu W (2007) Topological approaches to covering rough sets. Inf Sci 177(6):1499–1508

    Article  MATH  Google Scholar 

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

    Article  MATH  Google Scholar 

  17. Zhu W (2009) Relationship among basic concepts in covering-based rough sets. Inf Sci 179(14):2478–2486

    Article  MATH  Google Scholar 

  18. Wang SP, Zhu W (2011) Matroidal structure of covering-based rough sets through the upper approximation number. Int J Granul Comput Rough Sets Intell Syst 2:141–148

    Article  Google Scholar 

  19. Wang SP, Zhu W, Zhu QX, Min F (2014) Characteristic matrix of covering and its application to boolean matrix decomposition. Inf Sci 263:186–197

    Article  MathSciNet  Google Scholar 

  20. Hu QH, An S, Yu DR (2010) Soft fuzzy rough sets for robust feature evaluation and selection. Inf Sci 180:4384–4400

    Article  MathSciNet  Google Scholar 

  21. Hu QH, Xie ZX, Yu DR (2007) Hybrid attribute reduction based on a novel fuzzy-rough model and information granulation. Pattern Recognit 40:3509–3521

    Article  MATH  Google Scholar 

  22. Hu QH, Yu DR, Liu JF, Wu CX (2008) Neighborhood rough set based heterogeneous feature subset selection. Inf Sci 178:3577–3594

    Article  MATH  MathSciNet  Google Scholar 

  23. Du Y, Hu Q, Zhu P, Ma P (2011) Rule learning for classification based on neighborhood covering reduction. Inf Sci 181(24):5457–5467

    Article  MathSciNet  Google Scholar 

  24. Sun L, Xu JC, Tian Y (2012) Feature selection using rough entropy-based uncertainty measures in incomplete decision systems. Knowl-Based Syst 36:206–216

    Article  Google Scholar 

  25. Hu QH, Yu DR, Xie ZX (2008) Neighborhood classifiers. Expert Syst Appl 34:866–876

    Article  Google Scholar 

  26. Satterthwaite MA (1975) Strategy-proofness and arrow’s conditions: existence and correspondence theorems for voting procedures and social welfare functions. J Econ Theory 10:187–217

    Article  MATH  MathSciNet  Google Scholar 

  27. Blake CL, Merz CJ (1998) UCI repository of machine learning databasesn, http://www.ics.uci.edu/~mlearn/MLRepository.html

  28. Utgoff PE (1987) Id: an incremental id3

  29. Quinlan JR (1993) C4. 5: programs for machine learning, vol 1. Morgan Kaufmann, San Mateo

    Google Scholar 

  30. Quinlan JR (1996) Bagging, boosting, and c4. 5. In: AAAI/IAAI,

  31. Peterson R, Silver EA (1979) Decision systems for inventory management and production planning. Wiley, New York

    Google Scholar 

  32. Lin CT, Lee CSG (1991) Neural-network-based fuzzy logic control and decision system. IEEE Trans Comput 40(12):1320–1336

    Article  MathSciNet  Google Scholar 

  33. Yao YY (2004) A partition model of granular computing. Lect Notes Comput Sci 3100:232–253

    Article  Google Scholar 

  34. Larose DT (2014) Discovering knowledge in data: an introduction to data mining. Wiley, New York

    Book  Google Scholar 

  35. Zhao Y, Yao YY, Luo F (2007) Data analysis based on discernibility and indiscernibility. Inf Sci 177:4959–4976

    Article  MATH  Google Scholar 

  36. Liu QH, Li F, Min F, Ye M, Yang GW (2005) An efficient reduction algorithm based on new conditional information entropy. Control Decis (in Chinese) 20(8):878–882

    MATH  Google Scholar 

  37. Liu QH, Chen LT, Zhang JZ, Min F (2006) Knowledge reduction in inconsistent decision tables. In: Advanced data mining and applications. Springer, pp 626–635

  38. He X, Min F, Zhu W (2013) Parametric rough sets with application to granular association rule mining. Math Probl Eng 2013

  39. Pawlak Z, Skowron A (2007) Rough sets: some extensions. Inf Sci 177:28–40

    Article  MATH  MathSciNet  Google Scholar 

  40. Boriah S, Chandola V, Kumar V (2008) Similarity measures for categorical data: a comparative evaluation. In: Proceedings of the SIAM international conference on data mining, SDM 2008, April 24–26, 2008. Atlanta, pp 243–254

  41. Zhu W, Wang FY (2003) Reduction and axiomatization of covering generalized rough sets. Inf Sci 152:217–230

    Article  MATH  Google Scholar 

  42. Yang T, Li Q (2010) Reduction about approximation spaces of covering generalized rough sets. Int J Approx Reason 51:335–345

    Article  MATH  Google Scholar 

  43. Bianucci D, Cattaneo G, Ciucci D (2007) Entropies and co-entropies of coverings with application to incomplete information systems. Fundam Inform 75(1–4):77–105

    MATH  MathSciNet  Google Scholar 

  44. Bianucci D, Cattaneo G (2009) Information entropy and granulation co-entropy of partitions and coverings: a summary. Trans Rough Sets X 5656:15–66

    Article  Google Scholar 

  45. Min F, ZhuW(2012) Attribute reduction of data with error ranges and test costs. Inf Sci 211:48–67

    Article  MATH  MathSciNet  Google Scholar 

  46. Wang GY, Yu H, Hu F et al (2013) Test-cost-sensitive attribute reduction in decision-theoretic rough sets. In: Multi-disciplinary trends in artificial intelligence. Springer, pp 143–152

  47. Min F, He HP, Hua Qian Y, Zhu W (2011) Test-cost-sensitive attribute reduction. Inf Sci 181 (22):4928–4942

    Article  Google Scholar 

  48. Min F, Liu QH (2009) A hierarchical model for test-cost-sensitive decision systems. Inf Sci 179(14):2442–2452

    Article  MATH  MathSciNet  Google Scholar 

  49. Barakat N (2013) Feature ranking utilizing support vector machines’ svs. In: 2013 third international conference on innovative computing technology (INTECH). IEEE, pp 401–406

  50. Zhao H, Zhu W (2014) Optimal cost-sensitive granularization based on rough sets for variable costs. Knowl-Based Syst 65:72–82

    Article  Google Scholar 

  51. Selakov A, Cvijetinović D, Milović L, Mellon S, Bekut D (2014) Hybrid pso–svm method for short-term load forecasting during periods with significant temperature variations in city of burbank. Appl Soft Comput 16:80–88

    Article  Google Scholar 

  52. Blumer A, Ehrenfeucht A, Haussler D, Warmuth MK (1987). Inf Process Lett 24(6):377–380

    Article  MATH  MathSciNet  Google Scholar 

  53. Cimiano P, Staab S (2004) Learning by googling. ACM SIGKDD Explorations Newsletter 6(2):24–33

    Article  Google Scholar 

  54. Lu Q, Getoor L (2003) Link-based classification. In: ICML, vol 3, pp 496–503

Download references

Acknowledgments

This work is in part supported by the National Natural Science Foundation of China under Grant Nos. 61379089, 61379049 and Department of Education of Sichuan Province under Grant No. 13ZA0136.

Author information

Authors and Affiliations

Authors

Corresponding author

Correspondence to Fan Min.

Rights and permissions

Reprints and permissions

About this article

Check for updates. Verify currency and authenticity via CrossMark

Cite this article

Zhang, BW., Min, F. & Ciucci, D. Representative-based classification through covering-based neighborhood rough sets. Appl Intell 43, 840–854 (2015). https://doi.org/10.1007/s10489-015-0687-5

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s10489-015-0687-5

Keywords

Navigation