Inductive Logic Programming
|
Descargar SCORM
Este recurso ha sido solicitado 1 veces (0 veces en los últimos 31 días).
Para poder solicitar este recurso debe identificarse como usuario de la biblioteca
|
| |
Ver
Detalles del recurso
|
|
|
Inductive Logic Programming
|
| Id. |
41486015 |
| Idioma |
inglés
|
| Titulo |
Inductive Logic Programming |
| Autor(es) |
A Short
|
| Localización |
http://citeseer.ist.psu.edu/52020.html
|
| Versión |
1.0 |
| Estado |
Final
|
| Descripción |
Inductive Logic Programming (ILP) can be viewed as research in the intersection of Logic Programming and inductive Machine Learning. Informally speaking the field is concerned with the induction of PROLOG programs. Being able to express the discovered knowledge in a first-order logic representation language can overcome some of the limitations of classical learning algorithms. The representational power of these algorithms is usually restricted to propositional domain theories such as decision trees in the well-known ID3 family (Quinlan 1986) or propositional Horn clauses as in AQ (Michalski, Mozetic, Hong, and Lavrac 1986) or CN2 (Clark and Niblett 1989). ILP algorithms, on the other hand, can not only test attributes for specific values, but also make use of relations (like equality) between the values of d...
|
| Tipo |
ps
|
| Palabras clave |
A Short Inductive Logic Programming
|
| Tipo de Interactividad |
Expositivo
|
| Nivel de Interactividad |
muy bajo
|
| Audiencia |
Estudiante
Profesor
Autor
|
| Estructura |
Atomic |
| Coste |
no
|
| Copyright |
sí
|
|
unrestricted |
| Formatos |
ps
|
| Requerimientos técnicos |
Browser: Any
|
| Relación |
[IsBasedOn] http://www.ai.univie.ac.at/~juffi/publications/diss-oegai.ps.gz
[References] oai:CiteSeerPSU:44179
[References] oai:CiteSeerPSU:222642
[References] oai:CiteSeerPSU:230658
[References] oai:CiteSeerPSU:94985
[References] oai:CiteSeerPSU:177818
|
| Fecha de contribución |
31-mar-2009 |
| Contacto |
|
|
|
|
|
Valoración de los usuarios
No hay ninguna valoración para este recurso. Sea el primero en
valorar este recurso.
|
|
|
|
