<rdf:RDF xmlns:burst="http://xmlns.com/burst/0.1/" xmlns:admin="http://webns.net/mvcb/" xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:syn="http://purl.org/rss/1.0/modules/syndication/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns:owl="http://www.w3.org/2002/07/owl#" xmlns:cc="http://web.resource.org/cc/" xmlns:xsd="http://www.w3.org/2001/XMLSchema#" xmlns:swrc="http://swrc.ontoware.org/ontology#" xmlns:rdfs="http://www.w3.org/2000/01/rdf-schema#" 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/burst/user/hotho/algorithm"><title>BibSonomy publications for /user/hotho/algorithm</title><link>http://www.bibsonomy.org/burst/user/hotho/algorithm</link><description>BibSonomy BuRST Feed for /user/hotho/algorithm</description><dc:date>2008-10-08T13:24:41+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/256de7e6d214faebdbf2f2ef0fce09d7d/hotho"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29a8c0bf8a22e0e4583032eaab241ea04/hotho"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d53568209eef08fb0a8734cf34c59a71/hotho"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/289178e720b621b2dceec06fdb9628e33/hotho"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2bdb30b96e5b171260b6cf3cd9d5952c5/hotho"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/256de7e6d214faebdbf2f2ef0fce09d7d/hotho"><title>Fast algorithm for detecting community structure in networks</title><link>http://www.bibsonomy.org/bibtex/256de7e6d214faebdbf2f2ef0fce09d7d/hotho</link><dc:creator>hotho</dc:creator><dc:date>2008-06-02T15:12:04+02:00</dc:date><dc:subject>networks fast community algorithm clustering </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M.E.J. &lt;a href=&#034;http://www.bibsonomy.org/author/Newman&#034;&gt;Newman&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Physical Review E&lt;/em&gt;&lt;em&gt;September2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fast"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/community"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/256de7e6d214faebdbf2f2ef0fce09d7d/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/256de7e6d214faebdbf2f2ef0fce09d7d/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cond-mat/0309508"/><swrc:date>Mon Jun 02 15:12:04 CEST 2008</swrc:date><swrc:journal>Physical Review E</swrc:journal><swrc:month>September</swrc:month><swrc:title>Fast algorithm for detecting community structure in networks</swrc:title><swrc:volume>69</swrc:volume><swrc:year>2003</swrc:year><swrc:keywords>networks fast community algorithm clustering </swrc:keywords><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M.E.J. Newman"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/29a8c0bf8a22e0e4583032eaab241ea04/hotho"><title>Information Theory, Inference, and Learning Algorithms</title><link>http://www.bibsonomy.org/bibtex/29a8c0bf8a22e0e4583032eaab241ea04/hotho</link><dc:creator>hotho</dc:creator><dc:date>2006-05-16T09:10:53+02:00</dc:date><dc:subject>algorithm kdd lecture learning 2006 </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;David J. C. &lt;a href=&#034;http://www.bibsonomy.org/author/MacKay&#034;&gt;MacKay&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2003&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2006"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/29a8c0bf8a22e0e4583032eaab241ea04/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29a8c0bf8a22e0e4583032eaab241ea04/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.inference.phy.cam.ac.uk/mackay/itila/"/><swrc:date>Tue May 16 09:10:53 CEST 2006</swrc:date><swrc:title>Information Theory, Inference, and Learning Algorithms</swrc:title><swrc:year>2003</swrc:year><swrc:keywords>algorithm kdd lecture learning 2006 </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="9780521642989" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="David J. C. MacKay"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d53568209eef08fb0a8734cf34c59a71/hotho"><title>The structure and function of complex networks</title><link>http://www.bibsonomy.org/bibtex/2d53568209eef08fb0a8734cf34c59a71/hotho</link><dc:creator>hotho</dc:creator><dc:date>2006-01-24T08:42:05+01:00</dc:date><dc:subject>scale_free_networks kdubiq summerschool complex_systems folksonomy world small information web_graph retrieval network socialnetwork algorithm theory web clustering </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. E. J. &lt;a href=&#034;http://www.bibsonomy.org/author/Newman&#034;&gt;Newman&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;March2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/scale_free_networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdubiq"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/summerschool"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/complex_systems"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/world"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/small"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web_graph"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/socialnetwork"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2d53568209eef08fb0a8734cf34c59a71/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2d53568209eef08fb0a8734cf34c59a71/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Misc"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cond-mat/0303516"/><swrc:date>Tue Jan 24 08:42:05 CET 2006</swrc:date><swrc:month>March</swrc:month><swrc:title>The structure and function of complex networks</swrc:title><swrc:year>2003</swrc:year><swrc:keywords>scale_free_networks kdubiq summerschool complex_systems folksonomy world small information web_graph retrieval network socialnetwork algorithm theory web clustering </swrc:keywords><swrc:abstract>Inspired by empirical studies of networked systems such as the Internet,
social networks, and biological networks, researchers have in recent years
developed a variety of techniques and models to help us understand or predict
the behavior of these systems. Here we review developments in this field,
including such concepts as the small-world effect, degree distributions,
clustering, network correlations, random graph models, models of network growth
and preferential attachment, and dynamical processes taking place on networks.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="155" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="affinity algorithm arch clustering complex-systems folksonomy growth information_retrieval math network network_theory readinggroup scale-free-networks small_world socialnetwork systems thesis web web-graph" swrc:key="keywords"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="5" swrc:key="priority"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="cond-mat/0303516" swrc:key="eprint"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. E. J. Newman"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/289178e720b621b2dceec06fdb9628e33/hotho"><title>PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment</title><link>http://www.bibsonomy.org/bibtex/289178e720b621b2dceec06fdb9628e33/hotho</link><dc:creator>hotho</dc:creator><dc:date>2005-12-20T20:21:42+01:00</dc:date><dc:subject>alignment ontology merging automated prompt algorithm tool </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;N. &lt;a href=&#034;http://www.bibsonomy.org/author/Noy&#034;&gt;Noy&lt;/a&gt;  und M. &lt;a href=&#034;http://www.bibsonomy.org/author/Musen&#034;&gt;Musen&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000), &lt;/em&gt;&lt;em&gt;Seite450--455. &lt;/em&gt;&lt;em&gt;Austin, Texas, &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/alignment"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ontology"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/merging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/automated"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prompt"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tool"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/289178e720b621b2dceec06fdb9628e33/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/289178e720b621b2dceec06fdb9628e33/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://smi-web.stanford.edu/people/noy/publications.html"/><swrc:date>Tue Dec 20 20:21:42 CET 2005</swrc:date><swrc:address>Austin, Texas</swrc:address><swrc:booktitle>Proceedings of the Seventeenth National Conference on Artificial Intelligence (AAAI-2000)</swrc:booktitle><swrc:pages>450--455</swrc:pages><swrc:title>PROMPT: Algorithm and Tool for Automated Ontology Merging and Alignment</swrc:title><swrc:year>2000</swrc:year><swrc:keywords>alignment ontology merging automated prompt algorithm tool </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="3-540-41066-X" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="N. Noy"/></rdf:_1><rdf:_2><swrc:Person swrc:name="M. Musen"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2bdb30b96e5b171260b6cf3cd9d5952c5/hotho"><title>A sequential sampling algorithm for a general class of utility criteria</title><link>http://www.bibsonomy.org/bibtex/2bdb30b96e5b171260b6cf3cd9d5952c5/hotho</link><dc:creator>hotho</dc:creator><dc:date>2005-12-20T20:21:42+01:00</dc:date><dc:subject>utility algorithm criteria sampling general class sequential </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Tobias &lt;a href=&#034;http://www.bibsonomy.org/author/Scheffer&#034;&gt;Scheffer&lt;/a&gt;  und Stefan &lt;a href=&#034;http://www.bibsonomy.org/author/Wrobel&#034;&gt;Wrobel&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Knowledge Discovery and Data Mining, &lt;/em&gt;&lt;em&gt;Seite330--334. &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/utility"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/criteria"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sampling"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/general"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/class"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequential"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2bdb30b96e5b171260b6cf3cd9d5952c5/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2bdb30b96e5b171260b6cf3cd9d5952c5/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Tue Dec 20 20:21:42 CET 2005</swrc:date><swrc:booktitle>Knowledge Discovery and Data Mining</swrc:booktitle><swrc:pages>330--334</swrc:pages><swrc:title>A sequential sampling algorithm for a general class of utility criteria</swrc:title><swrc:year>2000</swrc:year><swrc:keywords>utility algorithm criteria sampling general class sequential </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="3-540-41066-X" swrc:key="isbn"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Tobias Scheffer"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Stefan Wrobel"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>