计算机工程与应用 ›› 2008, Vol. 44 ›› Issue (34): 35-39.DOI: 10.3778/j.issn.1002-8331.2008.34.009

• 博士论坛 • 上一篇    下一篇

多关系数据分类方法综述

彭 珍1,2,杨炳儒1,李冬艳2,侯 伟1,宋顶利1   

  1. 1.北京科技大学 信息工程学院 知识工程研究所,北京 100083
    2.华北科技学院 计算机系,北京 101601
  • 收稿日期:2008-08-18 修回日期:2008-09-22 出版日期:2008-12-01 发布日期:2008-12-01
  • 通讯作者: 彭 珍

Review of multi-relational classification approaches

PENG Zhen1,2,YANG Bing-ru1,LI Dong-yan2,HOU Wei1,SONG Ding-li1   

  1. 1.School of Information Engineering,Beijing University of Science and Technology,Beijing 100083,China
    2.Department of Computer,North China Institute of Science and Technology,Beijing 101601,China
  • Received:2008-08-18 Revised:2008-09-22 Online:2008-12-01 Published:2008-12-01
  • Contact: PENG Zhen

摘要: 多关系数据分类是多关系数据挖掘重要任务之一,它能够直接从多关系数据表中发现有效模式,比命题分类方法具有更大优势。根据知识表示形式及相关策略的不同将多关系数据分类分为归纳逻辑程序设计关系分类方法、图的关系分类方法和基于关系数据库的关系分类方法。着重论述了它们所采用的具体关系分类技术及其特点,对这些方法进行了对比,最后讨论了它们当前所面临的挑战性问题。

Abstract: As an important task of multi-relational data mining,multi-relational classification can directly look for patterns that involve multiple relations from a relational database and have more advantages than propositional data mining approaches.According to the differences in knowledge representation and strategy,the paper divids multi-relational classification approaches into ILP,graph-based and relational database-based classification approaches and discusses each relational classification technology,their characteristics,the comparisons and several challenging researching problems in detail.