<rdf:RDF 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:cc="http://web.resource.org/cc/" 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/user/philipp/graphs"><title>BibSonomy publications for /user/philipp/graphs</title><link>http://www.bibsonomy.org/publrss/user/philipp/graphs</link><description>BibSonomy RSS Feed for /user/philipp/graphs</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2be56be47bfd1d6c9edc9d523462c6d87/philipp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ac02f1d7dea7a106bc4103c8a9ec4aef/philipp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/philipp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a4a0a3a09630aea8c36b4f0f9a53af45/philipp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cfd520a625b783c504840ea64d5097f9/philipp"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2064c63cf6942371bd10b09bc3ba4e319/philipp"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2be56be47bfd1d6c9edc9d523462c6d87/philipp"><title>A fast kernel-based multilevel algorithm for graph clustering</title><link>http://www.bibsonomy.org/bibtex/2be56be47bfd1d6c9edc9d523462c6d87/philipp</link><dc:creator>philipp</dc:creator><dc:date>2007-01-17T15:56:34+01:00</dc:date><dc:subject>kernels graphs clustering </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Inderjit &lt;a href=&#034;http://www.bibsonomy.org/author/Dhillon&#034;&gt;Dhillon&lt;/a&gt;  und Yuqiang &lt;a href=&#034;http://www.bibsonomy.org/author/Guan&#034;&gt;Guan&lt;/a&gt;  und Brian &lt;a href=&#034;http://www.bibsonomy.org/author/Kulis&#034;&gt;Kulis&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;KDD &#039;05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, &lt;/em&gt;&lt;em&gt;Seite629--634. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM Press, &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/kernels"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/clustering"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ac02f1d7dea7a106bc4103c8a9ec4aef/philipp"><title>Link mining: a survey</title><link>http://www.bibsonomy.org/bibtex/2ac02f1d7dea7a106bc4103c8a9ec4aef/philipp</link><dc:creator>philipp</dc:creator><dc:date>2007-01-17T11:15:48+01:00</dc:date><dc:subject>structured-data graphs link-mining </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Lise &lt;a href=&#034;http://www.bibsonomy.org/author/Getoor&#034;&gt;Getoor&lt;/a&gt;  und Christopher P. &lt;a href=&#034;http://www.bibsonomy.org/author/Diehl&#034;&gt;Diehl&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;SIGKDD Explor. Newsl.&lt;/em&gt;&lt;em&gt;7(2):3--12&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/structured-data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/link-mining"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/philipp"><title>Diffusion Kernels on Graphs and Other Discrete Input Spaces</title><link>http://www.bibsonomy.org/bibtex/23a49cc3c52a3f5fe1474f822b3f973b0/philipp</link><dc:creator>philipp</dc:creator><dc:date>2007-01-16T12:18:55+01:00</dc:date><dc:subject>kernels graphs imported </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Risi Imre &lt;a href=&#034;http://www.bibsonomy.org/author/Kondor&#034;&gt;Kondor&lt;/a&gt;  und John D. &lt;a href=&#034;http://www.bibsonomy.org/author/Lafferty&#034;&gt;Lafferty&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ICML &#039;02: Proceedings of the Nineteenth International Conference on Machine Learning, &lt;/em&gt;&lt;em&gt;Seite315--322. &lt;/em&gt;&lt;em&gt;San Francisco, CA, USA, &lt;/em&gt;&lt;em&gt;Morgan Kaufmann Publishers Inc., &lt;/em&gt;(&lt;em&gt;2002&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kernels"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a4a0a3a09630aea8c36b4f0f9a53af45/philipp"><title>Link-based Classification.</title><link>http://www.bibsonomy.org/bibtex/2a4a0a3a09630aea8c36b4f0f9a53af45/philipp</link><dc:creator>philipp</dc:creator><dc:date>2007-01-16T12:16:51+01:00</dc:date><dc:subject>classification imported graphs link </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Qing &lt;a href=&#034;http://www.bibsonomy.org/author/Lu&#034;&gt;Lu&lt;/a&gt;  und Lise &lt;a href=&#034;http://www.bibsonomy.org/author/Getoor&#034;&gt;Getoor&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ICML, &lt;/em&gt;&lt;em&gt;Seite496-503. &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/classification"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/link"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cfd520a625b783c504840ea64d5097f9/philipp"><title>Relational Ensemble Classification.</title><link>http://www.bibsonomy.org/bibtex/2cfd520a625b783c504840ea64d5097f9/philipp</link><dc:creator>philipp</dc:creator><dc:date>2007-01-16T12:13:51+01:00</dc:date><dc:subject>graphs classification imported link </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Christine &lt;a href=&#034;http://www.bibsonomy.org/author/Preisach&#034;&gt;Preisach&lt;/a&gt;  und Lars &lt;a href=&#034;http://www.bibsonomy.org/author/Schmidt-Thieme&#034;&gt;Schmidt-Thieme&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ICDM, &lt;/em&gt;&lt;em&gt;Seite499-509. &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/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classification"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/imported"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/link"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2064c63cf6942371bd10b09bc3ba4e319/philipp"><title>Application of kernels to link analysis</title><description>Application of kernels to link analysis</description><link>http://www.bibsonomy.org/bibtex/2064c63cf6942371bd10b09bc3ba4e319/philipp</link><dc:creator>philipp</dc:creator><dc:date>2007-01-16T12:12:47+01:00</dc:date><dc:subject>graphs link kernels </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Takahiko &lt;a href=&#034;http://www.bibsonomy.org/author/Ito&#034;&gt;Ito&lt;/a&gt;  und Masashi &lt;a href=&#034;http://www.bibsonomy.org/author/Shimbo&#034;&gt;Shimbo&lt;/a&gt;  und Taku &lt;a href=&#034;http://www.bibsonomy.org/author/Kudo&#034;&gt;Kudo&lt;/a&gt;  und Yuji &lt;a href=&#034;http://www.bibsonomy.org/author/Matsumoto&#034;&gt;Matsumoto&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;KDD &#039;05: Proceeding of the eleventh ACM SIGKDD international conference on Knowledge discovery in data mining, &lt;/em&gt;&lt;em&gt;Seite586--592. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM Press, &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/graphs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/link"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kernels"/></rdf:Bag></taxo:topics></item></rdf:RDF>