Homogenous Granulation and Its Epsilon Variant†
AbstractIn the era of Big data, there is still place for techniques which reduce the data size with maintenance of its internal knowledge. This problem is the main subject of research of a family of granulation techniques proposed by Polkowski. In our recent works, we have developed new, really effective and simple techniques for decision approximation, homogenous granulation and epsilon homogenous granulation. The real problem in this family of methods was the choice of an effective parameter of approximation for any datasets. It was resolved by homogenous techniques. There is no need to estimate the optimal parameters of approximation for these methods, because those are set in a dynamic way according to the data internal indiscernibility level. In this work, we have presented an extension of the work presented at ICIST 2018 conference. We present results for homogenous and epsilon homogenous granulation with the comparison of its effectiveness. View Full-Text
Share & Cite This Article
Ropiak, K.; Artiemjew, P. Homogenous Granulation and Its Epsilon Variant. Computers 2019, 8, 36.
Ropiak K, Artiemjew P. Homogenous Granulation and Its Epsilon Variant. Computers. 2019; 8(2):36.Chicago/Turabian Style
Ropiak, Krzysztof; Artiemjew, Piotr. 2019. "Homogenous Granulation and Its Epsilon Variant." Computers 8, no. 2: 36.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.