<?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/user/mstrohm/networks"><title>BibSonomy publications for /user/mstrohm/networks</title><link>BibSonomypublrss/user/mstrohm/networks</link><description>BibSonomy RSS feed for /user/mstrohm/networks</description><dc:date>2012-02-16T19:34:25+01:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/240c3dea03e3e4c561db6bc4b34c6f3da/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b50f5711fa3788d7f2f712db1c544144/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2e5e21b26153f8edb79b2fd996ab9fca9/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c7903397a9cd1510b5dd1ed3b13859c5/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29b041bdba459fdc749a0b13de3d343d3/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22f96232a648d4fd1617c389d899f3d2b/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28b0de27fbcccb1140d4edfb734ee6fbc/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f696989e22dd4c77c8a6352526e13efe/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27927deea07c15ecae7537ec7a4550173/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29fb3f968713acc1830c6ddcfd2b2b3e6/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fd37fa74db7f35ab2a9040b189e39f4a/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/265bbdf52fce2fa4a468abc54f0996b66/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24b94dab5e5a9cb116bc1308c65112549/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22d7c9ea5484ee45ea8bf3520138d7477/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20c44a2fcf67f578c0cc2b0235183720f/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/28b5679f3be1730633af408682fb2f69d/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d87e198a6d564ae8a8fe151e0a96fa0f/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29632c170df74cc7c30c86ed558399d69/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2524d6c7e05430cc02e39bf51c3bbd779/mstrohm"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2022c2fbab2dccc2bd4341a553d8f6574/mstrohm"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/240c3dea03e3e4c561db6bc4b34c6f3da/mstrohm"><title>Sybil-resilient online content rating</title><link>http://www.bibsonomy.org/bibtex/240c3dea03e3e4c561db6bc4b34c6f3da/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2011-06-23T23:07:21+02:00</dc:date><dc:subject>PRELIMINARY-BIBTEX networks social-factors web-science </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Tran&#034;&gt;D.N. Tran&lt;/a&gt;, &lt;a href=&#034;/author/Min&#034;&gt;B. Min&lt;/a&gt;, &lt;a href=&#034;/author/Li&#034;&gt;J. Li&lt;/a&gt;,  and &lt;a href=&#034;/author/Subramanian&#034;&gt;L. Subramanian&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Citeseer, &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/PRELIMINARY-BIBTEX"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social-factors"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b50f5711fa3788d7f2f712db1c544144/mstrohm"><title>Engineering social order</title><link>http://www.bibsonomy.org/bibtex/2b50f5711fa3788d7f2f712db1c544144/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2010-11-13T16:46:11+01:00</dc:date><dc:subject>MUSTREAD agents networks social </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Castelfranchi&#034;&gt;C. Castelfranchi&lt;/a&gt; &lt;/span&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/MUSTREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/agents"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2e5e21b26153f8edb79b2fd996ab9fca9/mstrohm"><title>The Spread of Behavior in an Online Social Network Experiment</title><link>http://www.bibsonomy.org/bibtex/2e5e21b26153f8edb79b2fd996ab9fca9/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2010-11-10T10:20:34+01:00</dc:date><dc:subject>MUSTREAD behavior networks social </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Centola&#034;&gt;D. Centola&lt;/a&gt; &lt;/span&gt;&lt;em&gt;science&lt;/em&gt; &lt;em&gt;329(5996):1194&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/MUSTREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/behavior"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c7903397a9cd1510b5dd1ed3b13859c5/mstrohm"><title>Navigability of Complex Networks</title><link>http://www.bibsonomy.org/bibtex/2c7903397a9cd1510b5dd1ed3b13859c5/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2010-10-30T11:59:24+02:00</dc:date><dc:subject>MUSTREAD networks theory </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Boguna&#034;&gt;Marian Boguna&lt;/a&gt;, &lt;a href=&#034;/author/Krioukov&#034;&gt;Dmitri Krioukov&lt;/a&gt;,  and &lt;a href=&#034;/author/kc claffy&#034;&gt; kc claffy&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Nature&lt;/em&gt;  (&lt;em&gt;2007&lt;/em&gt;)&lt;em&gt;cite arxiv:0709.0303
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/MUSTREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics><description>[0709.0303] Navigability of Complex Networks</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/29b041bdba459fdc749a0b13de3d343d3/mstrohm"><title>Networks, Crowds, and Markets: Reasoning About a Highly Connected World</title><link>http://www.bibsonomy.org/bibtex/29b041bdba459fdc749a0b13de3d343d3/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2010-06-25T12:09:08+02:00</dc:date><dc:subject>algorithms books networks </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Easley&#034;&gt;D. Easley&lt;/a&gt;,  and &lt;a href=&#034;/author/Kleinberg&#034;&gt;J. Kleinberg&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Cambridge University Press, &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/algorithms"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/books"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22f96232a648d4fd1617c389d899f3d2b/mstrohm"><title>The Wisdom in Tweetonomies: Acquiring Latent Conceptual Structures from Social Awareness Streams</title><link>http://www.bibsonomy.org/bibtex/22f96232a648d4fd1617c389d899f3d2b/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2010-04-19T19:11:25+02:00</dc:date><dc:subject>folksonomy myown networks social tagging twitter taggingsurvey </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Wagner&#034;&gt;C. Wagner&lt;/a&gt;,  and &lt;a href=&#034;/author/Strohmaier&#034;&gt;M. Strohmaier&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. of the Semantic Search 2010 Workshop SemSearch2010, &lt;/em&gt;(&lt;em&gt;April 2010&lt;/em&gt;)</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/myown"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/social"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/twitter"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/taggingsurvey"/></rdf:Bag></taxo:topics><description>On taxonomies, folksonomies, and tweetonomies « Intentialicious: Markus Strohmaier&#039;s Weblog</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/28b0de27fbcccb1140d4edfb734ee6fbc/mstrohm"><title>SimFusion: measuring similarity using unified relationship matrix</title><link>http://www.bibsonomy.org/bibtex/28b0de27fbcccb1140d4edfb734ee6fbc/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2009-07-01T09:26:27+02:00</dc:date><dc:subject>MUSTREAD folksonomy networks reading-group search tagging tools </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Xi&#034;&gt;W. Xi&lt;/a&gt;, &lt;a href=&#034;/author/Fox&#034;&gt;E. A. Fox&lt;/a&gt;, &lt;a href=&#034;/author/Fan&#034;&gt;W. Fan&lt;/a&gt;, &lt;a href=&#034;/author/Zhang&#034;&gt;B. Zhang&lt;/a&gt;, &lt;a href=&#034;/author/Chen&#034;&gt;Z. Chen&lt;/a&gt;, &lt;a href=&#034;/author/Yan&#034;&gt;J. Yan&lt;/a&gt;,  and &lt;a href=&#034;/author/Zhuang&#034;&gt;D. Zhuang&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SIGIR &amp;#039;05: Proceedings of the 28th annual international ACM SIGIR conference on Research and development in information retrieval, &lt;/em&gt;&lt;em&gt;page 130--137. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;2005&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/MUSTREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reading-group"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tagging"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics><description>on URM (Unified Relationship Matrix)</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f696989e22dd4c77c8a6352526e13efe/mstrohm"><title>Hyperincident Connected Components of Tagging Networks</title><link>http://www.bibsonomy.org/bibtex/2f696989e22dd4c77c8a6352526e13efe/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2009-07-01T09:24:01+02:00</dc:date><dc:subject>TOREAD networks 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;HT &amp;#039;09: Proceedings of the Twentieth ACM Conference on Hypertext and Hypermedia, &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM, &lt;/em&gt;(&lt;em&gt;July 2009&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><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/tagging"/></rdf:Bag></taxo:topics><description>Hypertext 09 best paper</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/27927deea07c15ecae7537ec7a4550173/mstrohm"><title>Using Formal Concept Analysis to Construct and Visualise Hierarchies of Socio-Technical Relations</title><link>http://www.bibsonomy.org/bibtex/27927deea07c15ecae7537ec7a4550173/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2009-04-17T11:53:00+02:00</dc:date><dc:subject>networks social-factors software-engineering myown </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Wermelinger&#034;&gt;M. Wermelinger&lt;/a&gt;, &lt;a href=&#034;/author/Yu&#034;&gt;Y. Yu&lt;/a&gt;,  and &lt;a href=&#034;/author/Strohmaier&#034;&gt;M. Strohmaier&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proc. 31st International Conference on Software Engineering, companion volume, &lt;/em&gt;&lt;em&gt;IEEE, &lt;/em&gt;(&lt;em&gt;May 2009&lt;/em&gt;)&lt;em&gt;To appear
		    .
	    &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/social-factors"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software-engineering"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/myown"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29fb3f968713acc1830c6ddcfd2b2b3e6/mstrohm"><title>Graph mining: Laws, generators, and algorithms</title><link>http://www.bibsonomy.org/bibtex/29fb3f968713acc1830c6ddcfd2b2b3e6/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2009-03-21T10:44:50+01:00</dc:date><dc:subject>mathematics networks tools </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Chakrabarti&#034;&gt;D. Chakrabarti&lt;/a&gt;,  and &lt;a href=&#034;/author/Faloutsos&#034;&gt;C. Faloutsos&lt;/a&gt; &lt;/span&gt;&lt;em&gt;ACM Computing Surveys CSUR&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/mathematics"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tools"/></rdf:Bag></taxo:topics><description>page 45, R-MAT graph generator for bipartite networks</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2fd37fa74db7f35ab2a9040b189e39f4a/mstrohm"><title>Using Software Repositories to Investigate Socio-technical Congruence in Development Projects</title><link>http://www.bibsonomy.org/bibtex/2fd37fa74db7f35ab2a9040b189e39f4a/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-11-28T21:31:26+01:00</dc:date><dc:subject>SEMINAL networks requirements-engineering </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Valetto&#034;&gt;G. Valetto&lt;/a&gt;, &lt;a href=&#034;/author/Helander&#034;&gt;M. Helander&lt;/a&gt;, &lt;a href=&#034;/author/Ehrlich&#034;&gt;K. Ehrlich&lt;/a&gt;, &lt;a href=&#034;/author/Chulani&#034;&gt;S. Chulani&lt;/a&gt;, &lt;a href=&#034;/author/Wegman&#034;&gt;M. Wegman&lt;/a&gt;,  and &lt;a href=&#034;/author/Williams&#034;&gt;C. Williams&lt;/a&gt; &lt;/span&gt;&lt;em&gt;International Workshop on Mining Software Repositories, &lt;/em&gt;&lt;em&gt;page 25. &lt;/em&gt;&lt;em&gt;Los Alamitos, CA, USA, &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/SEMINAL"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/requirements-engineering"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/265bbdf52fce2fa4a468abc54f0996b66/mstrohm"><title>Concept Lattices and Their Applications</title><link>http://www.bibsonomy.org/bibtex/265bbdf52fce2fa4a468abc54f0996b66/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-09-08T15:15:37+02:00</dc:date><dc:subject>FCA networks theory </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Yahia&#034;&gt;S. B. Yahia&lt;/a&gt;, &lt;a href=&#034;/author/Nguifo&#034;&gt;E. M. Nguifo&lt;/a&gt;,  and &lt;a href=&#034;/author/Belohlávek&#034;&gt;R. Belohlávek&lt;/a&gt; (Eds.).
		 &lt;/span&gt;&lt;em&gt;volume 4923 of Lecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;Springer, &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/FCA"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24b94dab5e5a9cb116bc1308c65112549/mstrohm"><title>Purpose Tagging - Capturing User Intent to Assist Goal-Oriented Social Search</title><link>http://www.bibsonomy.org/bibtex/24b94dab5e5a9cb116bc1308c65112549/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-09-07T22:19:13+02:00</dc:date><dc:subject>commonsense folksonomy goals myown networks web-science taggingsurvey </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Strohmaier&#034;&gt;M. Strohmaier&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Workshop on Search in Social Media SSM&amp;#039;08, in conjunction with CIKM&amp;#039;08, Napa Valley, USA, &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/commonsense"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/goals"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/myown"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/taggingsurvey"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22d7c9ea5484ee45ea8bf3520138d7477/mstrohm"><title>Learning Concept Hierarchies from Text Corpora using Formal Concept Analysis</title><link>http://www.bibsonomy.org/bibtex/22d7c9ea5484ee45ea8bf3520138d7477/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-07-29T13:38:17+02:00</dc:date><dc:subject>folksonomy graphs networks </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cimiano&#034;&gt;P. Cimiano&lt;/a&gt;, &lt;a href=&#034;/author/Hotho&#034;&gt;A. Hotho&lt;/a&gt;,  and &lt;a href=&#034;/author/Staab&#034;&gt;S. Staab&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Journal of Artificial Intelligence Research JAIR&lt;/em&gt;  (&lt;em&gt;2005&lt;/em&gt;)</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/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20c44a2fcf67f578c0cc2b0235183720f/mstrohm"><title>Faster Algorithms for Constructing a Concept Galois Lattice</title><link>http://www.bibsonomy.org/bibtex/20c44a2fcf67f578c0cc2b0235183720f/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-07-21T15:36:30+02:00</dc:date><dc:subject>TOREAD graphs networks </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Choi&#034;&gt;V. Choi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Presented at the SIAM Conference on Discrete Mathematics, &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/TOREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/></rdf:Bag></taxo:topics><description>Faster Algorithms for Constructing a Concept (Galois) Lattice</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/28b5679f3be1730633af408682fb2f69d/mstrohm"><title>Mining Eclipse Developer Contributions via Author-Topic Models</title><link>http://www.bibsonomy.org/bibtex/28b5679f3be1730633af408682fb2f69d/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-05-26T16:41:17+02:00</dc:date><dc:subject>datasets goals networks </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Linstead&#034;&gt;E. Linstead&lt;/a&gt;, &lt;a href=&#034;/author/Rigor&#034;&gt;P. Rigor&lt;/a&gt;, &lt;a href=&#034;/author/Bajracharya&#034;&gt;S. Bajracharya&lt;/a&gt;, &lt;a href=&#034;/author/Lopes&#034;&gt;C. Lopes&lt;/a&gt;,  and &lt;a href=&#034;/author/Baldi&#034;&gt;P. Baldi&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Proceedings of the Fourth International Workshop on Mining Software Repositories, &lt;/em&gt;&lt;em&gt;page 30. &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/datasets"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/goals"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/></rdf:Bag></taxo:topics><description>based on the eclipse dataset the author-topic is applied
The goal of this paper is to identify the developer who will contribute to a bug most likely</description></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d87e198a6d564ae8a8fe151e0a96fa0f/mstrohm"><title>Network Properties of Folksonomies</title><link>http://www.bibsonomy.org/bibtex/2d87e198a6d564ae8a8fe151e0a96fa0f/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-05-21T12:39:46+02:00</dc:date><dc:subject>TOREAD networks reading-group web-science taggingsurvey </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Cattuto&#034;&gt;C. Cattuto&lt;/a&gt;, &lt;a href=&#034;/author/Schmitz&#034;&gt;C. Schmitz&lt;/a&gt;, &lt;a href=&#034;/author/Baldassarri&#034;&gt;A. Baldassarri&lt;/a&gt;, &lt;a href=&#034;/author/Servedio&#034;&gt;V. D. P. Servedio&lt;/a&gt;, &lt;a href=&#034;/author/Loreto&#034;&gt;V. Loreto&lt;/a&gt;, &lt;a href=&#034;/author/Hotho&#034;&gt;A. Hotho&lt;/a&gt;, &lt;a href=&#034;/author/Grahl&#034;&gt;M. Grahl&lt;/a&gt;,  and &lt;a href=&#034;/author/Stumme&#034;&gt;G. Stumme&lt;/a&gt; &lt;/span&gt;&lt;em&gt;AI Communications&lt;/em&gt; &lt;em&gt;20(4):245 - 262&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/TOREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reading-group"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/taggingsurvey"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/29632c170df74cc7c30c86ed558399d69/mstrohm"><title>The \$25,000,000,000 Eigenvector: The Linear Algebra behind Google</title><link>http://www.bibsonomy.org/bibtex/29632c170df74cc7c30c86ed558399d69/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-04-22T10:13:08+02:00</dc:date><dc:subject>SNA networks search web-science </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Bryan&#034;&gt;K. Bryan&lt;/a&gt;,  and &lt;a href=&#034;/author/Leise&#034;&gt;T. Leise&lt;/a&gt; &lt;/span&gt;&lt;em&gt;SIAM Review&lt;/em&gt; &lt;em&gt;48(3):569--581&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/SNA"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web-science"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2524d6c7e05430cc02e39bf51c3bbd779/mstrohm"><title>Finding community structure in networks using the eigenvectors of matrices</title><link>http://www.bibsonomy.org/bibtex/2524d6c7e05430cc02e39bf51c3bbd779/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-04-18T10:01:45+02:00</dc:date><dc:subject>MUSTREAD SNA networks </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Newman&#034;&gt;M.E.J. Newman&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Physical Review E&lt;/em&gt; &lt;em&gt;74(3):36104&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/MUSTREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/SNA"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2022c2fbab2dccc2bd4341a553d8f6574/mstrohm"><title>Basic Notions for the Analysis of Large Affiliation Networks/Bipartite Graphs</title><link>http://www.bibsonomy.org/bibtex/2022c2fbab2dccc2bd4341a553d8f6574/mstrohm</link><dc:creator>mstrohm</dc:creator><dc:date>2008-04-08T18:00:56+02:00</dc:date><dc:subject>MUSTREAD SNA folksonomy networks </dc:subject><content:encoded>&lt;span class=&#034;authorEditorList&#034;&gt;&lt;a href=&#034;/author/Latapy&#034;&gt;M. Latapy&lt;/a&gt;, &lt;a href=&#034;/author/Magnien&#034;&gt;C. Magnien&lt;/a&gt;,  and &lt;a href=&#034;/author/Vecchio&#034;&gt;N. Del Vecchio&lt;/a&gt; &lt;/span&gt;&lt;em&gt;Arxiv preprint cond-mat/0611631&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/MUSTREAD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/SNA"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/folksonomy"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/networks"/></rdf:Bag></taxo:topics></item></rdf:RDF>
