On Granular Rough Computing: Covering by Joint and Disjoint Granules in Epsilon Concept Dependent Granulation

  • Piotr ArtiemjewEmail author
  • Jacek Szypulski
Conference paper
Part of the Smart Innovation, Systems and Technologies book series (SIST, volume 57)


In this work we present the optimization methods of epsilon concept-dependent granulation. We consider two cases of parallel covering and granulation, based on joint and disjoint granules. Additionally we check two variants of majority voting, the first one based on descriptors, which are epsilon-indiscernible with the centers of granules, and the second variant uses all descriptors of respective granules. We verify the effectiveness of our methods on the real data sets from UCI Repository using the SVM classifier. It turned out that disjoint granules versus joint give almost identical results of classification with a significant acceleration of the granulation process. Additionally, the majority voting, based on the epsilon indiscernible descriptors, stabilised the process of granulation in terms of the accuracy of classification. This is a significant result, which lets us to accelerate the process of classification for many popular classifiers at least for k-NN, Naive Bayes, many rough set methods and the SVM classifier, which is supported by our recent works.


Rough sets Decision systems SVM Granular rough computing Epsilon concept-dependent granulation Majority voting 



The research has been supported by grant 1309-802 from the Ministry of Science and Higher Education of the Republic of Poland.


  1. 1.
    Artiemjew, P.: On strategies of knowledge granulation and applications to decision systems. Polkowski, L., Supervisor, Ph.D. Dissertation, Polish Japanese Institute of Information Technology, Warsaw (2009)Google Scholar
  2. 2.
    Artiemjew, P.: A review of the knowledge granulation methods: discrete versus continuous algorithms. In: Rough Sets and Intelligent Systems—Professor Zdzisław Pawlak in Memoriam, vol. 2, pp. 41–59. Springer, Heidelberg (2013)CrossRefGoogle Scholar
  3. 3.
    Boser, B.E., Guyon, I.M., Vapnik, V.N.: A training algorithm for optimal margin classifiers. In: Proceedings of the Fifth Annual Workshop on Computational Learning Theory, COLT ’92, pp. 144–152. ACM, New York, NY, USA (1992)Google Scholar
  4. 4.
    Chang, C.C., Lin, C.J.: Libsvm: A library for support vector machines. ACM Trans. Intell. Syst. Technol. 2(3), 27:1–27:27 (2011)CrossRefGoogle Scholar
  5. 5.
    Polkowski, L.: Formal granular calculi based on rough inclusions. In: 2005 IEEE International Conference on Granular Computing, vol. 1, pp. 57–69 (2005)Google Scholar
  6. 6.
    Polkowski, L.: Granulation of knowledge in decision systems: the approach based on rough inclusions. The method and its applications. In: Proceedings of International Conference on Rough Sets and Intelligent Systems Paradigms, RSEISP 2007, Warsaw, Poland, 28–30 June 2007, pp. 69–79. Springer, Heidelberg (2007)Google Scholar
  7. 7.
    Polkowski, L.: Approximate Reasoning by Parts: An Introduction to Rough Mereology, 1st edn. Springer Publishing Company (2011)Google Scholar
  8. 8.
    Polkowski, L., Artiemjew, P.: Granular Computing in Decision Approximation: An Application of Rough Mereology. Springer Publishing Company (2015)Google Scholar
  9. 9.
    Szypulski, J., Artiemjew, P.: The rough granular approach to classifier synthesis by means of SVM. In: Proceedings of the 15th International Conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing, RSFDGrC 2015. Tianjin, China, 20–23 Nov 2015, pp. 256–263. Springer International Publishing, Cham (2015)Google Scholar
  10. 10.
    Tibshirani, R.J., Tibshirani, R.: A bias correction for the minimum error rate in cross-validation. Ann. Appl. Stat. 3(2), 822–829 (2009)MathSciNetCrossRefGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2016

Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (, which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.

The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.

Authors and Affiliations

  1. 1.Department of Mathematics and Computer ScienceUniversity of Warmia and MazuryOlsztynPoland

Personalised recommendations