Zobrazeno 1 - 10
of 32
pro vyhledávání: '"Larry A. Rendell"'
Autor:
Steven K. Donoho, Larry A. Rendell
Publikováno v:
Journal of Artificial Intelligence Research. 2:411-446
Theory revision integrates inductive learning and background knowledge by combining training examples with a coarse domain theory to produce a more accurate theory. There are two challenges that theory revision and other theory-guided systems face. F
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::fa2208e6f60b796b80ade26b61f5831f
https://doi.org/10.1613/jair.129
https://doi.org/10.1613/jair.129
Publikováno v:
Machine Learning. 21:151-175
Predicting the fold, or approximate 3D structure, of a protein from its amino acid sequence is an important problem in biology. The homology modeling approach uses a protein database to identify fold-class relationships by sequence similarity. The ma
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::5010cfbde2168f4be65a2ca9d712dd19
https://doi.org/10.1007/bf00993383
https://doi.org/10.1007/bf00993383
Publikováno v:
International Journal on Artificial Intelligence Tools. :157-185
A new neural network called AUGURS is designed to assist a user of a Computer-Aided Design system in utilizing standard graphic symbols. With AUGURS, the CAD user can avoid searching for standard symbols in a large library and rely on AUGURS to autom
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::91a311200fcc23eb52154c76632fbd81
https://doi.org/10.1142/s0218213094000091
https://doi.org/10.1142/s0218213094000091
Autor:
Larry A. Rendell, Raj Seshu
Publikováno v:
Computational Intelligence. 6:247-270
The intrinsic accuracy of an inductive problem is the accuracy achieved by exhaustive table look-up. Intrinsic accuracy is the upper bound for any inductive method. Hard concepts are concepts that have high intrinsic accuracy, but which cannot be lea
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::59bc89314b0776e2ddeeb2cc0edaf947
https://doi.org/10.1111/j.1467-8640.1990.tb00298.x
https://doi.org/10.1111/j.1467-8640.1990.tb00298.x
Autor:
Peter Haddawy, Larry A. Rendell
Publikováno v:
The Knowledge Engineering Review. 5:15-33
Research on planning in AI can be separated into the two major areas: plan generation and plan representation. Most AI planners to date have been based on the STRIPS planning representation. This representation has a number of limitations. Much recen
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::7b7f67c58828a1e49b11210df44c60a5
https://doi.org/10.1017/s026988890000521x
https://doi.org/10.1017/s026988890000521x
Publikováno v:
[1989] Proceedings. The Fifth Conference on Artificial Intelligence Applications.
Constructive induction is the creation of new terms for describing and learning concepts more effectively. An approach to the problem that uses inductive test incorporation, for fast and effective assessment of terms, is presented. The authors invest
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::d6109ee742220d3c10f7338f5c3af9be
https://doi.org/10.1109/caia.1989.49153
https://doi.org/10.1109/caia.1989.49153
Publikováno v:
SEKE
A knowledge base and learning system is designed to help biologists predict protein structure and function based on sequence information. The knowledge base contains diverse information about: (a) protein motif sequences and structures, (b) heuristic
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::05ef3755439595f12edb4b8601543ab3
https://doi.org/10.1109/seke.1992.227960
https://doi.org/10.1109/seke.1992.227960
Autor:
Steve Donoho, Larry A. Rendell
Publikováno v:
Feature Extraction, Construction and Selection ISBN: 9781461376224
Domain knowledge can range from a nearly complete theory to a sparse set of ill-defined hunches. Most work in knowledge-guided constructive induction has used nearly complete theories to guide feature construction. This chapter focuses on fragmentary
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::99b8f982e7c157225a0202508adfc47d
https://doi.org/10.1007/978-1-4615-5725-8_17
https://doi.org/10.1007/978-1-4615-5725-8_17
Autor:
Larry A. Rendell, Eduardo Pérez
Publikováno v:
Biblos-e Archivo. Repositorio Institucional de la UAM
instname
Advances in Artificial Intelligence ISBN: 9783540645757
Canadian Conference on AI
instname
Advances in Artificial Intelligence ISBN: 9783540645757
Canadian Conference on AI
The final publication is available at Springer via http://dx.doi.org/10.1007/3-540-64575-6_67
Proceedings of 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI'98 Vancouver, BC, Canada, June 18–20, 1
Proceedings of 12th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI'98 Vancouver, BC, Canada, June 18–20, 1
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_dedup___::d8f921ab60f90d807d750f3742209ec1
https://hdl.handle.net/10486/664137
https://hdl.handle.net/10486/664137
Publikováno v:
Machine Learning: ECML-97 ISBN: 9783540628583
ECML
ECML
We investigate an inherent limitation of top-down decision tree induction in which the continuous partitioning of the instance space progressively lessens the statistical support of every partial (i.e. disjunctive) hypothesis, known as the fragmentat
Externí odkaz:
https://explore.openaire.eu/search/publication?articleId=doi_________::2bb0d71e12a2ab0262a96fe7afd32da2
https://doi.org/10.1007/3-540-62858-4_95
https://doi.org/10.1007/3-540-62858-4_95