<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns="http://purl.org/rss/1.0/" xmlns:admin="http://webns.net/mvcb/" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:cc="http://web.resource.org/cc/"><channel rdf:about="http://www.bibsonomy.org/author/Blockeel"><title>BibSonomy publications for /author/Blockeel</title><link>BibSonomypublrss/author/Blockeel</link><description>BibSonomy RSS feed for /author/Blockeel</description><dc:date>2012-02-16T04:23:32+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2becd01b20e73fbf97c1585c403640a86/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/278e34d699f16413a5fbc0b04ba287f1c/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2725ddbc234d878c150da982db8a32c07/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cff2afee45e764910571e2addad79aeb/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2657e93d923594d7af5cfee44133ef449/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/275412dcca7e7bad3b239cfc9b9b7a2b9/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b6395d1d75cb41a0f1f4f4ef6ae45dbf/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21ee53f71f8d02c6ba0f31a1e158948f2/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27a4fe59c5c5218c537704fd85b240ab9/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/200cb7984de7ef394d7bdbfc7e49d73bb/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d8f9d9a3cc3e9bdc24f48740879c7725/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c7fdf32dcafe7f70253ea29c2ec5230d/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23d29680088952ad1d360ab04451772ea/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ff8547d02399333fc42084160e815564/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/227a9092be5006db1e1709a7adc39ac44/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2842b2285c8c254d5ab08d056e3963fc9/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a21707837654c7471d9022b4f1ec15ff/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/221af18cf0beb5b192baa80bbbef551e9/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29213555def20374cade1e1e2d2c5dcdc/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20f6c669a27c38f1dc1aba3627ceb3094/dblp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2becd01b20e73fbf97c1585c403640a86/dblp"><title>Outlier detection in relational data: A case study in geographical information systems.</title><link>http://www.bibsonomy.org/bibtex/2becd01b20e73fbf97c1585c403640a86/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-02-06T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Maervoet&#034;&gt;Joris Maervoet&lt;/a&gt;, &lt;a href=&#034;/author/Vens&#034;&gt;Celine Vens&lt;/a&gt;, &lt;a href=&#034;/author/Berghe&#034;&gt;Greet Vanden Berghe&lt;/a&gt;, &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;,  and &lt;a href=&#034;/author/Causmaecker&#034;&gt;Patrick De Causmaecker&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Expert Syst. Appl.&lt;/em&gt; &lt;em&gt;39(5):4718-4728&lt;/em&gt; (&lt;em&gt;2012&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/278e34d699f16413a5fbc0b04ba287f1c/dblp"><title>Mining Views: Database Views for Data Mining.</title><link>http://www.bibsonomy.org/bibtex/278e34d699f16413a5fbc0b04ba287f1c/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-01-23T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;, &lt;a href=&#034;/author/Calders&#034;&gt;Toon Calders&lt;/a&gt;, &lt;a href=&#034;/author/Fromont&#034;&gt;Élisa Fromont&lt;/a&gt;, &lt;a href=&#034;/author/Goethals&#034;&gt;Bart Goethals&lt;/a&gt;,  and &lt;a href=&#034;/author/Prado&#034;&gt;Adriana Prado&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ICDE, &lt;/em&gt;&lt;em&gt;page 1608-1611. &lt;/em&gt;&lt;em&gt;IEEE, &lt;/em&gt;(&lt;em&gt;2008&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2725ddbc234d878c150da982db8a32c07/dblp"><title>An inductive database system based on virtual mining views.</title><link>http://www.bibsonomy.org/bibtex/2725ddbc234d878c150da982db8a32c07/dblp</link><dc:creator>dblp</dc:creator><dc:date>2012-01-10T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;, &lt;a href=&#034;/author/Calders&#034;&gt;Toon Calders&lt;/a&gt;, &lt;a href=&#034;/author/Fromont&#034;&gt;Élisa Fromont&lt;/a&gt;, &lt;a href=&#034;/author/Goethals&#034;&gt;Bart Goethals&lt;/a&gt;, &lt;a href=&#034;/author/Prado&#034;&gt;Adriana Prado&lt;/a&gt;,  and &lt;a href=&#034;/author/Robardet&#034;&gt;Céline Robardet&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Data Min. Knowl. Discov.&lt;/em&gt; &lt;em&gt;24(1):247-287&lt;/em&gt; (&lt;em&gt;2012&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cff2afee45e764910571e2addad79aeb/dblp"><title>Efficient algorithms for decision tree cross-validation</title><link>http://www.bibsonomy.org/bibtex/2cff2afee45e764910571e2addad79aeb/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;,  and &lt;a href=&#034;/author/Struyf&#034;&gt;Jan Struyf&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2657e93d923594d7af5cfee44133ef449/dblp"><title>Improving the Efficiency of Inductive Logic Programming Through the Use of Query Packs</title><link>http://www.bibsonomy.org/bibtex/2657e93d923594d7af5cfee44133ef449/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;, &lt;a href=&#034;/author/Dehaspe&#034;&gt;Luc Dehaspe&lt;/a&gt;, &lt;a href=&#034;/author/Demoen&#034;&gt;Bart Demoen&lt;/a&gt;, &lt;a href=&#034;/author/Janssens&#034;&gt;Gerda Janssens&lt;/a&gt;, &lt;a href=&#034;/author/Ramon&#034;&gt;Jan Ramon&lt;/a&gt;,  and &lt;a href=&#034;/author/Vandecasteele&#034;&gt;Henk Vandecasteele&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/275412dcca7e7bad3b239cfc9b9b7a2b9/dblp"><title>Top-down induction of clustering trees</title><link>http://www.bibsonomy.org/bibtex/275412dcca7e7bad3b239cfc9b9b7a2b9/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;, &lt;a href=&#034;/author/Raedt&#034;&gt;Luc De Raedt&lt;/a&gt;,  and &lt;a href=&#034;/author/Ramon&#034;&gt;Jan Ramon&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b6395d1d75cb41a0f1f4f4ef6ae45dbf/dblp"><title>Scaling Up Inductive Logic Programming by Learning from Interpretations</title><link>http://www.bibsonomy.org/bibtex/2b6395d1d75cb41a0f1f4f4ef6ae45dbf/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;, &lt;a href=&#034;/author/Raedt&#034;&gt;Luc De Raedt&lt;/a&gt;, &lt;a href=&#034;/author/Jacobs&#034;&gt;Nico Jacobs&lt;/a&gt;,  and &lt;a href=&#034;/author/Demoen&#034;&gt;Bart Demoen&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/21ee53f71f8d02c6ba0f31a1e158948f2/dblp"><title>Web Mining Research: A Survey</title><link>http://www.bibsonomy.org/bibtex/21ee53f71f8d02c6ba0f31a1e158948f2/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-05T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Kosala&#034;&gt;Raymond Kosala&lt;/a&gt;,  and &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27a4fe59c5c5218c537704fd85b240ab9/dblp"><title>Relational Learning.</title><link>http://www.bibsonomy.org/bibtex/27a4fe59c5c5218c537704fd85b240ab9/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Struyf&#034;&gt;Jan Struyf&lt;/a&gt;,  and &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Encyclopedia of Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/200cb7984de7ef394d7bdbfc7e49d73bb/dblp"><title>Multi-Instance Learning.</title><link>http://www.bibsonomy.org/bibtex/200cb7984de7ef394d7bdbfc7e49d73bb/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Ray&#034;&gt;Soumya Ray&lt;/a&gt;, &lt;a href=&#034;/author/Scott&#034;&gt;Stephen Scott&lt;/a&gt;,  and &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Encyclopedia of Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d8f9d9a3cc3e9bdc24f48740879c7725/dblp"><title>Bias Specification Language.</title><link>http://www.bibsonomy.org/bibtex/2d8f9d9a3cc3e9bdc24f48740879c7725/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Encyclopedia of Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c7fdf32dcafe7f70253ea29c2ec5230d/dblp"><title>Hypothesis Space.</title><link>http://www.bibsonomy.org/bibtex/2c7fdf32dcafe7f70253ea29c2ec5230d/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Encyclopedia of Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23d29680088952ad1d360ab04451772ea/dblp"><title>Observation Language.</title><link>http://www.bibsonomy.org/bibtex/23d29680088952ad1d360ab04451772ea/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Encyclopedia of Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ff8547d02399333fc42084160e815564/dblp"><title>Hypothesis Language.</title><link>http://www.bibsonomy.org/bibtex/2ff8547d02399333fc42084160e815564/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-25T00:00:00+01:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Encyclopedia of Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2010&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/227a9092be5006db1e1709a7adc39ac44/dblp"><title>Collaboration-Based Function Prediction in Protein-Protein Interaction Networks.</title><link>http://www.bibsonomy.org/bibtex/227a9092be5006db1e1709a7adc39ac44/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-10-25T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Rahmani&#034;&gt;Hossein Rahmani&lt;/a&gt;, &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;,  and &lt;a href=&#034;/author/Bender&#034;&gt;Andreas Bender&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IDA, &lt;/em&gt;&lt;em&gt;volume 7014 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 318-327. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2011&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2842b2285c8c254d5ab08d056e3963fc9/dblp"><title>Top-Down Induction of First Order Logical Decision Trees.</title><link>http://www.bibsonomy.org/bibtex/2842b2285c8c254d5ab08d056e3963fc9/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-09-09T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;AI Commun.&lt;/em&gt; &lt;em&gt;12(1-2):119-120&lt;/em&gt; (&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a21707837654c7471d9022b4f1ec15ff/dblp"><title>A simple regression based heuristic for learning model trees.</title><link>http://www.bibsonomy.org/bibtex/2a21707837654c7471d9022b4f1ec15ff/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-09-09T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Vens&#034;&gt;Celine Vens&lt;/a&gt;,  and &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Intell. Data Anal.&lt;/em&gt; &lt;em&gt;10(3):215-236&lt;/em&gt; (&lt;em&gt;2006&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/221af18cf0beb5b192baa80bbbef551e9/dblp"><title>First Order Random Forests with Complex Aggregates.</title><link>http://www.bibsonomy.org/bibtex/221af18cf0beb5b192baa80bbbef551e9/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-07-08T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Vens&#034;&gt;Celine Vens&lt;/a&gt;, &lt;a href=&#034;/author/Assche&#034;&gt;Anneleen Van Assche&lt;/a&gt;, &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt;,  and &lt;a href=&#034;/author/Dzeroski&#034;&gt;Saso Dzeroski&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ILP, &lt;/em&gt;&lt;em&gt;volume 3194 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 323-340. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29213555def20374cade1e1e2d2c5dcdc/dblp"><title>Query Optimization in Inductive Logic Programming by Reordering Literals.</title><link>http://www.bibsonomy.org/bibtex/29213555def20374cade1e1e2d2c5dcdc/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-07-05T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Struyf&#034;&gt;Jan Struyf&lt;/a&gt;,  and &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ILP, &lt;/em&gt;&lt;em&gt;volume 2835 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 329-346. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20f6c669a27c38f1dc1aba3627ceb3094/dblp"><title>Compact Representation of Knowledge Bases in ILP.</title><link>http://www.bibsonomy.org/bibtex/20f6c669a27c38f1dc1aba3627ceb3094/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-07-04T00:00:00+02:00</dc:date><dc:subject>dblp </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Struyf&#034;&gt;Jan Struyf&lt;/a&gt;, &lt;a href=&#034;/author/Ramon&#034;&gt;Jan Ramon&lt;/a&gt;,  and &lt;a href=&#034;/author/Blockeel&#034;&gt;Hendrik Blockeel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ILP, &lt;/em&gt;&lt;em&gt;volume 2583 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page 254-269. &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics></item></rdf:RDF>
