{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T23:15:30Z","timestamp":1761174930823,"version":"build-2065373602"},"reference-count":33,"publisher":"Polish Information Processing Society","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.15439\/2025f0110","type":"proceedings-article","created":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:44:23Z","timestamp":1761119063000},"page":"195-205","source":"Crossref","is-referenced-by-count":0,"title":["Estimating the entropy of covering-based rough set\napproximation operators"],"prefix":"10.15439","volume":"43","author":[{"ORCID":"https:\/\/orcid.org\/0009-0005-1597-1023","authenticated-orcid":true,"given":"Wannes De","family":"Maeyer","sequence":"first","affiliation":[{"name":"Ghent University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-0818-468X","authenticated-orcid":true,"given":"Steven Van","family":"Overberghe","sequence":"additional","affiliation":[{"name":"Ghent University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-6852-4041","authenticated-orcid":true,"given":"Chris","family":"Cornelis","sequence":"additional","affiliation":[{"name":"Ghent University"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Mauricio Restrepo","family":"L\u00f3pez","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"6175","published-online":{"date-parts":[[2025,10,15]]},"reference":[{"key":"ref1","doi-asserted-by":"publisher","unstructured":"Z. Pawlak, \u201cRough sets,\u201d International Journal of Computer and Information Sciences, vol. 11, no. 5, pp. 341\u2013356, 1982. https:\/\/dx.doi.org\/10.1007\/BF01001956","DOI":"10.1007\/BF01001956"},{"key":"ref2","doi-asserted-by":"crossref","unstructured":"Y. Yao, \u201cOn generalizing rough set theory,\u201d in Lecture\nNotes in Computer Science. Berlin, Heidelberg: Springer\nBerlin Heidelberg, 2007, pp. 44\u201351.","DOI":"10.1007\/3-540-39205-X_6"},{"key":"ref3","doi-asserted-by":"publisher","unstructured":"Z. Shi and Z. Gong, \u201cThe further investigation of\ncovering-based rough sets: Uncertainty characterization,\nsimilarity measure and generalized models,\u201d Information\nSciences, vol. 180, no. 19, pp. 3745\u20133763, 2010. https:\/\/dx.doi.org\/10.1016\/j.ins.2010.06.020","DOI":"10.1016\/j.ins.2010.06.020"},{"key":"ref4","doi-asserted-by":"publisher","unstructured":"T. Yang and Q. Li, \u201cReduction about approximation\nspaces of covering generalized rough sets,\u201d\nInternational Journal of Approximate Reasoning,\nvol. 51, no. 3, pp. 335\u2013345, 2010. https:\/\/dx.doi.org\/10.1016\/j.ijar.2009.11.001","DOI":"10.1016\/j.ijar.2009.11.001"},{"key":"ref5","doi-asserted-by":"publisher","unstructured":"I. Couso and D. Dubois, \u201cRough sets, coverings and\nincomplete information,\u201d Fundam. Inform., vol. 108, pp.\n223\u2013247, 01 2011. https:\/\/dx.doi.org\/10.3233\/FI-2011-421","DOI":"10.3233\/FI-2011-421"},{"key":"ref6","doi-asserted-by":"publisher","unstructured":"J. J\u00e4rvinen and S. Radeleczki, \u201cRough sets determined\nby tolerances,\u201d International Journal of Approximate\nReasoning, vol. 55, no. 6, pp. 1419\u20131438, 2014. https:\/\/dx.doi.org\/10.1016\/j.ijar.2013.12.005","DOI":"10.1016\/j.ijar.2013.12.005"},{"key":"ref7","doi-asserted-by":"publisher","unstructured":"D. Chen, X. Zhang, and W. Li, \u201cOn measurements of\ncovering rough sets based on granules and evidence\ntheory,\u201d Information Sciences, vol. 317, pp. 329\u2013348,  \n2015. https:\/\/dx.doi.org\/10.1016\/j.ins.2015.04.051","DOI":"10.1016\/j.ins.2015.04.051"},{"key":"ref8","doi-asserted-by":"publisher","unstructured":"L. D\u2019eer and C. Cornelis, \u201cNotes on covering-based \nrough sets from topological point of view: Relationships with general framework of dual approximation operators,\u201d International Journal of Approxi- \nmate Reasoning, vol. 88, pp. 295\u2013305, 2017. https:\/\/dx.doi.org\/10.1016\/j.ijar.2017.06.006","DOI":"10.1016\/j.ijar.2017.06.006"},{"key":"ref9","doi-asserted-by":"publisher","unstructured":"M. Restrepo, C. Cornelis, and J. G\u00f3mez, \u201cPartial order  \nrelation for approximation operators in covering based \nrough sets,\u201d Information Sciences, vol. 284, pp. 44\u201359, \n2014. https:\/\/dx.doi.org\/10.1016\/j.ins.2014.06.032","DOI":"10.1016\/j.ins.2014.06.032"},{"key":"ref10","doi-asserted-by":"publisher","unstructured":"M. Restrepo, C. Cornelis, and J. G\u00f3mez, \u201cDuality, conjugacy and adjointness of \napproximation operators in covering-based rough  \nsets,\u201d International Journal of Approximate Reasoning, \nvol. 55, no. 1, Part 4, pp. 469\u2013485, 2014. https:\/\/dx.doi.org\/10.1016\/j.ijar.2013.08.002 Rough Sets  \nand Logic.","DOI":"10.1016\/j.ijar.2013.08.002"},{"key":"ref11","doi-asserted-by":"publisher","unstructured":"C. Wang, M. Shao, B. Sun, and Q. Hu, \u201cAn improved \nattribute reduction scheme with covering based rough \nsets,\u201d Applied Soft Computing, vol. 26, pp. 235\u2013243,  \n2015. https:\/\/dx.doi.org\/10.1016\/j.asoc.2014.10.006","DOI":"10.1016\/j.asoc.2014.10.006"},{"key":"ref12","doi-asserted-by":"publisher","unstructured":"L. Fachao, R. Yexing, and J. Chenxia, \u201cAttribute reduction method of covering rough set based on dependence degree,\u201d International Journal of Computational  \nIntelligence Systems, vol. 14, pp. 1419\u20131425, 2021. https:\/\/dx.doi.org\/10.2991\/ijcis.d.210419.002","DOI":"10.2991\/ijcis.d.210419.002"},{"key":"ref13","doi-asserted-by":"publisher","unstructured":"Y. Yang, D. Chen, X. Zhang, and Z. Ji, \u201cCovering \nrough set-based incremental feature selection for mixed \ndecision system,\u201d Soft Comput., vol. 26, no. 6, pp.  \n2651\u20132669, 2022. https:\/\/dx.doi.org\/10.1007\/s00500-021-06687-0","DOI":"10.1007\/s00500-021-06687-0"},{"key":"ref14","doi-asserted-by":"publisher","unstructured":"P. Zhu and Q. Wen, \u201cEntropy and co-entropy of a \ncovering approximation space,\u201d International Journal of \nApproximate Reasoning, vol. 53, no. 4, pp. 528\u2013540,  \n2012. https:\/\/dx.doi.org\/10.1016\/j.ijar.2011.12.004","DOI":"10.1016\/j.ijar.2011.12.004"},{"key":"ref15","doi-asserted-by":"publisher","unstructured":"Z. Li, S. Wei, and S. Liu, \u201cOutlier detection using \nconditional information entropy and rough set theory,\u201d  \nJournal of Intelligent & Fuzzy Systems, vol. 46, no. 1, \npp. 1899\u20131918, 2024. https:\/\/dx.doi.org\/10.3233\/JIFS-236009","DOI":"10.3233\/JIFS-236009"},{"key":"ref16","doi-asserted-by":"publisher","unstructured":"L. Zhou and F. Jiang, \u201cA rough set approach to \nfeature selection based on relative decision entropy,\u201d  \nin Rough Sets and Knowledge Technology.  Berlin, \nHeidelberg: Springer Berlin Heidelberg, 2011. https:\/\/dx.doi.org\/10.1007\/978-3-642-24425-4 17 pp. 110\u2013119.","DOI":"10.1007\/978-3-642-24425-4"},{"key":"ref17","doi-asserted-by":"publisher","unstructured":"M. Restrepo and C. Cornelis, \u201cMapper-based rough sets,\u201d \nin Rough Sets: International Joint Conference, IJCRS \n2024, Halifax, NS, Canada, May 17\u201320, 2024, Proceedings, Part I. Berlin, Heidelberg: Springer-Verlag, \n2024. https:\/\/dx.doi.org\/10.1007\/978-3-031-65665-1_1  p. 3\u201317.","DOI":"10.1007\/978-3-031-65665-1_1"},{"key":"ref18","doi-asserted-by":"publisher","unstructured":"A. D. Smith, P. D\u0142otko, and V. M. Zavala, \n\u201cTopological data analysis: Concepts, computation, \nand applications in chemical engineering,\u201d Computers \nChemical Engineering, vol. 146, 2021. doi:  \nhttps:\/\/doi.org\/10.1016\/j.compchemeng.2020.107202","DOI":"10.1016\/j.compchemeng.2020.107202"},{"key":"ref19","doi-asserted-by":"publisher","unstructured":"V. Q. Vu, B. Yu, and R. E. Kass, \u201cCoverage-adjusted entropy estimation,\u201d Statistics in Medicine, \n vol. 26, no. 21, pp. 4039\u20134060, 2007. https:\/\/dx.doi.org\/10.1002\/sim.2942","DOI":"10.1002\/sim.2942"},{"key":"ref20","doi-asserted-by":"crossref","unstructured":"J. G. Bazan, H. S. Nguyen, S. H. Nguyen, P. Synak, and \n J. Wr\u00f3blewski, Rough Set Algorithms in Classification \n Problem. Heidelberg: Physica-Verlag HD, 2000, pp. \n49\u201388.","DOI":"10.1007\/978-3-7908-1840-6_3"},{"key":"ref21","doi-asserted-by":"publisher","unstructured":"W. Ziarko and N. Shan, \u201cDiscovering attribute relation ships, dependencies and rules by using rough sets,\u201d in \n Proceedings of the Twenty-Eighth Annual Hawaii International Conference on System Sciences, vol. 3, 1995. \n https:\/\/dx.doi.org\/10.1109\/HICSS.1995.375608 pp. 293\u2013299 vol.3.","DOI":"10.1109\/HICSS.1995.375608"},{"key":"ref22","unstructured":"H. Alqaheri, A. E. Hassanien, and A. Abraham, \u201cDis covering stock price prediction rules using rough sets,\u201d \n Neural Network World, vol. 18, 01 2008."},{"key":"ref23","doi-asserted-by":"crossref","unstructured":"M. S. Raza and U. Qamar, Understanding and using rough set based feature selection: Concepts, tech niques and applications, 2nd ed. Singapore, Singapore: \n Springer, Sep. 2019.","DOI":"10.1007\/978-981-32-9166-9"},{"key":"ref24","doi-asserted-by":"publisher","unstructured":"K. Thangavel and A. Pethalakshmi, \u201cDimensionality re duction based on rough set theory: A review,\u201d Applied \n Soft Computing, vol. 9, no. 1, pp. 1\u201312, 2009. https:\/\/dx.doi.org\/10.1016\/j.asoc.2008.05.006","DOI":"10.1016\/j.asoc.2008.05.006"},{"key":"ref25","doi-asserted-by":"publisher","unstructured":"A. K. Das, S. Sengupta, and S. Bhattacharyya, \u201cA \n group incremental feature selection for classification \nusing rough set theory based genetic algorithm,\u201d Applied Soft Computing, vol. 65, pp. 400\u2013411, 2018. https:\/\/dx.doi.org\/10.1016\/j.asoc.2018.01.040","DOI":"10.1016\/j.asoc.2018.01.040"},{"key":"ref26","unstructured":"W. De Maeyer, C. Cornelis, and M. Restrepo, \u201cThe \n granular structure of covering-based rough sets generated \nby mapper,\u201d in Proceedings of 16th European Symposium \n on Computational Intelligence and Mathematics (ESCIM \n 2025), in press."},{"key":"ref27","doi-asserted-by":"crossref","unstructured":"B. S. Everitt, S. Landau, M. Leese, and D. Stahl, Cluster \nAnalysis, 5th ed., ser. Wiley Series in Probability and \n Statistics. Hoboken, NJ: Wiley-Blackwell, 2011.","DOI":"10.1002\/9780470977811"},{"key":"ref28","doi-asserted-by":"publisher","unstructured":"C. Shannon, \u201cA mathematical theory of communication,\u201d \n The Bell System Technical Journal, vol. 27, no. 3, \npp. 379\u2013423, 1948. https:\/\/dx.doi.org\/10.1002\/j.1538-7305.1948.tb01338.x","DOI":"10.1002\/j.1538-7305.1948.tb01338.x"},{"key":"ref29","doi-asserted-by":"publisher","unstructured":"L. Paninski, \u201cEstimation of entropy and mutual infor mation,\u201d Neural Computation, vol. 15, pp. 1191\u20131253, \n 2003. https:\/\/dx.doi.org\/10.1162\/089976603321780272","DOI":"10.1162\/089976603321780272"},{"key":"ref30","doi-asserted-by":"publisher","unstructured":"A. Chao and T.-J. Shen, \u201cNonparametric estimation of \n shannon\u2019s diversity index when there are unseen species \n in sample. environ ecol stat 10: 429-443,\u201d Environmental \n and Ecological Statistics, vol. 10, pp. 429\u2013443, 2003. \n https:\/\/dx.doi.org\/10.1023\/A:1026096204727","DOI":"10.1023\/A:1026096204727"},{"key":"ref31","doi-asserted-by":"publisher","unstructured":"D. G. Horvitz and D. J. Thompson, \u201cA generalization of sampling without replacement from a finite \n universe,\u201d Journal of the American Statistical Association, vol. 47, no. 260, pp. 663\u2013685, 1952. https:\/\/dx.doi.org\/10.2307\/2280784","DOI":"10.2307\/2280784"},{"key":"ref32","unstructured":"M. Skorski, \u201cImproved estimation of collision entropy \n in high and low-entropy regimes and applications to \nanomaly detection,\u201d IACR Cryptol. ePrint Arch., vol. \n2016, p. 1035, 2016."},{"key":"ref33","unstructured":"M. Kelly, R. Longjohn, and K. Nottingham, the \nUCI Machine Learning Repository. [Online]. Available: \nhttps:\/\/archive.ics.uci.edu"}],"event":{"name":"20th Conference on Computer Science and Intelligence Systems (FedCSIS)","theme":"Computer Science and Intelligence Systems","location":"Krak\u00f3w, Poland","acronym":"FedCSIS","number":"20","start":{"date-parts":[[2025,9,14]]},"end":{"date-parts":[[2025,9,17]]}},"container-title":["Annals of Computer Science and Information Systems","Proceedings of the 20th Conference on Computer Science and Intelligence Systems (FedCSIS)"],"original-title":[],"deposited":{"date-parts":[[2025,10,22]],"date-time":"2025-10-22T07:46:15Z","timestamp":1761119175000},"score":1,"resource":{"primary":{"URL":"https:\/\/annals-csis.org\/Volume_43\/drp\/0110.html"}},"subtitle":[],"proceedings-subject":"Computer Science and Information Systems","short-title":[],"issued":{"date-parts":[[2025,10,15]]},"references-count":33,"URL":"https:\/\/doi.org\/10.15439\/2025f0110","relation":{},"ISSN":["2300-5963"],"issn-type":[{"value":"2300-5963","type":"print"}],"subject":[],"published":{"date-parts":[[2025,10,15]]}}}