Author of the publication

A Glance to the Goldman's Testors from the Point of View of Rough Set Theory.

, , and . MCPR, volume 9703 of Lecture Notes in Computer Science, page 189-197. Springer, (2016)

Please choose a person to relate this publication to

To differ between persons with the same name, the academic degree and the title of an important publication will be displayed. You can also use the button next to the name to display some publications already assigned to the person.

 

Other publications of authors with the same name

Fast-BR vs. Fast-CT_EXT: An Empirical Performance Study., , , and . MCPR, volume 10267 of Lecture Notes in Computer Science, page 127-136. Springer, (2017)A new algorithm for computing reducts based on the binary discernibility matrix., , , and . Intell. Data Anal., 20 (2): 317-337 (2016)Structuralization of universes., , and . Fuzzy Sets Syst., 112 (3): 485-500 (2000)Taking Advantage of Typical Testor Algorithms for Computing Non-reducible Descriptors., , , , , and . ICPRAM, page 188-194. SCITEPRESS, (2022)Class-Specific Reducts vs. Classic Reducts in a Rule-Based Classifier: A Case Study., , and . MCPR, volume 10880 of Lecture Notes in Computer Science, page 23-30. Springer, (2018)Enhancing the Performance of YYC Algorithm Useful to Generate Irreducible Testors., , , and . Int. J. Pattern Recognit. Artif. Intell., 32 (1): 1860001:1-1860001:18 (2018)Towards Selecting Reducts for Building Decision Rules for Rule-Based Classifiers., , , and . MCPR, volume 12088 of Lecture Notes in Computer Science, page 67-75. Springer, (2020)An Algorithm for Computing Minimum-Length Irreducible Testors., , , and . IEEE Access, (2020)Algorithm for computing all the shortest reducts based on a new pruning strategy., , , and . Inf. Sci., (2022)An Algorithm for Computing Goldman Fuzzy Reducts., , and . MCPR, volume 10267 of Lecture Notes in Computer Science, page 3-12. Springer, (2017)