透過您的圖書館登入
IP:18.221.112.220
  • 期刊

Research on Discovering Discriminative Rules-Based on an Information System Rough Set Model

若您是本文的作者,可授權文章由華藝線上圖書館中協助推廣。

並列摘要


Learning from examples algorithms is a traditional method for data mining. Usually the examples undergoing learning are partitioned into positive and negative sets. Discriminative rules are discovered by generalizing process on positive sets and specializing on negative sets. These algorithms require an explicitly specified negative example set and only effect in an ideal environment, which doesn't exist because of the uncertainty in management domain. How to discover knowledge from this kind of data sets is a difficult problem and the proceeded research work is limited. The main contribution of this paper is to propose an approach for discovering knowledge from uncertain data with incomplete information based on the refined rough set model of information systems.

參考文獻


Chen, M. S., Han, J., Yu, P. S.(1996).Data Mining: An Overview from a Database Perspective.IEEE Transactions on Knowledge and Data Engineering.8(6)
Han, J., Cai, Y., Cercone, Nick(1993).Data-Driven Discovery of Quantitative Rules in Relational Databases.IEEE Transactions on Knowledge and Data Engineering.5(1)
Jroddick, J. F.(1996).Handling Discovered Structure in Databases System.IEEE Transactions on Knowledge and Data Engineering.8(2)
Mclachlan, G.(1992).Discriminant Analysis and Statistical Pattern Recognition.Wiley Press.
Russell, S. J.(1988).Proceeding of AAAI Conference.Minneapolis:

延伸閱讀