-
Notifications
You must be signed in to change notification settings - Fork 1
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
- Loading branch information
0 parents
commit d15f040
Showing
522 changed files
with
222,163 additions
and
0 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,44 @@ | ||
Topic: areas/learning/systems/ | ||
|
||
Summary: Machine Learning Software Packages | ||
|
||
Description: | ||
|
||
This directory contains machine learning software packages. | ||
|
||
Origin: FTP repositories for machine learning include | ||
ftp.ics.uci.edu:/pub/ | ||
cs.utexas.edu:/pub/mooney/ | ||
ftp.gmd.de:/gmd/mlt/ML-Program-Library/ | ||
ftp.gmd.de:/MachineLearning/ | ||
|
||
CD-ROM: Prime Time Freeware for AI, Issue 1-1 | ||
|
||
Keywords: | ||
|
||
Machine Learning | ||
|
||
Contains: | ||
|
||
accel/ ACCEL: Abduction | ||
classweb/ CLASSWEB: Classit and Cobweb | ||
focl/ FOCL: Expert System Shell and Machine Learning Program | ||
foil/ FOIL: Produces Horn clauses from data expressed as relations. | ||
golem/ GOLEM: Inductive learning algorithm | ||
index/ INDEX: Experimental inductive data engineering system. | ||
learn_pl/ Machine Learning Algorithms Implemented in Prolog | ||
miles/ MILES: Flexible environment for tests with ILP methods. | ||
mobal/ MOBAL: Knowledge Acquisition and Machine Learning System | ||
occam/ Occam: Learning program that combines EBL and SBL | ||
pebls/ PEBLS: Parallel Exemplar-Based Learning System | ||
rwm/ RWM: Refinement With Macros | ||
utexas/ Raymond Mooney's Machine Learning Collection | ||
|
||
See Also: | ||
|
||
? | ||
|
||
References: | ||
|
||
? | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,51 @@ | ||
<TITLE>Topic: areas/learning/systems/</TITLE> | ||
<hr> | ||
<b>CMU Artificial Intelligence Repository</b><br> | ||
<tt><A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/air.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/home.gif" ALT="Home"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/rep_info.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/info.gif" ALT="INFO"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/keys/keysform.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/search.gif" ALT="Search"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/faqs/top.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/faqs.gif" ALT="FAQs"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/0.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/top.gif" ALT="Repository Root"></A> </tt> | ||
<hr> | ||
<H2>Machine Learning Software Packages</H2> | ||
<pre> | ||
<A HREF="./">areas/learning/systems/</A> | ||
|
||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/accel/0.html">accel/</A> ACCEL: Abduction | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/classweb/0.html">classweb/</A> CLASSWEB: Classit and Cobweb | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/focl/0.html">focl/</A> FOCL: Expert System Shell and Machine Learning | ||
Program | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/foil/0.html">foil/</A> FOIL: Produces Horn clauses from data expressed | ||
as relations. | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/golem/0.html">golem/</A> GOLEM: Inductive learning algorithm | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/index/0.html">index/</A> INDEX: Experimental inductive data engineering | ||
system. | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/learn_pl/0.html">learn_pl/</A> Machine Learning Algorithms Implemented in Prolog | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/miles/0.html">miles/</A> MILES: Flexible environment for tests with ILP | ||
methods. | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/mobal/0.html">mobal/</A> MOBAL: Knowledge Acquisition and Machine Learning | ||
System | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/oc1/0.html">oc1/</A> OC1: Oblique Classifier 1 | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/occam/0.html">occam/</A> Occam: Learning program that combines EBL and SBL | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/pebls/0.html">pebls/</A> PEBLS: Parallel Exemplar-Based Learning System | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/rwm/0.html">rwm/</A> RWM: Refinement With Macros | ||
<A HREF="/afs/cs/project/ai-repository/ai/areas/learning/systems/utexas/0.html">utexas/</A> Raymond Mooney's Machine Learning Collection | ||
|
||
Origin: | ||
|
||
FTP repositories for machine learning include | ||
<A HREF="ftp://ftp.ics.uci.edu/pub/"> ftp.ics.uci.edu:/pub/</A> | ||
<A HREF="ftp://cs.utexas.edu/pub/mooney/"> cs.utexas.edu:/pub/mooney/</A> | ||
<A HREF="ftp://ftp.gmd.de/gmd/mlt/ML-Program-Library/"> ftp.gmd.de:/gmd/mlt/ML-Program-Library/</A> | ||
<A HREF="ftp://ftp.gmd.de/MachineLearning/"> ftp.gmd.de:/MachineLearning/</A> | ||
</pre> | ||
<listing> | ||
This directory contains machine learning software packages. | ||
</listing> | ||
<hr> | ||
<listing> | ||
CD-ROM: Prime Time Freeware for AI, Issue 1-1 | ||
|
||
Keywords: | ||
|
||
Machine Learning | ||
|
||
</listing><hr> | ||
<address>Last Web update on Mon Feb 13 10:24:36 1995 <br> | ||
<A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/air.html">[email protected]</A></address> |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,46 @@ | ||
**Project: Translated Machine Learning Algorithms** | ||
|
||
Welcome to the repository containing translations of various machine learning algorithms into MeTTa and new functional logic programming languages using type theory. This project aims to make these algorithms accessible in languages that leverage type theory for enhanced expressiveness and correctness. | ||
|
||
## Directories: | ||
|
||
### [AQ1](./aq1/) | ||
This directory contains the original source code for the AQ1 algorithm, along with its translation into MeTTa. AQ1 is a reimplementation of Michalski's AQ algorithm, specifically designed to handle attribute vectors. Created by Jeffrey M. Becker, AQ1 offers enhanced capabilities for dealing with complex attribute-based data structures, making it a valuable tool for various machine learning tasks. | ||
|
||
### [ARCH1](./arch1/) | ||
Here you'll find the implementation of ARCH1, along with its translation into the new functional logic programming language using type theory. ARCH1, developed by Stefan Wrobel, is an incremental learning procedure based on Patrick Winston's work. This implementation provides a framework for dynamic model updates as new data becomes available, making it a powerful tool for tasks requiring adaptability and real-time learning. | ||
|
||
### [ARCH2](./arch2/) | ||
ARCH2's original implementation resides here, along with its translation into MeTTa. ARCH2, devised by Ivan Bratko, offers a minimalistic version of Winston's incremental learning procedure. While more restricted in functionality compared to ARCH1, it provides a lightweight solution for scenarios where simplicity and efficiency are paramount. | ||
|
||
### [ATTDSC](./attdsc/) | ||
The ATTDSC algorithm's source code is available here, along with its translation into the new functional logic programming language. Developed by Ivan Bratko, ATTDSC presents an algorithm specifically designed for learning attributional descriptions. By focusing on attributional attributes, this algorithm enables the extraction of meaningful patterns and insights from datasets characterized by attributional structures. | ||
|
||
### [COBWEB](./cobweb/) | ||
This directory holds the COBWEB algorithm's original implementation and its translation into MeTTa. COBWEB, implemented by Joerg-Uwe Kietz, is an algorithm for incremental concept formation. Based on Fisher's work, COBWEB dynamically constructs and refines concept hierarchies as new instances are encountered, making it suitable for tasks involving concept learning and categorization. | ||
|
||
### [DISCR](./discr/) | ||
You can find the DISCR algorithm's original source code and its translation into the new functional logic programming language here. DISCR, created by Pavel Brazdil, provides a method for generating discriminants from derivation trees. This approach facilitates the extraction of discriminative features or rules from complex data representations, aiding in tasks such as pattern recognition and classification. | ||
|
||
### [EBG](./ebg/) | ||
The EBG algorithm is available here, along with its translation into MeTTa. EBG offers implementations of Prolog meta-interpreters for Mitchell's explanation-based generalization. Developed as a tool for explanation-based learning, EBG facilitates the acquisition of generalized knowledge from specific instances, enhancing the efficiency of learning systems. | ||
|
||
### [IDT](./idt/) | ||
In this directory, you'll find the implementation of IDT and its translation into the new functional logic programming language using type theory. Crafted by Luis Torgo, IDT is an ID3-like program for inducing decision trees based on the gain-ratio measure. By employing a gain-ratio-based splitting criterion, IDT aims to construct decision trees that effectively capture the underlying structure of the data, enabling accurate classification and prediction. | ||
|
||
### [INDEX](./index/) | ||
Here, you can explore the original implementation of the INDEX system and its translation into MeTTa. INDEX is an experimental system for inductive data engineering, designed by Peter A. Flach. This system provides a platform for exploring innovative approaches to data engineering tasks, with a focus on inductive reasoning and knowledge discovery from data. | ||
|
||
### [INVERS](./invers/) | ||
The INVERS algorithm's original source code and its translation into the new functional logic programming language are located here. INVERS is an implementation of Steven Muggleton's operators for inverse resolution. By applying absorption and intra-construction operators, INVERS facilitates the process of inverse resolution, which involves deriving hypotheses or explanations from observed data. | ||
|
||
### [Logic](./logic/) | ||
This directory contains a collection of logic procedures for learning, along with their translations into MeTTa. Logic is a foundational toolkit including procedures for determination of substitutions, implication, least general generalization, and generalized subsumption. These procedures serve essential functionalities for various learning systems. | ||
|
||
### [Occam](./occam/) | ||
Here, you'll find the Occam learning program's original implementation and its translation into the new functional logic programming language. Occam is a learning system that combines Explanation-Based Learning (EBL) and Similarity-Based Learning (SBL). By integrating these two learning paradigms, Occam aims to leverage both explanatory and similarity-based approaches to enhance learning efficiency and generalization performance. | ||
|
||
### [VS](./vs/) | ||
The VS algorithm's original source code and its translation into MeTTa are available in this directory. Developed by Luc de Raeth, VS is a reimplementation of the version space algorithm for learning conjunctions. By implementing Mitchell's version space algorithm, VS provides a powerful tool for learning complex conjunctions from data, enabling accurate and interpretable rule discovery. | ||
|
||
Feel free to explore each directory to access both the original implementations and their translations. If you have any questions or suggestions, please don't hesitate to reach out! |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,65 @@ | ||
Package: areas/learning/systems/learn_pl/aq1/ | ||
|
||
Name: AQ-Prolog | ||
|
||
Summary: Reimplementation of Michalski's AQ for attribute vectors | ||
|
||
Version: 14-JAN-94 | ||
|
||
Description: | ||
|
||
This directory contains Jeffrey M. Becker's AQ-PROLOG, a | ||
reimplementation of Michalski's AQ for attribute vectors | ||
|
||
Requires: Prolog | ||
|
||
Ports: The algorithm is written in Edinburgh Prolog syntax. | ||
|
||
Origin: ftp.gmd.de:/gmd/mlt/ML-Program-Library/ [129.26.8.84] | ||
|
||
Copying: Copyright (c) 1985 Jeffrey M. Becker | ||
|
||
Updated: | ||
|
||
CD-ROM: Prime Time Freeware for AI, Issue 1-1 | ||
|
||
Bug Reports: | ||
|
||
Mailing List: | ||
|
||
Author(s): Jeffrey M. Becker, Thomas Hoppe | ||
|
||
Contact: Thomas Hoppe <[email protected]> (Machine Learning Library) | ||
Projektgruppe KIT | ||
Technische Universitaet Berlin | ||
Franklinstr. 28/29, | ||
10629 Berlin, Germany. | ||
|
||
Werner Emde <[email protected]> (ftp library) | ||
Gesellschaft fuer Mathematik und Datenverarbeitung, Bonn | ||
|
||
Keywords: | ||
|
||
Machine Learning, Prolog!Code, AQ-Prolog, Authors!Becker, | ||
Inductive Learning, Conceptual Clustering, Prolog!Code, Michalski's AQ | ||
|
||
Contains: ??? | ||
|
||
See Also: | ||
|
||
References: | ||
|
||
Becker, J.M., "AQ-PROLOG: A Prolog Implementation of an | ||
Attribute-Based Learning System", Reports of the Intelligent | ||
Systems Group, Department of Computer Science, University of | ||
Illinois at Urbana-Champaign, Report Number ISG 85-1, January 1985. | ||
|
||
Michalski, R.S. and Stepp, R.E., "Learning from Observation: | ||
Conceptual Clustering", in: Machine Learning, Michalski, R.S., | ||
Carbonell, J.G., Mitchell, T.M. (eds.), Tioga Publishing Company, Palo | ||
Alto, 1983. | ||
|
||
Michalski, R.S., "Inductive Learning", in: Machine Learning, Michalski, | ||
R.S., Carbonell, J.G., Mitchell, T.M. (eds.), Tioga Publishing | ||
Company, Palo Alto, 1983. | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,67 @@ | ||
<TITLE>Package: areas/learning/systems/learn_pl/aq1/</TITLE> | ||
<hr> | ||
<b>CMU Artificial Intelligence Repository</b><br> | ||
<tt><A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/air.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/home.gif" ALT="Home"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/rep_info.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/info.gif" ALT="INFO"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/keys/keysform.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/search.gif" ALT="Search"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/faqs/top.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/faqs.gif" ALT="FAQs"></A> <A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/0.html"><IMG ALIGN=MIDDLE SRC="/afs/cs.cmu.edu/project/ai-repository/ai/html/gif/top.gif" ALT="Repository Root"></A> </tt> | ||
<hr> | ||
<H2>AQ-Prolog: Reimplementation of Michalski's AQ for attribute | ||
vectors</H2> | ||
<pre> | ||
<A HREF="./">areas/learning/systems/learn_pl/aq1/</A> | ||
</pre> | ||
<listing> | ||
This directory contains Jeffrey M. Becker's AQ-PROLOG, a | ||
reimplementation of Michalski's AQ for attribute vectors | ||
</listing> | ||
<pre> | ||
Origin: | ||
|
||
<A HREF="ftp://ftp.gmd.de/gmd/mlt/ML-Program-Library/">ftp.gmd.de:/gmd/mlt/ML-Program-Library/ [129.26.8.84]</A> | ||
</pre> | ||
<hr> | ||
<listing> | ||
Version: 14-JAN-94 | ||
|
||
Requires: Prolog | ||
|
||
Ports: The algorithm is written in Edinburgh Prolog syntax. | ||
|
||
Copying: Copyright (c) 1985 Jeffrey M. Becker | ||
|
||
CD-ROM: Prime Time Freeware for AI, Issue 1-1 | ||
|
||
Author(s): Jeffrey M. Becker, Thomas Hoppe | ||
|
||
Contact: Thomas Hoppe <hoppet@cs.tu-berlin.de> (Machine Learning Library) | ||
Projektgruppe KIT | ||
Technische Universitaet Berlin | ||
Franklinstr. 28/29, | ||
10629 Berlin, Germany. | ||
|
||
Werner Emde <emde@gmd.de> (ftp library) | ||
Gesellschaft fuer Mathematik und Datenverarbeitung, Bonn | ||
|
||
Keywords: | ||
|
||
AQ-Prolog, Authors!Becker, Conceptual Clustering, | ||
Inductive Learning, Machine Learning, Michalski's AQ, | ||
Prolog!Code, Prolog!Code | ||
|
||
References: | ||
|
||
Becker, J.M., "AQ-PROLOG: A Prolog Implementation of an | ||
Attribute-Based Learning System", Reports of the Intelligent | ||
Systems Group, Department of Computer Science, University of | ||
Illinois at Urbana-Champaign, Report Number ISG 85-1, January 1985. | ||
|
||
Michalski, R.S. and Stepp, R.E., "Learning from Observation: | ||
Conceptual Clustering", in: Machine Learning, Michalski, R.S., | ||
Carbonell, J.G., Mitchell, T.M. (eds.), Tioga Publishing Company, Palo | ||
Alto, 1983. | ||
|
||
Michalski, R.S., "Inductive Learning", in: Machine Learning, Michalski, | ||
R.S., Carbonell, J.G., Mitchell, T.M. (eds.), Tioga Publishing | ||
Company, Palo Alto, 1983. | ||
|
||
</listing><hr> | ||
<address>Last Web update on Mon Feb 13 10:24:22 1995 <br> | ||
<A HREF="/afs/cs.cmu.edu/project/ai-repository/ai/html/air.html">[email protected]</A></address> |
Oops, something went wrong.