( en | de | ru )

 

Disambiguation of "Sakai, Hiroshi"

Author of the publication

copydeleteadd this publication to your clipboard
Rule Induction Based on Indiscernible Classes from Rough Sets in Information Tables with Continuous Values.

, , and . IJCSR, volume 11103 of Lecture Notes in Computer Science, page 323-336. Springer, (2018)

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.

Hajime Sakai

Winfried Sakai

Noriyuki Sakai

Asato Sakai

Arito Rüdiger Sakai

 

Other publications of authors with the same name

Rough set-based rule generation and Apriori-based rule generation from table data sets: a survey and a combination., and . CAAI Trans. Intell. Technol., 4 (4): 203-213 (2019)An Algorithm for Finding Equivalence Relations from Tables with Non-Deterministic Information., and . RSFDGrC, volume 1711 of Lecture Notes in Computer Science, page 64-72. Springer, (1999)Division Charts as Granules and Their Merging Algorithm for Rule Generation in Nondeterministic Data., , and . Int. J. Intell. Syst., 28 (9): 865-882 (2013)Twofold rough approximations under incomplete information., and . Int. J. General Systems, 42 (6): 546-571 (2013)An Approach Based on Rough Sets to Possibilistic Information., and . IPMU (3), volume 444 of Communications in Computer and Information Science, page 61-70. Springer, (2014)A Simulation Study of a Knowledge Base Machine Architecture., , , , and . IWDM, volume 43 of The Kluwer International Series in Engineering and Computer Science, page 585-598. Kluwer, (1987)Applications of Logic Programs with Functor Set to Automated Problem Solving Under Uncertainty., and . IEA/AIE, page 377-382. Gordon and Breach Science Publishers, (1996)Katětov and Katětov-Blass orders on Fσ-ideals., and . Arch. Math. Log., 55 (7-8): 883-898 (2016)NIS-Apriori Algorithm with a Target Descriptor for Handling Rules Supported by Minor Instances., , and . IUKM, volume 11471 of Lecture Notes in Computer Science, page 247-259. Springer, (2019)The weakly compact reflection principle need not imply a high order of weak compactness., and . Arch. Math. Log., 59 (1-2): 179-196 (2020)