<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/schaul/and,"><title>BibSonomy publications for /user/schaul/and,</title><link>http://www.bibsonomy.org/burst/user/schaul/and,</link><description>BibSonomy BuRST Feed for /user/schaul/and,</description><dc:date>2008-07-26T04:44:34+02:00</dc:date><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20eaf250f52c44307eabd9be2a34e50e4/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a6f77b57f9dd6af428692b40ecc13a73/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2b9394ee75dd5db37341b62745634de89/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23e33239f0046b223f066a4fbe60edcd6/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f65403f6346a5b6747be35f3f4f3ac2f/schaul"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2196353ab4f02ae1e2973c01d08d38c45/schaul"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/20eaf250f52c44307eabd9be2a34e50e4/schaul"><title>A parameter-less genetic algorithm</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/20eaf250f52c44307eabd9be2a34e50e4/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>and, paper, lindenmayer, genetic, philosophy, poster, l-systems, juergen, programming algorithms, pedagogy, methodology, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;G. R. &lt;a href=&#034;http://www.bibsonomy.org/author/Harick&#034;&gt;Harick&lt;/a&gt;  and F. G. &lt;a href=&#034;http://www.bibsonomy.org/author/Lobo&#034;&gt;Lobo&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the Genetic and Evolutionary Computation Conference, &lt;/em&gt;&lt;em&gt;2, &lt;/em&gt;&lt;em&gt;Orlando, Florida, USA, &lt;/em&gt;&lt;em&gt;Morgan Kaufmann, &lt;/em&gt;&lt;em&gt;JanuaryMarch-JanuaryJuly July1999. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/paper,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lindenmayer,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/philosophy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/poster,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/l-systems,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/pedagogy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/methodology,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/20eaf250f52c44307eabd9be2a34e50e4/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/20eaf250f52c44307eabd9be2a34e50e4/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:address>Orlando, Florida, USA</swrc:address><swrc:booktitle>Proceedings of the Genetic and Evolutionary Computation Conference</swrc:booktitle><swrc:month>JanuaryMarch-JanuaryJuly July</swrc:month><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann"/></swrc:publisher><swrc:title>A parameter-less genetic algorithm</swrc:title><swrc:volume>2</swrc:volume><swrc:year>1999</swrc:year><swrc:keywords>and, paper, lindenmayer, genetic, philosophy, poster, l-systems, juergen, programming algorithms, pedagogy, methodology, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382074" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="G. R. Harick"/></rdf:_1><rdf:_2><swrc:Person swrc:name="F. G. Lobo"/></rdf:_2></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="Wolfgang Banzhaf"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Jason Daida"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Agoston E. Eiben"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Max H. Garzon"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Vasant Honavar"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Mark Jakiela"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Robert E. Smith"/></rdf:_7></rdf:Seq></swrc:editor></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a6f77b57f9dd6af428692b40ecc13a73/schaul"><title>Adaptive Online Prediction by Following the Perturbed Leader</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2a6f77b57f9dd6af428692b40ecc13a73/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>expert, weights, juergen, bounds, online, of, loss, adaptive, with hierarchy, rate, advice, learning, adversary, sequential, follow, and, high, expected, alphabet, probability, general, perturbed, experts, prediction, the, leader, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  and J. &lt;a href=&#034;http://www.bibsonomy.org/author/Poland&#034;&gt;Poland&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Machine Learning Research&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/expert,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/weights,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bounds,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/online,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adaptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/with"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hierarchy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rate,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/advice,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adversary,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequential,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/follow,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expected,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/alphabet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/general,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/perturbed,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/experts,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/the,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/leader,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2a6f77b57f9dd6af428692b40ecc13a73/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2a6f77b57f9dd6af428692b40ecc13a73/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.AI/0504078"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:journal>Journal of Machine Learning Research</swrc:journal><swrc:pages>639--660</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Microtome"/></swrc:publisher><swrc:title>Adaptive Online Prediction by Following the Perturbed Leader</swrc:title><swrc:volume>6</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>expert, weights, juergen, bounds, online, of, loss, adaptive, with hierarchy, rate, advice, learning, adversary, sequential, follow, and, high, expected, alphabet, probability, general, perturbed, experts, prediction, the, leader, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382167" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Hutter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="J. Poland"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2b9394ee75dd5db37341b62745634de89/schaul"><title>Prediction with Expert Advice by Following the Perturbed Leader for General Weights</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2b9394ee75dd5db37341b62745634de89/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>prediction, leader, perturbed, follow, online, and, weights, expected, with expert, alphabet, hierarchy, loss, general, probability, juergen, sequential, the, bounds, learning, adaptive, advice, of, rate, experts, high, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  and J. &lt;a href=&#034;http://www.bibsonomy.org/author/Poland&#034;&gt;Poland&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 15th International Conf. on Algorithmic Learning Theory (ALT&#039;04), &lt;/em&gt;&lt;em&gt;volume3244ofLNAI, &lt;/em&gt;&lt;em&gt;page279--293. &lt;/em&gt;&lt;em&gt;Padova, &lt;/em&gt;&lt;em&gt;Springer, Berlin, &lt;/em&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/leader,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/perturbed,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/follow,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/online,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/weights,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expected,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/with"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expert,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/alphabet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hierarchy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/general,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequential,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/the,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bounds,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adaptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/advice,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rate,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/experts,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b9394ee75dd5db37341b62745634de89/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b9394ee75dd5db37341b62745634de89/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.LG/0405043"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:address>Padova</swrc:address><swrc:booktitle>Proc. 15th International Conf. on Algorithmic Learning Theory ({ALT&#039;04})</swrc:booktitle><swrc:pages>279--293</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer, Berlin"/></swrc:publisher><swrc:series>LNAI</swrc:series><swrc:title>Prediction with Expert Advice by Following the Perturbed Leader for General Weights</swrc:title><swrc:volume>3244</swrc:volume><swrc:year>2004</swrc:year><swrc:keywords>prediction, leader, perturbed, follow, online, and, weights, expected, with expert, alphabet, hierarchy, loss, general, probability, juergen, sequential, the, bounds, learning, adaptive, advice, of, rate, experts, high, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382172" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Hutter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="J. Poland"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/23e33239f0046b223f066a4fbe60edcd6/schaul"><title>Distribution of Mutual Information from Complete and Incomplete Data</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/23e33239f0046b223f066a4fbe60edcd6/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>statistics, bayes, order, of, information, dirichlet, feature, and, juergen, filters, mutual, distribution, variance selection, naive, classifier, cross, expectation, bayesian, second, entropy, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Marcus &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  and Marco &lt;a href=&#034;http://www.bibsonomy.org/author/Zaffalon&#034;&gt;Zaffalon&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Computational Statistics \&amp;amp; Data Analysis&lt;/em&gt;&lt;em&gt;48(3):633--657&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/statistics,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/order,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dirichlet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/feature,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filters,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mutual,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distribution,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/variance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/naive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classifier,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cross,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expectation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayesian,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/second,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/23e33239f0046b223f066a4fbe60edcd6/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/23e33239f0046b223f066a4fbe60edcd6/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.hutter1.de/ai/mifs.htm"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:journal>Computational Statistics \&amp; Data Analysis</swrc:journal><swrc:number>3</swrc:number><swrc:pages>633--657</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Elsevier Science"/></swrc:publisher><swrc:title>Distribution of Mutual Information from Complete and Incomplete Data</swrc:title><swrc:volume>48</swrc:volume><swrc:year>2005</swrc:year><swrc:keywords>statistics, bayes, order, of, information, dirichlet, feature, and, juergen, filters, mutual, distribution, variance selection, naive, classifier, cross, expectation, bayesian, second, entropy, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382178" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Marcus Hutter"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Marco Zaffalon"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f65403f6346a5b6747be35f3f4f3ac2f/schaul"><title>Robust Feature Selection by Mutual Information Distributions</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2f65403f6346a5b6747be35f3f4f3ac2f/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>variance statistics, credible, of, robust, selection, classifier, approach, dirichlet, distribution, bayesian, missing, naive, cross, information, bayes, expectation, filter, juergen, order, mutual, and, entropy, intervals, feature, data, second, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Marco &lt;a href=&#034;http://www.bibsonomy.org/author/Zaffalon&#034;&gt;Zaffalon&lt;/a&gt;  and Marcus &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 18th International Conf. on Uncertainty in Artificial Intelligence (UAI-2002), &lt;/em&gt;&lt;em&gt;page577--584. &lt;/em&gt;&lt;em&gt;Morgan Kaufmann, San Francisco, CA, &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/variance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/statistics,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/credible,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/robust,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classifier,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/approach,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dirichlet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distribution,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayesian,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/missing,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/naive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cross,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expectation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/order,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mutual,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/intervals,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/feature,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/second,"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f65403f6346a5b6747be35f3f4f3ac2f/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f65403f6346a5b6747be35f3f4f3ac2f/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.AI/0206006"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:booktitle>Proc. 18th International Conf. on Uncertainty in Artificial Intelligence (UAI-2002)</swrc:booktitle><swrc:pages>577--584</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann, San Francisco, CA"/></swrc:publisher><swrc:title>Robust Feature Selection by Mutual Information Distributions</swrc:title><swrc:year>2002</swrc:year><swrc:keywords>variance statistics, credible, of, robust, selection, classifier, approach, dirichlet, distribution, bayesian, missing, naive, cross, information, bayes, expectation, filter, juergen, order, mutual, and, entropy, intervals, feature, data, second, </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382179" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Marco Zaffalon"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Marcus Hutter"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description></burst:publication></item><item rdf:about="http://www.bibsonomy.org/bibtex/2196353ab4f02ae1e2973c01d08d38c45/schaul"><title>Distribution of Mutual Information</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/2196353ab4f02ae1e2973c01d08d38c45/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>and, cross, expectation, mutual, of, juergen, order, entropy, distribution, information, dirichlet, second, variance </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advances in Neural Information Processing Systems 14, &lt;/em&gt;&lt;em&gt;page399--406. &lt;/em&gt;&lt;em&gt;Cambridge, MA, &lt;/em&gt;&lt;em&gt;MIT Press, &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/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cross,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expectation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mutual,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/order,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distribution,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dirichlet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/second,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/variance"/></rdf:Bag></taxo:topics><burst:publication><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2196353ab4f02ae1e2973c01d08d38c45/schaul"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2196353ab4f02ae1e2973c01d08d38c45/schaul"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://arxiv.org/abs/cs.AI/0112019"/><swrc:date>Tue Feb 26 11:58:58 CET 2008</swrc:date><swrc:address>Cambridge, MA</swrc:address><swrc:booktitle>Advances in Neural Information Processing Systems 14</swrc:booktitle><swrc:pages>399--406</swrc:pages><swrc:publisher><swrc:Organization swrc:name="MIT Press"/></swrc:publisher><swrc:title>Distribution of Mutual Information</swrc:title><swrc:year>2002</swrc:year><swrc:keywords>and, cross, expectation, mutual, of, juergen, order, entropy, distribution, information, dirichlet, second, variance </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="2382180" swrc:key="id"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="2" swrc:key="priority"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="M. Hutter"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description></burst:publication></item></rdf:RDF>