首页 | 本学科首页   官方微博 | 高级检索  
     检索      

构造性覆盖算法的知识发现方法研究
引用本文:张旻,张铃.构造性覆盖算法的知识发现方法研究[J].电子与信息学报,2006,28(7):1322-1326.
作者姓名:张旻  张铃
作者单位:解放军电子工程学院702研究室,合肥,230037;安徽大学人工智能与信号处理国家教育部重点实验室,合肥,230039;安徽大学人工智能与信号处理国家教育部重点实验室,合肥,230039
基金项目:国家高技术研究发展计划(863计划)
摘    要:该文提出一种新的基于构造性覆盖算法的知识发现方法。由于覆盖网络构造方法的特殊性,使得形成的每个覆盖领域都很有价值,对覆盖领域内样本分析能挖掘出数据内在的知识,且可以根据需求构造不同的覆盖网络,形成对数据的多侧面的分析;实验结果表明覆盖算法用于知识发现的方法是有效可行的。

关 键 词:覆盖算法  覆盖领域  等价关系  知识发现
文章编号:1009-5896(2006)07-1322-05
收稿时间:2004-12-16
修稿时间:2005-10-17

Study on the Method of Knowledge Discover Based on the Structured Covering Algorithm
Zhang Min,Zhang Lin.Study on the Method of Knowledge Discover Based on the Structured Covering Algorithm[J].Journal of Electronics & Information Technology,2006,28(7):1322-1326.
Authors:Zhang Min  Zhang Lin
Institution:702 Research Room, Electronic Engineering Institute of PLA, Hefei 230037, China;Ministry of Education, Key Lab of IC&SP at Anhui University, Hefei 230039, China
Abstract:This paper proposes a new method of knowledge discovery based on the structured covering algorithm. Since the network of covering domains is constructed through a special method, it makes each covering domain a valuable pattern. Through analyzing the samples covered by the covering domain, certain valuable pattern will be found, which includes clustering information of samples, association rules among the data, the outlier analysis, etc. And in order to meet different requirement of users, different covering networks can be structured, therefore, multi-sides of data can be analysed. The experiments show that using the covering algorithm to discover knowledge of data is effective and feasible.
Keywords:Covering algorithm  Covering domain  Equipollent relationship  Knowledge discover
本文献已被 CNKI 维普 万方数据 等数据库收录!
点击此处可从《电子与信息学报》浏览原始摘要信息
点击此处可从《电子与信息学报》下载免费的PDF全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

Copyright©北京勤云科技发展有限公司  京ICP备09084417号