<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/tag/kdd"><title>BibSonomy publications for /tag/kdd</title><link>http://www.bibsonomy.org/publrss/tag/kdd</link><description>BibSonomy RSS Feed for /tag/kdd</description><items><rdf:Seq><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/29c8080aa372c4ac558c11465d817499a/cschenk"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2f5bd6dedb929651afacb06f360442cbc/brazovayeye"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23f5a400d01a974f993cee1ac5f79cfc8/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/229f6bc4833269393dabf92bae3afa905/kdubiq"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2fed442e06c23e32e798d4f0bc9d2875d/hkorte"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2966f2760e840f6b325ad4b3167810dda/jil"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ccd9dc5e964aa635a0a5f6bb816c3a2c/jhammerb"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2ac6a86404d8489b64098b7a3cde43c7a/jil"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2c7c17a56dc9616291cd785b2782b2b1e/jil"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/271047c2340c155bf8dab876110b8df75/jil"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23ad2c8792dc1329746dc94feb84528f0/jil"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/bsmyth"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2eb5f2e6742d9520453cbf9d100cacfd2/bsmyth"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23f5a400d01a974f993cee1ac5f79cfc8/bsmyth"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2dd266b193c76d6cb46be6afa3e9396bb/stumme"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/262cdc3a7629dd764715a60f8d5cf3d7a/zeno"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23c24ecac64fa011fc71b45cfa96ab1e6/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/25142a10793f996c748c9baa42b0993d2/sb3000"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/kde"/><rdf:li rdf:resource="http://www.bibsonomy.org/bibtex/2eb5f2e6742d9520453cbf9d100cacfd2/kde"/></rdf:Seq></items></channel><item rdf:about="http://www.bibsonomy.org/bibtex/29c8080aa372c4ac558c11465d817499a/cschenk"><title>ToscanaJ: An Open Source Tool for Qualitative Data Analysis</title><link>http://www.bibsonomy.org/bibtex/29c8080aa372c4ac558c11465d817499a/cschenk</link><dc:creator>cschenk</dc:creator><dc:date>2008-07-02T11:02:53+02:00</dc:date><dc:subject>stumme qualitative read:2008 sourceforge kdd knowledge paper fca data tool concepts discovery analysis toscanaj </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;P. &lt;a href=&#034;http://www.bibsonomy.org/author/Becker&#034;&gt;Becker&lt;/a&gt;  and J. &lt;a href=&#034;http://www.bibsonomy.org/author/Hereth&#034;&gt;Hereth&lt;/a&gt;  and G. &lt;a href=&#034;http://www.bibsonomy.org/author/Stumme&#034;&gt;Stumme&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advances in Formal Concept Analysis for Knowledge Discovery in Databases., &lt;/em&gt;&lt;em&gt;page1-2. &lt;/em&gt;&lt;em&gt;Lyon, France, &lt;/em&gt;&lt;em&gt;July 23,2002. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/stumme"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/qualitative"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/read:2008"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sourceforge"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/knowledge"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/paper"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fca"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/tool"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concepts"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/discovery"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/toscanaj"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2f5bd6dedb929651afacb06f360442cbc/brazovayeye"><title>Interfacing knowledge discovery algorithms to large database management systems</title><link>http://www.bibsonomy.org/bibtex/2f5bd6dedb929651afacb06f360442cbc/brazovayeye</link><dc:creator>brazovayeye</dc:creator><dc:date>2008-06-19T17:35:00+02:00</dc:date><dc:subject>genetic client-server decision programming, primitives, trees, algorithms, KDD data mining, </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;S. &lt;a href=&#034;http://www.bibsonomy.org/author/Lavington&#034;&gt;Lavington&lt;/a&gt;  and N. &lt;a href=&#034;http://www.bibsonomy.org/author/Dewhurst&#034;&gt;Dewhurst&lt;/a&gt;  and E. &lt;a href=&#034;http://www.bibsonomy.org/author/Wilkins&#034;&gt;Wilkins&lt;/a&gt;  and A. &lt;a href=&#034;http://www.bibsonomy.org/author/Freitas&#034;&gt;Freitas&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Information and Software Technology&lt;/em&gt;&lt;em&gt;41(9):605--617&lt;/em&gt;&lt;em&gt;25 June1999. &lt;/em&gt;&lt;em&gt;special issue on data mining
		    .
	    &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/genetic"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/client-server"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/decision"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/programming,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/primitives,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/trees,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithms,"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/KDD"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining,"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23f5a400d01a974f993cee1ac5f79cfc8/sb3000"><title>From data mining to knowledge discovery: an overview</title><description>From data mining to knowledge discovery</description><link>http://www.bibsonomy.org/bibtex/23f5a400d01a974f993cee1ac5f79cfc8/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2008-05-16T16:48:40+02:00</dc:date><dc:subject>kdd </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Usama M. &lt;a href=&#034;http://www.bibsonomy.org/author/Fayyad&#034;&gt;Fayyad&lt;/a&gt;  and Gregory &lt;a href=&#034;http://www.bibsonomy.org/author/Piatetsky-Shapiro&#034;&gt;Piatetsky-Shapiro&lt;/a&gt;  and Padhraic &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advances in knowledge discovery and data mining, &lt;/em&gt;&lt;em&gt;AAAI Press, &lt;/em&gt;&lt;em&gt;Menlo Park, CA, USA, &lt;/em&gt;(&lt;em&gt;1996&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/229f6bc4833269393dabf92bae3afa905/kdubiq"><title>Data Preparation for Data Mining</title><description>dblp</description><link>http://www.bibsonomy.org/bibtex/229f6bc4833269393dabf92bae3afa905/kdubiq</link><dc:creator>kdubiq</dc:creator><dc:date>2008-04-30T12:59:47+02:00</dc:date><dc:subject>wg4 kdubiq preparation data dm mining kdd </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Dorian &lt;a href=&#034;http://www.bibsonomy.org/author/Pyle&#034;&gt;Pyle&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Morgan Kaufmann, &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/wg4"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdubiq"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/preparation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/data"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2fed442e06c23e32e798d4f0bc9d2875d/hkorte"><title>Konzeption und Analyse von KDD-Techniken f&#252;r das Software Engineering</title><link>http://www.bibsonomy.org/bibtex/2fed442e06c23e32e798d4f0bc9d2875d/hkorte</link><dc:creator>hkorte</dc:creator><dc:date>2008-04-22T14:31:18+02:00</dc:date><dc:subject>kdd software_engineering </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Pascal &lt;a href=&#034;http://www.bibsonomy.org/author/Wenzel&#034;&gt;Wenzel&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2004&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/software_engineering"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2966f2760e840f6b325ad4b3167810dda/jil"><title>Machine learning in automated text categorization</title><link>http://www.bibsonomy.org/bibtex/2966f2760e840f6b325ad4b3167810dda/jil</link><dc:creator>jil</dc:creator><dc:date>2008-04-15T00:52:44+02:00</dc:date><dc:subject>text classification machine sebastiani learning kdd categorization algorithmen vergleich klassifikation </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;F. &lt;a href=&#034;http://www.bibsonomy.org/author/Sebastiani&#034;&gt;Sebastiani&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;ACM Computing Surveys&lt;/em&gt;&lt;em&gt;34(1):1--47&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/text"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/classification"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/machine"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/sebastiani"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/learning"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/categorization"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/algorithmen"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/vergleich"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/klassifikation"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ccd9dc5e964aa635a0a5f6bb816c3a2c/jhammerb"><title>Hancock: a language for extracting signatures from data streams</title><description>Hancock</description><link>http://www.bibsonomy.org/bibtex/2ccd9dc5e964aa635a0a5f6bb816c3a2c/jhammerb</link><dc:creator>jhammerb</dc:creator><dc:date>2007-12-17T05:32:09+01:00</dc:date><dc:subject>signature distributed kdd att datamining language </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Corinna &lt;a href=&#034;http://www.bibsonomy.org/author/Cortes&#034;&gt;Cortes&lt;/a&gt;  and Kathleen &lt;a href=&#034;http://www.bibsonomy.org/author/Fisher&#034;&gt;Fisher&lt;/a&gt;  and Daryl &lt;a href=&#034;http://www.bibsonomy.org/author/Pregibon&#034;&gt;Pregibon&lt;/a&gt;  and Anne &lt;a href=&#034;http://www.bibsonomy.org/author/Rogers&#034;&gt;Rogers&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;KDD &#039;00: Proceedings of the sixth ACM SIGKDD international conference on Knowledge discovery and data mining, &lt;/em&gt;&lt;em&gt;page9--17. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;ACM, &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/signature"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/distributed"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/att"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/datamining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/language"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2ac6a86404d8489b64098b7a3cde43c7a/jil"><title>Knowledge Discovery in Multi-label Phenotype Data.</title><link>http://www.bibsonomy.org/bibtex/2ac6a86404d8489b64098b7a3cde43c7a/jil</link><dc:creator>jil</dc:creator><dc:date>2007-11-24T21:15:08+01:00</dc:date><dc:subject>informationsgewinn information_gain multi gain label kdd modification multilabel information c4.5 multiclass </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Amanda &lt;a href=&#034;http://www.bibsonomy.org/author/Clare&#034;&gt;Clare&lt;/a&gt;  and Ross D. &lt;a href=&#034;http://www.bibsonomy.org/author/King&#034;&gt;King&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;PKDD, &lt;/em&gt;&lt;em&gt;volume2168ofLecture Notes in Computer Science, &lt;/em&gt;&lt;em&gt;page42-53. &lt;/em&gt;&lt;em&gt;Springer, &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/informationsgewinn"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information_gain"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/multi"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gain"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/label"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/modification"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/multilabel"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/information"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/c4.5"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/multiclass"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2c7c17a56dc9616291cd785b2782b2b1e/jil"><title>SECRET: a scalable linear regression tree algorithm.</title><link>http://www.bibsonomy.org/bibtex/2c7c17a56dc9616291cd785b2782b2b1e/jil</link><dc:creator>jil</dc:creator><dc:date>2007-11-24T18:35:01+01:00</dc:date><dc:subject>tree regression gehrke linear kdd decision </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Alin &lt;a href=&#034;http://www.bibsonomy.org/author/Dobra&#034;&gt;Dobra&lt;/a&gt;  and Johannes &lt;a href=&#034;http://www.bibsonomy.org/author/Gehrke&#034;&gt;Gehrke&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;KDD, &lt;/em&gt;&lt;em&gt;page481-487. &lt;/em&gt;&lt;em&gt;ACM, &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/tree"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/regression"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gehrke"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/linear"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/decision"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/271047c2340c155bf8dab876110b8df75/jil"><title>Combining winnow and orthogonal sparse bigrams for incremental spam filtering</title><link>http://www.bibsonomy.org/bibtex/271047c2340c155bf8dab876110b8df75/jil</link><dc:creator>jil</dc:creator><dc:date>2007-11-10T16:00:52+01:00</dc:date><dc:subject>categorization bi ngram bigram gram orthogonal text spamassassin window spam winnow kdd n osb </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Christian &lt;a href=&#034;http://www.bibsonomy.org/author/Siefkes&#034;&gt;Siefkes&lt;/a&gt;  and Fidelis &lt;a href=&#034;http://www.bibsonomy.org/author/Assis&#034;&gt;Assis&lt;/a&gt;  and Shalendra &lt;a href=&#034;http://www.bibsonomy.org/author/Chhabra&#034;&gt;Chhabra&lt;/a&gt;  and William S. &lt;a href=&#034;http://www.bibsonomy.org/author/Yerazunis&#034;&gt;Yerazunis&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;PKDD &#039;04: Proceedings of the 8th European Conference on Principles and Practice of Knowledge Discovery in Databases, &lt;/em&gt;&lt;em&gt;page410--421. &lt;/em&gt;&lt;em&gt;New York, NY, USA, &lt;/em&gt;&lt;em&gt;Springer-Verlag New York, Inc., &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/categorization"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bi"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ngram"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/bigram"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/gram"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/orthogonal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spamassassin"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/window"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/spam"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/winnow"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/n"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/osb"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23ad2c8792dc1329746dc94feb84528f0/jil"><title>Solving Multiclass Learning Problems via Error-Correcting Output Codes</title><link>http://www.bibsonomy.org/bibtex/23ad2c8792dc1329746dc94feb84528f0/jil</link><dc:creator>jil</dc:creator><dc:date>2007-11-08T20:46:49+01:00</dc:date><dc:subject>ecoc error backpropagation entscheidungsbaum nn correction c4.5 codes kdd </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;T. G. &lt;a href=&#034;http://www.bibsonomy.org/author/Dietterich&#034;&gt;Dietterich&lt;/a&gt;  and G. &lt;a href=&#034;http://www.bibsonomy.org/author/Bakiri&#034;&gt;Bakiri&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Journal of Artificial Intelligence Research&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/ecoc"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/error"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/backpropagation"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/entscheidungsbaum"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/nn"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/correction"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/c4.5"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/codes"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/bsmyth"><title>Modeling the Internet and the Web: Probabilistic Methods and Algorithms</title><link>http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/bsmyth</link><dc:creator>bsmyth</dc:creator><dc:date>2007-11-05T17:28:31+01:00</dc:date><dc:subject>web mining dm KI2007WebMining kdd ml </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Pierre &lt;a href=&#034;http://www.bibsonomy.org/author/Baldi&#034;&gt;Baldi&lt;/a&gt;  and Paolo &lt;a href=&#034;http://www.bibsonomy.org/author/Frasconi&#034;&gt;Frasconi&lt;/a&gt;  and Padhraic &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;chapter 4, &lt;/em&gt;&lt;em&gt;Wiley, &lt;/em&gt;&lt;em&gt;April2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/KI2007WebMining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2eb5f2e6742d9520453cbf9d100cacfd2/bsmyth"><title>From Data Mining to Knowledge Discovery in Databases</title><description>The big one</description><link>http://www.bibsonomy.org/bibtex/2eb5f2e6742d9520453cbf9d100cacfd2/bsmyth</link><dc:creator>bsmyth</dc:creator><dc:date>2007-11-05T17:28:31+01:00</dc:date><dc:subject>2006 definition lecture kdd dm </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;U. &lt;a href=&#034;http://www.bibsonomy.org/author/Fayyad&#034;&gt;Fayyad&lt;/a&gt;  and G. &lt;a href=&#034;http://www.bibsonomy.org/author/Piatetsky-Shapiro&#034;&gt;Piatetsky-Shapiro&lt;/a&gt;  and P. &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;AI Magazine&lt;/em&gt;(&lt;em&gt;1996&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2006"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/definition"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23f5a400d01a974f993cee1ac5f79cfc8/bsmyth"><title>From data mining to knowledge discovery: an overview</title><description>From data mining to knowledge discovery</description><link>http://www.bibsonomy.org/bibtex/23f5a400d01a974f993cee1ac5f79cfc8/bsmyth</link><dc:creator>bsmyth</dc:creator><dc:date>2007-11-03T00:18:07+01:00</dc:date><dc:subject>kdd </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Usama M. &lt;a href=&#034;http://www.bibsonomy.org/author/Fayyad&#034;&gt;Fayyad&lt;/a&gt;  and Gregory &lt;a href=&#034;http://www.bibsonomy.org/author/Piatetsky-Shapiro&#034;&gt;Piatetsky-Shapiro&lt;/a&gt;  and Padhraic &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Advances in knowledge discovery and data mining, &lt;/em&gt;&lt;em&gt;American Association for Artificial Intelligence, &lt;/em&gt;&lt;em&gt;Menlo Park, CA, USA, &lt;/em&gt;(&lt;em&gt;1996&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2dd266b193c76d6cb46be6afa3e9396bb/stumme"><title>Why can concept lattices support knowledge discovery in databases?</title><link>http://www.bibsonomy.org/bibtex/2dd266b193c76d6cb46be6afa3e9396bb/stumme</link><dc:creator>stumme</dc:creator><dc:date>2007-09-05T16:33:02+02:00</dc:date><dc:subject>kdd concept formal lattices analysis fca </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Rudolf &lt;a href=&#034;http://www.bibsonomy.org/author/Wille&#034;&gt;Wille&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;J. Exp. Theor. Artif. Intell.&lt;/em&gt;&lt;em&gt;14(2-3):81-92&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/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/concept"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/formal"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lattices"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/analysis"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/fca"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/262cdc3a7629dd764715a60f8d5cf3d7a/zeno"><title>TimeMines: Constructing Timelines with Statistical Models of Word Usage</title><description>TimeMines: Constructing Timelines with Statistical Models of Word Usage - Swan, Jensen</description><link>http://www.bibsonomy.org/bibtex/262cdc3a7629dd764715a60f8d5cf3d7a/zeno</link><dc:creator>zeno</dc:creator><dc:date>2007-08-01T09:59:18+02:00</dc:date><dc:subject>BAD_BIBTEX kdd text-mining 2000 timeline words </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;R. &lt;a href=&#034;http://www.bibsonomy.org/author/Swan&#034;&gt;Swan&lt;/a&gt;  and D. &lt;a href=&#034;http://www.bibsonomy.org/author/Jensen&#034;&gt;Jensen&lt;/a&gt;  &lt;/span&gt;(&lt;em&gt;2000&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/BAD_BIBTEX"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/text-mining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2000"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/timeline"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/words"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23c24ecac64fa011fc71b45cfa96ab1e6/sb3000"><title>Data Mining: Practical Machine Learning Tools and Techniques with Java Implementations</title><link>http://www.bibsonomy.org/bibtex/23c24ecac64fa011fc71b45cfa96ab1e6/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-07-17T16:43:29+02:00</dc:date><dc:subject>ml datamining kdd </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Ian H. &lt;a href=&#034;http://www.bibsonomy.org/author/Witten&#034;&gt;Witten&lt;/a&gt;  and Eibe &lt;a href=&#034;http://www.bibsonomy.org/author/Frank&#034;&gt;Frank&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Morgan Kaufmann, &lt;/em&gt;&lt;em&gt;October1999. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/datamining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/25142a10793f996c748c9baa42b0993d2/sb3000"><title>Intelligent Data Analysis</title><link>http://www.bibsonomy.org/bibtex/25142a10793f996c748c9baa42b0993d2/sb3000</link><dc:creator>sb3000</dc:creator><dc:date>2007-07-17T16:43:02+02:00</dc:date><dc:subject>kdd datamining ml </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Michael R. &lt;a href=&#034;http://www.bibsonomy.org/author/Berthold&#034;&gt;Berthold&lt;/a&gt;  and David J. &lt;a href=&#034;http://www.bibsonomy.org/author/Hand&#034;&gt;Hand&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;Springer, &lt;/em&gt;&lt;em&gt;April2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/datamining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/kde"><title>Modeling the Internet and the Web: Probabilistic Methods and Algorithms</title><link>http://www.bibsonomy.org/bibtex/23e4e2899e7d6988218d02a264bcfe24a/kde</link><dc:creator>kde</dc:creator><dc:date>2007-07-16T11:35:14+02:00</dc:date><dc:subject>dm KI2007WebMining web kdd ml mining </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;Pierre &lt;a href=&#034;http://www.bibsonomy.org/author/Baldi&#034;&gt;Baldi&lt;/a&gt;  and Paolo &lt;a href=&#034;http://www.bibsonomy.org/author/Frasconi&#034;&gt;Frasconi&lt;/a&gt;  and Padhraic &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;chapter 4, &lt;/em&gt;&lt;em&gt;Wiley, &lt;/em&gt;&lt;em&gt;April2003. &lt;/em&gt;</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/KI2007WebMining"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/web"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/ml"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/mining"/></rdf:Bag></taxo:topics></item><item rdf:about="http://www.bibsonomy.org/bibtex/2eb5f2e6742d9520453cbf9d100cacfd2/kde"><title>From Data Mining to Knowledge Discovery in Databases</title><description>The big one</description><link>http://www.bibsonomy.org/bibtex/2eb5f2e6742d9520453cbf9d100cacfd2/kde</link><dc:creator>kde</dc:creator><dc:date>2007-07-13T11:40:08+02:00</dc:date><dc:subject>kdd lecture definition dm 2006 KI2007WebMining </dc:subject><content:encoded>&lt;span style=&#034;color:#555555;&#034;&gt;U. &lt;a href=&#034;http://www.bibsonomy.org/author/Fayyad&#034;&gt;Fayyad&lt;/a&gt;  and G. &lt;a href=&#034;http://www.bibsonomy.org/author/Piatetsky-Shapiro&#034;&gt;Piatetsky-Shapiro&lt;/a&gt;  and P. &lt;a href=&#034;http://www.bibsonomy.org/author/Smyth&#034;&gt;Smyth&lt;/a&gt;  &lt;/span&gt;&lt;em&gt;AI Magazine&lt;/em&gt;(&lt;em&gt;1996&lt;/em&gt;)</content:encoded><taxo:topics><rdf:Bag><rdf:li rdf:resource="http://www.bibsonomy.org/tag/kdd"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/lecture"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/definition"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/dm"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/2006"/><rdf:li rdf:resource="http://www.bibsonomy.org/tag/KI2007WebMining"/></rdf:Bag></taxo:topics></item></rdf:RDF>