<?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/fsteeg/ma"><title>BibSonomy bookmarks for /user/fsteeg/ma</title><link>https://www.bibsonomy.org/user/fsteeg/ma</link><description>BibSonomy RSS Feed for /user/fsteeg/ma</description><items><rdf:Seq><rdf:li rdf:resource="http://eusoils.jrc.it/ESDB_Archive/eusoils_docs/other/EUR22191.pdf"/><rdf:li rdf:resource="http://www.cs.cmu.edu/~wcohen/pubs-x.html"/><rdf:li rdf:resource="http://portal.acm.org/citation.cfm?id=1089820&amp;dl=ACM&amp;coll=&amp;CFID=15151515&amp;CFTOKEN=6184618"/><rdf:li rdf:resource="http://labs.google.com/papers/sawzall.html"/><rdf:li rdf:resource="http://www.inf.fh-brs.de/"/></rdf:Seq></items></channel><item rdf:about="http://eusoils.jrc.it/ESDB_Archive/eusoils_docs/other/EUR22191.pdf"><title>The Unofficial Guide for Authors</title><description>(or how to produce research articles worth citing)</description><link>http://eusoils.jrc.it/ESDB_Archive/eusoils_docs/other/EUR22191.pdf</link><dc:creator>fsteeg</dc:creator><dc:date>2007-04-18T05:27:14+02:00</dc:date><dc:subject>ma publications science writing </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;(or how to produce research articles worth citing)&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ma"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/publications"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/science"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/writing"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.cmu.edu/~wcohen/pubs-x.html"><title>William W. Cohen&#039;s Papers: Information Extraction</title><description></description><link>http://www.cs.cmu.edu/~wcohen/pubs-x.html</link><dc:creator>fsteeg</dc:creator><dc:date>2006-11-18T19:24:44+01:00</dc:date><dc:subject>ie ma mining </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-18T19:24:44+01:00&#034; href=&#034;http://www.cs.cmu.edu/~wcohen/pubs-x.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.cmu.edu/~wcohen/pubs-x.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ie"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ma"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mining"/></rdf:Bag></taxo:topics></item><item rdf:about="http://portal.acm.org/citation.cfm?id=1089820&amp;dl=ACM&amp;coll=&amp;CFID=15151515&amp;CFTOKEN=6184618"><title>Distributed higher order association rule mining using information extracted from textual data</title><description></description><link>http://portal.acm.org/citation.cfm?id=1089820&amp;dl=ACM&amp;coll=&amp;CFID=15151515&amp;CFTOKEN=6184618</link><dc:creator>fsteeg</dc:creator><dc:date>2006-11-18T19:23:57+01:00</dc:date><dc:subject>ie ma mining </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2006-11-18T19:23:57+01:00&#034; href=&#034;http://portal.acm.org/citation.cfm?id=1089820&amp;amp;dl=ACM&amp;amp;coll=&amp;amp;CFID=15151515&amp;amp;CFTOKEN=6184618&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://portal.acm.org/citation.cfm?id=1089820&amp;amp;dl=ACM&amp;amp;coll=&amp;amp;CFID=15151515&amp;amp;CFTOKEN=6184618&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ie"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ma"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/mining"/></rdf:Bag></taxo:topics></item><item rdf:about="http://labs.google.com/papers/sawzall.html"><title>Google Research Publication: Sawzall</title><description>&#034;Very large data sets often have a flat but regular structure and span multiple disks and machines. ... These large data sets are not amenable to study using traditional dat</description><link>http://labs.google.com/papers/sawzall.html</link><dc:creator>fsteeg</dc:creator><dc:date>2006-10-23T20:38:44+02:00</dc:date><dc:subject>data-mining db dsl ma programming-languages retrieval </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;&amp;#034;Very large data sets often have a flat but regular structure and span multiple disks and machines. ... These large data sets are not amenable to study using traditional dat&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/data-mining"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/db"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/dsl"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ma"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/programming-languages"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/retrieval"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.inf.fh-brs.de/"><title>Fachbereich Informatik - Fachhochschule Bonn-Rhein-Sieg</title><description>..in St. Augustin</description><link>http://www.inf.fh-brs.de/</link><dc:creator>fsteeg</dc:creator><dc:date>2006-10-21T14:47:11+02:00</dc:date><dc:subject>cologne fh informatik jobs ma </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;..in St. Augustin&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/cologne"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/fh"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/informatik"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/jobs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/ma"/></rdf:Bag></taxo:topics></item></rdf:RDF>