没有合适的资源?快使用搜索试试~ 我知道了~
MultiRelational Data Mining The Current Frontiers
需积分: 9 17 下载量 51 浏览量
2008-04-16
21:53:44
上传
评论
收藏 40KB PDF 举报
温馨提示
试读
2页
MultiRelational Data Mining The Current Frontiers
资源推荐
资源详情
资源评论
Multi-Relational Data Mining: The Current Frontiers
Sa
ˇ
so D
ˇ
zeroski
Jozef Stefan Institute
Jamova 39
SI-1000 Ljubljana, Slovenia
saso.dzeroski@ijs.si
Luc De Raedt
Institut f
¨
ur Informatik, Albert-Ludwigs-University,
Georges-Koehler-Allee, Building 079, D-79110
Freiburg, Germany
deraedt@informatik.uni-freiburg.de
Data mining algorithms look for patterns in data. Most
existing data mining approaches are propositional and look
for patterns in a single data table. Most real-world databases,
however, store information in multiple tables.
Relational data mining (RDM) approaches (Dˇzeroski and
Lavraˇc 2001), look for patterns that involve multiple tables
(relations) from a relational database. To emphasize this
fact, RDM is often referre d to as multi-relational data min-
ing (MRDM) (Dˇzeroski et al. 2002). We will adopt this
term in the present special issue.
When we are looking for patterns in multi-relational
data, it is natural that the patterns involve multiple rela-
tions. They are typically stated in a more expressive lan-
guage than patterns defined on a single data table. The
major types of multi-relational patterns extend the types of
propositional patterns considered in single table data min-
ing. We can thus have multi-relational classification rules,
multi-relational regression trees, and multi-relational asso-
ciation rules, among others.
Just as many data mining algorithms come from the
field of machine learning, many MRDM algorithms come
form the field of inductive logic programming (ILP, Muggle-
ton 1992; Lavraˇc and Dˇzeroski 1994). Situated at the in-
tersection of machine learning and logic programming, ILP
has been concerned with finding patterns e xpres sed as logic
programs. Initially, ILP focusse d on automated program
synthesis from examples, formulated as a binary classifica-
tion task. In recent years, however, the scope of ILP has
broadened to cover the whole spectrum of data mining tasks
(classification, regre ssion, clustering, association analysis).
The most common types of patterns have been extended to
their multi-relational versions and so have the major data
mining algorithms (decision tree induction, distance-based
clustering and prediction, etc.).
There is also a growing interest in the development of
data mining algorithms for various types of structured data.
These include, for example, graph-based data mining. There
is also an increasing body of work on mining tree-structured
and XML documents. Mining data which consists of com-
plex/structured objects also falls within the scope of MRDM,
as the normalized repres entation of such objects in a rela-
tional database requires multiple tables.
The rise of several KDD application areas that are in-
trinsically relational has provided and continues to provide a
strong motivation for the development of MRDM approaches.
These include in the first place bioinformatics and more
broadly computational biology. The World Wide Web and
data mining tasks related to it, such as information extrac-
tion follow closely. Related tasks, such as social network
analysis also hold significant importance.
In this special issue, we first provide an introduction to
multi-relational data mining (Dˇzeroski 2003). An extensive
overview of the field is given by Dˇzeroski and Lavraˇc (2001).
The overview in this issue focusses on the most important
approaches, giving a brief introduction to inductive logic
programming, then covering several multi-relational data
mining tasks and techniques, such as multi-relational as-
sociation rules and multi-relational decision trees.
Most of the full-length contributions in this special issue
cover important recent advances at the frontiers of multi-
relational data mining. These include probabilistic logic
learning (De Raedt and Kersting 2003), kernel-based learn-
ing for structured data (G¨artner 2003), and graph-based
data mining (Washio and Motoda 2003). Blockeel and Se-
bag (2003) survey scalability and efficiency issues in MRDM
and approaches taken to resolving these. Finally, Page and
Craven (2003) survey several applications of MRDM in the
area of bioinformatics, the area where MRDM has had most
successes so far and which still holds many challenges for
MRDM.
In addition to the six full-length contributions, this spe-
cial issue contains three shorter articles/position statements.
While Washio and Motoda (2003) mainly survey methods
for frequent subgraph discovery, Holder and Cook (2003) dis-
cuss current and future directions in graph-based relational
learning, which also addresses other data mining tasks, such
as classification. Getoor (2003) introduces and discusses sev-
eral tasks of link mining, where links/relations among ob-
jects are of central importance. Finally, Domingos (2003)
discusses several applications areas for MRDM, as well as
challenges that MRDM must address to be successful in
these.
A summer school on relational data mining, covering
both basic and advanced topics in this area, was organized
in Helsinki in August 2002, preceding ECML /PKDD 2002
(The 13th European Conference on Machine Learning and
The 6th European Conference on Principles and Practice
of Knowledge Discovery in Databases). The slides from
this summer school are available online (Dˇzeroski and
ˇ
Zenko
2002). A report on this event by Dˇzeroski and
ˇ
Zenko (2003)
is included at the end of this special issue.
资源评论
morre
- 粉丝: 187
- 资源: 2337
上传资源 快速赚钱
- 我的内容管理 展开
- 我的资源 快来上传第一个资源
- 我的收益 登录查看自己的收益
- 我的积分 登录查看自己的积分
- 我的C币 登录后查看C币余额
- 我的收藏
- 我的下载
- 下载帮助
最新资源
- Screenshot_20240427_031602.jpg
- 网页PDF_2024年04月26日 23-46-14_QQ浏览器网页保存_QQ浏览器转格式(6).docx
- 直接插入排序,冒泡排序,直接选择排序.zip
- 在排序2的基础上,再次对快排进行优化,其次增加快排非递归,归并排序,归并排序非递归版.zip
- 实现了7种排序算法.三种复杂度排序.三种nlogn复杂度排序(堆排序,归并排序,快速排序)一种线性复杂度的排序.zip
- 冒泡排序 直接选择排序 直接插入排序 随机快速排序 归并排序 堆排序.zip
- 课设-内部排序算法比较 包括冒泡排序、直接插入排序、简单选择排序、快速排序、希尔排序、归并排序和堆排序.zip
- Python排序算法.zip
- C语言实现直接插入排序、希尔排序、选择排序、冒泡排序、堆排序、快速排序、归并排序、计数排序,并带图详解.zip
- 常用工具集参考用于图像等数据处理
资源上传下载、课程学习等过程中有任何疑问或建议,欢迎提出宝贵意见哦~我们会及时处理!
点击此处反馈
安全验证
文档复制为VIP权益,开通VIP直接复制
信息提交成功