<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="http://www.bibsonomy.org/concept/user/hotho/ml"><title>BibSonomy bookmarks for /concept/user/hotho/ml</title><link>http://www.bibsonomy.org/rss/concept/user/hotho/ml</link><description>BibSonomy RSS Feed for /concept/user/hotho/ml</description><items><rdf:Seq><rdf:li rdf:resource="http://socialmedia.typepad.com/blog/2008/04/clustering-tags.html"/><rdf:li rdf:resource="http://www.kde.cs.uni-kassel.de/ws/rsdc08/"/><rdf:li rdf:resource="http://thesis.neminis.org/2007/12/03/support-vector-clustering-code/"/><rdf:li rdf:resource="http://theoval.sys.uea.ac.uk/~gcc/svm/toolbox/"/><rdf:li rdf:resource="http://www.kyb.tuebingen.mpg.de/bs/people/spider/"/><rdf:li rdf:resource="http://micans.org/mcl/"/><rdf:li rdf:resource="http://www2008.org/papers/fp648.html"/><rdf:li rdf:resource="http://www.wipo.int/pctdb/en/wo.jsp?WO=2006%2F116196&amp;IA=WO2006%2F116196&amp;DISPLAY=STATUS"/><rdf:li rdf:resource="http://www.data-miner.com/"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~vitor/cutonce/cutOnce.html"/><rdf:li rdf:resource="http://www.inma.ucl.ac.be/~blondel/workshops/2008/"/><rdf:li rdf:resource="http://www.wmin.ac.uk/page-14784"/><rdf:li rdf:resource="http://searchpoint.ijs.si/"/><rdf:li rdf:resource="http://www.paperoftheweek.com/"/><rdf:li rdf:resource="http://www.cs.uvm.edu/~icdm/algorithms/index.shtml"/><rdf:li rdf:resource="http://www.cs.uvm.edu/~icdm/10Problems/index.shtml"/><rdf:li rdf:resource="http://mloss.org/about/"/><rdf:li rdf:resource="http://hunch.net/~vw/"/><rdf:li rdf:resource="http://givealink.org/cgi-pub/mainPages/about/aboutus.cgi"/><rdf:li rdf:resource="http://relexo.ontoware.org/"/></rdf:Seq></items></channel><item rdf:about="http://socialmedia.typepad.com/blog/2008/04/clustering-tags.html"><title>Social Media Research Blog: Clustering Tags and Links Simultaneously</title><description></description><link>http://socialmedia.typepad.com/blog/2008/04/clustering-tags.html</link><dc:creator>hotho</dc:creator><dc:date>2008-07-12T12:19:51+02:00</dc:date><dc:subject>folksonomy clustering detection toread community </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/detection"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/community"/></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&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.</description><link>http://www.kde.cs.uni-kassel.de/ws/rsdc08/</link><dc:creator>hotho</dc:creator><dc:date>2008-05-07T18:19:42+02:00</dc:date><dc:subject>challenge workshop myown pkdd dm 2008 ml bibsonomy ecml discovery </dc:subject><content:encoded>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 &lt;span class=&#034;info&#034;&gt;...&lt;span&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;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/challenge"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/workshop"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/myown"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pkdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bibsonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ecml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/discovery"/></rdf:Bag></taxo:topics></item><item rdf:about="http://thesis.neminis.org/2007/12/03/support-vector-clustering-code/"><title>Thesis Neminis » Support Vector Clustering Code</title><description>@inproceedings{cone2006, 
   author = {Sei-Hyung Lee and Karen M. Daniels}, 
   Booktitle = {Proceedings of 6th SIAM Conference on Data Mining}, 
   Date-Added = {2007-04-29 16:58:13 +0200}, 
   Date-Modified = {2007-06-19 18:52:22 +0200}, 
   Keywords = {SVM, clustering}, 
   Month = {May}, 
   Pages = {484–488}, 
   Title = {Cone Cluster Labeling for Support Vector Clustering}, 
   Url = {http://www.siam.org/meetings/sdm06/proceedings/046lees.pdf}, 
   Year = {2006}, 
   Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGBwpZJGFyY2hpdmVyWCR2ZXJzaW9uVCR0b3BYJG9iamVjdHNfEA9OU0tleWVkQXJjaGl2ZXISAAGGoNEICVRyb290gAGoCwwXGBkaHiVVJG51bGzTDQ4PEBMWWk5TLm9iamVjdHNXTlMua2V5c1YkY2xhc3OiERKABIAFohQVgAKAA4AHXHJlbGF0aXZlUGF0aFlhbGlhc0RhdGFfEEsuLi8uLi8uLi9QYXBlcnMvTGVlL0NvbmUgQ2×1c3RlciBMYWJlbGluZyBmb3IgU3VwcG9ydCBWZWN0b3IgQ2×1c3RlcmluZy5wZGbSGw8cHVdOUy5kYXRhTxECLgAAAAACLgACAAAJRG9jdW1lbnRzAAAAAAAAAAAAAAAAAAAAAAAAvs54rkgrAAAANyVBH0NvbmUgQ2×1c3RlciBMYWJlbGluIzJGMDk0My5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvCUPCWn72AAAAAAAAAAAAAwADAAAJAAAAAAAAAAAAAAAAAAAAAANMZWUAABAACAAAvs5cjgAAABEACAAAwlpi1gAAAAEAFAA3JUEANxuAAACy8gAAEsYAABKtAAIATkRvY3VtZW50czpuZW1vOkRvY3VtZW50czpVbml2ZXJzaXRhOlBhcGVyczpMZWU6Q29uZSBDbHVzdGVyIExhYmVsaW4jMkYwOTQzLnBkZgAOAHAANwBDAG8AbgBlACAAQwBsAHUAcwB0AGUAcgAgAEwAYQBiAGUAbABpAG4AZwAgAGYAbwByACAAUwB1AHAAcABvAHIAdAAgAFYAZQBjAHQAbwByACAAQwBsAHUAcwB0AGUAcgBpAG4AZwAuAHAAZABmAA8AFAAJAEQAbwBjAHUAbQBlAG4AdABzABIAXS9uZW1vL0RvY3VtZW50cy9Vbml2ZXJzaXRhL1BhcGVycy9MZWUvQ29uZSBDbHVzdGVyIExhYmVsaW5nIGZvciBTdXBwb3J0IFZlY3RvciBDbHVzdGVyaW5nLnBkZgAAEwASL1ZvbHVtZXMvRG9jdW1lbnRzABUAAgAX//8AAIAG0h8gISJYJGNsYXNzZXNaJGNsYXNzbmFtZaMiIyRdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3TSHyAmJ6InJFxOU0RpY3Rpb25hcnkACAARABsAJAApADIARABJAEwAUQBTAFwAYgBpAHQAfACDAIYAiACKAI0AjwCRAJMAoACqAPgA/QEFAzcDOQM+A0cDUgNWA2QDawN0A3kDfAAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAOJ}, 
   Bdsk-Url-1 = {http://www.siam.org/meetings/sdm06/proceedings/046lees.pdf}
}</description><link>http://thesis.neminis.org/2007/12/03/support-vector-clustering-code/</link><dc:creator>hotho</dc:creator><dc:date>2008-05-06T09:43:38+02:00</dc:date><dc:subject>svm ml clustering code </dc:subject><content:encoded>@inproceedings{cone2006, 
   author = {Sei-Hyung Lee and Karen M. Daniels}, 
   Booktitle = {Proceedings of 6th SIAM Conference on Data Mining}, 
   Dat&lt;span class=&#034;info&#034;&gt;...&lt;span&gt;@inproceedings{cone2006, 
   author = {Sei-Hyung Lee and Karen M. Daniels}, 
   Booktitle = {Proceedings of 6th SIAM Conference on Data Mining}, 
   Date-Added = {2007-04-29 16:58:13 +0200}, 
   Date-Modified = {2007-06-19 18:52:22 +0200}, 
   Keywords = {SVM, clustering}, 
   Month = {May}, 
   Pages = {484–488}, 
   Title = {Cone Cluster Labeling for Support Vector Clustering}, 
   Url = {http://www.siam.org/meetings/sdm06/proceedings/046lees.pdf}, 
   Year = {2006}, 
   Bdsk-File-1 = {YnBsaXN0MDDUAQIDBAUGBwpZJGFyY2hpdmVyWCR2ZXJzaW9uVCR0b3BYJG9iamVjdHNfEA9OU0tleWVkQXJjaGl2ZXISAAGGoNEICVRyb290gAGoCwwXGBkaHiVVJG51bGzTDQ4PEBMWWk5TLm9iamVjdHNXTlMua2V5c1YkY2xhc3OiERKABIAFohQVgAKAA4AHXHJlbGF0aXZlUGF0aFlhbGlhc0RhdGFfEEsuLi8uLi8uLi9QYXBlcnMvTGVlL0NvbmUgQ2×1c3RlciBMYWJlbGluZyBmb3IgU3VwcG9ydCBWZWN0b3IgQ2×1c3RlcmluZy5wZGbSGw8cHVdOUy5kYXRhTxECLgAAAAACLgACAAAJRG9jdW1lbnRzAAAAAAAAAAAAAAAAAAAAAAAAvs54rkgrAAAANyVBH0NvbmUgQ2×1c3RlciBMYWJlbGluIzJGMDk0My5wZGYAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAvCUPCWn72AAAAAAAAAAAAAwADAAAJAAAAAAAAAAAAAAAAAAAAAANMZWUAABAACAAAvs5cjgAAABEACAAAwlpi1gAAAAEAFAA3JUEANxuAAACy8gAAEsYAABKtAAIATkRvY3VtZW50czpuZW1vOkRvY3VtZW50czpVbml2ZXJzaXRhOlBhcGVyczpMZWU6Q29uZSBDbHVzdGVyIExhYmVsaW4jMkYwOTQzLnBkZgAOAHAANwBDAG8AbgBlACAAQwBsAHUAcwB0AGUAcgAgAEwAYQBiAGUAbABpAG4AZwAgAGYAbwByACAAUwB1AHAAcABvAHIAdAAgAFYAZQBjAHQAbwByACAAQwBsAHUAcwB0AGUAcgBpAG4AZwAuAHAAZABmAA8AFAAJAEQAbwBjAHUAbQBlAG4AdABzABIAXS9uZW1vL0RvY3VtZW50cy9Vbml2ZXJzaXRhL1BhcGVycy9MZWUvQ29uZSBDbHVzdGVyIExhYmVsaW5nIGZvciBTdXBwb3J0IFZlY3RvciBDbHVzdGVyaW5nLnBkZgAAEwASL1ZvbHVtZXMvRG9jdW1lbnRzABUAAgAX//8AAIAG0h8gISJYJGNsYXNzZXNaJGNsYXNzbmFtZaMiIyRdTlNNdXRhYmxlRGF0YVZOU0RhdGFYTlNPYmplY3TSHyAmJ6InJFxOU0RpY3Rpb25hcnkACAARABsAJAApADIARABJAEwAUQBTAFwAYgBpAHQAfACDAIYAiACKAI0AjwCRAJMAoACqAPgA/QEFAzcDOQM+A0cDUgNWA2QDawN0A3kDfAAAAAAAAAIBAAAAAAAAACgAAAAAAAAAAAAAAAAAAAOJ}, 
   Bdsk-Url-1 = {http://www.siam.org/meetings/sdm06/proceedings/046lees.pdf}
}&lt;/span&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/svm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/code"/></rdf:Bag></taxo:topics></item><item rdf:about="http://theoval.sys.uea.ac.uk/~gcc/svm/toolbox/"><title>UEA Computational Biology Laboratory</title><description></description><link>http://theoval.sys.uea.ac.uk/~gcc/svm/toolbox/</link><dc:creator>hotho</dc:creator><dc:date>2008-05-01T14:15:28+02:00</dc:date><dc:subject>svm ml matlab </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/svm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/matlab"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.kyb.tuebingen.mpg.de/bs/people/spider/"><title>Spider</title><description></description><link>http://www.kyb.tuebingen.mpg.de/bs/people/spider/</link><dc:creator>hotho</dc:creator><dc:date>2008-05-01T14:14:37+02:00</dc:date><dc:subject>matlab svm ml spider machine learning research </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/matlab"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/svm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spider"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/research"/></rdf:Bag></taxo:topics></item><item rdf:about="http://micans.org/mcl/"><title>MCL - an algorithm for clustering graphs</title><description></description><link>http://micans.org/mcl/</link><dc:creator>hotho</dc:creator><dc:date>2008-04-26T12:26:17+02:00</dc:date><dc:subject>graph clustering tools mcl software cluster </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mcl"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cluster"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www2008.org/papers/fp648.html"><title>WWW2008 Refereed Papers - WWW 2008: Refereed Papers</title><description></description><link>http://www2008.org/papers/fp648.html</link><dc:creator>hotho</dc:creator><dc:date>2008-04-24T07:41:00+02:00</dc:date><dc:subject>del.icio.us papers clustering folksonomy 2008 www toread </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/del.icio.us"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/papers"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/www"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.wipo.int/pctdb/en/wo.jsp?WO=2006%2F116196&amp;IA=WO2006%2F116196&amp;DISPLAY=STATUS"><title>(WO/2006/116196) MEDIA OBJECT METADATA ASSOCIATION AND RANKING</title><description></description><link>http://www.wipo.int/pctdb/en/wo.jsp?WO=2006%2F116196&amp;amp;IA=WO2006%2F116196&amp;amp;DISPLAY=STATUS</link><dc:creator>hotho</dc:creator><dc:date>2008-04-15T10:17:56+02:00</dc:date><dc:subject>tag toread clustering folksonomy association rules analysis </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tag"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/association"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rules"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.data-miner.com/"><title>Predictive Data Mining and Text Mining Software</title><description>Software can be downloaded by using:
l: tmskriktext
p: 780387954332</description><link>http://www.data-miner.com/</link><dc:creator>hotho</dc:creator><dc:date>2008-04-12T15:17:18+02:00</dc:date><dc:subject>tm software mining dm text </dc:subject><content:encoded>Software can be downloaded by using:
l: tmskriktext
p: 780387954332</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~vitor/cutonce/cutOnce.html"><title>Cut Once - Thunderbird Extension</title><description></description><link>http://www.cs.cmu.edu/~vitor/cutonce/cutOnce.html</link><dc:creator>hotho</dc:creator><dc:date>2008-04-03T11:21:48+02:00</dc:date><dc:subject>extension ml vorhersage dm empfänger thunderbird </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/extension"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vorhersage"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/empfänger"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/thunderbird"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.inma.ucl.ac.be/~blondel/workshops/2008/"><title>Communities in large networks</title><description>11:30-12:15:
Jean-Loup
Guillaume, Université catholique de Louvain,
Belgium and Université de Paris 6, France 

         Ultra-fast
multi-resolution method for detecting communities in large networks</description><link>http://www.inma.ucl.ac.be/~blondel/workshops/2008/</link><dc:creator>hotho</dc:creator><dc:date>2008-03-25T19:19:51+01:00</dc:date><dc:subject>clustering toread networks communities </dc:subject><content:encoded>11:30-12:15:
Jean-Loup
Guillaume, Université catholique de Louvain,
Belgium and Université de Paris 6, France 

         Ultra-fast
multi-resolution &lt;span class=&#034;info&#034;&gt;...&lt;span&gt;11:30-12:15:
Jean-Loup
Guillaume, Université catholique de Louvain,
Belgium and Université de Paris 6, France 

         Ultra-fast
multi-resolution method for detecting communities in large networks&lt;/span&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/communities"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.wmin.ac.uk/page-14784"><title>NLDB 2008</title><description></description><link>http://www.wmin.ac.uk/page-14784</link><dc:creator>hotho</dc:creator><dc:date>2008-03-21T12:19:07+01:00</dc:date><dc:subject>dm 2008 pc nldb semantic mining web nlp conference ml </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pc"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nldb"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nlp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/conference"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://searchpoint.ijs.si/"><title>SearchPoint</title><description></description><link>http://searchpoint.ijs.si/</link><dc:creator>hotho</dc:creator><dc:date>2008-02-19T14:53:33+01:00</dc:date><dc:subject>search 2.0 engine clustering ontology </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2.0"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/engine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ontology"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.paperoftheweek.com/"><title>Paper of the Week</title><description>Each week a new paper is discussed, seems to be mostly in the domain of knowledge discovery, text mining machine learning</description><link>http://www.paperoftheweek.com/</link><dc:creator>hotho</dc:creator><dc:date>2008-02-11T17:28:16+01:00</dc:date><dc:subject>nlp paper kdd toread ml </dc:subject><content:encoded>Each week a new paper is discussed, seems to be mostly in the domain of knowledge discovery, text mining machine learning</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nlp"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toread"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.uvm.edu/~icdm/algorithms/index.shtml"><title>IEEE Conference on Data Mining</title><description></description><link>http://www.cs.uvm.edu/~icdm/algorithms/index.shtml</link><dc:creator>hotho</dc:creator><dc:date>2008-01-22T11:17:54+01:00</dc:date><dc:subject>data mining icdm dm algorithm </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/icdm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.uvm.edu/~icdm/10Problems/index.shtml"><title>IEEE Conference on Data Mining</title><description></description><link>http://www.cs.uvm.edu/~icdm/10Problems/index.shtml</link><dc:creator>hotho</dc:creator><dc:date>2008-01-22T11:17:38+01:00</dc:date><dc:subject>dm data mining problem icdm </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/problem"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/icdm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://mloss.org/about/"><title>mloss | About</title><description></description><link>http://mloss.org/about/</link><dc:creator>hotho</dc:creator><dc:date>2008-01-16T08:26:12+01:00</dc:date><dc:subject>ml source software learning machine open </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/source"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/open"/></rdf:Bag></taxo:topics></item><item rdf:about="http://hunch.net/~vw/"><title>Vowpal Wabbit (Fast Online Learning)</title><description></description><link>http://hunch.net/~vw/</link><dc:creator>hotho</dc:creator><dc:date>2008-01-01T11:23:02+01:00</dc:date><dc:subject>online fast learning ml dm </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/online"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fast"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://givealink.org/cgi-pub/mainPages/about/aboutus.cgi"><title>givealink.org</title><description></description><link>http://givealink.org/cgi-pub/mainPages/about/aboutus.cgi</link><dc:creator>hotho</dc:creator><dc:date>2007-12-01T10:41:04+01:00</dc:date><dc:subject>web semantic folksonomy ml mining tools publication dm </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/semantic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/publication"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://relexo.ontoware.org/"><title>Relational Exploration and Ontology Learning</title><description></description><link>http://relexo.ontoware.org/</link><dc:creator>hotho</dc:creator><dc:date>2007-11-25T10:58:57+01:00</dc:date><dc:subject>ol kaon relational exploration learning ontology ml </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ol"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kaon"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/relational"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/exploration"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ontology"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/></rdf:Bag></taxo:topics></item></rdf:RDF>