{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,20]],"date-time":"2025-11-20T18:57:27Z","timestamp":1763665047027,"version":"build-2065373602"},"reference-count":42,"publisher":"MDPI AG","issue":"1","license":[{"start":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T00:00:00Z","timestamp":1672617600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Entropy"],"abstract":"<jats:p>In this article, we present a modification of the algorithm based on EAV (entity\u2013attribute\u2013value) model, for induction of decision rules, utilizing novel approach for attribute ranking. The selection of attributes used as premises of decision rules, is an important stage of the process of rules induction. In the presented approach, this task is realized using ranking of attributes based on standard deviation of attributes\u2019 values per decision classes, which is considered as a distinguishability level. The presented approach allows to work not only with numerical values of attributes but also with categorical ones. For this purpose, an additional step of data transformation into a matrix format has been proposed. It allows to transform data table into a binary one with proper equivalents of categorical values of attributes and ensures independence of the influence of the attribute selection function from the data type of variables. The motivation for the proposed method is the development of an algorithm which allows to construct rules close to optimal ones in terms of length, while maintaining enough good classification quality. The experiments presented in the paper have been performed on data sets from UCI ML Repository, comparing results of the proposed approach with three selected greedy heuristics for induction of decision rules, taking into consideration classification accuracy and length and support of constructed rules. The obtained results show that for the most part of datasests, the average length of rules obtained for 80% of best attributes from the ranking is very close to values obtained for the whole set of attributes. In case of classification accuracy, for 50% of considered datasets, results obtained for 80% of best attributes from the ranking are higher or the same as results obtained for the whole set of attributes.<\/jats:p>","DOI":"10.3390\/e25010091","type":"journal-article","created":{"date-parts":[[2023,1,2]],"date-time":"2023-01-02T04:51:22Z","timestamp":1672635082000},"page":"91","update-policy":"https:\/\/doi.org\/10.3390\/mdpi_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Improved EAV-Based Algorithm for Decision Rules Construction"],"prefix":"10.3390","volume":"25","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5051-3531","authenticated-orcid":false,"given":"Krzysztof","family":"\u017babi\u0144ski","sequence":"first","affiliation":[{"name":"Institute of Computer Science, Faculty of Science and Technology, University of Silesia in Katowice, B\u0119dzi\u0144ska 39, 41-200 Sosnowiec, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3788-1094","authenticated-orcid":false,"given":"Beata","family":"Zielosko","sequence":"additional","affiliation":[{"name":"Institute of Computer Science, Faculty of Science and Technology, University of Silesia in Katowice, B\u0119dzi\u0144ska 39, 41-200 Sosnowiec, Poland"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"1968","published-online":{"date-parts":[[2023,1,2]]},"reference":[{"key":"ref_1","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1002\/1098-111X(200101)16:1<13::AID-INT3>3.0.CO;2-M","article-title":"Induction of decision rules in classification and discovery-oriented perspectives","volume":"16","author":"Stefanowski","year":"2001","journal-title":"Int. J. Intell. Syst."},{"key":"ref_2","first-page":"119","article-title":"Rule Quality Measures Improve the Accuracy of Rule Induction: An Experimental Approach","volume":"Volume 1932","author":"Ohsuga","year":"2000","journal-title":"International Symposium on Methodologies for Intelligent Systems"},{"key":"ref_3","doi-asserted-by":"crossref","first-page":"419","DOI":"10.3233\/FI-2016-1455","article-title":"Rule Quality Measures Settings in Classification, Regression and Survival Rule Induction\u2014An Empirical Approach","volume":"149","author":"Sikora","year":"2016","journal-title":"Fundam. Inform."},{"key":"ref_4","first-page":"137","article-title":"Approximate Reducts and Association Rules-Correspondence and Complexity Results","volume":"Volume 1711","author":"Zhong","year":"1999","journal-title":"RSFDGrC 1999"},{"key":"ref_5","doi-asserted-by":"crossref","first-page":"259","DOI":"10.3233\/FI-2009-0074","article-title":"Greedy Algorithm for Construction of Partial Association Rules","volume":"92","author":"Moshkov","year":"2009","journal-title":"Fundam. Inform."},{"key":"ref_6","doi-asserted-by":"crossref","unstructured":"\u017babi\u0144ski, K., and Zielosko, B. (2021). Algorithm based on eav model. Entropy, 23.","DOI":"10.3390\/e23010014"},{"key":"ref_7","first-page":"3667","article-title":"Selected approaches for decision rules construction-comparative study","volume":"Volume 192","author":"Salabun","year":"2021","journal-title":"Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 25th International Conference KES-2021, Szczecin, Poland, 8\u201310 September 2021"},{"key":"ref_8","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2019-1791","article-title":"Comparison of heuristics for optimization of association rules","volume":"166","author":"Alsolami","year":"2019","journal-title":"Fundam. Inform."},{"key":"ref_9","doi-asserted-by":"crossref","unstructured":"Guyon, I., Gunn, S., Nikravesh, M., and Zadeh, L. (2006). Feature Extraction: Foundations and Applications, Springer. Studies in Fuzziness and Soft Computing.","DOI":"10.1007\/978-3-540-35488-8"},{"key":"ref_10","doi-asserted-by":"crossref","unstructured":"Sta\u0144czyk, U., Zielosko, B., and Jain, L.C. (2018). Advances in Feature Selection for Data and Pattern Recognition: An Introduction. Advances in Feature Selection for Data and Pattern Recognition, Springer International Publishing.","DOI":"10.1007\/978-3-319-67588-6"},{"key":"ref_11","doi-asserted-by":"crossref","first-page":"1664","DOI":"10.1016\/j.patcog.2013.10.009","article-title":"Efficient feature size reduction via predictive forward selection","volume":"47","author":"Reif","year":"2014","journal-title":"Pattern Recognit."},{"key":"ref_12","doi-asserted-by":"crossref","first-page":"41","DOI":"10.1016\/j.ins.2006.06.007","article-title":"Rough sets and Boolean reasoning","volume":"177","author":"Pawlak","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_13","first-page":"308","article-title":"Order based genetic algorithms for the search of approximate entropy reducts","volume":"Volume 2639","author":"Wang","year":"2003","journal-title":"RSFDGrC 2003"},{"key":"ref_14","doi-asserted-by":"crossref","first-page":"22","DOI":"10.1016\/j.knosys.2015.02.002","article-title":"Finding rough set reducts with fish swarm algorithm","volume":"81","author":"Chen","year":"2015","journal-title":"Knowl.-Based Syst."},{"key":"ref_15","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","article-title":"Rudiments of rough sets","volume":"177","author":"Pawlak","year":"2007","journal-title":"Inf. Sci."},{"key":"ref_16","first-page":"2576","article-title":"Reduct-based ranking of attributes","volume":"Volume 176","author":"Cristani","year":"2020","journal-title":"Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 24th International Conference KES-2020, Virtual Event, 16\u201318 September 2020"},{"key":"ref_17","first-page":"549","article-title":"Greedy Algorithm for Attribute Reduction","volume":"85","author":"Zielosko","year":"2008","journal-title":"Fundam. Inform."},{"key":"ref_18","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1109\/TFUZZ.2016.2581186","article-title":"Active Sample Selection Based Incremental Algorithm for Attribute Reduction With Rough Sets","volume":"25","author":"Yang","year":"2017","journal-title":"IEEE Trans. Fuzzy Syst."},{"key":"ref_19","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1016\/j.ijar.2017.10.012","article-title":"Feature selection using rough set-based direct dependency calculation by avoiding the positive region","volume":"92","author":"Raza","year":"2018","journal-title":"Int. J. Approx. Reason."},{"key":"ref_20","doi-asserted-by":"crossref","first-page":"18","DOI":"10.1016\/j.ijar.2018.12.013","article-title":"Attribute reduction based on k-nearest neighborhood rough sets","volume":"106","author":"Wang","year":"2019","journal-title":"Int. J. Approx. Reason."},{"key":"ref_21","doi-asserted-by":"crossref","first-page":"276","DOI":"10.1016\/j.ijar.2018.07.011","article-title":"Feature selection based on composition of rough sets induced by feature granulation","volume":"101","author":"Ferone","year":"2018","journal-title":"Int. J. Approx. Reason."},{"key":"ref_22","doi-asserted-by":"crossref","first-page":"987","DOI":"10.1016\/j.ins.2010.10.030","article-title":"Sequential covering rule induction algorithm for variable consistency rough set approaches","volume":"181","year":"2011","journal-title":"Inf. Sci."},{"key":"ref_23","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1016\/j.knosys.2019.02.019","article-title":"GuideR: A guided separate-and-conquer rule learning in classification, regression, and survival settings","volume":"173","author":"Sikora","year":"2019","journal-title":"Knowl.-Based Syst."},{"key":"ref_24","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1023\/A:1006524209794","article-title":"Separate-and-Conquer Rule Learning","volume":"13","year":"1999","journal-title":"Artif. Intell. Rev."},{"key":"ref_25","doi-asserted-by":"crossref","first-page":"147","DOI":"10.1016\/j.eswa.2017.03.041","article-title":"Refinement and selection heuristics in subgroup discovery and classification rule learning","volume":"81","author":"Valmarska","year":"2017","journal-title":"Expert Syst. Appl."},{"key":"ref_26","doi-asserted-by":"crossref","first-page":"261","DOI":"10.1007\/s10462-011-9272-4","article-title":"Decision Trees: A Recent Overview","volume":"13","author":"Kotsiantis","year":"2013","journal-title":"Artif. Intell. Rev."},{"key":"ref_27","doi-asserted-by":"crossref","first-page":"334","DOI":"10.1007\/11847465_16","article-title":"Approximate Boolean reasoning: Foundations and applications in data mining","volume":"Volume 4100","author":"Peters","year":"2006","journal-title":"Transactions on Rough Sets V"},{"key":"ref_28","first-page":"350","article-title":"Application of Greedy Heuristics for Feature Characterisation and Selection: A Case Study in Stylometric Domain","volume":"Volume 11103","author":"Nguyen","year":"2018","journal-title":"Proceedings of the Rough Sets\u2013International Joint Conference, IJCRS 2018"},{"key":"ref_29","doi-asserted-by":"crossref","first-page":"1","DOI":"10.3233\/FI-2014-956","article-title":"Relationships Between Length and Coverage of Decision Rules","volume":"129","author":"Amin","year":"2014","journal-title":"Fundam. Inform."},{"key":"ref_30","doi-asserted-by":"crossref","first-page":"187","DOI":"10.1016\/j.ijar.2020.07.005","article-title":"Heuristic-based feature selection for rough set approach","volume":"125","author":"Zielosko","year":"2020","journal-title":"Int. J. Approx. Reason."},{"key":"ref_31","doi-asserted-by":"crossref","first-page":"73","DOI":"10.1007\/978-3-319-67588-6_5","article-title":"Optimization of Decision Rules Relative to Length Based on Modified Dynamic Programming Approach","volume":"Volume 138","author":"Zielosko","year":"2018","journal-title":"Advances in Feature Selection for Data and Pattern Recognition"},{"key":"ref_32","doi-asserted-by":"crossref","first-page":"611","DOI":"10.1016\/j.neucom.2016.08.025","article-title":"A combinatorial necessary and sufficient condition for cluster consensus","volume":"216","author":"Shang","year":"2016","journal-title":"Neurocomputing"},{"key":"ref_33","unstructured":"Tan, P., Steinbach, M., Karpatne, A., and Kumar, V. (2019). Introduction to Data Mining, Pearson."},{"key":"ref_34","doi-asserted-by":"crossref","unstructured":"\u015awieboda, W., and Nguyen, H.S. (March, January 27). Rough Set Methods for Large and Spare Data in EAV Format. Proceedings of the 2012 IEEE RIVF International Conference on Computing Communication Technologies, Research, Innovation, and Vision for the Future, Ho Chi Minh City, Vietnam.","DOI":"10.1109\/rivf.2012.6169830"},{"key":"ref_35","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., and Stone, C.J. (1984). Classification and Regression Trees, Chapman and Hall\/CRC."},{"key":"ref_36","unstructured":"Bocca, J.B., Jarke, M., and Zaniolo, C. (1994). Fast algorithms for mining association rules in large databases. VLDB, Morgan Kaufmann."},{"key":"ref_37","unstructured":"Kowalski, M., and Stawicki, S. (2012, January 9\u201312). SQL-Based Heuristics for Selected KDD Tasks over Large Data Sets. Proceedings of the Federated Conference on Computer Science and Information Systems, Wroc\u0142aw, Poland."},{"key":"ref_38","doi-asserted-by":"crossref","first-page":"89","DOI":"10.1023\/A:1009887712954","article-title":"Integrating Association Rule Mining with Relational Database Systems: Alternatives and Implications","volume":"4","author":"Sarawagi","year":"2000","journal-title":"Data Min. Knowl. Discov."},{"key":"ref_39","doi-asserted-by":"crossref","unstructured":"Peters, J.F., and Skowron, A. (2005). Rough Sets and Bayes Factor. Transactions on Rough Sets III, Springer.","DOI":"10.1007\/b136502"},{"key":"ref_40","unstructured":"Mitchell, T.M. (1997). Machine Learning, McGraw-Hill."},{"key":"ref_41","first-page":"2737","article-title":"Ranking of attributes\u2014Comparative study based on data from stylometric domain","volume":"Volume 207","author":"Cristani","year":"2022","journal-title":"Knowledge-Based and Intelligent Information & Engineering Systems: Proceedings of the 26th International Conference KES-2022, Verona, Italy, 7\u20139 September 2022"},{"key":"ref_42","unstructured":"Dua, D., and Graff, C. (2022, March 23). UCI Machine Learning Repository, 2017. University of California, Irvine, School of Information and Computer Sciences. Available online: http:\/\/archive.ics.uci.edu\/ml."}],"container-title":["Entropy"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/91\/pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,10,10]],"date-time":"2025-10-10T17:56:12Z","timestamp":1760118972000},"score":1,"resource":{"primary":{"URL":"https:\/\/www.mdpi.com\/1099-4300\/25\/1\/91"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,1,2]]},"references-count":42,"journal-issue":{"issue":"1","published-online":{"date-parts":[[2023,1]]}},"alternative-id":["e25010091"],"URL":"https:\/\/doi.org\/10.3390\/e25010091","relation":{},"ISSN":["1099-4300"],"issn-type":[{"type":"electronic","value":"1099-4300"}],"subject":[],"published":{"date-parts":[[2023,1,2]]}}}