<?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/"><title>BibSonomy publications for /</title><link>BibSonomyburst/</link><description>BibSonomy RSS feed for /</description><dc:date>2012-02-14T01:27:41+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2268e9546446d8bd65e0a15792879e333/folke"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27f9e0de989ed9bd4deaa41d39bc98d4c/folke"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2df6dbed89a49a368270d4ea42beebc26/drmatusek"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2000eaa395ab34d01885bf70fbd9cd1ac/beate"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2275220e7853ed9478bf88e804faf96a2/beate"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2268e9546446d8bd65e0a15792879e333/folke"><title>Graph entropy: A survey</title><link>http://www.bibsonomy.org/bibtex/2268e9546446d8bd65e0a15792879e333/folke</link><dc:creator>folke</dc:creator><dc:date>2012-02-14T00:56:20+01:00</dc:date><dc:subject>analysis entropy graph network theory </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Simonyi&#034;&gt;G. Simonyi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Combinatorial Optimization&lt;/em&gt;  (&lt;em&gt;1995&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2268e9546446d8bd65e0a15792879e333/folke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2268e9546446d8bd65e0a15792879e333/folke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://scholar.google.com/scholar.bib?q=info:vh6sRffaxYEJ:scholar.google.com/&amp;output=citation&amp;hl=en&amp;as_sdt=0,5&amp;as_vis=1&amp;ct=citation&amp;cd=0"/><swrc:date>Tue Feb 14 00:56:20 CET 2012</swrc:date><swrc:journal>Combinatorial Optimization</swrc:journal><swrc:pages>399--441</swrc:pages><swrc:publisher><swrc:Organization swrc:name="DIMACS Series on Discrete Math and Computer Science"/></swrc:publisher><swrc:title>Graph entropy: A survey</swrc:title><swrc:volume>20</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>analysis entropy graph network theory </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="G. Simonyi"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/27f9e0de989ed9bd4deaa41d39bc98d4c/folke"><title>Information processing in complex networks: Graph entropy and information functionals</title><link>http://www.bibsonomy.org/bibtex/27f9e0de989ed9bd4deaa41d39bc98d4c/folke</link><dc:creator>folke</dc:creator><dc:date>2012-02-14T00:53:13+01:00</dc:date><dc:subject>analysis entropy graph network theory </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Dehmer&#034;&gt;M. Dehmer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Applied Mathematics and Computation&lt;/em&gt; &lt;em&gt;201(1):82--94&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/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27f9e0de989ed9bd4deaa41d39bc98d4c/folke"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27f9e0de989ed9bd4deaa41d39bc98d4c/folke"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://scholar.google.de/scholar.bib?q=info:iQ0tq1hMPwgJ:scholar.google.com/&amp;output=citation&amp;hl=de&amp;as_sdt=0&amp;ct=citation&amp;cd=0"/><swrc:date>Tue Feb 14 00:53:13 CET 2012</swrc:date><swrc:journal>Applied Mathematics and Computation</swrc:journal><swrc:number>1</swrc:number><swrc:pages>82--94</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Elsevier"/></swrc:publisher><swrc:title>Information processing in complex networks: Graph entropy and information functionals</swrc:title><swrc:volume>201</swrc:volume><swrc:year>2008</swrc:year><swrc:keywords>analysis entropy graph network theory </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Dehmer"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2df6dbed89a49a368270d4ea42beebc26/drmatusek"><title>Multireference Nature of Chemistry: The Coupled-Cluster View</title><link>http://www.bibsonomy.org/bibtex/2df6dbed89a49a368270d4ea42beebc26/drmatusek</link><dc:creator>drmatusek</dc:creator><dc:date>2012-02-14T00:52:33+01:00</dc:date><dc:subject>chemistry cluster coupled quantum review theory </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Lyakh&#034;&gt;Dmitry I. Lyakh&lt;/a&gt;, &lt;a href=&#034;/author/Musial&#034;&gt;Monika Musial&lt;/a&gt;, &lt;a href=&#034;/author/Lotrich&#034;&gt;Victor F. Lotrich&lt;/a&gt;,  and &lt;a href=&#034;/author/Bartlett&#034;&gt;Rodney J. Bartlett&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Chemical Reviews&lt;/em&gt; &lt;em&gt;112(1):182-243&lt;/em&gt; (&lt;em&gt;January 2012&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/chemistry"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cluster"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/coupled"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/quantum"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/review"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2df6dbed89a49a368270d4ea42beebc26/drmatusek"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2df6dbed89a49a368270d4ea42beebc26/drmatusek"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://pubs.acs.org/doi/abs/10.1021/cr2001417"/><swrc:date>Tue Feb 14 00:52:33 CET 2012</swrc:date><swrc:journal>Chemical Reviews</swrc:journal><swrc:month>January</swrc:month><swrc:number>1</swrc:number><swrc:pages>182-243</swrc:pages><swrc:title>Multireference Nature of Chemistry: The Coupled-Cluster View</swrc:title><swrc:volume>112</swrc:volume><swrc:year>2012</swrc:year><swrc:keywords>chemistry cluster coupled quantum review theory </swrc:keywords><swrc:abstract>A review of advances in multireference coupled cluster theory and methods.  Section titles are:  Introduction;  Exponential Era of Electron Correlation Theory;  Genuine Multireference Coupled-Cluster Theory in Hilbert Space;  Genuine Multireference Coupled-Cluster Theory in Fock Space; Alternative Multireference Coupled-Cluster Methods;  Numerical Illustrations;  To Multireference or Not to Multireference?</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="10.1021/cr2001417" swrc:key="doi"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="http://pubs.acs.org/doi/pdf/10.1021/cr2001417" swrc:key="eprint"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Dmitry I. Lyakh"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Monika Musial"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Victor F. Lotrich"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Rodney J. Bartlett"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2000eaa395ab34d01885bf70fbd9cd1ac/beate"><title>&#034;In vivo&#034; spam filtering: a challenge problem for KDD</title><link>http://www.bibsonomy.org/bibtex/2000eaa395ab34d01885bf70fbd9cd1ac/beate</link><dc:creator>beate</dc:creator><dc:date>2012-02-13T23:20:51+01:00</dc:date><dc:subject>challenges spam spam-detection survey </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Fawcett&#034;&gt;Tom Fawcett&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SIGKDD Explor. Newsl.&lt;/em&gt;  (&lt;em&gt;December 2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/challenges"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam-detection"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/survey"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2000eaa395ab34d01885bf70fbd9cd1ac/beate"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2000eaa395ab34d01885bf70fbd9cd1ac/beate"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://doi.acm.org/10.1145/980972.980990"/><swrc:date>Mon Feb 13 23:20:51 CET 2012</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>SIGKDD Explor. Newsl.</swrc:journal><swrc:month>December</swrc:month><swrc:pages>140--148</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>&#034;In vivo&#034; spam filtering: a challenge problem for KDD</swrc:title><swrc:volume>5</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>challenges spam spam-detection survey </swrc:keywords><swrc:abstract>Spam, also known as Unsolicited Commercial Email (UCE), is the bane of email communication. Many data mining researchers have addressed the problem of detecting spam, generally by treating it as a static text classification problem. True &lt;i&gt;in vivo&lt;/i&gt; spam filtering has characteristics that make it a rich and challenging domain for data mining. Indeed, real-world datasets with these characteristics are typically difficult to acquire and to share. This paper demonstrates some of these characteristics and argues that researchers should pursue &lt;i&gt;in vivo&lt;/i&gt; spam filtering as an accessible domain for investigating them.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1931-0145" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="980990" swrc:key="acmid"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="issue"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="9" swrc:key="numpages"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1145/980972.980990" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Tom Fawcett"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication><description>&#034;In vivo&#034; spam filtering</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2275220e7853ed9478bf88e804faf96a2/beate"><title>Review: A review of machine learning approaches to Spam filtering</title><link>http://www.bibsonomy.org/bibtex/2275220e7853ed9478bf88e804faf96a2/beate</link><dc:creator>beate</dc:creator><dc:date>2012-02-13T22:45:00+01:00</dc:date><dc:subject>ml naive-bayes spam spam-detection survey </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Guzella&#034;&gt;Thiago S. Guzella&lt;/a&gt;,  and &lt;a href=&#034;/author/Caminhas&#034;&gt;Walmir M. Caminhas&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Expert Syst. Appl.&lt;/em&gt;  (&lt;em&gt;September 2009&lt;/em&gt;)</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/naive-bayes"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam-detection"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/survey"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2275220e7853ed9478bf88e804faf96a2/beate"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2275220e7853ed9478bf88e804faf96a2/beate"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dl.acm.org/citation.cfm?id=1539049.1539460"/><swrc:date>Mon Feb 13 22:45:00 CET 2012</swrc:date><swrc:address>Tarrytown, NY, USA</swrc:address><swrc:journal>Expert Syst. Appl.</swrc:journal><swrc:month>September</swrc:month><swrc:pages>10206--10222</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Pergamon Press, Inc."/></swrc:publisher><swrc:title>Review: A review of machine learning approaches to Spam filtering</swrc:title><swrc:volume>36</swrc:volume><swrc:year>2009</swrc:year><swrc:keywords>ml naive-bayes spam spam-detection survey </swrc:keywords><swrc:abstract>In this paper, we present a comprehensive review of recent developments in the application of machine learning algorithms to Spam filtering, focusing on both textual- and image-based approaches. Instead of considering Spam filtering as a standard classification problem, we highlight the importance of considering specific characteristics of the problem, especially concept drift, in designing new filters. Two particularly important aspects not widely recognized in the literature are discussed: the difficulties in updating a classifier based on the bag-of-words representation and a major difference between two early naive Bayes models. Overall, we conclude that while important advancements have been made in the last years, several aspects remain to be explored, especially under more realistic evaluation settings. </swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="0957-4174" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1539460" swrc:key="acmid"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="7" swrc:key="issue"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="17" swrc:key="numpages"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1016/j.eswa.2009.02.037" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thiago S. Guzella"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Walmir M. Caminhas"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication><description>Review</description></item></rdf:RDF>
