An Aspect of Decision Making in Rough Non-deterministic Information Analysis

We have been proposing a framework Rough Non-deterministic Information Analysis (RNIA), which handles rough sets based concepts in not only Deterministic Information Systems (DISs) but also Non-deterministic Information Systems (NISs). We have recently developed some algorithms and software tools for rule generation from NISs. Obtained rules characterize the tendencies in NISs, and they are often applied to decision making. However, if the condition parts in such rules are not satisfied, obtained rules are not applied to decision making. In this case, we need to examine each data in NISs, directly. In this paper, we add a question-answering with criterion values to RNIA. This addition enhances the aspect of decision making in RNIA.

[1]  Sadaaki Miyamoto,et al.  Rough Sets and Current Trends in Computing , 2012, Lecture Notes in Computer Science.

[2]  Hiroshi Sakai,et al.  Rough Sets Based Minimal Certain Rule Generation in Non-deterministic Information Systems: An Overview , 2005, LAPTEC.

[3]  Hiroshi Sakai,et al.  Lower and Upper Approximations of Rules in Non-deterministic Information Systems , 2008, RSCTC.

[4]  Hiroshi Sakai.  Some Effective Procedures for Data Dependencies in Information Systems , 2003 .

[5]  Hiroshi Sakai,et al.  Rough Sets Based Rule Generation from Data with Categorical and Numerical Values , 2008, J. Adv. Comput. Intell. Intell. Informatics.

[6]  Heikki Mannila,et al.  Fast Discovery of Association Rules , 1996, Advances in Knowledge Discovery and Data Mining.

[7]  Hiroshi Sakai,et al.  Rules and Apriori Algorithm in Non-deterministic Information Systems , 2006, Trans. Rough Sets.

[8]  J. Kacprzyk,et al.  Incomplete Information: Rough Set Analysis , 1997 .

[9]  Armin Wolf,et al.  Declarative Programming for Knowledge Management, 16th International Conference on Applications of Declarative Programming and Knowledge Management, INAP 2005, Fukuoka, Japan, October 22-24, 2005, Revised Selected Papers , 2006, INAP.

[10]  Hiroshi Sakai,et al.  An Application of Discernibility Functions to Generating Minimal Rules in Non-Deterministic Information Systems , 2006, J. Adv. Comput. Intell. Intell. Informatics.

[11]  S. Tsumoto,et al.  Rough Set Theory and Granular Computing , 2003 .

[12]  Witold Lipski,et al.  On Databases with Incomplete Information , 1981, JACM.

[13]  Ramakrishnan Srikant,et al.  Fast algorithms for mining association rules , 1998, VLDB 1998.

[14]  Jerzy W. Grzymala-Busse,et al.  Rough Sets , 1995, Commun. ACM.

[15]  Ramakrishnan Srikant,et al.  Fast Algorithms for Mining Association Rules in Large Databases , 1994, VLDB.

[16]  Hiroshi Sakai,et al.  On a Rough Sets Based Data Mining Tool in Prolog: An Overview , 2005, INAP.

[17]  Zdzislaw Pawlak,et al.  Some Issues on Rough Sets , 2004, Trans. Rough Sets.

[18]  Hiroshi Sakai,et al.  On Possible Rules and Apriori Algorithm in Non-deterministic Information Systems: Part 2 , 2007, RSFDGrC.

[19]  Hiroshi Sakai,et al.  Basic Algorithms and Tools for Rough Non-deterministic Information Analysis , 2004, Trans. Rough Sets.

[20]  Ewa Orlowska,et al.  Representation of Nondeterministic Information , 1984, Theor. Comput. Sci..

[21]  Hiroshi Sakai.  Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems , 2001, Fundam. Informaticae.

[22]  Witold Lipski,et al.  On semantic issues connected with incomplete information databases , 1979, ACM Trans. Database Syst..