<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="http://www.bibsonomy.org/user/jaeschke/information"><title>BibSonomy bookmarks for /user/jaeschke/information</title><link>http://www.bibsonomy.org/rss/user/jaeschke/information</link><description>BibSonomy RSS Feed for /user/jaeschke/information</description><items><rdf:Seq><rdf:li rdf:resource="http://pyevolve.sourceforge.net/wordpress/?p=1589"/><rdf:li rdf:resource="http://www.informit.com/articles/article.aspx?p=130881&amp;seqNum=6&amp;rll=1"/><rdf:li rdf:resource="http://www.informationisbeautiful.net/"/><rdf:li rdf:resource="http://secondstring.sourceforge.net/"/><rdf:li rdf:resource="http://www.cs.ualberta.ca/~aixplore/learning/DecisionTrees/InterArticle/5-DecisionTree.html"/><rdf:li rdf:resource="http://crs.bkg.bund.de/crs-eu/"/><rdf:li rdf:resource="http://www.durchdenken.de/lewandowski/web-ir/"/></rdf:Seq></items></channel><item rdf:about="http://pyevolve.sourceforge.net/wordpress/?p=1589"><title>Machine Learning :: Text feature extraction (tf-idf) – Part I | Pyevolve</title><description>Short introduction to Vector Space Model (VSM) In information retrieval or text mining, the term frequency - inverse document frequency also called tf-idf, is</description><link>http://pyevolve.sourceforge.net/wordpress/?p=1589</link><dc:creator>jaeschke</dc:creator><dc:date>2012-02-08T13:03:04+01:00</dc:date><dc:subject>document frequency information ir learning machine model retrieval search space term tfidf vector vsm web </dc:subject><content:encoded>Short introduction to Vector Space Model (VSM) In information retrieval or text mining, the term frequency - inverse document frequency also called tf-idf,&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;Short introduction to Vector Space Model (VSM) In information retrieval or text mining, the term frequency - inverse document frequency also called tf-idf, is&lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/document"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/frequency"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ir"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/model"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/space"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/term"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tfidf"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vector"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vsm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.informit.com/articles/article.aspx?p=130881&amp;seqNum=6&amp;rll=1"><title>InformIT: The Business of Understanding &amp;gt; Latch: The Five Ultimate Hatracks</title><description>The ways of organizing information are finite. It can only be organized by location, alphabet, time, category, or hierarchy. These modes are applicable to almost any endeavor—from your personal file cabinets to multinational corporations. They are the framework upon which annual reports, books, conversations, exhibitions, directories, conventions, and even warehouses are arranged.</description><link>http://www.informit.com/articles/article.aspx?p=130881&amp;amp;seqNum=6&amp;amp;rll=1</link><dc:creator>jaeschke</dc:creator><dc:date>2010-01-25T13:12:40+01:00</dc:date><dc:subject>dagsocial information latch organization </dc:subject><content:encoded>The ways of organizing information are finite. It can only be organized by location, alphabet, time, category, or hierarchy. These modes are applicable to &lt;span class=&#034;info&#034;&gt;...&lt;div&gt;The ways of organizing information are finite. It can only be organized by location, alphabet, time, category, or hierarchy. These modes are applicable to almost any endeavor—from your personal file cabinets to multinational corporations. They are the framework upon which annual reports, books, conversations, exhibitions, directories, conventions, and even warehouses are arranged.&lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dagsocial"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/latch"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/organization"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.informationisbeautiful.net/"><title>Information Is Beautiful </title><description>Ideas, issues, concepts, subjects - visualized!</description><link>http://www.informationisbeautiful.net/</link><dc:creator>jaeschke</dc:creator><dc:date>2009-11-05T13:21:56+01:00</dc:date><dc:subject>data graphic information visualization </dc:subject><content:encoded>Ideas, issues, concepts, subjects - visualized!</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/graphic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/visualization"/></rdf:Bag></taxo:topics></item><item rdf:about="http://secondstring.sourceforge.net/"><title>SecondString Project Page</title><description>This is the project page for SecondString, an open-source Java-based package of approximate string-matching techniques. This code was developed by researchers at Carnegie Mellon University from the Center for Automated Learning and Discovery, the Department of Statistics, and the Center for Computer and Communications Security. 	

SecondString is intended primarily for researchers in information integration and other scientists. It does or will include a range of string-matching methods from a variety of communities, including statistics, artificial intelligence, information retrieval, and databases. It also includes tools for systematically evaluating performance on test data. It is not designed for use on very large data sets.</description><link>http://secondstring.sourceforge.net/</link><dc:creator>jaeschke</dc:creator><dc:date>2008-09-10T10:37:12+02:00</dc:date><dc:subject>extraction information java matching secondstring string text </dc:subject><content:encoded>This is the project page for SecondString, an open-source Java-based package of approximate string-matching techniques. This code was developed by research&lt;span class=&#034;info&#034;&gt;...&lt;div&gt;This is the project page for SecondString, an open-source Java-based package of approximate string-matching techniques. This code was developed by researchers at Carnegie Mellon University from the Center for Automated Learning and Discovery, the Department of Statistics, and the Center for Computer and Communications Security. 	

SecondString is intended primarily for researchers in information integration and other scientists. It does or will include a range of string-matching methods from a variety of communities, including statistics, artificial intelligence, information retrieval, and databases. It also includes tools for systematically evaluating performance on test data. It is not designed for use on very large data sets.&lt;/div&gt;&lt;/span&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/extraction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/java"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/matching"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/secondstring"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/string"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.cs.ualberta.ca/~aixplore/learning/DecisionTrees/InterArticle/5-DecisionTree.html"><title>Gain Ratio</title><description></description><link>http://www.cs.ualberta.ca/~aixplore/learning/DecisionTrees/InterArticle/5-DecisionTree.html</link><dc:creator>jaeschke</dc:creator><dc:date>2007-07-10T18:12:11+02:00</dc:date><dc:subject>gain information learning machine ratio </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gain"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ratio"/></rdf:Bag></taxo:topics></item><item rdf:about="http://crs.bkg.bund.de/crs-eu/"><title>Information and Service System for European Coordinate Reference Systems</title><description></description><link>http://crs.bkg.bund.de/crs-eu/</link><dc:creator>jaeschke</dc:creator><dc:date>2007-04-17T11:05:06+02:00</dc:date><dc:subject>coordinate crs geo information reference system </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/coordinate"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/crs"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/geo"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/reference"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/system"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.durchdenken.de/lewandowski/web-ir/"><title>Dr. Dirk Lewandowski: Web Information Retrieval</title><description></description><link>http://www.durchdenken.de/lewandowski/web-ir/</link><dc:creator>jaeschke</dc:creator><dc:date>2005-10-18T06:17:49+02:00</dc:date><dc:subject>search web engine retrieval information </dc:subject><content:encoded></content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/search"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/engine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/retrieval"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/></rdf:Bag></taxo:topics></item></rdf:RDF>
