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

面向语义的精简化多关系频繁模式发现方法
引用本文:杨炳儒.面向语义的精简化多关系频繁模式发现方法[J].中国工程科学,2008,10(9):47-53.
作者姓名:杨炳儒
作者单位:北京科技大学信息工程学院,北京,100083
基金项目:国家自然科学基金,科技部科技成果重点推广计划
摘    要:多关系频繁模式发现能够直接从复杂结构化数据中发现涉及多个关系的复杂频繁模式,避免了传统方法的局限。有别于主流基于归纳逻辑程序设计技术的方法,提出了基于合取查询包含关系的面向语义的精简化多关系频繁模式发现方法,具有理论与技术基础的新颖性,解决了两种语义冗余问题。实验表明,该方法在可理解性、功能、效率以及可扩展性方面具有优势。

关 键 词:多关系数据挖掘  频繁模式发现  合取查询  精简化模式
收稿时间:2007/1/29 0:00:00
修稿时间:2007/6/14 0:00:00

Semantically condensed multi relational frequent pattern discovery based on conjunctive query containment
Yang Bingru.Semantically condensed multi relational frequent pattern discovery based on conjunctive query containment[J].Engineering Science,2008,10(9):47-53.
Authors:Yang Bingru
Affiliation:School of Information Engineering,University of Science and Technology Beijing,Beijing 100083,China
Abstract:Multi relational data mining is one of rapidly developing subfields of data mining. Multi relational frequent pattern discovery approaches directly look for frequent patterns that involve multiple relations from a relational database. While the state of the art of multi relational frequent pattern discovery approaches is based on the inductive logical programming techniques, we propose an approach to semantically condensed multi relational frequent pattern discovery based on conjunctive query containment in terms of the theory and technique of relational database. With the novelty of the groundwork, the proposed approach deals with two kinds of semantically redundant problems. In theory and experiments, it shows that our approach improve the understandability, function, efficiency and scalability of the state of the art of multi relational frequent pattern discovery approaches.
Keywords:multi relational data mining  frequent pattern discovery  conjunctive query  condensed pattern
本文献已被 维普 万方数据 等数据库收录!
点击此处可从《中国工程科学》浏览原始摘要信息
点击此处可从《中国工程科学》下载全文
设为首页 | 免责声明 | 关于勤云 | 加入收藏

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