摘要
利用S-粗集与它的属性迁移,提出f、知识、挖掘度概念,讨论了属性迁移与知识挖掘的数量关系;给出了f、知识链式定理和f、知识最小、最大挖掘度定理。最后,给出了"f知识挖掘的实例分析。
This paper presents the concepts of f,f knowledge and mining degree by using S-rough set and its attribute transfer, and discusses the relation between attribute transfer and knowledge mining data property.This paper gives some knowledge chain theorems and minimum,maximum mining degree theorem of f, f.Finally,this paper presents an analysis on f knowledge mining example.
出处
《计算机工程与应用》
CSCD
北大核心
2007年第19期42-44,共3页
Computer Engineering and Applications
基金
山东省自然科学基金(the Natural Science Foundation of Shandong Province of China under Grant No.Y2004A04)
山东省科学发展计划项目(the Science Development Plan of Shandong Province of China under Grant No.B2006053)
关键词
单向S-粗集
属性迁移
挖掘度
挖掘定理
one direction S-rough set
attribute transfer
mining degree
mining dependence theorem
