Towards a Framework for Learning from Networked Data

被引：1

作者：

Ramon, Jan ^{[1
]}

机构：

[1] Katholieke Univ Leuven, Dept Comp Sci, B-3001 Heverlee, Belgium

来源：

GRAPH-BASED REPRESENTATION AND REASONING | 2014年 / 8577卷

关键词：

D O I：

10.1007/978-3-319-08389-6_3

中图分类号：

TP18 [人工智能理论];

学科分类号：

081104 ; 0812 ; 0835 ; 1405 ;

摘要：

引用

页码：25 / 30

页数：6

共 12 条

[1]

[Anonymous], 2007, Introduction to Statistical Relational Learning

[2]

[Anonymous], 2010, Networks: An Introduction, DOI 10.1162/artl_r_00062

[3] Scale-Free Networks: A Decade and Beyond [J].

Barabasi, Albert-Laszlo .

SCIENCE, 2009, 325 (5939) :412-413

[4] All normalized anti-monotonic overlap graph measures are bounded [J].

Calders, Toon ;

Ramon, Jan ;

Van Dyck, Dries .

DATA MINING AND KNOWLEDGE DISCOVERY, 2011, 23 (03) :503-548

[5]

De Raedt L., 1998, Inductive Logic Programming. 8th International Conference, ILP-98. Proceedings, P1, DOI 10.1007/BFb0027304

[6] Logical settings for concept-learning [J].

DeRaedt, L .

ARTIFICIAL INTELLIGENCE, 1997, 95 (01) :187-201

[7] Predicting Tryptic Cleavage from Proteomics Data Using Decision Tree Ensembles [J].

Fannes, Thomas ;

Vandermarliere, Elien ;

Schietgat, Leander ;

Degroeve, Sven ;

Martens, Lennart ;

Ramon, Jan .

JOURNAL OF PROTEOME RESEARCH, 2013, 12 (05) :2253-2259

[8] Frequent subgraph mining in outerplanar graphs [J].

Horvath, Tamas ;

Ramon, Jan ;

Wrobel, Stefan .

DATA MINING AND KNOWLEDGE DISCOVERY, 2010, 21 (03) :472-508

[9] Nearly exact mining of frequent trees in large networks [J].

Kibriya, Ashraf M. ;

Ramon, Jan .

DATA MINING AND KNOWLEDGE DISCOVERY, 2013, 27 (03) :478-504

[10]

Martens L., INSPECTOR INTEGRATED

← 1 2 →