( en | de | ru )

 

Disambiguation

From post

копироватьудалитьдобавить публикацию в буфер
Apriori-Based Rule Generation in Incomplete Information Databases and Non-Deterministic Information Systems.

, , и . Fundam. Informaticae, 130 (3): 343-376 (2014)

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.

Hajime Sakai

Winfried Sakai

Noriyuki Sakai

Asato Sakai

Arito Rüdiger Sakai

 

Другие публикации лиц с тем же именем

Toward association rules based decision making in Lipski's Incomplete Information Databases., и . GrC, стр. 570-575. IEEE Computer Society, (2011)Generalized Prikry forcing and iteration of generic ultrapowers.. Math. Log. Q., 51 (5): 507-523 (2005)On Katětov and Katětov-Blass orders on analytic P-ideals and Borel ideals.. Arch. Math. Log., 57 (3-4): 317-327 (2018)Inference Methods and Semantics on Or-type Knowledge Bases.. LP, том 383 из Lecture Notes in Computer Science, стр. 136-155. Springer, (1988)Rough Sets in Incomplete Information Systems with Order Relations Under Lipski's Approach., , и . IJCRS (1), том 10313 из Lecture Notes in Computer Science, стр. 487-506. Springer, (2017)Lower and Upper Approximations of Rules in Non-deterministic Information Systems., , и . RSCTC, том 5306 из Lecture Notes in Computer Science, стр. 299-309. Springer, (2008)An Algorithm for Checking Dependencies of Attributes in a Table with Non-deterministic Information: A Rough Sets Based Approach., и . PRICAI, том 1886 из Lecture Notes in Computer Science, стр. 219-229. Springer, (2000)Rule induction based on rough sets from information tables having continuous domains., , и . CAAI Trans. Intell. Technol., 4 (4): 237-244 (2019)Rule induction based on rough sets from information tables containing possibilistic information., и . IFSA/NAFIPS, стр. 91-96. IEEE, (2013)Rough sets approximations in data tables containing missing values., и . FUZZ-IEEE, стр. 673-680. IEEE, (2008)