<?xml version="1.0" encoding="UTF-8"?>
<rdf:RDF xmlns:content="http://purl.org/rss/1.0/modules/content/" xmlns:dc="http://purl.org/dc/elements/1.1/" xmlns:taxo="http://purl.org/rss/1.0/modules/taxonomy/" xmlns="http://purl.org/rss/1.0/" xmlns:rdf="http://www.w3.org/1999/02/22-rdf-syntax-ns#"><channel rdf:about="https://www.bibsonomy.org/user/folke/theory"><title>BibSonomy bookmarks for /user/folke/theory</title><link>https://www.bibsonomy.org/user/folke/theory</link><description>BibSonomy RSS Feed for /user/folke/theory</description><items><rdf:Seq><rdf:li rdf:resource="http://www.cs.washington.edu/homes/anuprao/pubs/CSE533Autumn2010/lecture4.pdf"/><rdf:li rdf:resource="http://onlamp.com/pub/a/php/2005/03/24/joint_entropy.html?page=4"/><rdf:li rdf:resource="http://www.tp.umu.se/~rosvall/code.html"/><rdf:li rdf:resource="http://igraph.sourceforge.net/"/><rdf:li rdf:resource="http://de.wikipedia.org/wiki/Kullback-Leibler-Divergenz"/><rdf:li rdf:resource="http://de.wikipedia.org/wiki/Herkules_(Kassel)"/><rdf:li rdf:resource="http://www.prip.tuwien.ac.at/teaching/ss/strupr/"/><rdf:li rdf:resource="http://www.math.ucsd.edu/~fan/research/revised.html"/><rdf:li rdf:resource="http://www.cs.yale.edu/homes/spielman/eigs/"/></rdf:Seq></items></channel><item rdf:about="http://www.cs.washington.edu/homes/anuprao/pubs/CSE533Autumn2010/lecture4.pdf"><title>Lecture on Graph Entropy [PDF]</title><description></description><link>http://www.cs.washington.edu/homes/anuprao/pubs/CSE533Autumn2010/lecture4.pdf</link><dc:creator>folke</dc:creator><dc:date>2012-02-14T00:51:18+01:00</dc:date><dc:subject>entropy graph theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2012-02-14T00:51:18+01:00&#034; href=&#034;http://www.cs.washington.edu/homes/anuprao/pubs/CSE533Autumn2010/lecture4.pdf&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.cs.washington.edu/homes/anuprao/pubs/CSE533Autumn2010/lecture4.pdf&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/entropy"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://onlamp.com/pub/a/php/2005/03/24/joint_entropy.html?page=4"><title>Calculating Entropy for Data Miners - O&#039;Reilly Media</title><description>Paul Meagher demonstrates how to apply principles of information theory to datamining through PHP.</description><link>http://onlamp.com/pub/a/php/2005/03/24/joint_entropy.html?page=4</link><dc:creator>folke</dc:creator><dc:date>2012-02-07T12:01:10+01:00</dc:date><dc:subject>applied examples information php theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Paul Meagher demonstrates how to apply principles of information theory to datamining through PHP.&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/applied"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/examples"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/php"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.tp.umu.se/~rosvall/code.html"><title>Complex Rosvall - Code</title><description></description><link>http://www.tp.umu.se/~rosvall/code.html</link><dc:creator>folke</dc:creator><dc:date>2010-07-08T09:57:04+02:00</dc:date><dc:subject>clustering community detection implementation infomap information theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2010-07-08T09:57:04+02:00&#034; href=&#034;http://www.tp.umu.se/~rosvall/code.html&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.tp.umu.se/~rosvall/code.html&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/clustering"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/community"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/detection"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/implementation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/infomap"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://igraph.sourceforge.net/"><title>The igraph library for complex network research</title><description></description><link>http://igraph.sourceforge.net/</link><dc:creator>folke</dc:creator><dc:date>2010-04-27T10:15:18+02:00</dc:date><dc:subject>algorithms graph igraph implementation network theory tool </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2010-04-27T10:15:18+02:00&#034; href=&#034;http://igraph.sourceforge.net/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://igraph.sourceforge.net/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/algorithms"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/igraph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/implementation"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/network"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/tool"/></rdf:Bag></taxo:topics></item><item rdf:about="http://de.wikipedia.org/wiki/Kullback-Leibler-Divergenz"><title>Kullback-Leibler-Divergenz – Wikipedia</title><description></description><link>http://de.wikipedia.org/wiki/Kullback-Leibler-Divergenz</link><dc:creator>folke</dc:creator><dc:date>2009-09-22T09:21:01+02:00</dc:date><dc:subject>distance distribution information theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-09-22T09:21:01+02:00&#034; href=&#034;http://de.wikipedia.org/wiki/Kullback-Leibler-Divergenz&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://de.wikipedia.org/wiki/Kullback-Leibler-Divergenz&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/distance"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/distribution"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://de.wikipedia.org/wiki/Herkules_(Kassel)"><title>Herkules (Kassel) – Wikipedia</title><description>Der Herkules ist eine Kupferstatue des antiken Herakles (lat. Hercules, eingedeutscht Herkules) im Bergpark Wilhelmshöhe in Kassel (Nordhessen, Deutschland). Die Statue, die als ein Wahrzeichen der Stadt Kassel gilt, befindet sich an der Spitze einer Pyramide, die auf dem Oktogon, dem Riesenschloss steht. Heute steht der Name „Herkules“ nicht nur für das Standbild, sondern das gesamte Bauwerk, welches auch den Ausgangspunkt der sommerlichen Wasserspiele im Bergpark bildet. Das Oktogon und der </description><link>http://de.wikipedia.org/wiki/Herkules_(Kassel)</link><dc:creator>folke</dc:creator><dc:date>2009-03-20T14:36:52+01:00</dc:date><dc:subject>graph community theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Der Herkules ist eine Kupferstatue des antiken Herakles (lat. Hercules, eingedeutscht Herkules) im Bergpark Wilhelmshöhe in Kassel (Nordhessen, Deutschland). Die Statue, die als ein Wahrzeichen der Stadt Kassel gilt, befindet sich an der Spitze einer Pyramide, die auf dem Oktogon, dem Riesenschloss steht. Heute steht der Name „Herkules“ nicht nur für das Standbild, sondern das gesamte Bauwerk, welches auch den Ausgangspunkt der sommerlichen Wasserspiele im Bergpark bildet. Das Oktogon und der &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/community"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.prip.tuwien.ac.at/teaching/ss/strupr/"><title>Structural Pattern Recognition — Pattern Recognition and Image Processing (PRIP) Group</title><description></description><link>http://www.prip.tuwien.ac.at/teaching/ss/strupr/</link><dc:creator>folke</dc:creator><dc:date>2009-02-16T10:26:22+01:00</dc:date><dc:subject>graph spectral theory </dc:subject><content:encoded>&lt;a itemprop=&#034;url&#034; data-versiondate=&#034;2009-02-16T10:26:22+01:00&#034; href=&#034;http://www.prip.tuwien.ac.at/teaching/ss/strupr/&#034; rel=&#034;nofollow&#034; class=&#034;description-link&#034;&gt;http://www.prip.tuwien.ac.at/teaching/ss/strupr/&lt;/a&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/spectral"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.math.ucsd.edu/~fan/research/revised.html"><title>Spectral Graph Theory , by Fan Chung</title><description>This monograph is an intertwined tale of eigenvalues and their use in unlocking a thousand secrets about graphs. The stories will be told --- how the spectrum reveals fundamental properties of a graph, how spectral graph theory links the discrete universe to the continuous one through geometric, analytic and algebraic techniques, and how, through eigenvalues, theory and applications in communications and computer science come together in symbiotic harmony.... </description><link>http://www.math.ucsd.edu/~fan/research/revised.html</link><dc:creator>folke</dc:creator><dc:date>2009-02-05T15:34:17+01:00</dc:date><dc:subject>graph spectral theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;This monograph is an intertwined tale of eigenvalues and their use in unlocking a thousand secrets about graphs. The stories will be told --- how the spectrum reveals fundamental properties of a graph, how spectral graph theory links the discrete universe to the continuous one through geometric, analytic and algebraic techniques, and how, through eigenvalues, theory and applications in communications and computer science come together in symbiotic harmony.... &lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graph"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/spectral"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.yale.edu/homes/spielman/eigs/"><title>Spectral Graph Theory and its Applications</title><description>Spectral Graph Theory and its Applications</description><link>http://www.cs.yale.edu/homes/spielman/eigs/</link><dc:creator>folke</dc:creator><dc:date>2009-01-07T08:08:08+01:00</dc:date><dc:subject>graphs lecture spectral theory </dc:subject><content:encoded>&lt;span itemprop=&#034;description&#034;&gt;Spectral Graph Theory and its Applications&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="https://www.bibsonomy.org/tag/graphs"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/spectral"/><rdf:li rdf:resource="https://www.bibsonomy.org/tag/theory"/></rdf:Bag></taxo:topics></item></rdf:RDF>