<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/kde-alumni/discovery"><title>BibSonomy bookmarks for /user/kde-alumni/discovery</title><link>https://www.bibsonomy.org/user/kde-alumni/discovery</link><description>BibSonomy RSS Feed for /user/kde-alumni/discovery</description><items><rdf:Seq><rdf:li rdf:resource="http://www.kde.cs.uni-kassel.de/ws/dc13/"/><rdf:li rdf:resource="http://www.kde.cs.uni-kassel.de/ws/rsdc08/"/><rdf:li rdf:resource="http://www.kde.cs.uni-kassel.de/ws/dc09/"/></rdf:Seq></items></channel><item rdf:about="http://www.kde.cs.uni-kassel.de/ws/dc13/"><title>15th Discovery Challenge | organized in conjunction with ECML PKDD 2013</title><description></description><link>http://www.kde.cs.uni-kassel.de/ws/dc13/</link><dc:creator>kde-alumni</dc:creator><dc:date>2015-10-16T11:03:08+02:00</dc:date><dc:subject>2013 challenge dc13 discovery ecmlpkdd myown recommender </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2015-10-16T11:03:08+02:00&#034; href=&#034;http://www.kde.cs.uni-kassel.de/ws/dc13/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.kde.cs.uni-kassel.de/ws/dc13/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2013"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/challenge"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dc13"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/discovery"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ecmlpkdd"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/myown"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/recommender"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.kde.cs.uni-kassel.de/ws/rsdc08/"><title>ECML PKDD Discovery Challenge 2008</title><description>This year&#039;s discovery challenge presents two tasks in the new area 
			of social bookmarking. One task covers spam detection and
			the other covers tag recommendations. As we are hosting the social bookmark and
			publication sharing system BibSonomy, we are able to provide a dataset 
			of BibSonomy for the challenge. A training dataset for both tasks is provided at the beginning of the competition. 
			The test dataset will be released 48 hours before the final deadline. Due to a very tight schedule we cannot grant any deadline 
                        extension. 
			The presentation of the results will take place at the ECML/PKDD workshop where the top teams are
			invited to present their approaches and results.</description><link>http://www.kde.cs.uni-kassel.de/ws/rsdc08/</link><dc:creator>kde-alumni</dc:creator><dc:date>2015-10-16T10:56:11+02:00</dc:date><dc:subject>2008 bibsonomy challenge discovery dm ecml ml myown pkdd workshop </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This year&amp;#039;s discovery challenge presents two tasks in the new area 
			of social bookmarking. One task covers spam detection and
			the other covers tag recommendations. As we are hosting the social bookmark and
			publication sharing system BibSonomy, we are able to provide a dataset 
			of BibSonomy for the challenge. A training dataset for both tasks is provided at the beginning of the competition. 
			The test dataset will be released 48 hours before the final deadline. Due to a very tight schedule we cannot grant any deadline 
                        extension. 
			The presentation of the results will take place at the ECML/PKDD workshop where the top teams are
			invited to present their approaches and results.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2008"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/bibsonomy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/challenge"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/discovery"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ecml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/myown"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pkdd"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/workshop"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.kde.cs.uni-kassel.de/ws/dc09/"><title>ECML PKDD Discovery Challenge 2009</title><description>mendation service which can be called via HTTP by BibSonomy&#039;s recommender when a user posts a bookmark or publication. All participating recommenders are called on each posting process, one of them is choosen to actually deliver the results to the user. We can then measure </description><link>http://www.kde.cs.uni-kassel.de/ws/dc09/</link><dc:creator>kde-alumni</dc:creator><dc:date>2015-10-16T10:54:45+02:00</dc:date><dc:subject>2009 challenge discovery ecml myown pkdd workshop </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;mendation service which can be called via HTTP by BibSonomy&amp;#039;s recommender when a user posts a bookmark or publication. All participating recommenders are called on each posting process, one of them is choosen to actually deliver the results to the user. We can then measure &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/2009"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/challenge"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/discovery"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ecml"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/myown"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/pkdd"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/workshop"/></rdf:Bag></taxo:topics></item></rdf:RDF>