@proceedings{2005-lws-proceedings, title = {Proceedings of the Workshop on Learning in Web Search (LWS 2005) }, editor = {Stephan Bloehdorn and Wray Buntine and Andreas Hotho}, note = {Workshop at the 22nd International Conference on Machine Learning (ICML 2005) }, year = 2005, url = {http://cosco.hiit.fi/search/learninginsearch05/ICML_W4.pdf}, biburl = {http://www.bibsonomy.org/bibtex/22de98c2b635f36c137e25256e8c235e0/sb3000}, keywords = {ir ml sb sb-editor} } @inproceedings{cumby02learningfdl, title = {Learning with Feature Description Logics}, author = {Chad M. Cumby and Dan Roth}, booktitle = {Proceedings of the 12th International Conference on Inductive Logic Programming (ILP 2002), July 9 - 11, 2002, Sydney, Australia --- Revised Papers}, editor = {Stan Matwin and Claude Sammut}, number = 2583, pages = {32--47}, publisher = {Springer, Berlin--Heidelberg, Germany}, series = {Lecture Notes in Computer Science}, year = 2003, biburl = {http://www.bibsonomy.org/bibtex/20b70a74881cbc955d2312a9ef2ad7871/sb3000}, keywords = {ml propositionalization structured-data} } @book{lloyd03logicforlearning, title = {Logic for Learning: Learning Comprehensible Theories from Structured Data}, address = {Berlin--Heidelberg, Germany}, author = {J.W. Lloyd}, publisher = {Springer}, year = 2003, biburl = {http://www.bibsonomy.org/bibtex/2502a6bf8f280f1c850a46cece43cc7a7/sb3000}, keywords = {logic ml} } @book{shawetaylor04kernelmethods, title = {Kernel Methods for Pattern Analysis}, address = {Cambridge, UK}, author = {John Shawe-Taylor and Nello Cristianini}, month = {June}, publisher = {Cambridge University Press}, year = 2004, isbn = {0521813972}, biburl = {http://www.bibsonomy.org/bibtex/21d17b9d54a4ef23864227f647622d071/sb3000}, keywords = {classification kernels ml svm} } @book{cristianini00introductionsvm, title = {An Introduction to Support Vector Machines and Other Kernel-based Learning Methods}, address = {Cambridge, UK}, author = {Nello Cristianini and John Shawe-Taylor}, howpublished = {Hardcover}, month = {March}, publisher = {Cambridge University Press}, year = 2000, isbn = {0521780195}, biburl = {http://www.bibsonomy.org/bibtex/2251b00a05b3df11168de911d7591490e/sb3000}, keywords = {kernels ml svm} } @inproceedings{cohen94learningclassic, title = {Learning the {CLASSIC} Description Logic: Theoretical and Experimental Results}, author = {William W. Cohen and Haym Hirsh}, booktitle = {Proceedings of the 4th International Conference on Principles of Knowledge Representation and Reasoning (KR'94), May 24-27, 1994, Bonn, Germany}, editor = {Jon Doyle and Erik Sandewall and Pietro Torasso}, pages = {121--133}, publisher = {Morgan-Kauffman Publishers, San Francisco, CA, USA}, year = 1994, biburl = {http://www.bibsonomy.org/bibtex/26abee7d4dbc7874815f8d18f20d3e3a9/sb3000}, keywords = {DL ml} } @incollection{bloehdorn08mlontologies, title = {Machine Learning and Ontologies}, address = {Berlin--Heidelberg, Germany}, author = {Stephan Bloehdorn and Andreas Hotho}, booktitle = {Handbook on Ontologies }, chapter = 31, edition = {Second}, editor = {Steffen Staab and Rudi Studer}, note = {To appear.}, publisher = {Springer}, year = 2008, biburl = {http://www.bibsonomy.org/bibtex/2551d12bdef0fa1335c473317cfa4575e/sb3000}, keywords = {ml ontologies} } @article{cover67nearestneighbour, title = {Nearest neighbor pattern classification}, author = {T. Cover and P. Hart}, journal = {IEEE Transactions on Information Theory}, pages = {21- 27}, volume = 13, year = 1967, url = {http://ieeexplore.ieee.org/xpl/freeabs_all.jsp?arnumber=1053964}, issn = {0018-9448}, abstract = {The nearest neighbor decision rule assigns to an unclassified sample point the classification of the nearest of a set of previously classified points. This rule is independent of the underlying joint distribution on the sample points and their classifications, and hence the probability of errorRof such a rule must be at least as great as the Bayes probability of errorR^{ast}--the minimum probability of error over all decision rules taking underlying probability structure into account. However, in a large sample analysis, we will show in theM-category case thatR^{ast} leq R leq R^{ast}(2 --MR^{ast}/(M-1)), where these bounds are the tightest possible, for all suitably smooth underlying distributions. Thus for any number of categories, the probability of error of the nearest neighbor rule is bounded above by twice the Bayes probability of error. In this sense, it may be said that half the classification information in an infinite sample set is contained in the nearest neighbor.}, biburl = {http://www.bibsonomy.org/bibtex/2f138d4d67e0bed94bd3c726af83c0492/sb3000}, keywords = {algorithms ml seminal} } @inproceedings{esposito04knowledgeintensive, title = {Knowledge-Intensive Induction of Terminologies from Metadata}, author = {Floriana Esposito and Nicola Fanizzi and Luigi Iannone and Ignazio Palmisano and Giovanni Semeraro}, booktitle = {The Semantic Web - ISWC 2004: Third International Semantic}, editor = {Sheila A. McIlraith and Dimitris Plexousakis and Frank van Harmelen}, pages = {441-455}, publisher = {Springer}, series = {Lecture Notes in Computer Science}, volume = 3298, year = 2004, isbn = {3-540-23798-4}, biburl = {http://www.bibsonomy.org/bibtex/24ea6707ab6b5ac055fb09d47ba195e02/sb3000}, keywords = {ml ontology similarity} } @inproceedings{edwards02semweblearning, title = {An Empirical Investigation of Learning from the Semantic Web}, author = {P. Edwards and G. AA. Grimnes and A. Preece}, booktitle = {ECML/PKDD, Semantic Web Mining Workshop}, pages = {71-89}, year = 2002, description = {My Main bibliography file}, biburl = {http://www.bibsonomy.org/bibtex/2c7155e97d2e7549e418251d0f9ad7ca9/sb3000}, keywords = {ml semweb} }