<?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/Obermayer"><title>BibSonomy publications for /author/Obermayer</title><link>BibSonomyburst/author/Obermayer</link><description>BibSonomy RSS feed for /author/Obermayer</description><dc:date>2012-02-16T01:37:35+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp"><title>Tripartite community structure in social bookmarking data.</title><link>http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/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/Neubauer&#034;&gt;Nicolas Neubauer&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;The New Review of Hypermedia and Multimedia&lt;/em&gt; &lt;em&gt;17(3):267-294&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2300713ac0b6284882f5f51cd28986243/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2300713ac0b6284882f5f51cd28986243/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/nrhm/nrhm17.html#NeubauerO11"/><swrc:date>Mon Feb 06 00:00:00 CET 2012</swrc:date><swrc:journal>The New Review of Hypermedia and Multimedia</swrc:journal><swrc:number>3</swrc:number><swrc:pages>267-294</swrc:pages><swrc:title>Tripartite community structure in social bookmarking data.</swrc:title><swrc:volume>17</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1080/13614568.2011.598952" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicolas Neubauer"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp"><title>Soft nearest prototype classification.</title><link>http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-12-16T00: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/Seo&#034;&gt;Sambu Seo&lt;/a&gt;, &lt;a href=&#034;/author/Bode&#034;&gt;Mathias Bode&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;IEEE Transactions on Neural Networks&lt;/em&gt; &lt;em&gt;14(2):390-398&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2fbe253d82413cdec56ec528eb076761b/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/tnn/tnn14.html#SeoBO03"/><swrc:date>Fri Dec 16 00:00:00 CET 2011</swrc:date><swrc:journal>IEEE Transactions on Neural Networks</swrc:journal><swrc:number>2</swrc:number><swrc:pages>390-398</swrc:pages><swrc:title>Soft nearest prototype classification.</swrc:title><swrc:volume>14</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1109/TNN.2003.809407" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sambu Seo"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Mathias Bode"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp"><title>Graph Quantization</title><link>http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/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/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2304cb641fb892b2e98b28a993f9a67c7/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1001.html#abs-1001-0921"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Graph Quantization</swrc:title><swrc:volume>abs/1001.0921</swrc:volume><swrc:year>2010</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1001.0921" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Brijnesh J. Jain"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp"><title>Accelerating Competitive Learning Graph Quantization</title><link>http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/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/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/28e9c44b6f7f8ad7bfea99c1c1a0784a5/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1001.html#abs-1001-0927"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Accelerating Competitive Learning Graph Quantization</swrc:title><swrc:volume>abs/1001.0927</swrc:volume><swrc:year>2010</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1001.0927" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Brijnesh J. Jain"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp"><title>Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem</title><link>http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/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/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27cb50b40431cf28ffd5f3d52c47cb66d/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1101.html#abs-1101-1266"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Extending Bron Kerbosch for Solving the Maximum Weight Clique Problem</swrc:title><swrc:volume>abs/1101.1266</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1101.1266" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Brijnesh J. Jain"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp"><title>A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem</title><link>http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/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/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f6bfab27f721f797cc1de0f1a6a5b25b/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0912.html#abs-0912-4584"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>A Necessary and Sufficient Condition for Graph Matching Being Equivalent to the Maximum Weight Clique Problem</swrc:title><swrc:volume>abs/0912.4584</swrc:volume><swrc:year>2009</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/0912.4584" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Brijnesh J. Jain"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp"><title>Elkan&#039;s k-Means for Graphs</title><link>http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/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/Jain&#034;&gt;Brijnesh J. Jain&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;CoRR&lt;/em&gt;  (&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20962df23706bf1f53281175c27470f10/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20962df23706bf1f53281175c27470f10/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr0912.html#abs-0912-4598"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Elkan&#039;s k-Means for Graphs</swrc:title><swrc:volume>abs/0912.4598</swrc:volume><swrc:year>2009</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/0912.4598" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Brijnesh J. Jain"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp"><title>A Unified Framework for Risk-sensitive Markov Decision Processes with Finite State and Action Spaces</title><link>http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/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/Shen&#034;&gt;Yun Shen&lt;/a&gt;, &lt;a href=&#034;/author/Grünewälder&#034;&gt;Steffen Grünewälder&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2850286e0efa0705bac12a07a8d22a1f2/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1110.html#abs-1110-6317"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>A Unified Framework for Risk-sensitive Markov Decision Processes with Finite State and Action Spaces</swrc:title><swrc:volume>abs/1110.6317</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1110.6317" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Yun Shen"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Steffen Grünewälder"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp"><title>Probabilistic prototype models for attributed graphs</title><link>http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/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/Srinivasan&#034;&gt;S. Deepak Srinivasan&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e830e708c1f6b082628ee7f3bf9c2d48/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/corr/corr1109.html#abs-1109-4744"/><swrc:date>Mon Dec 05 00:00:00 CET 2011</swrc:date><swrc:journal>CoRR</swrc:journal><swrc:title>Probabilistic prototype models for attributed graphs</swrc:title><swrc:volume>abs/1109.4744</swrc:volume><swrc:year>2011</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://arxiv.org/abs/1109.4744" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="S. Deepak Srinivasan"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate"><title>Hyperincident connected components of tagging networks</title><link>http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate</link><dc:creator>beate</dc:creator><dc:date>2011-11-30T07:55:16+01:00</dc:date><dc:subject>bibsonomy-dataset networks spam tagging </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Neubauer&#034;&gt;Nicolas Neubauer&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SIGWEB Newsl.&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/bibsonomy-dataset"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/27ac6cd7d96cce39a5240ae4280f614b3/beate"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://doi.acm.org/10.1145/1592394.1592398"/><swrc:date>Wed Nov 30 07:55:16 CET 2011</swrc:date><swrc:address>New York, NY, USA</swrc:address><swrc:journal>SIGWEB Newsl.</swrc:journal><swrc:month>September</swrc:month><swrc:pages>4:1--4:10</swrc:pages><swrc:publisher><swrc:Organization swrc:name="ACM"/></swrc:publisher><swrc:title>Hyperincident connected components of tagging networks</swrc:title><swrc:year>2009</swrc:year><swrc:keywords>bibsonomy-dataset networks spam tagging </swrc:keywords><swrc:abstract>Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of complex network analysis can be applied to examine their properties. One of the most basic tools, the analysis of connected components, however cannot be applied meaningfully: Tagging networks tend to be almost entirely connected. We therefore propose a generalization of connected components, &lt;i&gt;m&lt;/i&gt;-hyperincident connected components. We show that decomposing tagging networks into 2-hyperincident connected components yields a characteristic component distribution with a salient giant component that can be found across various datasets. This pattern changes if the underlying formation process changes, for example, if the hypergraph is constructed from search logs, or if the tagging data is contaminated by spam: It turns out that the second- to 129th largest components of the spam-labeled Bibsonomy dataset are inhabited exclusively by spam users. Based on these findings, we propose and unsupervised method for spam detection.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="1931-1745" swrc:key="issn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1592398" swrc:key="acmid"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="Autumn" swrc:key="issue"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10" swrc:key="numpages"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="4" swrc:key="articleno"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1145/1592394.1592398" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicolas Neubauer"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication><description>Hyperincident connected components of tagging networks</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp"><title>Distance Measures in Query Space: How Strongly to Use Feedback From Past Queries.</title><link>http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-24T00: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/Neubauer&#034;&gt;Nicolas Neubauer&lt;/a&gt;, &lt;a href=&#034;/author/Scheel&#034;&gt;Christian Scheel&lt;/a&gt;, &lt;a href=&#034;/author/Albayrak&#034;&gt;Sahin Albayrak&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Web Intelligence, &lt;/em&gt;&lt;em&gt;page 607-613. &lt;/em&gt;&lt;em&gt;IEEE Computer Society, &lt;/em&gt;(&lt;em&gt;2007&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29d2a5013b8ae1f80a9eb2cc92294beb3/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/webi/webi2007.html#NeubauerSAO07"/><swrc:date>Thu Nov 24 00:00:00 CET 2011</swrc:date><swrc:booktitle>Web Intelligence</swrc:booktitle><swrc:crossref>conf/webi/2007</swrc:crossref><swrc:pages>607-613</swrc:pages><swrc:publisher><swrc:Organization swrc:name="IEEE Computer Society"/></swrc:publisher><swrc:title>Distance Measures in Query Space: How Strongly to Use Feedback From Past Queries.</swrc:title><swrc:year>2007</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://doi.ieeecomputersociety.org/10.1109/WI.2007.65" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="0-7695-3026-5" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Nicolas Neubauer"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Christian Scheel"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Sahin Albayrak"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp"><title>Support Vector Machines for Dyadic Data.</title><link>http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Hochreiter&#034;&gt;Sepp Hochreiter&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;18(6):1472-1510&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/237b0973c05c329bb43d3f68cbe8d7067/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco18.html#HochreiterO06"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>6</swrc:number><swrc:pages>1472-1510</swrc:pages><swrc:title>Support Vector Machines for Dyadic Data.</swrc:title><swrc:volume>18</swrc:volume><swrc:year>2006</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/neco.2006.18.6.1472" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sepp Hochreiter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp"><title>The Joint Development of Orientation and Ocular Dominance: Role of Constraints.</title><link>http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Piepenbrock&#034;&gt;Christian Piepenbrock&lt;/a&gt;, &lt;a href=&#034;/author/Ritter&#034;&gt;Helge Ritter&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;9(5):959-970&lt;/em&gt; (&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25ce4994d41d8bcf06921a39f37c72931/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco9.html#PiepenbrockRO97"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>5</swrc:number><swrc:pages>959-970</swrc:pages><swrc:title>The Joint Development of Orientation and Ocular Dominance: Role of Constraints.</swrc:title><swrc:volume>9</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/neco.1997.9.5.959" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Christian Piepenbrock"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Helge Ritter"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp"><title>Soft Learning Vector Quantization.</title><link>http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Seo&#034;&gt;Sambu Seo&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;15(7):1589-1604&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/25fac0ef5146818367ab6bbf8424de906/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco15.html#SeoO03"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>7</swrc:number><swrc:pages>1589-1604</swrc:pages><swrc:title>Soft Learning Vector Quantization.</swrc:title><swrc:volume>15</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/089976603321891819" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Sambu Seo"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp"><title>Models of orientation and ocular dominance columns in the visual cortex: a critical comparison.</title><link>http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Erwin&#034;&gt;E. Erwin&lt;/a&gt;, &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt;,  and &lt;a href=&#034;/author/Schulten&#034;&gt;Klaus Schulten&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;7(3):425-468&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/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20198d1d7021e31f517e261d6ba780c08/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco7.html#ErwinOS95"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>3</swrc:number><swrc:pages>425-468</swrc:pages><swrc:title>Models of orientation and ocular dominance columns in the visual cortex: a critical comparison.</swrc:title><swrc:volume>7</swrc:volume><swrc:year>1995</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/neco.1995.7.3.425" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="E. Erwin"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Klaus Schulten"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp"><title>Singularities in Primate Orientation Maps.</title><link>http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt;,  and &lt;a href=&#034;/author/Blasdel&#034;&gt;Gary G. Blasdel&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;9(3):555-575&lt;/em&gt; (&lt;em&gt;1997&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/21d419e2b30fe5085d2e525e963283316/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/21d419e2b30fe5085d2e525e963283316/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco9.html#ObermayerB97"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>3</swrc:number><swrc:pages>555-575</swrc:pages><swrc:title>Singularities in Primate Orientation Maps.</swrc:title><swrc:volume>9</swrc:volume><swrc:year>1997</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/neco.1997.9.3.555" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Gary G. Blasdel"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp"><title>An Analysis of Orientation and Ocular Dominance Patterns in the Visual Cortex of Cats and Ferrets.</title><link>http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Müller&#034;&gt;T. Müller&lt;/a&gt;, &lt;a href=&#034;/author/Stetter&#034;&gt;Martin Stetter&lt;/a&gt;, &lt;a href=&#034;/author/Hübener&#034;&gt;Mark Hübener&lt;/a&gt;, &lt;a href=&#034;/author/Sengpiel&#034;&gt;F. Sengpiel&lt;/a&gt;, &lt;a href=&#034;/author/Bonhoeffer&#034;&gt;Tobias Bonhoeffer&lt;/a&gt;, &lt;a href=&#034;/author/Gödecke&#034;&gt;I. Gödecke&lt;/a&gt;, &lt;a href=&#034;/author/Chapman&#034;&gt;B. Chapman&lt;/a&gt;, &lt;a href=&#034;/author/Löwel&#034;&gt;Siegrid Löwel&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;12(11):2573-2595&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2076e49c648e8c2b48d9e2da0e1e87c72/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco12.html#MullerSHSBGCLO00"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>11</swrc:number><swrc:pages>2573-2595</swrc:pages><swrc:title>An Analysis of Orientation and Ocular Dominance Patterns in the Visual Cortex of Cats and Ferrets.</swrc:title><swrc:volume>12</swrc:volume><swrc:year>2000</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/089976600300014854" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="T. Müller"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Martin Stetter"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Mark Hübener"/></rdf:_3><rdf:_4><swrc:Person swrc:name="F. Sengpiel"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Tobias Bonhoeffer"/></rdf:_5><rdf:_6><swrc:Person swrc:name="I. Gödecke"/></rdf:_6><rdf:_7><swrc:Person swrc:name="B. Chapman"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Siegrid Löwel"/></rdf:_8><rdf:_9><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_9></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp"><title>A Stochastic Self-Organizing Map for Proximity Data.</title><link>http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-17T00: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/Graepel&#034;&gt;Thore Graepel&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Neural Computation&lt;/em&gt; &lt;em&gt;11(1):139-155&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><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f481cd227c297fa0b4d4e24e702ed625/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/neco/neco11.html#GraepelO99"/><swrc:date>Thu Nov 17 00:00:00 CET 2011</swrc:date><swrc:journal>Neural Computation</swrc:journal><swrc:number>1</swrc:number><swrc:pages>139-155</swrc:pages><swrc:title>A Stochastic Self-Organizing Map for Proximity Data.</swrc:title><swrc:volume>11</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1162/089976699300016854" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Thore Graepel"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp"><title>Correlation Coefficients are Insufficient for Analyzing Spike Count Dependencies.</title><link>http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp</link><dc:creator>dblp</dc:creator><dc:date>2011-11-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/Onken&#034;&gt;Arno Onken&lt;/a&gt;, &lt;a href=&#034;/author/Grünewälder&#034;&gt;Steffen Grünewälder&lt;/a&gt;,  and &lt;a href=&#034;/author/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt; &lt;/span&gt;&lt;em&gt;NIPS, &lt;/em&gt;&lt;em&gt;page 1383-1391. &lt;/em&gt;&lt;em&gt;Curran Associates, Inc., &lt;/em&gt;(&lt;em&gt;2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b7ed701eaf9aa1dc4a5c98c5f6351fb8/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/conf/nips/nips2009.html#OnkenGO09"/><swrc:date>Thu Nov 10 00:00:00 CET 2011</swrc:date><swrc:booktitle>NIPS</swrc:booktitle><swrc:crossref>conf/nips/2009</swrc:crossref><swrc:pages>1383-1391</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Curran Associates, Inc."/></swrc:publisher><swrc:title>Correlation Coefficients are Insufficient for Analyzing Spike Count Dependencies.</swrc:title><swrc:year>2009</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://books.nips.cc/papers/files/nips22/NIPS2009_0770.pdf" swrc:key="ee"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="9781615679119" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Arno Onken"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Steffen Grünewälder"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_3></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Yoshua Bengio"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Dale Schuurmans"/></rdf:_2><rdf:_3><swrc:Person swrc:name="John D. Lafferty"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Christopher K. I. Williams"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Aron Culotta"/></rdf:_5></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp"><title>Large-scale simulations of self-organizing neural networks on parallel computers: application to biological modelling.</title><link>http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/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/Obermayer&#034;&gt;Klaus Obermayer&lt;/a&gt;, &lt;a href=&#034;/author/Ritter&#034;&gt;Helge Ritter&lt;/a&gt;,  and &lt;a href=&#034;/author/Schulten&#034;&gt;Klaus Schulten&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Parallel Computing&lt;/em&gt; &lt;em&gt;14(3):381-404&lt;/em&gt; (&lt;em&gt;1990&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dblp"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/248ed26cbb0010602eacf5ef8c863cb00/dblp"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dblp.uni-trier.de/db/journals/pc/pc14.html#ObermayerRS90"/><swrc:date>Fri Sep 09 00:00:00 CEST 2011</swrc:date><swrc:journal>Parallel Computing</swrc:journal><swrc:number>3</swrc:number><swrc:pages>381-404</swrc:pages><swrc:title>Large-scale simulations of self-organizing neural networks on parallel computers: application to biological modelling.</swrc:title><swrc:volume>14</swrc:volume><swrc:year>1990</swrc:year><swrc:keywords>dblp </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="http://dx.doi.org/10.1016/0167-8191(90)90088-Q" swrc:key="ee"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Klaus Obermayer"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Helge Ritter"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Klaus Schulten"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>
