Zobrazeno 1 - 10
of 36
pro vyhledávání: '"Piotr Hońko"'
Publikováno v:
Neural Computing and Applications. 32:14801-14816
Attribute reduction, being a complex problem in data mining, has attracted many researchers. The importance of this issue rises due to ever-growing data to be mined. Together with data growth, a need for speeding up computations increases. The contri
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::0fc9e81ce0fba2bcab156dcb046f19ea
https://doi.org/10.1007/s00521-020-04833-7
https://doi.org/10.1007/s00521-020-04833-7
Autor:
Piotr Hońko
Publikováno v:
International Journal of Intelligent Systems. 34:3123-3138
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::86c6252bd3ceabff2ba47c575d0bb719
https://doi.org/10.1002/int.22181
https://doi.org/10.1002/int.22181
Autor:
Piotr Hońko
Publikováno v:
International Journal of General Systems. 47:208-243
Attribute reduction, being one of the most essential tasks in rough set theory, is a challenge for data that does not fit in the available memory. This paper proposes new definitions of attribute reduction using horizontal data decomposition. Algorit
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2e9820af810c476958d5c7a1b3118fe9
https://doi.org/10.1080/03081079.2017.1413098
https://doi.org/10.1080/03081079.2017.1413098
Autor:
Piotr Hońko
Publikováno v:
International Journal of Approximate Reasoning. 71:89-111
Compound approximation spaces for relational data are proposed.They are viewed as expansions of tolerance approximation spaces to a relational case.Properties of compound approximation spaces are investigated.Compound approximation spaces enable to d
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::02664440ccfc19e2615571b83fe85f16
https://doi.org/10.1016/j.ijar.2016.02.002
https://doi.org/10.1016/j.ijar.2016.02.002
Publikováno v:
Computer Information Systems and Industrial Management ISBN: 9783030289560
CISIM
CISIM
Speeding up attribute reduction process is an important issue in data mining. The goal of this paper is to compare two hardware implementations of minimal reducts computation, i.e. the previously introduced implementation on Intel Arria V SoC and a n
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::b14e5abc398750904f2d239814c16a5b
https://doi.org/10.1007/978-3-030-28957-7_34
https://doi.org/10.1007/978-3-030-28957-7_34
Autor:
Piotr Hońko
Publikováno v:
Applied Soft Computing. 37:467-478
Graphical abstractDisplay Omitted HighlightsFormula-based relations defined in a granular computing framework are proposed.The relations are used to construct more informative granules.The granules are used to represent relational data and patterns.T
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ec9cfb5c228b9fb343609876fb1a4310
https://doi.org/10.1016/j.asoc.2015.08.045
https://doi.org/10.1016/j.asoc.2015.08.045
Granular-Relational Data Mining : How to Mine Relational Data in the Paradigm of Granular Computing?
Autor:
Piotr Hońko
This book provides two general granular computing approaches to mining relational data, the first of which uses abstract descriptions of relational objects to build their granular representation, while the second extends existing granular data mining
Autor:
Piotr Hońko
Publikováno v:
Fundamenta Informaticae. 137:323-340
Information granulation is a powerful tool for data analysis and processing. However, not much attention has been devoted to application of this tool to data stored in a relational structure. This paper extends the notion of information granules to a
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::ac5d1e79cacb64e60c9c35bed9e4f316
https://doi.org/10.3233/fi-2015-1182
https://doi.org/10.3233/fi-2015-1182
Autor:
Piotr Hońko
Publikováno v:
Soft Computing. 20:951-966
Ever-growing data generate a need for new solutions to the problem of attribute reduction. Such solutions are required to deal with limited memory capacity and with many computations needed for large data processing. This paper proposes new definitio
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::3b6a3ee677f53c290fa05e07a341059c
https://doi.org/10.1007/s00500-014-1554-8
https://doi.org/10.1007/s00500-014-1554-8
Autor:
Piotr Hońko
Publikováno v:
International Journal of Intelligent Systems. 29:407-438
One of the popular methods to develop an algorithm for mining data stored in a relational structure is to upgrade an existing attribute-value algorithm to a relational case. Current approaches to this problem have some shortcomings such as 1 a depend
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::92ea0c048e7c3c7d22d68fda823643a3
https://doi.org/10.1002/int.21644
https://doi.org/10.1002/int.21644