메뉴 건너뛰기




Volumn 10, Issue 5, 2006, Pages 695-702

An Application of Discernibility Functions to Generating Minimal Rules in Non-Deterministic Information Systems

Author keywords

discernibility functions; minimal rules; non deterministic information; rough sets; tool for rule generation

Indexed keywords

INFORMATION SYSTEMS; INFORMATION USE;

EID: 37249049641     PISSN: 13430130     EISSN: 18838014     Source Type: Journal    
DOI: 10.20965/jaciii.2006.p0695     Document Type: Article
Times cited : (20)

References (29)
  • 1
    • 0004174560 scopus 로고
    • Kluwer Academic Publisher
    • Z. Pawlak, “Rough Sets,” Kluwer Academic Publisher, 1991.
    • (1991) Rough Sets
    • Pawlak, Z.1
  • 6
    • 0031189666 scopus 로고    scopus 로고
    • A New Version of the Rule Induction System LERS
    • J. Grzymala-Busse, “A New Version of the Rule Induction System LERS,” Fundamenta Informaticae, Vol.31, pp. 27-39, 1997.
    • (1997) Fundamenta Informaticae , vol.31 , pp. 27-39
    • Grzymala-Busse, J.1
  • 8
    • 0033906937 scopus 로고    scopus 로고
    • Knowledge Discovery in Clinical Databases and Evaluation of Discovered Knowledge in Outpatient Clinic
    • S. Tsumoto, “Knowledge Discovery in Clinical Databases and Evaluation of Discovered Knowledge in Outpatient Clinic,” Information Sciences, Vol.124, pp. 125-137, 2000.
    • (2000) Information Sciences , vol.124 , pp. 125-137
    • Tsumoto, S.1
  • 9
    • 0008320334 scopus 로고    scopus 로고
    • Rough Set Theory and Its Applications
    • A. Nakamura, S. Tsumoto, H. Tanaka, and S. Kobayashi, “Rough Set Theory and Its Applications,” J. JSAI, Vol.11, No.2, pp. 209-215, 1996.
    • (1996) J. JSAI , vol.11 , Issue.2 , pp. 209-215
    • Nakamura, A.1    Tsumoto, S.2    Tanaka, H.3    Kobayashi, S.4
  • 13
    • 37249021698 scopus 로고
    • Representation of Nondeterministic Information
    • E. Orłowska and Z. Pawlak, “Representation of Nondeterministic Information,” Theoretical Computer Science, Vol.29, pp. 27-39, 1984.
    • (1984) Theoretical Computer Science , vol.29 , pp. 27-39
    • Orłowska, E.1    Pawlak, Z.2
  • 14
    • 0018518835 scopus 로고
    • On Semantic Issues Connected with Incomplete Information Data Base
    • W. Lipski, “On Semantic Issues Connected with Incomplete Information Data Base,” ACM Trans. DBS, Vol.4, pp. 269-296, 1979.
    • (1979) ACM Trans. DBS , vol.4 , pp. 269-296
    • Lipski, W.1
  • 15
    • 84976669069 scopus 로고
    • On Databases with Incomplete Information
    • W. Lipski, “On Databases with Incomplete Information,” Journal of the ACM, Vol.28, pp. 41-70, 1981.
    • (1981) Journal of the ACM , vol.28 , pp. 41-70
    • Lipski, W.1
  • 17
    • 0030283822 scopus 로고    scopus 로고
    • A Rough Logic based on Incomplete Information and Its Application
    • A. Nakamura, “A Rough Logic based on Incomplete Information and Its Application,” International Journal of Approximate Reasoning, Vol.15, pp. 367-378, 1996.
    • (1996) International Journal of Approximate Reasoning , vol.15 , pp. 367-378
    • Nakamura, A.1
  • 19
    • 33645411671 scopus 로고    scopus 로고
    • Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction
    • J. Grzymala-Busse, “Data with Missing Attribute Values: Generalization of Indiscernibility Relation and Rule Induction,” Transactions on Rough Sets, International Rough Set Society, Vol.1, pp.78-95, 2004.
    • (2004) Transactions on Rough Sets, International Rough Set Society , vol.1 , pp. 78-95
    • Grzymala-Busse, J.1
  • 20
    • 0033079944 scopus 로고    scopus 로고
    • Rules in Incomplete Information Systems
    • M. Kryszkiewicz, “Rules in Incomplete Information Systems,” Information Sciences, Vol.113, pp. 271-292, 1999.
    • (1999) Information Sciences , vol.113 , pp. 271-292
    • Kryszkiewicz, M.1
  • 21
    • 0030217714 scopus 로고    scopus 로고
    • Computation of Reducts of Composed Information Systems
    • M. Kryszkiewicz and H. Rybinski, “Computation of Reducts of Composed Information Systems,” Fundamenta Informaticae, Vol.27, pp. 183-195, 1996.
    • (1996) Fundamenta Informaticae , vol.27 , pp. 183-195
    • Kryszkiewicz, M.1    Rybinski, H.2
  • 23
    • 0014797273 scopus 로고
    • A Relational Model of Data for Large Shared Data Banks
    • E. Codd, “A Relational Model of Data for Large Shared Data Banks,” Communication of the ACM, Vol.13, pp. 377-387, 1970.
    • (1970) Communication of the ACM , vol.13 , pp. 377-387
    • Codd, E.1
  • 24
  • 25
    • 0035711408 scopus 로고    scopus 로고
    • Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems
    • H. Sakai, “Effective Procedures for Handling Possible Equivalence Relations in Non-deterministic Information Systems,” Fundamenta Informaticae, Vol.48, pp. 343-362, 2001.
    • (2001) Fundamenta Informaticae , vol.48 , pp. 343-362
    • Sakai, H.1
  • 27
    • 0142183372 scopus 로고    scopus 로고
    • A Framework of Rough Sets based Rule Generation in Non-deterministic Information Systems
    • Springer-Verlag
    • H. Sakai, “A Framework of Rough Sets based Rule Generation in Non-deterministic Information Systems,” Lecture Notes in AI, Springer-Verlag, Vol.2871, pp. 143-151, 2003.
    • (2003) Lecture Notes in AI , vol.2871 , pp. 143-151
    • Sakai, H.1
  • 28
    • 33645973706 scopus 로고    scopus 로고
    • Discernibility Functions and Minimal Rules in Non-deterministic Information Systems
    • Springer-Verlag
    • H. Sakai and M. Nakata, “Discernibility Functions and Minimal Rules in Non-deterministic Information Systems,” Lecture Notes in AI, Springer-Verlag, Vol.3641, pp. 254-264, 2005.
    • (2005) Lecture Notes in AI , vol.3641 , pp. 254-264
    • Sakai, H.1    Nakata, M.2


* 이 정보는 Elsevier사의 SCOPUS DB에서 KISTI가 분석하여 추출한 것입니다.