<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/sb3000/boosting"><title>BibSonomy publications for /user/sb3000/boosting</title><link>http://www.bibsonomy.org/publrss/user/sb3000/boosting</link><description>BibSonomy RSS Feed for /user/sb3000/boosting</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a57903a4addd9ac0058b0ab1507c4476/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23a1c4ffb6c4f64f3e29681ad83544dd8/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/20fa048c9b58029b8867236e3436caf94/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/222a9b9d3dc4107e4e875fe6b6ce04da2/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/21bc591d7bd76fd3fc999fdeed4bd7b68/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/22c5880e97000108c88d8872f155889f7/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2a8ff318d7bc5f2b811934c85c05c74e2/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27247ba14f8a7785d130812b2551bb536/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f9eb3dc7ca9a96447821e093b1e97c6c/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2cec2e129bc84620b30672ff0614ff87a/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24b54d67152e9e88f2280f216179da34f/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2420e9aafa435d34a954a20c909781ecf/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2d64ba3baa6d7f7b08e38f08a5d850c89/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2590a45a22e9a772d19a381fd868a7599/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2633432479404d81b6a139afc0884be84/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/24c55f2213f0fef19e7730c09a92dc669/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/27e697191d6bdd5cbe5291c8412bcd1df/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c22d81a3d6d0175c04d12fbfd1717489/sb3000"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/2a57903a4addd9ac0058b0ab1507c4476/sb3000"><title>Boosting for Text Classification with Semantic Features</title><description>Institut AIFB - Publikation: Boosting for Text Classification with Semantic Features</description><link>http://www.bibsonomy.org/bibtex/2a57903a4addd9ac0058b0ab1507c4476/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2008-04-25T14:46:50+02:00</dc:date><dc:subject>sb boosting text-classification </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Stephan &lt;a href=&#034;http://www.bibsonomy.org/author/Bloehdorn&#034;&gt;Bloehdorn&lt;/a&gt;  und Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advances in Web Mining and Web Usage Analysis, Revised Selected Papers of the 6th International Workshop on Knowledge Discovery on the Web, WebKDD 2004, Seattle, WA, USA, August 22-25, 2004, &lt;/em&gt;&lt;em&gt;3932, &lt;/em&gt;&lt;em&gt;Seite149-166. &lt;/em&gt;&lt;em&gt;Springer, Berlin--Heidelberg, Germany, &lt;/em&gt;(&lt;em&gt;2006&lt;/em&gt;) &lt;em&gt;REPRINT
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sb"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text-classification"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23a1c4ffb6c4f64f3e29681ad83544dd8/sb3000"><title>Text Categorization by Boosting Automatically Extracted Concepts</title><description>Text categorization by boosting automatically extracted concepts</description><link>http://www.bibsonomy.org/bibtex/23a1c4ffb6c4f64f3e29681ad83544dd8/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2008-03-10T15:48:35+01:00</dc:date><dc:subject>plsi boosting text-classification </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Lijuan &lt;a href=&#034;http://www.bibsonomy.org/author/Cai&#034;&gt;Cai&lt;/a&gt;  und Thomas &lt;a href=&#034;http://www.bibsonomy.org/author/Hofmann&#034;&gt;Hofmann&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 26th Annual International ACM SIGIR Conference on Research and Development in Information Retrieval (SIGIR &#039;03), July 28 - August 1, 2003, Toronto, Canada, &lt;/em&gt;&lt;em&gt;Seite182--189. &lt;/em&gt;&lt;em&gt;ACM Press, New York, NY, USA, &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/plsi"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text-classification"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/20fa048c9b58029b8867236e3436caf94/sb3000"><title>Text Classification by Boosting Weak Learners based on Terms and Concepts</title><link>http://www.bibsonomy.org/bibtex/20fa048c9b58029b8867236e3436caf94/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2008-03-10T15:17:24+01:00</dc:date><dc:subject>ontologies sb boosting text-classification </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Stephan &lt;a href=&#034;http://www.bibsonomy.org/author/Bloehdorn&#034;&gt;Bloehdorn&lt;/a&gt;  und Andreas &lt;a href=&#034;http://www.bibsonomy.org/author/Hotho&#034;&gt;Hotho&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 4th IEEE International Conference on Data Mining (ICDM 2004), 1-4 November 2004, Brighton, UK, &lt;/em&gt;&lt;em&gt;Seite331-334. &lt;/em&gt;&lt;em&gt;IEEE Computer Society, Washington, DC, USA, &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/ontologies"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sb"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text-classification"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/222a9b9d3dc4107e4e875fe6b6ce04da2/sb3000"><title>MARK: a boosting algorithm for heterogeneous kernel models</title><link>http://www.bibsonomy.org/bibtex/222a9b9d3dc4107e4e875fe6b6ce04da2/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-10-10T13:49:37+02:00</dc:date><dc:subject>kernels boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Kristin P. &lt;a href=&#034;http://www.bibsonomy.org/author/Bennett&#034;&gt;Bennett&lt;/a&gt;  und Michinari &lt;a href=&#034;http://www.bibsonomy.org/author/Momma&#034;&gt;Momma&lt;/a&gt;  und Mark J. &lt;a href=&#034;http://www.bibsonomy.org/author/Embrechts&#034;&gt;Embrechts&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;KDD &#039;02: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining, &lt;/em&gt;&lt;em&gt;Seite24--31. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM 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/kernels"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/21bc591d7bd76fd3fc999fdeed4bd7b68/sb3000"><title>Column-generation boosting methods for mixture of kernels</title><link>http://www.bibsonomy.org/bibtex/21bc591d7bd76fd3fc999fdeed4bd7b68/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-10-10T13:49:06+02:00</dc:date><dc:subject>kernels boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Jinbo &lt;a href=&#034;http://www.bibsonomy.org/author/Bi&#034;&gt;Bi&lt;/a&gt;  und Tong &lt;a href=&#034;http://www.bibsonomy.org/author/Zhang&#034;&gt;Zhang&lt;/a&gt;  und Kristin P. &lt;a href=&#034;http://www.bibsonomy.org/author/Bennett&#034;&gt;Bennett&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;KDD &#039;04: Proceedings of the tenth ACM SIGKDD international conference on Knowledge discovery and data mining, &lt;/em&gt;&lt;em&gt;Seite521--526. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM Press, &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/kernels"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/22c5880e97000108c88d8872f155889f7/sb3000"><title>Soft Margins for AdaBoost</title><link>http://www.bibsonomy.org/bibtex/22c5880e97000108c88d8872f155889f7/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-10-02T15:21:28+02:00</dc:date><dc:subject>boosting regularization </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;G. &lt;a href=&#034;http://www.bibsonomy.org/author/Rätsch&#034;&gt;R&amp;#228;tsch&lt;/a&gt;  und T. &lt;a href=&#034;http://www.bibsonomy.org/author/Onoda&#034;&gt;Onoda&lt;/a&gt;  und K.-R. &lt;a href=&#034;http://www.bibsonomy.org/author/Müller&#034;&gt;M&amp;#252;ller&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Machine Learning&lt;/em&gt;&lt;em&gt;42(3):287--320&lt;/em&gt;&lt;em&gt;March2001. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/regularization"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2a8ff318d7bc5f2b811934c85c05c74e2/sb3000"><title>An Introduction to Boosting and Leveraging</title><link>http://www.bibsonomy.org/bibtex/2a8ff318d7bc5f2b811934c85c05c74e2/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-10-02T10:23:36+02:00</dc:date><dc:subject>boosting introduction </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ron &lt;a href=&#034;http://www.bibsonomy.org/author/Meir&#034;&gt;Meir&lt;/a&gt;  und Gunnar &lt;a href=&#034;http://www.bibsonomy.org/author/Rätsch&#034;&gt;R&amp;#228;tsch&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advanced Lectures on Machine Learning, &lt;/em&gt;&lt;em&gt;2600, &lt;/em&gt;&lt;em&gt;Springer-Verlag New York, Inc., &lt;/em&gt;&lt;em&gt;New York, NY, USA, &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/boosting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/introduction"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27247ba14f8a7785d130812b2551bb536/sb3000"><title>BoosTexter: A Boosting-based System for Text Categorization</title><link>http://www.bibsonomy.org/bibtex/27247ba14f8a7785d130812b2551bb536/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-04-21T14:58:47+02:00</dc:date><dc:subject>boosting text-classification </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  und Y. &lt;a href=&#034;http://www.bibsonomy.org/author/Singer&#034;&gt;Singer&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Machine Learning&lt;/em&gt;&lt;em&gt;39(2/3):135--168&lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text-classification"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f9eb3dc7ca9a96447821e093b1e97c6c/sb3000"><title>An Introduction to Boosting and Leveraging</title><link>http://www.bibsonomy.org/bibtex/2f9eb3dc7ca9a96447821e093b1e97c6c/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:11:36+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. &lt;a href=&#034;http://www.bibsonomy.org/author/Meir&#034;&gt;Meir&lt;/a&gt;  und G. &lt;a href=&#034;http://www.bibsonomy.org/author/R{ä}tsch&#034;&gt;R&amp;#228;tsch&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advanced Lectures on Machine Learning, &lt;/em&gt;&lt;em&gt;Springer, &lt;/em&gt;&lt;em&gt;Heidelberg, DE, &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/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2cec2e129bc84620b30672ff0614ff87a/sb3000"><title>A Decision Theoretic Generalization of On-Line Learning and an Application to Boosting</title><link>http://www.bibsonomy.org/bibtex/2cec2e129bc84620b30672ff0614ff87a/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:06:27+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Y. &lt;a href=&#034;http://www.bibsonomy.org/author/Freund&#034;&gt;Freund&lt;/a&gt;  und R. E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Second European Conference on Computational Learning Theory (EuroCOLT-95), &lt;/em&gt;&lt;em&gt;Seite23--37. &lt;/em&gt;(&lt;em&gt;1995&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24b54d67152e9e88f2280f216179da34f/sb3000"><title>The Strength of Weak Learnability</title><link>http://www.bibsonomy.org/bibtex/24b54d67152e9e88f2280f216179da34f/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:05:10+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Machine Learning&lt;/em&gt;(&lt;em&gt;1990&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2420e9aafa435d34a954a20c909781ecf/sb3000"><title>Boosting the Margin: A New Explanation for the Effectiveness of Voting Methods.</title><link>http://www.bibsonomy.org/bibtex/2420e9aafa435d34a954a20c909781ecf/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:05:10+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  und Y. &lt;a href=&#034;http://www.bibsonomy.org/author/Freund&#034;&gt;Freund&lt;/a&gt;  und P. &lt;a href=&#034;http://www.bibsonomy.org/author/Bartlett&#034;&gt;Bartlett&lt;/a&gt;  und W. S. &lt;a href=&#034;http://www.bibsonomy.org/author/Lee&#034;&gt;Lee&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;The Annals of Statistics&lt;/em&gt;&lt;em&gt;26(5):1651--1686&lt;/em&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2d64ba3baa6d7f7b08e38f08a5d850c89/sb3000"><title>Improved Boosting Algorithms Using Confidence-Rated Predictions</title><link>http://www.bibsonomy.org/bibtex/2d64ba3baa6d7f7b08e38f08a5d850c89/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:05:10+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  und Y. &lt;a href=&#034;http://www.bibsonomy.org/author/Singer&#034;&gt;Singer&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Machine Learning&lt;/em&gt;&lt;em&gt;37(3):297--336&lt;/em&gt;(&lt;em&gt;1999&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2590a45a22e9a772d19a381fd868a7599/sb3000"><title>Additive Logistic Regression: a Statistical View of Boosting</title><link>http://www.bibsonomy.org/bibtex/2590a45a22e9a772d19a381fd868a7599/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:05:10+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;J. &lt;a href=&#034;http://www.bibsonomy.org/author/Friedman&#034;&gt;Friedman&lt;/a&gt;  und T. &lt;a href=&#034;http://www.bibsonomy.org/author/Hastie&#034;&gt;Hastie&lt;/a&gt;  und R. &lt;a href=&#034;http://www.bibsonomy.org/author/Tibshirani&#034;&gt;Tibshirani&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;The Annals of Statistics&lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2633432479404d81b6a139afc0884be84/sb3000"><title>Boosting Trees for Anti-Spam Email Filtering</title><link>http://www.bibsonomy.org/bibtex/2633432479404d81b6a139afc0884be84/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:05:10+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;X. &lt;a href=&#034;http://www.bibsonomy.org/author/Carreras&#034;&gt;Carreras&lt;/a&gt;  und L. &lt;a href=&#034;http://www.bibsonomy.org/author/M\&amp;#039;arquez&#034;&gt;M&#039;arquez&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of RANLP-01, 4th International Conference on Recent Advances in Natural Language Processing, &lt;/em&gt;&lt;em&gt;Tzigov Chark, BG, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/24c55f2213f0fef19e7730c09a92dc669/sb3000"><title>Boosting and Rocchio applied to text filtering</title><link>http://www.bibsonomy.org/bibtex/24c55f2213f0fef19e7730c09a92dc669/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T22:05:10+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Robert E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  und Yoram &lt;a href=&#034;http://www.bibsonomy.org/author/Singer&#034;&gt;Singer&lt;/a&gt;  und Amit &lt;a href=&#034;http://www.bibsonomy.org/author/Singhal&#034;&gt;Singhal&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of the 21th annual international ACM SIGIR conference on Research and development in informaion retrieval, &lt;/em&gt;&lt;em&gt;Seite215--223. &lt;/em&gt;&lt;em&gt;ACM Press, &lt;/em&gt;(&lt;em&gt;1998&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/27e697191d6bdd5cbe5291c8412bcd1df/sb3000"><title>The Boosting Approach to Machine Learning: An Overview</title><link>http://www.bibsonomy.org/bibtex/27e697191d6bdd5cbe5291c8412bcd1df/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T21:54:04+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. E. &lt;a href=&#034;http://www.bibsonomy.org/author/Schapire&#034;&gt;Schapire&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;In MSRI Workshop on Nonlinear Estimation and Classification, Berkeley, CA, USA, &lt;/em&gt;(&lt;em&gt;2001&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c22d81a3d6d0175c04d12fbfd1717489/sb3000"><title>A Boosting Approach to Topic Spotting on Subdialogues</title><link>http://www.bibsonomy.org/bibtex/2c22d81a3d6d0175c04d12fbfd1717489/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2006-02-02T21:54:04+01:00</dc:date><dc:subject>boosting </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;K. &lt;a href=&#034;http://www.bibsonomy.org/author/Myers&#034;&gt;Myers&lt;/a&gt;  und M. &lt;a href=&#034;http://www.bibsonomy.org/author/Kearns&#034;&gt;Kearns&lt;/a&gt;  und S. &lt;a href=&#034;http://www.bibsonomy.org/author/Singh&#034;&gt;Singh&lt;/a&gt;  und M. A. &lt;a href=&#034;http://www.bibsonomy.org/author/Walker&#034;&gt;Walker&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Proceedings of ICML-00, 17th International Conference on Machine Learning, &lt;/em&gt;&lt;em&gt;Stanford, USA, &lt;/em&gt;&lt;em&gt;Morgan Kaufmann Publishers, &lt;/em&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/boosting"/></rdf:Bag></taxo:topics></item></rdf:RDF>