<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/schaul/of,"><title>BibSonomy publications for /user/schaul/of,</title><link>http://www.bibsonomy.org/publrss/user/schaul/of,</link><description>BibSonomy RSS Feed for /user/schaul/of,</description><items><rdf:Seq><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/208a8dfde4e1c9fe9b6f6b1ebe570cece/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/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>rate, and, general, bounds, hierarchy, leader, perturbed, alphabet, prediction, expected, learning, the, probability, advice, weights, online, high, experts, of, follow, adversary, expert, adaptive, sequential, loss, with juergen, </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;  und 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/rate,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/general,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bounds,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hierarchy,"/><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/alphabet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expected,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/the,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/advice,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/weights,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/online,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/experts,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/follow,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adversary,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expert,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adaptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sequential,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/with"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/></rdf:Bag></taxo:topics></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>bounds, weights, follow, expert, learning, loss, leader, perturbed, advice, juergen, adaptive, prediction, expected, with sequential, hierarchy, the, rate, alphabet, online, probability, experts, of, high, and, general, </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;  und 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;Volume3244vonLNAI, &lt;/em&gt;&lt;em&gt;Seite279--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/bounds,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/weights,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/follow,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expert,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/loss,"/><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/advice,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/adaptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/prediction,"/><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/sequential,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/hierarchy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/the,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/rate,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/alphabet,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/online,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/probability,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/experts,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/high,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/general,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul"><title>Tournament versus Fitness Uniform Selection</title><description>idsia</description><link>http://www.bibsonomy.org/bibtex/208a8dfde4e1c9fe9b6f6b1ebe570cece/schaul</link><dc:creator>schaul</dc:creator><dc:date>2008-02-26T11:58:58+01:00</dc:date><dc:subject>selection, basic, problems, juergen, deceptive, optimization, principles, schemes, computations, multimodal, of, evaluation, evolutionary, landscapes, working fitness, selfadaptation, algorithm, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;S. &lt;a href=&#034;http://www.bibsonomy.org/author/Legg&#034;&gt;Legg&lt;/a&gt;  und M. &lt;a href=&#034;http://www.bibsonomy.org/author/Hutter&#034;&gt;Hutter&lt;/a&gt;  und A. &lt;a href=&#034;http://www.bibsonomy.org/author/Kumar&#034;&gt;Kumar&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proc. 2004 Congress on Evolutionary Computation (CEC&#039;04), &lt;/em&gt;&lt;em&gt;Seite2144--2151. &lt;/em&gt;&lt;em&gt;Portland, OR, &lt;/em&gt;&lt;em&gt;IEEE, &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/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/basic,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/problems,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/deceptive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/optimization,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/principles,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/schemes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/computations,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/multimodal,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evaluation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/evolutionary,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/landscapes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/working"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fitness,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selfadaptation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithm,"/></rdf:Bag></taxo:topics></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>and, statistics, variance information, naive, order, distribution, bayesian, cross, of, mutual, juergen, second, expectation, selection, bayes, entropy, filters, classifier, feature, dirichlet, </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;  und 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/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/statistics,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/variance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/naive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/order,"/><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/cross,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mutual,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/second,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expectation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bayes,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filters,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classifier,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/feature,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dirichlet,"/></rdf:Bag></taxo:topics></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>credible, data, naive, intervals, entropy, selection, information, classifier, filter, expectation, cross, second, and, juergen, missing, of, bayes, order, statistics, feature, variance distribution, bayesian, robust, approach, dirichlet, mutual, </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;  und 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;Seite577--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/credible,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/naive,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/intervals,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/selection,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classifier,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/filter,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expectation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cross,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/second,"/><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/missing,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/of,"/><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/statistics,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/feature,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/variance"/><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/robust,"/><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/mutual,"/></rdf:Bag></taxo:topics></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>of, distribution, mutual, information, order, expectation, variance entropy, juergen, second, cross, and, dirichlet, </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;Seite399--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/of,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distribution,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mutual,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/order,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/expectation,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/variance"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entropy,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/juergen,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/second,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/cross,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/and,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dirichlet,"/></rdf:Bag></taxo:topics></item></rdf:RDF>