<rdf:RDF xmlns:community="http://www.bibsonomy.org/ontologies/2008/05/community#" xmlns:foaf="http://xmlns.com/foaf/0.1/" xmlns:owl="http://www.w3.org/2002/07/owl#" 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: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#" xml:base="http://www.bibsonomy.org/tag/kdubiq"><owl:Ontology rdf:about=""><rdfs:comment>BibSonomy publications for /tag/kdubiq</rdfs:comment><owl:imports rdf:resource="http://swrc.ontoware.org/ontology/portal"/></owl:Ontology><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2be3c753af98ab591b4f31d349513b461/enitsirhc"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2be3c753af98ab591b4f31d349513b461/enitsirhc"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InCollection"/><owl:sameAs rdf:resource="http://208.254.79.11/shopping_cart/products/product_contents.asp?id=&amp;parent_id=497&amp;sku=C5867&amp;isbn=9781420085860&amp;pc="/><swrc:date>Thu Jan 19 16:05:26 CET 2012</swrc:date><swrc:booktitle>Next Generation of Data Mining (Chapman &amp; Hall/Crc Data Mining and Knowledge Discovery Series)</swrc:booktitle><swrc:edition>1</swrc:edition><swrc:publisher><swrc:Organization swrc:name="Chapman &amp; Hall/CRC"/></swrc:publisher><swrc:title>Research Challenges in Ubiquitous Knowledge Discovery</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>2008 mining data myown ubiquitous kdd kdubiq </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="9781420085860" swrc:key="ean"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1420085867" swrc:key="asin"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1420085867" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="9781420085860" swrc:key="isbn13"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="005.74" swrc:key="dewey"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael May"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Bettina Berendt"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Antoine Cornuéjols"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Jõao Gama"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Fosca Giannotti"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Andreas Hotho"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Donato Malerba"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Ernestina Menesalvas"/></rdf:_8><rdf:_9><swrc:Person swrc:name="Katharina Morik"/></rdf:_9><rdf:_10><swrc:Person swrc:name="Rasmus Pedersen"/></rdf:_10><rdf:_11><swrc:Person swrc:name="Lorenza Saitta"/></rdf:_11><rdf:_12><swrc:Person swrc:name="Yücel Saygin"/></rdf:_12><rdf:_13><swrc:Person swrc:name="Assaf Schuster"/></rdf:_13><rdf:_14><swrc:Person swrc:name="Koen Vanhoof"/></rdf:_14></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2c8dbb6371be8d67e3aa1928bd3dd0fed/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2c8dbb6371be8d67e3aa1928bd3dd0fed/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/hotho/pub/2006/schmitz2006asso_ifcs.pdf"/><swrc:date>Fri May 15 17:22:38 CEST 2009</swrc:date><swrc:address>Berlin/Heidelberg</swrc:address><swrc:booktitle>Data Science and Classification (Proc. IFCS 2006 Conference)</swrc:booktitle><swrc:month>July</swrc:month><swrc:note>Ljubljana</swrc:note><swrc:pages>261-270</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>Studies in Classification, Data Analysis, and Knowledge Organization</swrc:series><swrc:title>Mining Association Rules in Folksonomies</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>2006 analysis association folksonomy kdubiq myown network rules semantic seminar2006 sosbuch summerschool </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="978-3-540-34415-5" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="18" swrc:key="vgwort"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="10.1007/3-540-34416-0_28" swrc:key="doi"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Christoph Schmitz"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Andreas Hotho"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Robert Jäschke"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="V. Batagelj"/></rdf:_1><rdf:_2><swrc:Person swrc:name="H.-H. Bock"/></rdf:_2><rdf:_3><swrc:Person swrc:name="A. Ferligoj"/></rdf:_3><rdf:_4><swrc:Person swrc:name="A. Žiberna"/></rdf:_4></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2be3c753af98ab591b4f31d349513b461/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2be3c753af98ab591b4f31d349513b461/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InCollection"/><owl:sameAs rdf:resource="http://208.254.79.11/shopping_cart/products/product_contents.asp?id=&amp;parent_id=497&amp;sku=C5867&amp;isbn=9781420085860&amp;pc="/><swrc:date>Mon Jan 19 11:30:18 CET 2009</swrc:date><swrc:booktitle>Next Generation of Data Mining (Chapman &amp; Hall/Crc Data Mining and Knowledge Discovery Series)</swrc:booktitle><swrc:edition>1</swrc:edition><swrc:publisher><swrc:Organization swrc:name="Chapman &amp; Hall/CRC"/></swrc:publisher><swrc:title>Research Challenges in Ubiquitous Knowledge Discovery</swrc:title><swrc:year>2008</swrc:year><swrc:keywords>2008 data kdd kdubiq mining myown ubiquitous </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="9781420085860" swrc:key="ean"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1420085867" swrc:key="asin"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="1420085867" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="9781420085860" swrc:key="isbn13"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="005.74" swrc:key="dewey"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Michael May"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Bettina Berendt"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Antoine Cornuéjols"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Jõao Gama"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Fosca Giannotti"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Andreas Hotho"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Donato Malerba"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Ernestina Menesalvas"/></rdf:_8><rdf:_9><swrc:Person swrc:name="Katharina Morik"/></rdf:_9><rdf:_10><swrc:Person swrc:name="Rasmus Pedersen"/></rdf:_10><rdf:_11><swrc:Person swrc:name="Lorenza Saitta"/></rdf:_11><rdf:_12><swrc:Person swrc:name="Yücel Saygin"/></rdf:_12><rdf:_13><swrc:Person swrc:name="Assaf Schuster"/></rdf:_13><rdf:_14><swrc:Person swrc:name="Koen Vanhoof"/></rdf:_14></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/264d7db1df158a73984b5483873c42cfd/ocelma"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/264d7db1df158a73984b5483873c42cfd/ocelma"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://dx.doi.org/10.1007/11610113_66"/><swrc:date>Thu Jan 08 17:06:55 CET 2009</swrc:date><swrc:journal>Frontiers of WWW Research and Development</swrc:journal><swrc:pages>733--738</swrc:pages><swrc:title>Cubic Analysis of Social Bookmarking for Personalized Recommendation</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>PhD bookmarking folksonomy kdubiq recommender social summerschool tagging toread </swrc:keywords><swrc:abstract>Personalized recommendation is used to conquer the information overload problem, and collaborative filtering recommendation (CF) is one of the most successful recommendation techniques to date. However, CF becomes less effective when users have multiple interests, because users have similar taste in one aspect may behave quite different in other aspects. Information got from social bookmarking websites not only tells what a user likes, but also why he or she likes it. This paper proposes a division algorithm and a CubeSVD algorithm to analysis this information, distill the interrelations between different users various interests, and make better personalized recommendation based on them. Experiment reveals the superiority of our method over traditional CF methods.
ER  -</swrc:abstract><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Yanfei Xu"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Liang Zhang"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Wei Liu"/></rdf:_3></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f15cc7613101babb2c3ed1927e35213a/hotho"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f15cc7613101babb2c3ed1927e35213a/hotho"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Article"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/hotho/pub/2007/aicomm_2007_folksonomy_clustering.pdf"/><swrc:date>Wed May 21 10:23:17 CEST 2008</swrc:date><swrc:journal>AI Communications</swrc:journal><swrc:number>4</swrc:number><swrc:pages>245 - 262</swrc:pages><swrc:title>Network Properties of Folksonomies</swrc:title><swrc:volume>20</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>2007 folksonomies kdubiq myown network properties sosbuch summerschool </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="67" swrc:key="vgwort"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Ciro Cattuto"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Christoph Schmitz"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Andrea Baldassarri"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Vito D. P. Servedio"/></rdf:_4><rdf:_5><swrc:Person swrc:name="Vittorio Loreto"/></rdf:_5><rdf:_6><swrc:Person swrc:name="Andreas Hotho"/></rdf:_6><rdf:_7><swrc:Person swrc:name="Miranda Grahl"/></rdf:_7><rdf:_8><swrc:Person swrc:name="Gerd Stumme"/></rdf:_8></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2566686f518e43c993dc1854dc2b2b5e4/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2566686f518e43c993dc1854dc2b2b5e4/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://www.kde.cs.uni-kassel.de/hotho/pub/2006/seach2006hotho_eswc.pdf"/><swrc:date>Wed Apr 30 13:02:47 CEST 2008</swrc:date><swrc:address>Budva, Montenegro</swrc:address><swrc:booktitle>Proceedings of the 3rd European Semantic Web Conference </swrc:booktitle><swrc:month>June</swrc:month><swrc:pages>411-426</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Springer"/></swrc:publisher><swrc:series>LNCS</swrc:series><swrc:title>Information Retrieval in Folksonomies: Search and Ranking</swrc:title><swrc:year>2006</swrc:year><swrc:keywords>2006 Blueprint KDubiq bibsonomy definition folkrank folksonomy ir kdubiq myown pagerank rank search seminar2006 </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="3-540-34544-2" swrc:key="isbn"/></swrc:hasExtraField><swrc:hasExtraField><swrc:Field swrc:value="29" swrc:key="vgwort"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Andreas Hotho"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Robert Jäschke"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Christoph Schmitz"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/289f661a20f44fae705ceccd3619cbced/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/289f661a20f44fae705ceccd3619cbced/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Wed Apr 30 13:02:47 CEST 2008</swrc:date><swrc:address>Sheffield, England</swrc:address><swrc:booktitle>Proceedings of the 15th International Conference on Conceptual Structures</swrc:booktitle><swrc:month>July</swrc:month><swrc:series>LNCS</swrc:series><swrc:title>Analysis of the Publication Sharing Behaviour in {BibSonomy}</swrc:title><swrc:volume>4604</swrc:volume><swrc:year>2007</swrc:year><swrc:keywords>2007 Blueprint KDubiq bibsonomy fca iccs kdubiq myown trias </swrc:keywords><swrc:abstract>BibSonomy is a web-based social resource sharing system which allows users to organise and share bookmarks and publications in a collaborative manner. In this paper we present the system, followed by a description of the insights in the structure of its bibliographic data that we gained by applying techniques we developed in the area of Formal Concept Analysis.</swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="22" swrc:key="vgwort"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Robert Jäschke"/></rdf:_1><rdf:_2><swrc:Person swrc:name="Andreas Hotho"/></rdf:_2><rdf:_3><swrc:Person swrc:name="Christoph Schmitz"/></rdf:_3><rdf:_4><swrc:Person swrc:name="Gerd Stumme"/></rdf:_4></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/24ee0dcfacb2147b8ea8652430a495e7a/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/24ee0dcfacb2147b8ea8652430a495e7a/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#MasterThesis"/><swrc:date>Wed Apr 30 12:59:47 CEST 2008</swrc:date><swrc:note>ISBN 90-5282-993-4</swrc:note><swrc:school><swrc:University swrc:name="Stan Ackermans Institute, Eindhoven"/></swrc:school><swrc:title>Development of Adaptive, Online Soft Sensors</swrc:title><swrc:year>1999</swrc:year><swrc:keywords>blueprint kdubiq </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="groupsearch"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="E.M. Jordaan"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2e429ae255d9294b24b9ab52e4bb848b2/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2e429ae255d9294b24b9ab52e4bb848b2/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><swrc:date>Wed Apr 30 12:59:47 CEST 2008</swrc:date><swrc:booktitle>{Working Notes AAAI Work. Knowledge Discovery in Databases}</swrc:booktitle><swrc:pages>227--240</swrc:pages><swrc:publisher><swrc:Organization swrc:name="AAAI"/></swrc:publisher><swrc:title>{Toward Parallel and Distributed Learning by Meta-learning}</swrc:title><swrc:year>1993</swrc:year><swrc:keywords>Blueprint KDubiq kdubiq </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="groupsearch"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="P. Chan"/></rdf:_1><rdf:_2><swrc:Person swrc:name="S. J. Stolfo"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2f85c96fc2bc9009b0ed632e00d58ae92/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2f85c96fc2bc9009b0ed632e00d58ae92/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://bach.ece.jhu.edu/pub/gert/papers/nips00_inc.pdf"/><swrc:date>Wed Apr 30 12:59:47 CEST 2008</swrc:date><swrc:booktitle>Advances in Neural Information Processing Systems (NIPS*2000)</swrc:booktitle><swrc:title>Incremental and Decremental Support Vector Machine Learning</swrc:title><swrc:volume>13</swrc:volume><swrc:year>2001</swrc:year><swrc:keywords>Blueprint KDubiq kdubiq </swrc:keywords><swrc:abstract>An on-line recursive algorithm for training support vector machines,
    one vector at a time, is presented. Adiabatic increments retain
    the Kuhn-Tucker conditions on all previously seen training data,
    in a number of steps each computed analytically. The incremental
    procedure is reversible, and decremental ``unlearning&#039;&#039; offers an
    efficient method to exactly evaluate leave-one-out generalization
    performance. Interpretation of decremental unlearning in feature
    space sheds light on the relationship between generalization and
    geometry of the data. </swrc:abstract><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="groupsearch"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="G. Cauwenberghs"/></rdf:_1><rdf:_2><swrc:Person swrc:name="T. Poggio"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2abbe707b9958cbe9c42293b07ca1729f/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2abbe707b9958cbe9c42293b07ca1729f/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="http://mas.cs.umass.edu/pub/paper_detail.php?id=89"/><swrc:date>Wed Apr 30 12:59:47 CEST 2008</swrc:date><swrc:address>Liebowitz. New York</swrc:address><swrc:booktitle>Expert Systems with Applications--Special Issue on the Blackboard
    Paradigm and Its Application</swrc:booktitle><swrc:month>January</swrc:month><swrc:number>1</swrc:number><swrc:pages>1-30</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Pergamon Press"/></swrc:publisher><swrc:title>The Evolution of Blackboard Control Architectures</swrc:title><swrc:volume>7</swrc:volume><swrc:year>1994</swrc:year><swrc:keywords>Blueprint KDubiq kdubiq </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="groupsearch"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="N. Carver"/></rdf:_1><rdf:_2><swrc:Person swrc:name="V. Lesser"/></rdf:_2></rdf:Seq></swrc:author></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/2b5687b5d11880a15b100266926dea923/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/2b5687b5d11880a15b100266926dea923/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#InProceedings"/><owl:sameAs rdf:resource="/brokenurl#."/><swrc:date>Wed Apr 30 12:59:47 CEST 2008</swrc:date><swrc:booktitle>Proceedings of the 13th International Conference on Machine Learning</swrc:booktitle><swrc:pages>71-77</swrc:pages><swrc:publisher><swrc:Organization swrc:name="Morgan Kaufmann, San Mateo, CA"/></swrc:publisher><swrc:title>Simplified support vector decision rules</swrc:title><swrc:year>1996</swrc:year><swrc:keywords>Blueprint KDubiq kdubiq </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="groupsearch"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="C. J. C. Burges"/></rdf:_1></rdf:Seq></swrc:author><swrc:editor><rdf:Seq><rdf:_1><swrc:Person swrc:name="L. Saitta"/></rdf:_1></rdf:Seq></swrc:editor></rdf:Description><rdf:Description rdf:about="http://www.bibsonomy.org/bibtex/29835decd5c2edfefa1e820772cd94206/kdubiq"><owl:sameAs rdf:resource="http://www.bibsonomy.org/uri/bibtex/29835decd5c2edfefa1e820772cd94206/kdubiq"/><rdf:type rdf:resource="http://swrc.ontoware.org/ontology#Book"/><swrc:date>Wed Apr 30 12:59:47 CEST 2008</swrc:date><swrc:publisher><swrc:Organization swrc:name="Oxford"/></swrc:publisher><swrc:title>Neural Networks for Pattern Recognition</swrc:title><swrc:year>2000</swrc:year><swrc:keywords>Blueprint KDubiq kdubiq </swrc:keywords><swrc:hasExtraField><swrc:Field swrc:value="0" swrc:key="groupsearch"/></swrc:hasExtraField><swrc:author><rdf:Seq><rdf:_1><swrc:Person swrc:name="Christopher M. Bishop"/></rdf:_1></rdf:Seq></swrc:author></rdf:Description><foaf:Group rdf:about="http://www.bibsonomy.org/tag/kdubiq"><foaf:name>kdubiq</foaf:name><description>Community for tag(s) kdubiq</description></foaf:Group></rdf:RDF>
