Menu
▾
▴
dl-learner-svn — DL-Learner Subversion commits
You can subscribe to this list here.
| 2007 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(120) |
Sep
(36) |
Oct
(116) |
Nov
(17) |
Dec
(44) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2008 |
Jan
(143) |
Feb
(192) |
Mar
(74) |
Apr
(84) |
May
(105) |
Jun
(64) |
Jul
(49) |
Aug
(120) |
Sep
(159) |
Oct
(156) |
Nov
(51) |
Dec
(28) |
| 2009 |
Jan
(17) |
Feb
(55) |
Mar
(33) |
Apr
(57) |
May
(54) |
Jun
(28) |
Jul
(6) |
Aug
(16) |
Sep
(38) |
Oct
(30) |
Nov
(26) |
Dec
(52) |
| 2010 |
Jan
(7) |
Feb
(91) |
Mar
(65) |
Apr
(2) |
May
(14) |
Jun
(25) |
Jul
(38) |
Aug
(48) |
Sep
(80) |
Oct
(70) |
Nov
(75) |
Dec
(77) |
| 2011 |
Jan
(68) |
Feb
(53) |
Mar
(51) |
Apr
(35) |
May
(65) |
Jun
(101) |
Jul
(29) |
Aug
(230) |
Sep
(95) |
Oct
(49) |
Nov
(110) |
Dec
(63) |
| 2012 |
Jan
(41) |
Feb
(42) |
Mar
(25) |
Apr
(46) |
May
(51) |
Jun
(44) |
Jul
(45) |
Aug
(29) |
Sep
(12) |
Oct
(9) |
Nov
(17) |
Dec
(2) |
| 2013 |
Jan
(12) |
Feb
(14) |
Mar
(7) |
Apr
(16) |
May
(54) |
Jun
(27) |
Jul
(11) |
Aug
(5) |
Sep
(85) |
Oct
(27) |
Nov
(37) |
Dec
(32) |
| 2014 |
Jan
(8) |
Feb
(29) |
Mar
(5) |
Apr
(3) |
May
(22) |
Jun
(3) |
Jul
(4) |
Aug
(3) |
Sep
|
Oct
|
Nov
|
Dec
|
|
From: <jen...@us...> - 2007-09-05 08:58:42
|
Revision: 128
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=128&view=rev
Author: jenslehmann
Date: 2007-09-05 01:58:38 -0700 (Wed, 05 Sep 2007)
Log Message:
-----------
set pointers of all YinYang examples to OWL files in example directory
Modified Paths:
--------------
trunk/examples/yinyang_files/archLearningProblem.xml
trunk/examples/yinyang_files/forteLearningProblemYinYang.xml
trunk/examples/yinyang_files/pairLearningProblem.xml
trunk/examples/yinyang_files/straightLearningProblem.xml
Modified: trunk/examples/yinyang_files/archLearningProblem.xml
===================================================================
--- trunk/examples/yinyang_files/archLearningProblem.xml 2007-09-05 08:53:46 UTC (rev 127)
+++ trunk/examples/yinyang_files/archLearningProblem.xml 2007-09-05 08:58:38 UTC (rev 128)
@@ -7,7 +7,7 @@
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.di.uniba.it/learning/../LearningProblem.xsd"
-knowledgeBase="file:arch.owl"
+knowledgeBase="file:../arch/arch.owl"
positiveExampleSource="archPositives.txt"
negativeExampleSource="archNegatives.txt"
abstractionClass="it.uniba.di.dl.abstraction.KBoundMSCApproximatorRefinement"
Modified: trunk/examples/yinyang_files/forteLearningProblemYinYang.xml
===================================================================
--- trunk/examples/yinyang_files/forteLearningProblemYinYang.xml 2007-09-05 08:53:46 UTC (rev 127)
+++ trunk/examples/yinyang_files/forteLearningProblemYinYang.xml 2007-09-05 08:58:38 UTC (rev 128)
@@ -6,7 +6,7 @@
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.di.uniba.it/learning/ ../LearningProblem.xsd"
- knowledgeBase="file:forte.owl"
+ knowledgeBase="file:../forte/forte.owl"
positiveExampleSource="fortePositivesYinYang.txt"
negativeExampleSource="forteNegativesYinYang.txt"
abstractionClass="it.uniba.di.dl.abstraction.KBoundMSCApproximatorRefinement"
Modified: trunk/examples/yinyang_files/pairLearningProblem.xml
===================================================================
--- trunk/examples/yinyang_files/pairLearningProblem.xml 2007-09-05 08:53:46 UTC (rev 127)
+++ trunk/examples/yinyang_files/pairLearningProblem.xml 2007-09-05 08:58:38 UTC (rev 128)
@@ -7,7 +7,7 @@
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.di.uniba.it/learning/../LearningProblem.xsd"
-knowledgeBase="file:pair50.owl"
+knowledgeBase="file:../poker/pair50.owl"
positiveExampleSource="pairPositives.txt"
negativeExampleSource="pairNegatives.txt"
abstractionClass="it.uniba.di.dl.abstraction.KBoundMSCApproximatorRefinement"
Modified: trunk/examples/yinyang_files/straightLearningProblem.xml
===================================================================
--- trunk/examples/yinyang_files/straightLearningProblem.xml 2007-09-05 08:53:46 UTC (rev 127)
+++ trunk/examples/yinyang_files/straightLearningProblem.xml 2007-09-05 08:58:38 UTC (rev 128)
@@ -7,7 +7,7 @@
xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance"
xsi:schemaLocation="http://www.di.uniba.it/learning/../LearningProblem.xsd"
-knowledgeBase="file:straight.owl"
+knowledgeBase="file:../poker/straight.owl"
positiveExampleSource="straightPositives.txt"
negativeExampleSource="straightNegatives.txt"
abstractionClass="it.uniba.di.dl.abstraction.KBoundMSCApproximatorRefinement"
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-09-04 14:11:33
|
Revision: 85
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=85&view=rev
Author: jenslehmann
Date: 2007-08-28 06:23:47 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
updated parser with more getters and ability to parse several files in a row
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/parser/DLLearner.java
trunk/src/dl-learner/org/dllearner/parser/dllearner.jj
trunk/src/dl-learner/org/dllearner/parser/dllearner.jjt
Modified: trunk/src/dl-learner/org/dllearner/parser/DLLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/parser/DLLearner.java 2007-08-28 11:42:35 UTC (rev 84)
+++ trunk/src/dl-learner/org/dllearner/parser/DLLearner.java 2007-08-28 13:23:47 UTC (rev 85)
@@ -81,6 +81,18 @@
return negativeExamples;
}
+ public static List<ConfigurationOption> getConfOptions() {
+ return confOptions;
+ }
+
+ public static List<List<String>> getFunctionCalls() {
+ return functionCalls;
+ }
+
+ public static KB getKB() {
+ return kb;
+ }
+
/*
private static void addFunctionCall(String functionName, String argument) {
if(functionCalls.containsKey(functionName)) {
@@ -137,7 +149,11 @@
public static void parseFile(String filename) {
try {
- new DLLearner(new FileInputStream(filename));
+ if(constructorCalled)
+ DLLearner.ReInit(new FileInputStream(filename));
+ else
+ new DLLearner(new FileInputStream(filename));
+ constructorCalled = true;
DLLearner.Start();
} catch(Exception e) {
e.printStackTrace();
@@ -1561,25 +1577,6 @@
finally { jj_save(11, xla); }
}
- static final private boolean jj_3R_19() {
- if (jj_3R_4()) return true;
- return false;
- }
-
- static final private boolean jj_3R_9() {
- if (jj_3R_12()) return true;
- return false;
- }
-
- static final private boolean jj_3R_36() {
- if (jj_3R_50()) return true;
- if (jj_3R_22()) return true;
- if (jj_3R_17()) return true;
- if (jj_scan_token(COMMAND_END)) return true;
- if (jj_3R_14()) return true;
- return false;
- }
-
static final private boolean jj_3R_18() {
if (jj_3R_12()) return true;
return false;
@@ -2012,6 +2009,25 @@
return false;
}
+ static final private boolean jj_3R_19() {
+ if (jj_3R_4()) return true;
+ return false;
+ }
+
+ static final private boolean jj_3R_9() {
+ if (jj_3R_12()) return true;
+ return false;
+ }
+
+ static final private boolean jj_3R_36() {
+ if (jj_3R_50()) return true;
+ if (jj_3R_22()) return true;
+ if (jj_3R_17()) return true;
+ if (jj_scan_token(COMMAND_END)) return true;
+ if (jj_3R_14()) return true;
+ return false;
+ }
+
static private boolean jj_initialized_once = false;
static public DLLearnerTokenManager token_source;
static SimpleCharStream jj_input_stream;
Modified: trunk/src/dl-learner/org/dllearner/parser/dllearner.jj
===================================================================
--- trunk/src/dl-learner/org/dllearner/parser/dllearner.jj 2007-08-28 11:42:35 UTC (rev 84)
+++ trunk/src/dl-learner/org/dllearner/parser/dllearner.jj 2007-08-28 13:23:47 UTC (rev 85)
@@ -99,6 +99,18 @@
return negativeExamples;
}
+ public static List<ConfigurationOption> getConfOptions() {
+ return confOptions;
+ }
+
+ public static List<List<String>> getFunctionCalls() {
+ return functionCalls;
+ }
+
+ public static KB getKB() {
+ return kb;
+ }
+
/*
private static void addFunctionCall(String functionName, String argument) {
if(functionCalls.containsKey(functionName)) {
@@ -155,7 +167,11 @@
public static void parseFile(String filename) {
try {
- new DLLearner(new FileInputStream(filename));
+ if(constructorCalled)
+ DLLearner.ReInit(new FileInputStream(filename));
+ else
+ new DLLearner(new FileInputStream(filename));
+ constructorCalled = true;
DLLearner.Start();
} catch(Exception e) {
e.printStackTrace();
Modified: trunk/src/dl-learner/org/dllearner/parser/dllearner.jjt
===================================================================
--- trunk/src/dl-learner/org/dllearner/parser/dllearner.jjt 2007-08-28 11:42:35 UTC (rev 84)
+++ trunk/src/dl-learner/org/dllearner/parser/dllearner.jjt 2007-08-28 13:23:47 UTC (rev 85)
@@ -95,6 +95,18 @@
return negativeExamples;
}
+ public static List<ConfigurationOption> getConfOptions() {
+ return confOptions;
+ }
+
+ public static List<List<String>> getFunctionCalls() {
+ return functionCalls;
+ }
+
+ public static KB getKB() {
+ return kb;
+ }
+
/*
private static void addFunctionCall(String functionName, String argument) {
if(functionCalls.containsKey(functionName)) {
@@ -151,7 +163,11 @@
public static void parseFile(String filename) {
try {
- new DLLearner(new FileInputStream(filename));
+ if(constructorCalled)
+ DLLearner.ReInit(new FileInputStream(filename));
+ else
+ new DLLearner(new FileInputStream(filename));
+ constructorCalled = true;
DLLearner.Start();
} catch(Exception e) {
e.printStackTrace();
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-09-03 16:59:03
|
Revision: 126
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=126&view=rev
Author: jenslehmann
Date: 2007-09-03 08:43:58 -0700 (Mon, 03 Sep 2007)
Log Message:
-----------
updated statistic settings
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-31 15:30:09 UTC (rev 125)
+++ trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-09-03 15:43:58 UTC (rev 126)
@@ -126,7 +126,8 @@
int[] algorithmRuns = {1,10,10};
int startAlgorithmNr = 0;
-
+ Config.writeDIGProtocol = true;
+ Config.digProtocolFile = new File(statBaseDir, "dig.log");
// do not plot anything
// File[][][] gnuplotFiles = new File[examples.length][algorithms.length][3];
@@ -169,7 +170,9 @@
statString += "example: " + examples[exampleNr] + "\n\n";
for(int algorithmNr=startAlgorithmNr; algorithmNr < algorithms.length; algorithmNr++) {
-
+ // reset algorithm number (next example starts with first algorithm)
+ startAlgorithmNr = 0;
+
Stat classification = new Stat();
Stat length = new Stat();
Stat runtime = new Stat();
@@ -228,6 +231,10 @@
Config.GP.crossoverProbability = 0.8;
Config.GP.hillClimbingProbability = 0;
Config.percentPerLengthUnit = 0.005;
+ // give GP a chance to find the long solution of the
+ // uncle problem
+ if(exampleNr==3 || exampleNr == 6)
+ Config.percentPerLengthUnit = 0.002;
learningAlgorithm = new GP(learningProblem);
} else if(algorithmNr==2) {
Config.algorithm = Algorithm.HYBRID_GP;
@@ -243,6 +250,8 @@
Config.GP.crossoverProbability = 0.2;
Config.GP.hillClimbingProbability = 0;
Config.percentPerLengthUnit = 0.005;
+ if(exampleNr == 3 || exampleNr==6)
+ Config.percentPerLengthUnit = 0.002;
learningAlgorithm = new GP(learningProblem);
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-09-02 13:00:34
|
Revision: 61
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=61&view=rev
Author: jenslehmann
Date: 2007-08-27 03:33:05 -0700 (Mon, 27 Aug 2007)
Log Message:
-----------
created build target for PHP client
Modified Paths:
--------------
trunk/build.xml
Modified: trunk/build.xml
===================================================================
--- trunk/build.xml 2007-08-27 10:18:46 UTC (rev 60)
+++ trunk/build.xml 2007-08-27 10:33:05 UTC (rev 61)
@@ -5,11 +5,13 @@
<property name="lib_dir" value="library" />
<property name="source_dir" value="src/dl-learner" />
<property name="class_dir" value="classes" />
+ <property name="php_client_dir" value="src/php-client" />
<tstamp>
<format property="today" pattern="yyyy-MM-dd" locale="en" />
</tstamp>
<property name="version_dir" value="dllearner-${today}" />
- <property name="release_tmp_dir" value="release/${version_dir}" />
+ <property name="release_tmp_dir" value="release/${version_dir}" />
+ <property name="release_php_client_tmp_dir" value="release/php-client-${today}" />
<property name="kaon2" value="${lib_dir}/kaon2.jar"/>
<property name="xbean" value="${lib_dir}/xbean.jar"/>
@@ -108,7 +110,33 @@
<delete dir="release"/>
</target>
- <target name="wsgen_windows" >
+ <!-- build PHP client release -->
+ <target name="php_client">
+ <mkdir dir="${release_php_client_tmp_dir}" />
+
+ <!-- copy PHP-client to a temporary directory exluding some files -->
+ <copy toDir="${release_php_client_tmp_dir}">
+ <fileset dir="${php_client_dir}">
+ <exclude name="main.wsdl" />
+ <exclude name="*.xsd" />
+ <!-- <exclude name="save/" /> -->
+ </fileset>
+ </copy>
+
+ <!-- copy over all owl ontologies in examples directory -->
+ <copy toDir="${release_php_client_tmp_dir}/ontologies/" flatten="true">
+ <fileset dir="examples" includes="**/*.owl" />
+ </copy>
+
+ <!-- create release -->
+ <tar destfile="php_client_${today}.tar.gz" compression="gzip">
+ <tarfileset dir="release" />
+ </tar>
+
+ <delete dir="release" />
+ </target>
+
+ <target name="wsgen_windows" >
<exec dir="${source_dir}" executable="wsgen">
<arg value="-keep"/>
<arg value="-verbose"/>
@@ -118,7 +146,7 @@
</exec>
</target>
- <target name="wsgen_linux" >
+ <target name="wsgen_linux" >
<exec dir="${source_dir}" executable="wsgen">
<arg value="-keep"/>
<arg value="-verbose"/>
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-09-01 01:34:45
|
Revision: 86
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=86&view=rev
Author: jenslehmann
Date: 2007-08-28 06:24:54 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
intermediate commit for statistics generation script
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-28 13:23:47 UTC (rev 85)
+++ trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-28 13:24:54 UTC (rev 86)
@@ -23,6 +23,7 @@
import java.net.MalformedURLException;
import java.net.URL;
import java.util.HashMap;
+import java.util.List;
import java.util.Map;
import java.util.SortedSet;
import java.util.TreeSet;
@@ -61,6 +62,54 @@
@SuppressWarnings("unused")
private static void createStatistics() {
+ // experimental setup:
+
+ // algorithms: refinement, GP, hybrid GP (YinYang)
+ // settings GP:
+ // - average over 10 runs
+ // ...
+ // settings Hybrid GP:
+ // - average over 10 runs
+ // ...
+ // settings refinement:
+ // - single run
+ // ...
+
+ // observations:
+ // - correctness
+ // - concept length
+ // - runtime
+
+ // learning examples:
+ // - trains
+ // - arches
+ // - moral (simple)
+ // - moral (complex)
+ // - poker (pair)
+ // - poker (straight)
+ // - uncle (FORTE)
+ // - more?
+
+ String exampleBaseDir = "examples/";
+
+ File[] confFiles = new File[1];
+ confFiles[0] = new File(exampleBaseDir, "trains/trains.conf");
+
+ /*
+ Stat[][] statAr = new Stat[4][3];
+ File[][] fileAr = new File[4][3];
+
+ fileAr[0][0] = new File(baseDir, "gnuplot/hybrid100classification.data");
+ fileAr[0][1] = new File(baseDir, "gnuplot/hybrid100length.data");
+ fileAr[0][2] = new File(baseDir, "gnuplot/hybrid100runtime.data");
+ fileAr[1][0] = new File(baseDir, "gnuplot/hybrid50classification.data");
+ fileAr[1][1] = new File(baseDir, "gnuplot/hybrid50length.data");
+ fileAr[1][2] = new File(baseDir, "gnuplot/hybrid50runtime.data");
+ fileAr[2][0] = new File(baseDir, "gnuplot/gpclassification.data");
+ fileAr[2][1] = new File(baseDir, "gnuplot/gplength.data");
+ fileAr[2][2] = new File(baseDir, "gnuplot/gpruntime.data");
+ */
+
// set reasoner URL
try {
Config.digReasonerURL = new URL("http://localhost:8081");
@@ -68,21 +117,17 @@
e.printStackTrace();
}
- // used OWL files
- File fatherOwlFile = new File("examples/father.owl");
String fatherConfFile = "examples/father2.conf";
- URL ontologyFatherURL = null;
- try {
- ontologyFatherURL = new URL("file", "localhost", fatherOwlFile.getAbsolutePath());
- } catch (MalformedURLException e1) {
- e1.printStackTrace();
- }
- Map<URL, OntologyFileFormat> m = new HashMap<URL, OntologyFileFormat>();
- m.put(ontologyFatherURL, OntologyFileFormat.RDF_XML);
+ // file is parsed, but we use only the specified examples really
+ // (everything else is ignored)
+ DLLearner.parseFile(fatherConfFile);
+ // DLLearner.parseFile(fatherConfFile);
+ Map<URL, OntologyFileFormat> imports = getImports(DLLearner.getFunctionCalls());
+
// initialise reasoner
- Reasoner reasoner = Main.createReasoner(new KB(), m);
+ Reasoner reasoner = Main.createReasoner(new KB(), imports);
ReasoningService rs = new ReasoningService(reasoner);
Main.autoDetectConceptsAndRoles(rs);
@@ -96,10 +141,6 @@
}
}
- // file is parsed, but we use only the specified examples really
- // (everything else is ignored)
- DLLearner.parseFile(fatherConfFile);
-
SortedSet<Individual> positiveExamples = new TreeSet<Individual>();
SortedSet<Individual> negativeExamples = new TreeSet<Individual>();
Map<AtomicConcept,SortedSet<Individual>> posExamplesTmp = DLLearner.getPositiveExamples();
@@ -110,6 +151,8 @@
for (AtomicConcept target : negExamplesTmp.keySet())
negativeExamples = negExamplesTmp.get(target);
+
+
LearningProblem learningProblem = new LearningProblem(rs, positiveExamples, negativeExamples);
ROLearner learner = new ROLearner(learningProblem);
@@ -118,4 +161,46 @@
}
+ private static Map<URL, OntologyFileFormat> getImports(List<List<String>> functionCalls) {
+ Map<URL, OntologyFileFormat> importedFiles = new HashMap<URL, OntologyFileFormat>();
+
+ OntologyFileFormat format = null;
+ URL url = null;
+
+ for (List<String> call : functionCalls) {
+
+ if(call.get(0).equals("import")) {
+ // alte Methode mit file statt URI
+ // File f = new File(baseDir, call.get(1));
+
+ try {
+ String fileString = call.get(1);
+ if(fileString.startsWith("http:")) {
+ url = new URL(fileString);
+ } else {
+ File f = new File("examples", call.get(1));
+ url = f.toURI().toURL();
+ }
+ } catch (MalformedURLException e) {
+ // TODO Auto-generated catch block
+ e.printStackTrace();
+ }
+
+ if (call.size() == 2)
+ // falls nichts angegeben, dann wird RDF/XML gewählt
+ importedFiles.put(url, OntologyFileFormat.RDF_XML);
+ else {
+ String formatString = call.get(2);
+ if (formatString.equals("RDF/XML"))
+ format = OntologyFileFormat.RDF_XML;
+ else
+ format = OntologyFileFormat.N_TRIPLES;
+ importedFiles.put(url, format);
+ }
+ }
+ }
+
+ return importedFiles;
+ }
+
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-31 23:27:52
|
Revision: 92
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=92&view=rev
Author: jenslehmann
Date: 2007-08-28 07:32:08 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
committed correct startup files
Modified Paths:
--------------
trunk/bin/dllearner
trunk/bin/quickstart
trunk/bin/ws
Modified: trunk/bin/dllearner
===================================================================
--- trunk/bin/dllearner 2007-08-28 14:06:01 UTC (rev 91)
+++ trunk/bin/dllearner 2007-08-28 14:32:08 UTC (rev 92)
@@ -1 +1 @@
-java -cp /Programme/Java/eclipse/workspace/DL-Learner-SVN:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/dig1.1-xmlbeans.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/antlr-2.7.5.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/commons-logging.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/concurrent.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/icu4j_3_4.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/iri.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/jena.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/xercesImpl.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/kaon2.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/modules/sparqlModule.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/antlr-runtime-3.0.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/commons-lang-2.2.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-api.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-apibinding.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-change.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-debugging.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-dig1_1.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-functionalparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-functionalrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-impl.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-krssparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-mansyntaxparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-mansyntaxrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-metrics.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-oboparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-owlxmlparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-owlxmlrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfapi.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfxmlparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfxmlrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-util.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/xbean.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/dllearner.jar org.dllearner.parser.DLLearner $@
\ No newline at end of file
+java -cp .:./lib/dig1.1-xmlbeans.jar:./lib/jena/antlr-2.7.5.jar:./lib/jena/commons-logging.jar:./lib/jena/concurrent.jar:./lib/jena/icu4j_3_4.jar:./lib/jena/iri.jar:./lib/jena/jena.jar:./lib/jena/xercesImpl.jar:./lib/kaon2.jar:./lib/modules/sparqlModule.jar:./lib/owlapi/antlr-runtime-3.0.jar:./lib/owlapi/commons-lang-2.2.jar:./lib/owlapi/owlapi-api.jar:./lib/owlapi/owlapi-apibinding.jar:./lib/owlapi/owlapi-change.jar:./lib/owlapi/owlapi-debugging.jar:./lib/owlapi/owlapi-dig1_1.jar:./lib/owlapi/owlapi-functionalparser.jar:./lib/owlapi/owlapi-functionalrenderer.jar:./lib/owlapi/owlapi-impl.jar:./lib/owlapi/owlapi-krssparser.jar:./lib/owlapi/owlapi-mansyntaxparser.jar:./lib/owlapi/owlapi-mansyntaxrenderer.jar:./lib/owlapi/owlapi-metrics.jar:./lib/owlapi/owlapi-oboparser.jar:./lib/owlapi/owlapi-owlxmlparser.jar:./lib/owlapi/owlapi-owlxmlrenderer.jar:./lib/owlapi/owlapi-rdfapi.jar:./lib/owlapi/owlapi-rdfxmlparser.jar:./lib/owlapi/owlapi-rdfxmlrenderer.jar:./lib/owlapi/owlapi-util.jar:./lib/xbean.jar:./lib/dllearner.jar org.dllearner.parser.DLLearner $@
\ No newline at end of file
Modified: trunk/bin/quickstart
===================================================================
--- trunk/bin/quickstart 2007-08-28 14:06:01 UTC (rev 91)
+++ trunk/bin/quickstart 2007-08-28 14:32:08 UTC (rev 92)
@@ -1 +1 @@
-java -cp /Programme/Java/eclipse/workspace/DL-Learner-SVN:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/dig1.1-xmlbeans.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/antlr-2.7.5.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/commons-logging.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/concurrent.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/icu4j_3_4.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/iri.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/jena.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/xercesImpl.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/kaon2.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/modules/sparqlModule.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/antlr-runtime-3.0.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/commons-lang-2.2.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-api.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-apibinding.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-change.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-debugging.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-dig1_1.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-functionalparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-functionalrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-impl.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-krssparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-mansyntaxparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-mansyntaxrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-metrics.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-oboparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-owlxmlparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-owlxmlrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfapi.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfxmlparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfxmlrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-util.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/xbean.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/dllearner.jar org.dllearner.QuickStart
\ No newline at end of file
+java -cp .:./lib/dig1.1-xmlbeans.jar:./lib/jena/antlr-2.7.5.jar:./lib/jena/commons-logging.jar:./lib/jena/concurrent.jar:./lib/jena/icu4j_3_4.jar:./lib/jena/iri.jar:./lib/jena/jena.jar:./lib/jena/xercesImpl.jar:./lib/kaon2.jar:./lib/modules/sparqlModule.jar:./lib/owlapi/antlr-runtime-3.0.jar:./lib/owlapi/commons-lang-2.2.jar:./lib/owlapi/owlapi-api.jar:./lib/owlapi/owlapi-apibinding.jar:./lib/owlapi/owlapi-change.jar:./lib/owlapi/owlapi-debugging.jar:./lib/owlapi/owlapi-dig1_1.jar:./lib/owlapi/owlapi-functionalparser.jar:./lib/owlapi/owlapi-functionalrenderer.jar:./lib/owlapi/owlapi-impl.jar:./lib/owlapi/owlapi-krssparser.jar:./lib/owlapi/owlapi-mansyntaxparser.jar:./lib/owlapi/owlapi-mansyntaxrenderer.jar:./lib/owlapi/owlapi-metrics.jar:./lib/owlapi/owlapi-oboparser.jar:./lib/owlapi/owlapi-owlxmlparser.jar:./lib/owlapi/owlapi-owlxmlrenderer.jar:./lib/owlapi/owlapi-rdfapi.jar:./lib/owlapi/owlapi-rdfxmlparser.jar:./lib/owlapi/owlapi-rdfxmlrenderer.jar:./lib/owlapi/owlapi-util.jar:./lib/xbean.jar:./lib/dllearner.jar org.dllearner.QuickStart
\ No newline at end of file
Modified: trunk/bin/ws
===================================================================
--- trunk/bin/ws 2007-08-28 14:06:01 UTC (rev 91)
+++ trunk/bin/ws 2007-08-28 14:32:08 UTC (rev 92)
@@ -1 +1 @@
-java -cp /Programme/Java/eclipse/workspace/DL-Learner-SVN:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/dig1.1-xmlbeans.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/antlr-2.7.5.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/commons-logging.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/concurrent.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/icu4j_3_4.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/iri.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/jena.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/jena/xercesImpl.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/kaon2.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/modules/sparqlModule.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/antlr-runtime-3.0.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/commons-lang-2.2.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-api.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-apibinding.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-change.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-debugging.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-dig1_1.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-functionalparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-functionalrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-impl.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-krssparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-mansyntaxparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-mansyntaxrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-metrics.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-oboparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-owlxmlparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-owlxmlrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfapi.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfxmlparser.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-rdfxmlrenderer.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/owlapi/owlapi-util.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/xbean.jar:/Programme/Java/eclipse/workspace/DL-Learner-SVN/lib/dllearner.jar org.dllearner.server.DLLearnerWSStart $@
\ No newline at end of file
+java -cp .:./lib/dig1.1-xmlbeans.jar:./lib/jena/antlr-2.7.5.jar:./lib/jena/commons-logging.jar:./lib/jena/concurrent.jar:./lib/jena/icu4j_3_4.jar:./lib/jena/iri.jar:./lib/jena/jena.jar:./lib/jena/xercesImpl.jar:./lib/kaon2.jar:./lib/modules/sparqlModule.jar:./lib/owlapi/antlr-runtime-3.0.jar:./lib/owlapi/commons-lang-2.2.jar:./lib/owlapi/owlapi-api.jar:./lib/owlapi/owlapi-apibinding.jar:./lib/owlapi/owlapi-change.jar:./lib/owlapi/owlapi-debugging.jar:./lib/owlapi/owlapi-dig1_1.jar:./lib/owlapi/owlapi-functionalparser.jar:./lib/owlapi/owlapi-functionalrenderer.jar:./lib/owlapi/owlapi-impl.jar:./lib/owlapi/owlapi-krssparser.jar:./lib/owlapi/owlapi-mansyntaxparser.jar:./lib/owlapi/owlapi-mansyntaxrenderer.jar:./lib/owlapi/owlapi-metrics.jar:./lib/owlapi/owlapi-oboparser.jar:./lib/owlapi/owlapi-owlxmlparser.jar:./lib/owlapi/owlapi-owlxmlrenderer.jar:./lib/owlapi/owlapi-rdfapi.jar:./lib/owlapi/owlapi-rdfxmlparser.jar:./lib/owlapi/owlapi-rdfxmlrenderer.jar:./lib/owlapi/owlapi-util.jar:./lib/xbean.jar:./lib/dllearner.jar org.dllearner.server.DLLearnerWSStart $@
\ No newline at end of file
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2007-08-31 23:27:30
|
Revision: 90
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=90&view=rev
Author: kurzum
Date: 2007-08-28 07:03:01 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
Modified Paths:
--------------
trunk/examples/arch/arch_owl.conf
trunk/examples/daughter.conf
trunk/examples/father2.conf
trunk/examples/poker/pair_owl.conf
trunk/examples/poker/straight_owl.conf
trunk/examples/trains/trains_owl.conf
trunk/examples/uncle.conf
Modified: trunk/examples/arch/arch_owl.conf
===================================================================
--- trunk/examples/arch/arch_owl.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/arch/arch_owl.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -28,7 +28,7 @@
// search tree protocol
refinement.writeSearchTree = false;
refinement.searchTreeFile = "searchTree.txt";
-refinement.quiet = true;
+refinement.quiet = false;
import("arch.owl");
// hidePrefix="http://localhost/foo#";
/** background knowledge **/
Modified: trunk/examples/daughter.conf
===================================================================
--- trunk/examples/daughter.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/daughter.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -9,7 +9,7 @@
*/
// search tree protocol
-refinement.writeSearchTree = true;
+refinement.writeSearchTree = false;
refinement.searchTreeFile = "log/searchTreeDaughter.txt";
// control output
Modified: trunk/examples/father2.conf
===================================================================
--- trunk/examples/father2.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/father2.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -11,7 +11,7 @@
// and roles to make the output more readable
hidePrefix = "http://example.com/father#";
-writeDIGProtocol = true;
+writeDIGProtocol = false;
digProtocolFile = "owlapi_dig.txt";
/** examples **/
Modified: trunk/examples/poker/pair_owl.conf
===================================================================
--- trunk/examples/poker/pair_owl.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/poker/pair_owl.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -3,7 +3,7 @@
showIndividuals = true;
import("pair50.owl");
-refinement.quiet = true;
+refinement.quiet = false;
-pair("http://localhost/foo#hand0").
-pair("http://localhost/foo#hand1").
Modified: trunk/examples/poker/straight_owl.conf
===================================================================
--- trunk/examples/poker/straight_owl.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/poker/straight_owl.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -1,5 +1,5 @@
import("straight.owl");
-refinement.quiet = true;
+refinement.quiet = false;
+straight("http://localhost/foo#hand1").
+straight("http://localhost/foo#hand22").
Modified: trunk/examples/trains/trains_owl.conf
===================================================================
--- trunk/examples/trains/trains_owl.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/trains/trains_owl.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -1,7 +1,7 @@
import("trains.owl");
algorithm = refinement;
-refinement.quiet = true;
+refinement.quiet = false;
hidePrefix = "http://example.com/foo#";
+eastbound("http://example.com/foo#east1").
Modified: trunk/examples/uncle.conf
===================================================================
--- trunk/examples/uncle.conf 2007-08-28 13:43:52 UTC (rev 89)
+++ trunk/examples/uncle.conf 2007-08-28 14:03:01 UTC (rev 90)
@@ -12,7 +12,7 @@
* to find shorter correct solutions than the desired one above.
*/
-writeDIGProtocol = true;
+writeDIGProtocol = false;
digProtocolFile = "dig_uncle_fact.txt";
/** background knowledge **/
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2007-08-31 23:27:24
|
Revision: 88
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=88&view=rev
Author: kurzum
Date: 2007-08-28 06:42:16 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
small change in a tooltip string
Modified Paths:
--------------
trunk/src/php-client/Model.php
Modified: trunk/src/php-client/Model.php
===================================================================
--- trunk/src/php-client/Model.php 2007-08-28 13:38:46 UTC (rev 87)
+++ trunk/src/php-client/Model.php 2007-08-28 13:42:16 UTC (rev 88)
@@ -260,7 +260,7 @@
{ $ret="";
$uri="index.php?";
- $tt1=$this->getTooltip("Choose to automatically add instances of this class to positives examples<br>and try to estimate negative examples");
+ $tt1=$this->getTooltip("Choose to automatically add instances of this class to positives examples<br>and choose randomly 50% of instances left over to negative examples");
$tt2=$this->getTooltip("Choose to ignore a class when learning, can be used to relearn a concept definition");
$ret.="Ignored Classes:<br>".((sizeof($this->ignoredConcepts)==0)?"None<br>":"");
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2007-08-31 23:27:24
|
Revision: 87
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=87&view=rev
Author: kurzum
Date: 2007-08-28 06:38:46 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
working scripts
Modified Paths:
--------------
trunk/build.xml
Modified: trunk/build.xml
===================================================================
--- trunk/build.xml 2007-08-28 13:24:54 UTC (rev 86)
+++ trunk/build.xml 2007-08-28 13:38:46 UTC (rev 87)
@@ -168,18 +168,18 @@
<pathelement location="${lib_dir}/dllearner.jar"/>
</path>
<path id="removeprefix"><pathelement location="."/> </path>
- <pathconvert refid="removeprefix" property="removeprefixwin" targetos="windows"/>
- <pathconvert refid="removeprefix" property="removeprefixunix" targetos="unix"/>
+ <pathconvert refid="removeprefix" property="removeprefix" />
+
<pathconvert refid="addjar" property="pathStringUnix" targetos="unix">
- <map from="${removeprefixunix}" to="."/>
- <map from="c:" to=""/>
+ <map from="${removeprefix}" to="."/>
</pathconvert>
<pathconvert refid="addjar" property="pathStringWin" targetos="windows">
- <map from="${removeprefixwin}" to="."/>
+ <map from="${removeprefix}" to="."/>
</pathconvert>
- <echo message="${removeprefixunix}"/>
+ <echo message="${removeprefix}"/>
<echo message="${pathStringUnix}"/>
+ <echo message="${pathStringWin}"/>
<echo file="bin/quickstart.bat" message="java -cp ${pathStringWin} org.dllearner.QuickStart"/>
<echo file="bin/dllearner.bat" message="java -cp ${pathStringWin} org.dllearner.parser.DLLearner %*"/>
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-31 15:46:03
|
Revision: 122
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=122&view=rev
Author: jenslehmann
Date: 2007-08-31 07:21:57 -0700 (Fri, 31 Aug 2007)
Log Message:
-----------
fixed performance issue in genetic programming algorithm (2nd child was overwritten when performing crossover)
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/gp/GP.java
trunk/src/dl-learner/org/dllearner/algorithms/gp/Program.java
Modified: trunk/src/dl-learner/org/dllearner/algorithms/gp/GP.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/gp/GP.java 2007-08-31 10:23:51 UTC (rev 121)
+++ trunk/src/dl-learner/org/dllearner/algorithms/gp/GP.java 2007-08-31 14:21:57 UTC (rev 122)
@@ -1,6 +1,25 @@
+/**
+ * Copyright (C) 2007, Jens Lehmann
+ *
+ * This file is part of DL-Learner.
+ *
+ * DL-Learner is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * DL-Learner is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
package org.dllearner.algorithms.gp;
-
import static org.dllearner.Config.GP.algorithmType;
import static org.dllearner.Config.GP.crossoverProbability;
import static org.dllearner.Config.GP.elitism;
@@ -26,7 +45,6 @@
import org.dllearner.Config;
import org.dllearner.LearningProblem;
-import org.dllearner.Main;
import org.dllearner.Score;
import org.dllearner.algorithms.LearningAlgorithm;
import org.dllearner.algorithms.hybridgp.Psi;
@@ -34,7 +52,6 @@
import org.dllearner.dl.Top;
import org.dllearner.utilities.Helper;
-
/**
* This class implements the genetic programming (GP) algorithm and provides
* methods to configure and run it.
@@ -85,6 +102,8 @@
private Comparator<Program> fitnessComparator;
private static Random rand = new Random();
+
+ private long startTime;
private Score bestScore;
private Concept bestConcept;
@@ -105,7 +124,7 @@
this.learningProblem = learningProblem;
}
- public void start() {
+ public void start() {
// falls refinement-Wahrscheinlichkeit größer 0, dann erzeuge psi
psi = new Psi(learningProblem);
@@ -180,6 +199,8 @@
}
};
+ startTime = System.nanoTime();
+
// System.out.println("If Java does not allocate enough memory on your system\n" +
// "use \"java -Xmx128m Start\" to start the program. This allocates\n" +
// "a maximum of 128 MB of memory. 64 MB are sufficient so it is usually\n" +
@@ -201,8 +222,9 @@
Program[] newIndividuals = new Program[numberOfNewIndividuals];
Program[] tmp = new Program[2];
- long startTime = System.currentTimeMillis();
+ // long startTime = System.currentTimeMillis();
+
int generation = 0;
// MAIN LOOP
@@ -259,6 +281,12 @@
newIndividuals[i] = tmp[0];
newIndividuals[i + 1] = tmp[1];
+
+ // Incrementing i here is a significant code change! (2007/08/31)
+ // This is done, because crossover uses two individuals as input and
+ // outputs two. Without the increment that second produced child is
+ // overwritten, which caused a significant loss in performance.
+ i++;
// mutation
} else if(rand >= crossoverBoundary && rand < mutationBoundary) {
newIndividuals[i] = GPUtilities.mutation(learningProblem, individuals[selectedIndividuals[i]]);
@@ -346,7 +374,7 @@
// fittestIndividual.optimize();
- long endTime = System.currentTimeMillis();
+ long endTime = System.nanoTime(); // .currentTimeMillis();
// R�ckgabewert des Algorithmus speichern
bestScore = fittestIndividual.getScore();
bestConcept = fittestIndividual.getTree();
@@ -381,7 +409,7 @@
System.out.println("generations: " + generation);
System.out.println("fittest individual found after "
+ fittestIndividualGeneration + " generations");
- System.out.println("runtime in ms: " + (endTime - startTime));
+ System.out.println("runtime in ms: " + Helper.prettyPrintNanoSeconds(endTime - startTime));
System.out.println("fitness evaluations: "
+ GPUtilities.fitnessEvaluations);
if(Config.algorithm == Config.Algorithm.HYBRID_GP) {
@@ -660,9 +688,14 @@
conceptLengthSum += p.getTree().getLength();
double conceptLengthAverage = conceptLengthSum/(double)individuals.length;
System.out.println("average concept length: " + df.format(conceptLengthAverage));
- long algorithmTime = System.nanoTime() - Main.getAlgorithmStartTime();
+ // long algorithmTime = System.nanoTime() - Main.getAlgorithmStartTime();
+ long algorithmTime = System.nanoTime() - startTime;
System.out.println("overall algorithm runtime: " + Helper.prettyPrintNanoSeconds(algorithmTime));
+ // System.out.println("instance checks: " + learningProblem.getReasoningService().getNrOfInstanceChecks());
+ // System.out.println("fitness evals: " + Program.fitnessEvaluations);
+ // System.out.println("nr. of individuals: " + individuals.length + " (" + numberOfSelectedIndividuals + " selected)");
+
// für temporäre Performance-Werte
// double some = 100*(psi.someTime/(double)algorithmTime);
// System.out.println("some: " + df.format(some) + "%");
Modified: trunk/src/dl-learner/org/dllearner/algorithms/gp/Program.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/gp/Program.java 2007-08-31 10:23:51 UTC (rev 121)
+++ trunk/src/dl-learner/org/dllearner/algorithms/gp/Program.java 2007-08-31 14:21:57 UTC (rev 122)
@@ -1,3 +1,23 @@
+/**
+ * Copyright (C) 2007, Jens Lehmann
+ *
+ * This file is part of DL-Learner.
+ *
+ * DL-Learner is free software; you can redistribute it and/or modify
+ * it under the terms of the GNU General Public License as published by
+ * the Free Software Foundation; either version 3 of the License, or
+ * (at your option) any later version.
+ *
+ * DL-Learner is distributed in the hope that it will be useful,
+ * but WITHOUT ANY WARRANTY; without even the implied warranty of
+ * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
+ * GNU General Public License for more details.
+ *
+ * You should have received a copy of the GNU General Public License
+ * along with this program. If not, see <http://www.gnu.org/licenses/>.
+ *
+ */
+
package org.dllearner.algorithms.gp;
import org.dllearner.Score;
@@ -6,25 +26,12 @@
/**
* This class represents a program, i.e. an individual.
*
- * Um spaeter KAON2-Queries zu unterstuetzen, muesste man aus Program ein Interface
- * oder eine abstrakte Klasse machen. Diese Klasse wird zu OwnProgram o.ä. und
- * es wird eine zusaetzliche Klasse KAON2Program erstellt, die dann Queries an
- * KAON2 stellt und im Konstruktor eine KAON2-DL entgegennimmt. Programmiert
- * wird im GP-Algorithmus dann natuerlich nur gegen das Interface. Schwierig wird
- * lediglich, dass KAON2 eine andere Struktur hat, also ev. die Utility-Methoden
- * angepasst werden muessen. :-/
- *
- * Neu: Das Ganze wurde jetzt ueber einen abstrahierten Reasoner und die Klasse
- * LearningProblem erledigt. TODO: Eventuell ist etwas wie "ProblemSolution" ein
- * besserer Name. Bei Program scheint unklar, warum das LearningProblem hier eine
- * Rolle spielt.
- *
* @author Jens Lehmann
*
*/
public class Program {
- // private static int fitnessEvaluations = 0;
+ // public static int fitnessEvaluations = 0;
private Concept hypothesis;
@@ -39,7 +46,7 @@
// private LearningProblem learningProblem;
private double fitness;
-
+
/**
* Create a new program.
*
@@ -60,7 +67,10 @@
// fitness = score.getScore() - hypothesis.getLength() * Config.percentPerLengthUnit;
// => in getScore() ist jetzt schon der length penalty integriert
fitness = score.getScore();
-
+ // fitnessEvaluations++;
+
+ // System.out.println("new program: " + hypothesis);
+
/*
// falls R�ckgabetyp spezifiziert ist, dann muss hier der Baum
// entsprechend ver�ndert werden
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-31 15:30:14
|
Revision: 125
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=125&view=rev
Author: jenslehmann
Date: 2007-08-31 08:30:09 -0700 (Fri, 31 Aug 2007)
Log Message:
-----------
fixed pointer to OWL file, duplicate example removed
Modified Paths:
--------------
trunk/examples/forte/forte_uncle_owl.conf
Removed Paths:
-------------
trunk/examples/forte/forte.conf
Deleted: trunk/examples/forte/forte.conf
===================================================================
--- trunk/examples/forte/forte.conf 2007-08-31 14:28:38 UTC (rev 124)
+++ trunk/examples/forte/forte.conf 2007-08-31 15:30:09 UTC (rev 125)
@@ -1,507 +0,0 @@
-/**
- * Extracted from the FORTE (First Order Revision of Theories from Examples)
- * data set
- *
- * http://www.cs.utexas.edu/users/ml/forte.html
- *
- */
-
-// control output
-// showIndividuals = true;
-showConcepts = true;
-showRoles = true;
-// showInternalKB = true;
-// showSubsumptionHierarchy = true;
-
-
-algorithm = hybridGP;
-gp.algorithmType = generational;
-gp.numberOfIndividuals = 101;
-// gp.selectionType = tournament;
-
-
-// algorithm = gp;
-// gp.refinementPercent = 70;
-// gp.crossoverPercent = 25;
-
-reasoner = dig;
-
-// Subrole(sister,sibling).
-// Subrole(brother,sibling).
-
-BOTTOM = (male AND female).
-
-Symmetric(sibling).
-Symmetric(married).
-Functional(married).
-
-male(alfred).
-female(alice).
-female(angela).
-female(ann).
-male(art).
-female(beatrice).
-male(bob).
-female(callie).
-male(calvin).
-male(carl).
-male(carlos).
-female(christy).
-female(cornelia).
-male(david).
-female(deanna).
-female(elisa).
-male(eric).
-female(f12).
-female(f14).
-female(f19).
-female(f2).
-female(f20).
-female(f21).
-female(f22).
-female(f23).
-female(f25).
-female(f26).
-female(f28).
-female(f8).
-female(fannie).
-male(fred).
-male(frederick).
-female(gail).
-male(george).
-male(harry).
-female(helen).
-male(jack).
-male(james).
-female(jane).
-female(janet).
-male(jonas).
-female(kari).
-male(karl).
-male(leon).
-female(lorrie).
-male(m1).
-male(m10).
-male(m11).
-male(m13).
-male(m15).
-male(m16).
-male(m17).
-male(m18).
-male(m24).
-male(m27).
-male(m29).
-male(m3).
-male(m4).
-male(m5).
-male(m6).
-male(m7).
-male(m9).
-female(maria).
-male(mark).
-female(martha).
-male(melvin).
-female(nancy).
-male(neil).
-male(nero).
-female(nonnie).
-female(oma).
-male(owen).
-male(paul).
-female(paula).
-male(peter).
-female(prissie).
-female(rachel).
-male(ray).
-female(regina).
-male(steve).
-female(susan).
-female(terri).
-male(terry).
-male(umo).
-male(walt).
-female(wendy).
-
-sibling(angela,ray).
-sibling(art,umo).
-sibling(art,wendy).
-sibling(calvin,christy).
-sibling(calvin,jack).
-sibling(christy,calvin).
-sibling(christy,jack).
-sibling(cornelia,melvin).
-sibling(cornelia,nancy).
-sibling(david,elisa).
-sibling(elisa,david).
-sibling(eric,fannie).
-sibling(eric,gail).
-sibling(eric,harry).
-sibling(f12,m11).
-sibling(f14,m13).
-sibling(f14,m15).
-sibling(f19,f20).
-sibling(f19,m18).
-sibling(f2,m1).
-sibling(f20,f19).
-sibling(f20,m18).
-sibling(f21,f22).
-sibling(f22,f21).
-sibling(f23,f25).
-sibling(f23,m24).
-sibling(f25,f23).
-sibling(f25,m24).
-sibling(f26,f28).
-sibling(f26,m27).
-sibling(f28,f26).
-sibling(f28,m27).
-sibling(f8,m10).
-sibling(f8,m9).
-sibling(fannie,eric).
-sibling(fannie,gail).
-sibling(fannie,harry).
-sibling(frederick,jane).
-sibling(frederick,prissie).
-sibling(gail,eric).
-sibling(gail,fannie).
-sibling(gail,harry).
-sibling(harry,eric).
-sibling(harry,fannie).
-sibling(harry,gail).
-sibling(jack,calvin).
-sibling(jack,christy).
-sibling(jane,frederick).
-sibling(jane,prissie).
-sibling(janet,nero).
-sibling(jonas,terry).
-sibling(karl,lorrie).
-sibling(karl,mark).
-sibling(lorrie,karl).
-sibling(lorrie,mark).
-sibling(m1,f2).
-sibling(m10,f8).
-sibling(m10,m9).
-sibling(m11,f12).
-sibling(m13,f14).
-sibling(m13,m15).
-sibling(m15,f14).
-sibling(m15,m13).
-sibling(m16,m17).
-sibling(m17,m16).
-sibling(m18,f19).
-sibling(m18,f20).
-sibling(m24,f23).
-sibling(m24,f25).
-sibling(m27,f26).
-sibling(m27,f28).
-sibling(m4,m5).
-sibling(m4,m6).
-sibling(m4,m7).
-sibling(m5,m4).
-sibling(m5,m6).
-sibling(m5,m7).
-sibling(m6,m4).
-sibling(m6,m5).
-sibling(m6,m7).
-sibling(m7,m4).
-sibling(m7,m5).
-sibling(m7,m6).
-sibling(m9,f8).
-sibling(m9,m10).
-sibling(mark,karl).
-sibling(mark,lorrie).
-sibling(melvin,cornelia).
-sibling(melvin,nancy).
-sibling(nancy,cornelia).
-sibling(nancy,melvin).
-sibling(nero,janet).
-sibling(oma,paul).
-sibling(oma,rachel).
-sibling(paul,oma).
-sibling(paul,rachel).
-sibling(prissie,frederick).
-sibling(prissie,jane).
-sibling(rachel,oma).
-sibling(rachel,paul).
-sibling(ray,angela).
-sibling(terry,jonas).
-sibling(umo,art).
-sibling(umo,wendy).
-sibling(wendy,art).
-sibling(wendy,umo).
-
-parent(ann, david).
-parent(ann, elisa).
-parent(beatrice, eric).
-parent(beatrice, fannie).
-parent(beatrice, gail).
-parent(beatrice, harry).
-parent(callie, karl).
-parent(callie, lorrie).
-parent(callie, mark).
-parent(kari, janet).
-parent(kari, nero).
-parent(lorrie, oma).
-parent(lorrie, paul).
-parent(lorrie, rachel).
-parent(martha, susan).
-parent(deanna, jonas). parent(deanna, terry). parent(elisa, umo).
-parent(elisa, wendy). parent(elisa, art). parent(fannie, cornelia).
-parent(fannie, melvin). parent(fannie, nancy). parent(helen, prissie).
-parent(helen, jane). parent(janet, jack). parent(janet, calvin).
-parent(janet, christy). parent(nonnie, angela). parent(nonnie, ray).
-parent(terri, f8). parent(terri, m9). parent(terri, m10).
-parent(wendy, m11). parent(wendy, f12). parent(alice, m13).
-parent(alice, f14). parent(alice, m15). parent(maria, m16).
-parent(maria, m17). parent(nancy, m18). parent(nancy, f19).
-parent(nancy, f20). parent(prissie, f21). parent(prissie, f22).
-parent(jane, f23). parent(jane, m24). parent(jane, f25).
-parent(christy, f26). parent(christy, m27). parent(christy, f28).
-parent(regina, m29). parent(oma, m1). parent(oma, f2).
-parent(paula, m3). parent(susan, m4). parent(susan, m5).
-parent(susan, m6). parent(susan, m7). parent(helen, frederick).
-
-parent(alfred, david). parent(alfred, elisa). parent(bob, eric).
-parent(bob, fannie). parent(bob, gail). parent(bob, harry).
-parent(carl, karl). parent(carl, lorrie). parent(carl, mark).
-parent(karl, janet). parent(karl, nero). parent(leon, oma).
-parent(leon, paul). parent(leon, rachel). parent(mark, susan).
-parent(david, jonas). parent(david, terry). parent(eric, umo).
-parent(eric, wendy). parent(eric, art). parent(fred, cornelia).
-parent(fred, melvin). parent(fred, nancy). parent(harry, prissie).
-parent(harry, jane). parent(james, jack). parent(james, calvin).
-parent(james, christy). parent(nero, angela). parent(nero, ray).
-parent(terry, f8). parent(terry, m9). parent(terry, m10).
-parent(walt, m11). parent(walt, f12). parent(art, m13).
-parent(art, f14). parent(art, m15). parent(melvin, m16).
-parent(melvin, m17). parent(neil, m18). parent(neil, f19).
-parent(neil, f20). parent(peter, f21). parent(peter, f22).
-parent(jack, f23). parent(jack, m24). parent(jack, f25).
-parent(carlos, f26). parent(carlos, m27). parent(carlos, f28).
-parent(ray, m29). parent(owen, m1). parent(owen, f2).
-parent(paul, m3). parent(steve, m4). parent(steve, m5).
-parent(steve, m6). parent(steve, m7). parent(harry, frederick).
-
- married(ann, alfred). married(beatrice, bob). married(callie, carl).
- married(deanna, david). married(elisa, eric). married(fannie, fred).
- married(gail, george). married(helen, harry). married(janet, james).
- married(kari, karl). married(lorrie, leon). married(martha, mark).
- married(nonnie, nero). married(oma, owen). married(paula, paul).
- married(susan, steve). married(terri, terry). married(wendy, walt).
- married(alice, art). married(maria, melvin). married(nancy, neil).
- married(prissie, peter). married(jane, jack). married(christy, carlos).
- married(regina, ray).
-
-/* small example set
-+isUncle(art).
-+isUncle(calvin).
-+isUncle(carlos).
-+isUncle(david).
-+isUncle(eric).
-+isUncle(fred).
-+isUncle(frederick).
-+isUncle(george).
-
--isUncle(alfred).
--isUncle(alice).
--isUncle(angela).
--isUncle(bob).
--isUncle(carl).
--isUncle(christy).
--isUncle(karl).
-*/
-
-// complete example set
-+isUncle(art).
-+isUncle(calvin).
-+isUncle(carlos).
-+isUncle(david).
-+isUncle(eric).
-+isUncle(fred).
-+isUncle(frederick).
-+isUncle(george).
-+isUncle(harry).
-+isUncle(jack).
-+isUncle(james).
-+isUncle(jonas).
-+isUncle(karl).
-+isUncle(leon).
-+isUncle(mark).
-+isUncle(melvin).
-+isUncle(neil).
-+isUncle(nero).
-+isUncle(owen).
-+isUncle(paul).
-+isUncle(peter).
-+isUncle(umo).
-+isUncle(walt).
-
--isUncle(alfred).
--isUncle(alice).
--isUncle(angela).
--isUncle(ann).
--isUncle(beatrice).
--isUncle(bob).
--isUncle(callie).
--isUncle(carl).
--isUncle(christy).
--isUncle(cornelia).
--isUncle(deanna).
--isUncle(elisa).
--isUncle(f12).
--isUncle(f14).
--isUncle(f19).
--isUncle(f2).
--isUncle(f20).
--isUncle(f21).
--isUncle(f22).
--isUncle(f23).
--isUncle(f25).
--isUncle(f26).
--isUncle(f28).
--isUncle(f8).
--isUncle(fannie).
--isUncle(gail).
--isUncle(helen).
--isUncle(jane).
--isUncle(janet).
--isUncle(kari).
--isUncle(lorrie).
--isUncle(m1).
--isUncle(m10).
--isUncle(m11).
--isUncle(m13).
--isUncle(m15).
--isUncle(m16).
--isUncle(m17).
--isUncle(m18).
--isUncle(m24).
--isUncle(m27).
--isUncle(m29).
--isUncle(m3).
--isUncle(m4).
--isUncle(m5).
--isUncle(m6).
--isUncle(m7).
--isUncle(m9).
--isUncle(maria).
--isUncle(martha).
--isUncle(nancy).
--isUncle(nonnie).
--isUncle(oma).
--isUncle(paula).
--isUncle(prissie).
--isUncle(rachel).
--isUncle(ray).
--isUncle(regina).
--isUncle(steve).
--isUncle(susan).
--isUncle(terri).
--isUncle(terry).
--isUncle(wendy).
-
-
-
-// temporär:
-/*
-married(art,alice).
-married(david,deanna).
-married(harry,helen).
-married(melvin,maria).
-married(ray,regina).
-married(terry,terri).
-*/
-
-/* Here's the family shown graphically:
-
- Steve |--- m7
- Martha | | |--- m6
- | |------ Susan |--- m5
- /-- Mark | |--- m4
- /
- / /-- Rachel
- / /
- / /
- Callie | |
- | |----- Lorrie |
- Carl | | |------- Paul |
- \ Leon | | |--- m3
- | | Paula |
- | \
- | \
- | \----- Oma |--- f2
- | | |
- | Owen |--- m1
- |
- | /----- Ray |
- | / | |--- m29
- | / Regina |
- | Nonnie |
- | | |
- | /---- Nero |----- Angela
- | /
- | /
- \---- Karl | Carlos |--- f28
- | | | |--- m27
- Kari | /- Christy |--- f26
- \ /
- \ /
- \--- Janet |
- | |----- Calvin
- James |
- \
- \
- \---- Jack |--- f25
- | |--- m24
- /---- Jane |--- f23
- /
- /
- Helen |
- | |-- Frederick
- /-- Harry |
- / \
- | \
- | \- Prissie |--- f22
- | | |
- | Peter |--- f21
- |
- | George
- | |
- / /-- Gail
- | / Neil |--- f20
- Bob |-/ | |--- f19
- | | /--- Nancy |--- m18
- Beatrice |-\ /
- | \ /
- \ \- Fannie |
- | | |-- Cornelia
- | Fred |
- | \
- | \
- | \-- Melvin |--- m17
- | | |
- | Maria |--- m16
- |
- | Alice |--- m15
- | | |--- f14
- | /----- Art |--- m13
- | /
- \ /
- \--- Eric |
- | |------- Umo
- /-- Elisa |
- / \
- / \
- Ann | \--- Wendy |--- f12
- | | | |
- Alfred | Walt |--- m11
- \
- \
- \-- David | ----- Jonas
- | |
- Deanna |
- \
- \
- \--- Terry |--- m10
- | |--- m9
- Terri |--- f8
-*/
\ No newline at end of file
Modified: trunk/examples/forte/forte_uncle_owl.conf
===================================================================
--- trunk/examples/forte/forte_uncle_owl.conf 2007-08-31 14:28:38 UTC (rev 124)
+++ trunk/examples/forte/forte_uncle_owl.conf 2007-08-31 15:30:09 UTC (rev 125)
@@ -1,4 +1,4 @@
-import("moral_43instances.owl");
+import("forte.owl");
// complete example set
+isUncle(art).
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-31 14:52:09
|
Revision: 123
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=123&view=rev
Author: jenslehmann
Date: 2007-08-31 07:25:18 -0700 (Fri, 31 Aug 2007)
Log Message:
-----------
added method for counting axioms
small improvements in statistics script
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/dl/KB.java
trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
Modified: trunk/src/dl-learner/org/dllearner/dl/KB.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/dl/KB.java 2007-08-31 14:21:57 UTC (rev 122)
+++ trunk/src/dl-learner/org/dllearner/dl/KB.java 2007-08-31 14:25:18 UTC (rev 123)
@@ -201,4 +201,9 @@
return connectedSet;
}
+
+ public int getNumberOfAxioms() {
+ return (abox.size() + tbox.size() + rbox.size());
+ }
+
}
Modified: trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-31 14:21:57 UTC (rev 122)
+++ trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-31 14:25:18 UTC (rev 123)
@@ -116,6 +116,7 @@
examples[4] = "poker (49 examples, pair)";
examples[5] = "poker (55 examples, straight)";
examples[6] = "uncle (FORTE data set)";
+ int startExampleNr = 0;
String[] algorithms = new String[3];
algorithms[0] = "refinement";
@@ -123,6 +124,9 @@
algorithms[2] = "hybrid";
int[] algorithmRuns = {1,10,10};
+ int startAlgorithmNr = 0;
+
+
// do not plot anything
// File[][][] gnuplotFiles = new File[examples.length][algorithms.length][3];
@@ -143,7 +147,7 @@
ConfigurationManager confMgr = new ConfigurationManager();
confMgr.applyOptions();
- for(int exampleNr=0; exampleNr < examples.length; exampleNr++) {
+ for(int exampleNr=startExampleNr; exampleNr < examples.length; exampleNr++) {
// parse current conf file
DLLearner.parseFile(confFiles[exampleNr].toString());
@@ -164,7 +168,7 @@
statString += "example: " + examples[exampleNr] + "\n\n";
- for(int algorithmNr=0; algorithmNr < algorithms.length; algorithmNr++) {
+ for(int algorithmNr=startAlgorithmNr; algorithmNr < algorithms.length; algorithmNr++) {
Stat classification = new Stat();
Stat length = new Stat();
@@ -178,6 +182,13 @@
Reasoner reasoner = Main.createReasoner(new KB(), imports);
ReasoningService rs = new ReasoningService(reasoner);
+ // System.out.println(positiveExamples);
+ // System.out.println(negativeExamples);
+ // System.exit(0);
+
+ // create learning problem
+ LearningProblem learningProblem = new LearningProblem(rs, positiveExamples, negativeExamples);
+
// prepare reasoner for using subsumption and role hierarchy
// TODO: currently, it is a small unfairness that each algorithm
// uses the same reasoning object (e.g. the second algorithm may
@@ -194,10 +205,7 @@
} catch (ReasoningMethodUnsupportedException e) {
e.printStackTrace();
}
-
- // create learning problem
- LearningProblem learningProblem = new LearningProblem(rs, positiveExamples, negativeExamples);
-
+
LearningAlgorithm learningAlgorithm = null;
if(algorithmNr==0) {
Config.algorithm = Algorithm.REFINEMENT;
@@ -213,6 +221,8 @@
Config.GP.generations = 50;
Config.GP.useFixedNumberOfGenerations = true;
Config.GP.numberOfIndividuals = 201;
+ // if(exampleNr == 3 || exampleNr == 4)
+ // Config.GP.numberOfIndividuals = 51;
Config.GP.refinementProbability = 0;
Config.GP.mutationProbability = 0.02;
Config.GP.crossoverProbability = 0.8;
@@ -226,6 +236,8 @@
Config.GP.generations = 50;
Config.GP.useFixedNumberOfGenerations = true;
Config.GP.numberOfIndividuals = 201;
+ //if(exampleNr == 3 || exampleNr == 4)
+ // Config.GP.numberOfIndividuals = 51;
Config.GP.refinementProbability = 0.65;
Config.GP.mutationProbability = 0.02;
Config.GP.crossoverProbability = 0.2;
@@ -234,7 +246,8 @@
learningAlgorithm = new GP(learningProblem);
}
- rs.resetStatistics();
+ // rs.resetStatistics();
+
long algorithmStartTime = System.nanoTime();
learningAlgorithm.start();
long algorithmTime = System.nanoTime() - algorithmStartTime;
@@ -256,7 +269,7 @@
statDetailsString += "example: " + examples[exampleNr] + "\n";
statDetailsString += "algorithm: " + algorithms[algorithmNr] + "\n";
statDetailsString += "learned concept: " + learningAlgorithm.getBestSolution() + "\n";
- statDetailsString += "classification: " + classificationRatePercent + "\n";
+ statDetailsString += "classification: " + classificationRatePercent + "%\n";
statDetailsString += "concept length: " + conceptLength + "\n";
statDetailsString += "runtime: " + Helper.prettyPrintNanoSeconds(algorithmTime) + "\n\n";
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-31 14:36:08
|
Revision: 124
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=124&view=rev
Author: jenslehmann
Date: 2007-08-31 07:28:38 -0700 (Fri, 31 Aug 2007)
Log Message:
-----------
modified DIG reasoner to not send empty tells when the internal KB is empty
added method for printing all configuration values
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/Config.java
trunk/src/dl-learner/org/dllearner/reasoning/DIGReasoner.java
Modified: trunk/src/dl-learner/org/dllearner/Config.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/Config.java 2007-08-31 14:25:18 UTC (rev 123)
+++ trunk/src/dl-learner/org/dllearner/Config.java 2007-08-31 14:28:38 UTC (rev 124)
@@ -1,6 +1,7 @@
package org.dllearner;
import java.io.File;
+import java.lang.reflect.Field;
import java.net.URL;
import java.util.LinkedList;
import java.util.List;
@@ -19,7 +20,7 @@
public static int maxLength = 7;
public static int maxDepth;
-
+
// Punktabzug für "ungenaue" Klassifizierungen, also positiv als neutral,
// neutral als negativ und negativ als neutral
public static double accuracyPenalty = 1;
@@ -27,71 +28,79 @@
// Punktabzug für fehlerhafte Klassifizierungen, also positiv als negativ
// und negativ als positiv
public static double errorPenalty = 3;
-
+
public static ScoreMethod scoreMethod = ScoreMethod.POSITIVE;
-
+
public static LearningProblemType learningProblemType = LearningProblemType.TWO_VALUED;
-
+
public static boolean penalizeNeutralExamples = false;
-
+
public static boolean showCorrectClassifications = false;
-
+
// wieviel Prozent darf ein um eine Einheit längeres Konzept schlechter
// sein (aktuell: 5% sind eine Verlängerung um 1 wert)
- // Problem: dieser Parameter hat für GP und Refinement zwar die gleiche Bedeutung,
+ // Problem: dieser Parameter hat für GP und Refinement zwar die gleiche
+ // Bedeutung,
// aber es sind unterschiedliche Werte angebracht;
// bei GP sollte der Wert so sein, dass am Ende das gewünschte Konzept
// tatsächlich die beste Fitness hat, also eher niedrig (<0.005);
- // bei Refinement in flexible heuristic soll es so sein, dass schlechtere Konzepte
- // probiert werden sollen, sobald horizontal expansion eines gut klassifizierenden
- // Knotens steigt => da ist also gewünscht das kürzere aber schlechtere Knoten
- // ev. einen Vorsprung haben => demzufolge ist dort ein hoher Wert (ca. 0.05)
+ // bei Refinement in flexible heuristic soll es so sein, dass schlechtere
+ // Konzepte
+ // probiert werden sollen, sobald horizontal expansion eines gut
+ // klassifizierenden
+ // Knotens steigt => da ist also gewünscht das kürzere aber schlechtere
+ // Knoten
+ // ev. einen Vorsprung haben => demzufolge ist dort ein hoher Wert (ca.
+ // 0.05)
// angebracht
// public static double percentPerLengthUnit = 0.0025;
public static double percentPerLengthUnit = 0.05;
-
- public enum Algorithm {GP, BRUTE_FORCE, RANDOM_GUESSER, REFINEMENT, HYBRID_GP};
-
+
+ public enum Algorithm {
+ GP, BRUTE_FORCE, RANDOM_GUESSER, REFINEMENT, HYBRID_GP
+ };
+
public static Algorithm algorithm = Algorithm.REFINEMENT;
-
+
// Rückgabetyp des gelernten Konzepts
public static String returnType = "";
-
+
public static boolean statisticMode = false;
-
+
// if set to true a retrieval algorithm is used for classification
// instead of single instance checks (default is now false, because
// we can send all instance checks in a single request), for KAON2
// as reasoner it should in many cases be set to true
public static boolean useRetrievalForClassification = false;
-
+
// welche Art von Reasoning wird benutzt (eigener Algorithmus,
// KAON2-API, DIG-Interface)
public static ReasonerType reasonerType = ReasonerType.DIG;
-
+
// bei fast retrieval muss trotzdem irgendein Reasoner gesetzt
// werden um die flat ABox zu erzeugen
public static ReasonerType startUpReasoningType = ReasonerType.KAON2;
-
+
public static URL digReasonerURL = null;
-
+
// unique names assumption
public static boolean una = false;
-
+
// open world assumption; momentan wird closed world assumption nur
// fuer Rollen unterstuetzt
public static boolean owa = true;
-
- // an-/abschalten von System.nanoTime()-Aufrufen außerhalb des Reasoningservice
+
+ // an-/abschalten von System.nanoTime()-Aufrufen außerhalb des
+ // Reasoningservice
public static boolean useNonReasonerBenchmarks = false;
-
+
// erlaubt das abschalten von Benchmarks bei der Subsumptionhierarchie,
// da diese ohnehin gecacht wird, also die System.nanoTime()-Aufrufe nur
// Zeit kosten
// public static boolean useHierarchyReasonerBenchmarks = false;
-
+
public static List<String> hidePrefixes = new LinkedList<String>();
-
+
// Informationen (Rollen, Konzepte, Individuen, Anzahl Axiome) über
// Wissensbasis anzeigen => alles konfigurierbar um Output in Grenzen
// zu halten
@@ -100,97 +109,106 @@
public static boolean showIndividuals = false;
public static boolean showSubsumptionHierarchy = false;
// zeigt die interne Wissensbasis an (d.h. keine externen OWL-Dateien)
- public static boolean showInternalKB = false;
+ public static boolean showInternalKB = false;
public static int maxLineLength = 100;
-
+
public static boolean writeDIGProtocol = false;
- public static File digProtocolFile = new File("digProtocol.txt");
-
+ public static File digProtocolFile = new File("digProtocol.txt");
+
// public static String preprocessingModule = "";
-
- // TODO: noch nicht implementiert, dass man diese per Config-Datei setzen kann
+
+ // TODO: noch nicht implementiert, dass man diese per Config-Datei setzen
+ // kann
public static class Refinement {
-
+
// Nutzung der Äquivalenz ALL R.C AND ALL R.D = ALL R.(C AND D)
public static boolean applyAllFilter = true;
-
+
// Nutzung der Äquivalenz EXISTS R.C OR EXISTS R.D = EXISTS R.(C OR D)
public static boolean applyExistsFilter = true;
-
+
public static boolean useTooWeakList = true;
-
+
public static boolean useOverlyGeneralList = true;
-
+
public static boolean useShortConceptConstruction = true;
-
+
public static double horizontalExpansionFactor = 0.6;
-
+
public static boolean improveSubsumptionHierarchy = true;
-
+
public static boolean quiet = false;
-
+
public static boolean writeSearchTree = false;
-
+
public static File searchTreeFile = new File("searchTree.txt");
-
- public enum Heuristic { LEXICOGRAPHIC, FLEXIBLE };
-
+
+ public enum Heuristic {
+ LEXICOGRAPHIC, FLEXIBLE
+ };
+
public static Heuristic heuristic = Heuristic.LEXICOGRAPHIC;
- public enum UseDIGMultiInstanceChecks { NEVER, TWOCHECKS, ONECHECK };
-
+ public enum UseDIGMultiInstanceChecks {
+ NEVER, TWOCHECKS, ONECHECK
+ };
+
// multi instance check => es wird versucht mehrere instance checks pro
// Anfrage auf einmal an den Reasoner zu schicken; Vorteil bei DIG:
- // weniger Kommunikation; Nachteil: es müssen alle instanceChecks ausgeführt
+ // weniger Kommunikation; Nachteil: es müssen alle instanceChecks
+ // ausgeführt
// werden, bevor too weak festgestellt werden kann
// TODO: not implemented
public static UseDIGMultiInstanceChecks useDIGMultiInstanceChecks = UseDIGMultiInstanceChecks.TWOCHECKS;
-
+
// geplante Optionen um den Suchraum einzuschränken
-
- // Konzepte, die in der Definition vorkommen können (per Default ("null") alle)
+
+ // Konzepte, die in der Definition vorkommen können (per Default
+ // ("null") alle)
// nicht implementiert
public static Set<AtomicConcept> allowedConcepts = null;
// ignorierte Konzepte; Default null = keine
public static Set<AtomicConcept> ignoredConcepts = null;
- // beachte: es können nur entweder die erlaubten oder die ignorierten Konzepte
+ // beachte: es können nur entweder die erlaubten oder die ignorierten
+ // Konzepte
// gesetzt werden
-
- // true falls die Konzepte vom Nutzer gesetzt worden (also allowedConcepts
+
+ // true falls die Konzepte vom Nutzer gesetzt worden (also
+ // allowedConcepts
// gleich null), ansonsten false
public static boolean allowedConceptsAutoDetect = true;
-
+
// Rollen, die in der Lösung vorkommen können
// nicht implementiert
public static Set<AtomicRole> allowedRoles = null;
public static Set<AtomicRole> ignoredRoles = null;
public static boolean allowedRolesAutoDetect = true;
-
+
// max. Verschachtelungstiefe der Lösung
// nicht implementiert
public static int maxDepth = 0;
-
+
// Konstruktoren an- und abschalten
// nicht implementiert
public static boolean useAllConstructor = true;
public static boolean useExistsConstructor = true;
public static boolean useNegation = true;
// public static boolean useDisjunction = true;
- //public static boolean useConjunction = true;
-
+ // public static boolean useConjunction = true;
+
// Domain und Range beim Verschachteln von Rollen beachten
// nicht implementiert
// TODO: Wie soll man das in DIG machen?
public static boolean useDomainRange = false;
-
+
// bereits vorher allgemeinere Konzepte festlegen (Default: keine)
// nicht implementiert
// => ist eigentlich unnötig, da dieses Wissen zur Ontologie hinzugefügt
// und dann gelernt werden kann
// public static List<AtomicConcept> fixedUpperConcepts;
-
+
}
-
+
public static class GP {
// FPS funktioniert momentan noch nicht, es muss sichergestellt werden,
@@ -198,7 +216,7 @@
public static SelectionType selectionType = SelectionType.RANK_SELECTION;
public static int tournamentSize = 3;
-
+
public static boolean elitism = true;
public static AlgorithmType algorithmType = AlgorithmType.STEADY_STATE;
@@ -206,32 +224,59 @@
public static double mutationProbability = 0.03d;
public static double crossoverProbability = 0.95d;
-
+
public static double hillClimbingProbability = 0.0d;
public static double refinementProbability = 0.0;
-
+
public static int numberOfIndividuals = 100;
public static int numberOfSelectedIndividuals = 96;
public static boolean useFixedNumberOfGenerations = false;
-
+
public static int generations = 20;
-
+
public static int postConvergenceGenerations = 50;
-
+
public static boolean adc = false;
public static int initMinDepth = 4;
-
+
public static int initMaxDepth = 6;
-
+
public static int maxConceptLength = 75;
+
+ // bei true werden statt Disjunction MultiDisjunction und statt
+ // Conjunction
+ // MultiConjunction im GP benutzt (es gibt derzeit keinen Grund es auf
+ // false
+ // zu setzen)
+ public static boolean useMultiStructures = true;
- // bei true werden statt Disjunction MultiDisjunction und statt Conjunction
- // MultiConjunction im GP benutzt (es gibt derzeit keinen Grund es auf false
- // zu setzen)
- public static boolean useMultiStructures = true;
}
+
+ public static String print() {
+ StringBuffer buff = new StringBuffer();
+ buff.append("** overview of all set config values**\n\n");
+
+ Field[] fields = Config.class.getDeclaredFields();
+ // Field[] fields = this.getClass().getDeclaredFields();
+ for (int i = 0; i < fields.length; i++) {
+ try {
+ buff.append(fields[i].getName()).append("\t=>\t").append(fields[i].get(Config.class))
+ .append("\n");
+
+ // System.out.println(fields[i].getName() + " : values: " +
+ // fields[i].get(this));
+ } catch (IllegalAccessException ex) {
+ ex.printStackTrace(System.out);
+ } catch (IllegalArgumentException ex) {
+ ex.printStackTrace(System.out);
+ }
+
+ }
+ return buff.toString();
+
+ }
}
Modified: trunk/src/dl-learner/org/dllearner/reasoning/DIGReasoner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/reasoning/DIGReasoner.java 2007-08-31 14:25:18 UTC (rev 123)
+++ trunk/src/dl-learner/org/dllearner/reasoning/DIGReasoner.java 2007-08-31 14:28:38 UTC (rev 124)
@@ -97,7 +97,7 @@
public DIGReasoner(KB kb, URL url, Map<URL,OntologyFileFormat> imports) {
this.imports = imports;
this.kb = kb;
- connector = new DIGHTTPConnector(url);
+ connector = new DIGHTTPConnector(url);
identifier = connector.getIdentifier();
kbURI = connector.newKB();
@@ -109,21 +109,23 @@
"http://dl-web.man.ac.uk/dig/2003/02/dig.xsd\" uri=\""+kbURI+"\">";
// erzeuge tell-Anfrage für Knowledgebase
- StringBuilder sb = new StringBuilder();
- sb.append("<?xml version=\"1.0\" encoding=\"ISO-8859-1\"?>");
- sb.append("<tells xmlns=\"http://dl.kr.org/dig/2003/02/lang\" " +
- "xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" " +
- "xsi:schemaLocation=\"http://dl.kr.org/dig/2003/02/lang\n" +
- "http://dl-web.man.ac.uk/dig/2003/02/dig.xsd\" uri=\""+kbURI+"\">");
- sb.append(DIGConverter.getDIGString(kb));
- sb.append("</tells>");
+ if(kb.getNumberOfAxioms()>0) {
+ StringBuilder sb = new StringBuilder();
+ sb.append("<?xml version=\"1.0\" encoding=\"ISO-8859-1\"?>");
+ sb.append("<tells xmlns=\"http://dl.kr.org/dig/2003/02/lang\" " +
+ "xmlns:xsi=\"http://www.w3.org/2001/XMLSchema-instance\" " +
+ "xsi:schemaLocation=\"http://dl.kr.org/dig/2003/02/lang\n" +
+ "http://dl-web.man.ac.uk/dig/2003/02/dig.xsd\" uri=\""+kbURI+"\">");
+ sb.append(DIGConverter.getDIGString(kb));
+ sb.append("</tells>");
+
+ ResponseDocument rd = connector.tells(sb.toString());
+ if(!rd.getResponse().isSetOk()) {
+ System.err.println("DIG-Reasoner cannot read knowledgebase.");
+ System.exit(0);
+ }
+ }
- ResponseDocument rd = connector.tells(sb.toString());
- if(!rd.getResponse().isSetOk()) {
- System.err.println("DIG-Reasoner cannot read knowledgebase.");
- System.exit(0);
- }
-
String importDIGString = "";
// Ontologien mit Hilfe von KAON2 importieren - direkt zur
@@ -174,6 +176,8 @@
// es wird jetzt immer der DIG-Reasoner abgefragt (auch ohne Importe),
// da so gleich auch äquivalente Konzepte rausgefiltert werden
+
+
// DIG-Abfragen nach Konzepten, Rollen, Individuals
atomicConcepts = getAtomicConceptsDIG();
atomicRoles = getAtomicRolesDIG();
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2007-08-31 10:23:56
|
Revision: 121
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=121&view=rev
Author: kurzum
Date: 2007-08-31 03:23:51 -0700 (Fri, 31 Aug 2007)
Log Message:
-----------
added moral examples with all instances.
Best to use fact.
the simple one needs about 200 seconds
Added Paths:
-----------
trunk/examples/moral_reasoner/moral_all_examples_complex_owl.conf
trunk/examples/moral_reasoner/moral_all_examples_owl.conf
Added: trunk/examples/moral_reasoner/moral_all_examples_complex_owl.conf
===================================================================
--- trunk/examples/moral_reasoner/moral_all_examples_complex_owl.conf (rev 0)
+++ trunk/examples/moral_reasoner/moral_all_examples_complex_owl.conf 2007-08-31 10:23:51 UTC (rev 121)
@@ -0,0 +1,248 @@
+ /***********************
+ solution should be:
+ guilty = NOT justified AND (responsible OR vicarious)
+
+ Found: ((NOT justified) AND (vicarious OR (negligent_c AND responsible)))
+
+
+ Examples:
+ 102 positive
+ 100 negative
+
+ ***********************/
+
+ /** settings **/
+ // reasoner settings
+ reasoner = dig;
+ digReasonerURL = "http://localhost:8081";
+ useRetrievalForClassification = true;
+ refinement.useDIGMultiInstanceChecks = twoChecks;
+
+ // algorithm settings
+ algorithm = refinement;
+ refinement.horizontalExpansionFactor = 0.6;
+ refinement.quiet = false;
+ refinement.useTooWeakList = true;
+
+ // search tree protocol
+ refinement.writeSearchTree = false;
+ refinement.searchTreeFile = "searchTree.txt";
+
+
+
+ // control output
+ showIndividuals = false;
+ showConcepts = true;
+ showRoles = true;
+ showInternalKB = false;
+showSubsumptionHierarchy = true;
+import("moral.owl");
+//hidePrefix("http://localhost/foo#");
+
+/** background knowledge **/
+
+refinement.ignoredConcepts = {"http://localhost/foo#guilty","http://localhost/foo#blameworthy"};
+
+
++guilty(p0).
++guilty(p1).
++guilty(p2).
++guilty(p3).
++guilty(p4).
++guilty(p5).
++guilty(p6).
++guilty(p7).
++guilty(p8).
++guilty(p9).
++guilty(p10).
++guilty(p11).
++guilty(p12).
++guilty(p13).
++guilty(p14).
++guilty(p15).
++guilty(p16).
++guilty(p17).
++guilty(p18).
++guilty(p19).
++guilty(p20).
++guilty(p21).
++guilty(p22).
++guilty(p23).
++guilty(p24).
++guilty(p25).
++guilty(p26).
++guilty(p27).
++guilty(p28).
++guilty(p29).
++guilty(p30).
++guilty(p31).
++guilty(p32).
++guilty(p33).
++guilty(p34).
++guilty(p35).
++guilty(p36).
++guilty(p37).
++guilty(p38).
++guilty(p39).
++guilty(p40).
++guilty(p41).
++guilty(p42).
++guilty(p43).
++guilty(p44).
++guilty(p45).
++guilty(p46).
++guilty(p47).
++guilty(p48).
++guilty(p49).
++guilty(p50).
++guilty(p51).
++guilty(p52).
++guilty(p53).
++guilty(p54).
++guilty(p55).
++guilty(p56).
++guilty(p57).
++guilty(p58).
++guilty(p59).
++guilty(p60).
++guilty(p61).
++guilty(p62).
++guilty(p63).
++guilty(p64).
++guilty(p65).
++guilty(p66).
++guilty(p67).
++guilty(p68).
++guilty(p69).
++guilty(p70).
++guilty(p71).
++guilty(p72).
++guilty(p73).
++guilty(p74).
++guilty(p75).
++guilty(p76).
++guilty(p77).
++guilty(p78).
++guilty(p79).
++guilty(p80).
++guilty(p81).
++guilty(p82).
++guilty(p83).
++guilty(p84).
++guilty(p85).
++guilty(p86).
++guilty(p87).
++guilty(p88).
++guilty(p89).
++guilty(p90).
++guilty(p91).
++guilty(p92).
++guilty(p93).
++guilty(p94).
++guilty(p95).
++guilty(p96).
++guilty(p97).
++guilty(p98).
++guilty(p99).
++guilty(p100).
++guilty(p101).
+-guilty(n0).
+-guilty(n1).
+-guilty(n2).
+-guilty(n3).
+-guilty(n4).
+-guilty(n5).
+-guilty(n6).
+-guilty(n7).
+-guilty(n8).
+-guilty(n9).
+-guilty(n10).
+-guilty(n11).
+-guilty(n12).
+-guilty(n13).
+-guilty(n14).
+-guilty(n15).
+-guilty(n16).
+-guilty(n17).
+-guilty(n18).
+-guilty(n19).
+-guilty(n20).
+-guilty(n21).
+-guilty(n22).
+-guilty(n23).
+-guilty(n24).
+-guilty(n25).
+-guilty(n26).
+-guilty(n27).
+-guilty(n28).
+-guilty(n29).
+-guilty(n30).
+-guilty(n31).
+-guilty(n32).
+-guilty(n33).
+-guilty(n34).
+-guilty(n35).
+-guilty(n36).
+-guilty(n37).
+-guilty(n38).
+-guilty(n39).
+-guilty(n40).
+-guilty(n41).
+-guilty(n42).
+-guilty(n43).
+-guilty(n44).
+-guilty(n45).
+-guilty(n46).
+-guilty(n47).
+-guilty(n48).
+-guilty(n49).
+-guilty(n50).
+-guilty(n51).
+-guilty(n52).
+-guilty(n53).
+-guilty(n54).
+-guilty(n55).
+-guilty(n56).
+-guilty(n57).
+-guilty(n58).
+-guilty(n59).
+-guilty(n60).
+-guilty(n61).
+-guilty(n62).
+-guilty(n63).
+-guilty(n64).
+-guilty(n65).
+-guilty(n66).
+-guilty(n67).
+-guilty(n68).
+-guilty(n69).
+-guilty(n70).
+-guilty(n71).
+-guilty(n72).
+-guilty(n73).
+-guilty(n74).
+-guilty(n75).
+-guilty(n76).
+-guilty(n77).
+-guilty(n78).
+-guilty(n79).
+-guilty(n80).
+-guilty(n81).
+-guilty(n82).
+-guilty(n83).
+-guilty(n84).
+-guilty(n85).
+-guilty(n86).
+-guilty(n87).
+-guilty(n88).
+-guilty(n89).
+-guilty(n90).
+-guilty(n91).
+-guilty(n92).
+-guilty(n93).
+-guilty(n94).
+-guilty(n95).
+-guilty(n96).
+-guilty(n97).
+-guilty(n98).
+-guilty(n99).
Added: trunk/examples/moral_reasoner/moral_all_examples_owl.conf
===================================================================
--- trunk/examples/moral_reasoner/moral_all_examples_owl.conf (rev 0)
+++ trunk/examples/moral_reasoner/moral_all_examples_owl.conf 2007-08-31 10:23:51 UTC (rev 121)
@@ -0,0 +1,246 @@
+ /***********************
+ solution should be:
+ guilty = (blameworthy OR vicarious_blame ).
+
+
+ Examples:
+ 102 positive
+ 100 negative
+
+ ***********************/
+
+ /** settings **/
+ // reasoner settings
+ reasoner = dig;
+ digReasonerURL = "http://localhost:8081";
+ useRetrievalForClassification = true;
+ refinement.useDIGMultiInstanceChecks = twoChecks;
+
+ // algorithm settings
+ algorithm = refinement;
+ refinement.horizontalExpansionFactor = 0.6;
+ refinement.quiet = false;
+ refinement.useTooWeakList = true;
+
+ // search tree protocol
+ refinement.writeSearchTree = false;
+ refinement.searchTreeFile = "searchTree.txt";
+
+
+
+ // control output
+ showIndividuals = false;
+ showConcepts = true;
+ showRoles = true;
+ showInternalKB = false;
+showSubsumptionHierarchy = true;
+import("moral.owl");
+//hidePrefix("http://localhost/foo#");
+
+/** background knowledge **/
+
+refinement.ignoredConcepts = {"http://localhost/foo#guilty"};
+
+
++guilty(p0).
++guilty(p1).
++guilty(p2).
++guilty(p3).
++guilty(p4).
++guilty(p5).
++guilty(p6).
++guilty(p7).
++guilty(p8).
++guilty(p9).
++guilty(p10).
++guilty(p11).
++guilty(p12).
++guilty(p13).
++guilty(p14).
++guilty(p15).
++guilty(p16).
++guilty(p17).
++guilty(p18).
++guilty(p19).
++guilty(p20).
++guilty(p21).
++guilty(p22).
++guilty(p23).
++guilty(p24).
++guilty(p25).
++guilty(p26).
++guilty(p27).
++guilty(p28).
++guilty(p29).
++guilty(p30).
++guilty(p31).
++guilty(p32).
++guilty(p33).
++guilty(p34).
++guilty(p35).
++guilty(p36).
++guilty(p37).
++guilty(p38).
++guilty(p39).
++guilty(p40).
++guilty(p41).
++guilty(p42).
++guilty(p43).
++guilty(p44).
++guilty(p45).
++guilty(p46).
++guilty(p47).
++guilty(p48).
++guilty(p49).
++guilty(p50).
++guilty(p51).
++guilty(p52).
++guilty(p53).
++guilty(p54).
++guilty(p55).
++guilty(p56).
++guilty(p57).
++guilty(p58).
++guilty(p59).
++guilty(p60).
++guilty(p61).
++guilty(p62).
++guilty(p63).
++guilty(p64).
++guilty(p65).
++guilty(p66).
++guilty(p67).
++guilty(p68).
++guilty(p69).
++guilty(p70).
++guilty(p71).
++guilty(p72).
++guilty(p73).
++guilty(p74).
++guilty(p75).
++guilty(p76).
++guilty(p77).
++guilty(p78).
++guilty(p79).
++guilty(p80).
++guilty(p81).
++guilty(p82).
++guilty(p83).
++guilty(p84).
++guilty(p85).
++guilty(p86).
++guilty(p87).
++guilty(p88).
++guilty(p89).
++guilty(p90).
++guilty(p91).
++guilty(p92).
++guilty(p93).
++guilty(p94).
++guilty(p95).
++guilty(p96).
++guilty(p97).
++guilty(p98).
++guilty(p99).
++guilty(p100).
++guilty(p101).
+-guilty(n0).
+-guilty(n1).
+-guilty(n2).
+-guilty(n3).
+-guilty(n4).
+-guilty(n5).
+-guilty(n6).
+-guilty(n7).
+-guilty(n8).
+-guilty(n9).
+-guilty(n10).
+-guilty(n11).
+-guilty(n12).
+-guilty(n13).
+-guilty(n14).
+-guilty(n15).
+-guilty(n16).
+-guilty(n17).
+-guilty(n18).
+-guilty(n19).
+-guilty(n20).
+-guilty(n21).
+-guilty(n22).
+-guilty(n23).
+-guilty(n24).
+-guilty(n25).
+-guilty(n26).
+-guilty(n27).
+-guilty(n28).
+-guilty(n29).
+-guilty(n30).
+-guilty(n31).
+-guilty(n32).
+-guilty(n33).
+-guilty(n34).
+-guilty(n35).
+-guilty(n36).
+-guilty(n37).
+-guilty(n38).
+-guilty(n39).
+-guilty(n40).
+-guilty(n41).
+-guilty(n42).
+-guilty(n43).
+-guilty(n44).
+-guilty(n45).
+-guilty(n46).
+-guilty(n47).
+-guilty(n48).
+-guilty(n49).
+-guilty(n50).
+-guilty(n51).
+-guilty(n52).
+-guilty(n53).
+-guilty(n54).
+-guilty(n55).
+-guilty(n56).
+-guilty(n57).
+-guilty(n58).
+-guilty(n59).
+-guilty(n60).
+-guilty(n61).
+-guilty(n62).
+-guilty(n63).
+-guilty(n64).
+-guilty(n65).
+-guilty(n66).
+-guilty(n67).
+-guilty(n68).
+-guilty(n69).
+-guilty(n70).
+-guilty(n71).
+-guilty(n72).
+-guilty(n73).
+-guilty(n74).
+-guilty(n75).
+-guilty(n76).
+-guilty(n77).
+-guilty(n78).
+-guilty(n79).
+-guilty(n80).
+-guilty(n81).
+-guilty(n82).
+-guilty(n83).
+-guilty(n84).
+-guilty(n85).
+-guilty(n86).
+-guilty(n87).
+-guilty(n88).
+-guilty(n89).
+-guilty(n90).
+-guilty(n91).
+-guilty(n92).
+-guilty(n93).
+-guilty(n94).
+-guilty(n95).
+-guilty(n96).
+-guilty(n97).
+-guilty(n98).
+-guilty(n99).
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-30 19:06:28
|
Revision: 120
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=120&view=rev
Author: jenslehmann
Date: 2007-08-30 12:03:36 -0700 (Thu, 30 Aug 2007)
Log Message:
-----------
small fixes
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-30 18:57:02 UTC (rev 119)
+++ trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-30 19:03:36 UTC (rev 120)
@@ -256,8 +256,9 @@
statDetailsString += "example: " + examples[exampleNr] + "\n";
statDetailsString += "algorithm: " + algorithms[algorithmNr] + "\n";
statDetailsString += "learned concept: " + learningAlgorithm.getBestSolution() + "\n";
- statDetailsString += "concept length: " + length.getMean() + "\n";
- statDetailsString += "runtime: " + Helper.prettyPrintNanoSeconds(Math.round(runtime.getMean())) + "\n\n";
+ statDetailsString += "classification: " + classificationRatePercent + "\n";
+ statDetailsString += "concept length: " + conceptLength + "\n";
+ statDetailsString += "runtime: " + Helper.prettyPrintNanoSeconds(algorithmTime) + "\n\n";
Main.createFile(statDetailsFile, statDetailsString);
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-30 18:57:18
|
Revision: 119
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=119&view=rev
Author: jenslehmann
Date: 2007-08-30 11:57:02 -0700 (Thu, 30 Aug 2007)
Log Message:
-----------
added detailed statistics and incremental statistics updates
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-30 06:16:51 UTC (rev 118)
+++ trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-30 18:57:02 UTC (rev 119)
@@ -99,21 +99,23 @@
String gnuplotBaseDir = "log/gnuplot/";
String statBaseDir = "log/stat/";
- File[] confFiles = new File[6];
+ File[] confFiles = new File[7];
confFiles[0] = new File(exampleBaseDir + "trains", "trains_owl.conf");
- confFiles[1] = new File(exampleBaseDir + "moral_reasoner", "moral_43examples_owl.conf");
- confFiles[2] = new File(exampleBaseDir + "moral_reasoner", "moral_43examples_complex_owl.conf");
- confFiles[3] = new File(exampleBaseDir + "poker", "pair_owl.conf");
- confFiles[4] = new File(exampleBaseDir + "poker", "straight_owl.conf");
- confFiles[5] = new File(exampleBaseDir + "forte", "forte_uncle_owl.conf");
+ confFiles[1] = new File(exampleBaseDir + "arch", "arch_owl.conf");
+ confFiles[2] = new File(exampleBaseDir + "moral_reasoner", "moral_43examples_owl.conf");
+ confFiles[3] = new File(exampleBaseDir + "moral_reasoner", "moral_43examples_complex_owl.conf");
+ confFiles[4] = new File(exampleBaseDir + "poker", "pair_owl.conf");
+ confFiles[5] = new File(exampleBaseDir + "poker", "straight_owl.conf");
+ confFiles[6] = new File(exampleBaseDir + "forte", "forte_uncle_owl.conf");
- String[] examples = new String[6];
+ String[] examples = new String[7];
examples[0] = "trains";
- examples[1] = "moral reasoner (43 examples, simple)";
- examples[2] = "moral reasoner (43 examples, complex)";
- examples[3] = "poker (49 examples, pair)";
- examples[4] = "poker (55 examples, straight)";
- examples[5] = "uncle (FORTE data set)";
+ examples[1] = "arches";
+ examples[2] = "moral reasoner (43 examples, simple)";
+ examples[3] = "moral reasoner (43 examples, complex)";
+ examples[4] = "poker (49 examples, pair)";
+ examples[5] = "poker (55 examples, straight)";
+ examples[6] = "uncle (FORTE data set)";
String[] algorithms = new String[3];
algorithms[0] = "refinement";
@@ -133,7 +135,9 @@
//}
File statFile = new File(statBaseDir, "statistics.txt");
+ File statDetailsFile = new File(statBaseDir, "statistics_details.txt");
String statString = "**automatically generated statistics**\n\n";
+ String statDetailsString = statString;
// just set default options
ConfigurationManager confMgr = new ConfigurationManager();
@@ -197,7 +201,7 @@
LearningAlgorithm learningAlgorithm = null;
if(algorithmNr==0) {
Config.algorithm = Algorithm.REFINEMENT;
- Config.Refinement.heuristic = Config.Refinement.Heuristic.FLEXIBLE;
+ // Config.Refinement.heuristic = Config.Refinement.Heuristic.FLEXIBLE;
Config.Refinement.horizontalExpansionFactor = 0.6;
Config.Refinement.quiet = true;
Config.percentPerLengthUnit = 0.05;
@@ -247,20 +251,29 @@
runtime.addNumber(algorithmTime);
// free knowledge base to avoid memory leaks
- ((DIGReasoner) reasoner).releaseKB();
+ ((DIGReasoner) reasoner).releaseKB();
+
+ statDetailsString += "example: " + examples[exampleNr] + "\n";
+ statDetailsString += "algorithm: " + algorithms[algorithmNr] + "\n";
+ statDetailsString += "learned concept: " + learningAlgorithm.getBestSolution() + "\n";
+ statDetailsString += "concept length: " + length.getMean() + "\n";
+ statDetailsString += "runtime: " + Helper.prettyPrintNanoSeconds(Math.round(runtime.getMean())) + "\n\n";
- }
+ Main.createFile(statDetailsFile, statDetailsString);
+
+ } // end run loop
statString += "algorithm: " + algorithms[algorithmNr] + " (runs: " + algorithmRuns[algorithmNr] + ")\n";
statString += "classification: " + classification.getMean() + "% (standard deviation: " + classification.getStandardDeviation() + "%)\n";
statString += "concept length: " + length.getMean() + " (standard deviation: " + length.getStandardDeviation() + ")\n";
statString += "runtime: " + Helper.prettyPrintNanoSeconds(Math.round(runtime.getMean())) + " (standard deviation: " + Helper.prettyPrintNanoSeconds(Math.round(runtime.getStandardDeviation())) + ")\n\n";
- }
-
- }
+ Main.createFile(statFile, statString);
+
+ } // end algorithm loop
+
+ } // end example loop
- Main.createFile(statFile, statString);
}
private static Map<URL, OntologyFileFormat> getImports(List<List<String>> functionCalls, File confFile) {
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-30 06:17:05
|
Revision: 118
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=118&view=rev
Author: jenslehmann
Date: 2007-08-29 23:16:51 -0700 (Wed, 29 Aug 2007)
Log Message:
-----------
statistical settings updated
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-29 17:15:31 UTC (rev 117)
+++ trunk/src/dl-learner/org/dllearner/utilities/PaperStatistics.java 2007-08-30 06:16:51 UTC (rev 118)
@@ -208,7 +208,7 @@
Config.GP.selectionType = GP.SelectionType.RANK_SELECTION;
Config.GP.generations = 50;
Config.GP.useFixedNumberOfGenerations = true;
- Config.GP.numberOfIndividuals = 401;
+ Config.GP.numberOfIndividuals = 201;
Config.GP.refinementProbability = 0;
Config.GP.mutationProbability = 0.02;
Config.GP.crossoverProbability = 0.8;
@@ -221,7 +221,7 @@
Config.GP.selectionType = GP.SelectionType.RANK_SELECTION;
Config.GP.generations = 50;
Config.GP.useFixedNumberOfGenerations = true;
- Config.GP.numberOfIndividuals = 401;
+ Config.GP.numberOfIndividuals = 201;
Config.GP.refinementProbability = 0.65;
Config.GP.mutationProbability = 0.02;
Config.GP.crossoverProbability = 0.2;
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-29 18:38:34
|
Revision: 95
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=95&view=rev
Author: jenslehmann
Date: 2007-08-28 07:56:37 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
added overview about configuration options
Added Paths:
-----------
trunk/doc/configOptions.txt
Added: trunk/doc/configOptions.txt
===================================================================
--- trunk/doc/configOptions.txt (rev 0)
+++ trunk/doc/configOptions.txt 2007-08-28 14:56:37 UTC (rev 95)
@@ -0,0 +1,294 @@
+Configuration Files
+===================
+
+This file gives an overview for running DL-Learner using configuration files
+as provided in the examples directory.
+
+The background knowledge can either be given as OWL DL file (using the import
+function in the configuration files) or by specifying it directly in the
+configuration file (which we refer to as the internal knowledge base).
+
+Some examples of the syntax of the background knowledge in the internal
+knowledge base:
+
+person = (male OR female).
+mother = (female AND EXISTS hasChild.TOP).
+motherManyDaughters = (female AND >= 4 hasChild.female).
+(mother AND father) SUBCLASSOF person.
+
+Also see the example files.
+
+This is the EBNF description of the input language [slightly outdated]:
+
+Number = ["1"-"9"] (["0"-"9"])*
+Id = ["a"-"z"] (["_","a"-"z","A"-"Z","0"-"9"])*
+String: "\"" (~["\"","\\","\n","\r"])* "\""
+Instruction = ConfOption
+ | FunctionCall
+ | PosExample
+ | NegExample
+ | ABoxConcept
+ | ABoxRole
+ | Transitive
+ | Functional
+ | Symmetric
+ | Inverse
+ | Subrole
+ | TBoxEquiv
+ | TBoxSub
+ConfOption = Id [ "." Id ] "=" ( Id | Number ) ";"
+FunctionCall = Id "(" String ")" ";"
+PosExample = "+" Id "(" Id ")" "."
+NegExample = "-" Id "(" Id ")" "."
+ABoxConcept = Concept "(" Id ")" "."
+ABoxRole = Id "(" Id "," Id ")" "."
+Transitive = "Transitive" "(" Id ")" "."
+Functional = "Functional" "(" Id ")" "."
+Symmetric = "Symmetric" "(" Id ")" "."
+Inverse = "Inverse" "(" Id "," Id ")" "."
+Subrole = "Subrole" "(" Id "," Id ")" "."
+TBoxEquiv = Concept "=" Concept "."
+TBoxSub = Concept ("SUBCLASSOF" | "SUB" ) Concept "."
+Concept = "TOP"
+ | "BOTTOM"
+ | Id
+ | "(" Concept "AND" Concept ")"
+ | "(" Concept "OR" Concept ")"
+ | "EXISTS" Id "." Concept
+ | "ALL" Id "." Concept
+ | "NOT" Concept
+ | ">=" Number Id "." Concept
+ | "<=" Number Id "." Concept
+
+Configuration Options
+=====================
+
+General
+-------
+
+Option: algorithm
+Possible Values: bruteForce, gp, random, refinement, hybridGP
+Default: refinement
+Effect: Specifies the algorithm to use for solving the learning problem. Note,
+ that hybridGP is not an algorithm itself, but starts the GP algorithm
+ with a sensible set of default values for the hybrid algorithm combining
+ GP with refinement operators. In particular the probability of all
+ operators except refinement is set to 0.
+
+Option: reasoner
+Possible Values: dig, kaon2, fastRetrieval
+Default: dig
+Effect: Specifies the reasoner to be used. DIG communicates with a reasoner
+ using the DIG Interface. KAON2 means to use the KAON2 Java API directly.
+ FastRetrieval is an internal algorithm, which can only be used for
+ retrieval (not for subsumption). Currently the DIG reasoner cannot read
+ OWL files.
+
+Option: digReasonerURL
+Possible Values: a valid URL
+Default: http://localhost:8081
+Effect: Specifies the URL to be used to look for a DIG capable reasoner.
+
+Option: writeDIGProtocol
+Possible Values: true, false
+Default: false
+Effect: Specifies whether to store all DIG communication.
+
+Option: digProtocolFile
+Possible Values: strings
+Default: digProtocol.txt
+Effect: The file to store all DIG communication if writeDIGProtocol is true.
+
+Option: useRetrievalForClassification
+Possible Values: true, false
+Default: false
+Effect: To measure which concepts are covered, one can either use one retrieval
+ or several instance checks (at most one for each example). This option
+ controls which of both options should be used.
+
+Option: percentPerLengthUnit
+Possible Values: 0-1
+Default: 0.05
+Effect: How much percent (wrt classification accuracy) can a concept be worse to
+ justify an increase in length of 1. This variable is used for GP and in
+ refinement when the flexible heuristic is used. For GP, you should use a
+ value smaller than the default.
+
+> general options below are ignored <
+> by the refinement operator algorithm <
+
+Option: accuracyPenalty
+Possible Values: 1-1000
+Default: 1
+Effect: Sets the penalty for "small misclassifications".
+
+Option: errorPenalty
+Possible Values: 1-1000
+Default: 3
+Effect: Sets the penalty for classification errors.
+
+Option: maxLength
+Possible Values: 1-20
+Default: 7
+Effect: For the brute force learner this specifies the depth limit for the
+ search. The GP learner currently ignores it.
+
+Option: scoreMethod
+Possible Values: full, positive
+Default: positive
+Effect: The positive score method ignores if a negative examples cannot be
+ classified. This is often usefull, because of the limited expressiveness
+ of SHIQ wrt. negated role assertions. The full method penalizes this.
+
+Option: showCorrectClassifications
+Possible Values: true, false
+Default: false
+Effect: Controls if correct classifications are printed (does not effect the
+ algorithm).
+
+Option: penalizeNeutralExamples
+Possible Values: true, false
+Default: false
+Effect: If true there is a penalty if a neutral (neither positive nor negative)
+ individual is classified as either positive or negative. This should
+ usually be set to false.
+
+Refinement Operator Algorithm Specific
+--------------------------------------
+
+Option: refinement.horizontalExpansionFactor
+Possible Values: 0-1
+Default: 0.6
+Effect: Specifies horizontal expansion factor.
+
+Option: refinement.writeSearchTree
+Possible Values: true, false
+Default: false
+Effect: Specifies whether to write the search tree to a file.
+
+Option: refinement.searchTreeFile
+Possible Values: strings
+Default: "searchTree.txt"
+Effect: Specifies a file to save the current search tree after each loop of
+ the refinement algorithm.
+
+Option: refinement.heuristic
+Possible Values: flexible, lexicographic
+Default: lexicographic
+Effect: The refinement operator together with a heuristic yields a learning
+ algorithm. The lexicographic heuristic uses a lexicographic order of
+ covered negative examples and horizontal expansion of a node (i.e.
+ the covered examples are the first criterion, the horizontal expansion
+ the second criterion). The flexible heuristic computes a combined node
+ score of both criteria. Note, that the lexicographic needs a horizontal
+ expansion factor greater than 0 to ensure correctness of the learning
+ algorithm.
+
+Option: refinement.quiet
+Possible Values: true, false
+Default: false
+Effect: If set to true, no messages will be shown during the run of the
+ algorithm (but there will still be startup and summary messages).
+
+Option: refinement.applyAllFilter
+Possible Values: true, false
+Default: true
+Effect: Specifies wether all equivalences should be used.
+
+Option: refinement.applyExistsFilter
+Possible Values: true, false
+Default: true
+Effect: Specifies wether exists equivalences should be used.
+
+Option: refinement.useTooWeakList
+Possible Values: true, false
+Default: true
+Effect: Specifies wether a too weak list should be used to reduce reasoner
+ requests.
+
+Option: refinement.useOverlyGeneralList
+Possible Values: true, false
+Default: true
+Effect: Specifies wether an overly general list should be used to reduce
+ reasoner requests.
+
+Option: refinement.useShortConceptConstruction
+Possible Values: true, false
+Default: true
+Effect: Specifies wether the algorithm should try to reduce a concept to a
+ known more general concept to reduce the number of necessary
+ subsumption checks for the reasoner.
+
+Option: refinement.useDIGMultiInstanceChecks
+Possible Values: never, twoChecks, oneCheck
+Default: twoChecks
+Effect: The DIG protocol allows to send several queries to a DIG reasoner at
+ once. [This is automatically done for subsumption tests.] However,
+ for instance checks this has the disadvantage that it may not be
+ necessary to send all instance to the DIG reasoner if one of the
+ positive examples is not covered (meaning that the concept is
+ classified as too weak).
+ If the option is set to never, then each instance check is send
+ separately.
+ If the option is set to twoChecks, then first all positive examples will
+ be send in one query. If all of them are covered, i.e. the concept is
+ not classified as too weak, then all the negative examples are send in
+ one query.
+ If the option is set to oneCheck, then all examples will be send in one
+ query.
+
+Genetic Programming Specific
+----------------------------
+
+Option: gp.algorithmType
+Possible Values: steadyState, generational
+Default: steadyState
+Effect: Uses either a steady state (population partly replaced) or generational
+ (population completely replaced) algorithm.
+
+Option: gp.elitism
+Possible Values: true, false
+Default: true
+Effect: If true an the GP algorithm uses elitism, i.e. the best individual is
+ guarenteed to survive.
+
+Option: gp.numberOfIndividuals
+Possible Values: 1-1000000
+Default: 1000
+Effect: Sets the number of individuals in the population. A higher value
+ improves classification, but is computationally more expensive.
+
+Option: gp.numberOfSelectedIndividuals
+Possible Values: 1-1000000
+Default: 960
+Effect: Sets the number of individuals, which are selected for replacement in a
+ steady state GP algorithm.
+
+Option: gp.crossoverPercent
+Possible Values: 0-100
+Default: 95
+Effect: The probability that offspring is produced using crossover (in contrast
+ to simply being copied over to the next generation).
+
+Option: gp.mutationPercent
+Possible Values: 0-100
+Default: 3
+Effect: The probability that offspring is mutated after reproduction.
+
+Option: gp.hillClimbingPercent
+Possible Values: 0-100
+Default: 0
+Effect: The probability that offspring is produced using the hill climbing
+ operator.
+
+Option: gp.refinementPercent
+Possible Values: 0-100
+Default: 0
+Effect: The probability that offspring is produced using the genetic refinement
+ operator.
+
+Option: gp.postConvergenceGenerations
+Possible Values: 10-1000
+Default: 50
+Effect: If the algorithm does not find a better solution for this number of
+ generations it stops.
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2007-08-29 18:14:26
|
Revision: 89
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=89&view=rev
Author: kurzum
Date: 2007-08-28 06:43:52 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
removed echo
Modified Paths:
--------------
trunk/build.xml
Modified: trunk/build.xml
===================================================================
--- trunk/build.xml 2007-08-28 13:42:16 UTC (rev 88)
+++ trunk/build.xml 2007-08-28 13:43:52 UTC (rev 89)
@@ -177,9 +177,9 @@
<map from="${removeprefix}" to="."/>
</pathconvert>
- <echo message="${removeprefix}"/>
+ <!--<echo message="${removeprefix}"/>
<echo message="${pathStringUnix}"/>
- <echo message="${pathStringWin}"/>
+ <echo message="${pathStringWin}"/>-->
<echo file="bin/quickstart.bat" message="java -cp ${pathStringWin} org.dllearner.QuickStart"/>
<echo file="bin/dllearner.bat" message="java -cp ${pathStringWin} org.dllearner.parser.DLLearner %*"/>
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-29 18:14:03
|
Revision: 93
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=93&view=rev
Author: jenslehmann
Date: 2007-08-28 07:38:05 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
distinguished between standard and developers release (includes source and developer documentation)
+ some smaller improvements
Modified Paths:
--------------
trunk/build.xml
Modified: trunk/build.xml
===================================================================
--- trunk/build.xml 2007-08-28 14:32:08 UTC (rev 92)
+++ trunk/build.xml 2007-08-28 14:38:05 UTC (rev 93)
@@ -13,21 +13,10 @@
<property name="release_tmp_dir" value="release/${version_dir}" />
<property name="release_php_client_tmp_dir" value="release/php-client-${today}" />
-
+ <!-- KAON2 must not be distributed with the official release -->
<property name="kaon2" value="${lib_dir}/kaon2.jar"/>
- <property name="xbean" value="${lib_dir}/xbean.jar"/>
- <property name="dig1.1_xmlbeans" value="${lib_dir}/dig1.1-xmlbeans.jar"/>
- <property name="sparql" value="${lib_dir}/modules/sparqlModule.jar"/>
-
- <property name="jena" value="${lib_dir}/jena/jena.jar"/>
-
- <property name="owlapi-api" value="${lib_dir}/owlapi/owlapi-api.jar"/>
- <property name="owlapi-apibinding" value="${lib_dir}/owlapi/owlapi-apibinding.jar"/>
- <property name="owlapi-dig1_1" value="${lib_dir}/owlapi/owlapi-dig1_1.jar"/>
-
- <!-- setup classpath -->
-
-
+
+ <!-- set up classpath -->
<path id="classpath">
<pathelement location="."/>
<fileset dir="${lib_dir}">
@@ -39,7 +28,7 @@
</path>
<!-- build target -->
- <target name="build" depends="createScripts">
+ <target name="build" depends="createScripts,javadoc">
<!-- write current build date into Info.java -->
<echo file="${source_dir}/org/dllearner/Info.java" append="false">
@@ -81,6 +70,17 @@
<!-- create file containing the build info -->
<echo file="${release_tmp_dir}/build.txt" append="false">DL-Leaner Build ${today}</echo>
+ <!-- create empty log directory for release -->
+ <mkdir dir="${release_tmp_dir}/log" />
+
+ <!-- copy documentation excluding developer documentation -->
+ <copy toDir="${release_tmp_dir}/doc">
+ <fileset dir="doc">
+ <exclude name="eclipse/" />
+ <exclude name="javadoc/" />
+ </fileset>
+ </copy>
+
<!-- create tar.gz files (allows storing whether a file is executable) -->
<tar longfile="gnu" destfile="dllearner_${today}.tar.gz" compression="gzip">
<!-- extra set for executable files -->
@@ -102,8 +102,16 @@
<fileset dir="${source_dir}" includes="**/*.java,**/*.jjt,build.xml"/>
</copy>
- <!-- create backup (= standard build + source code) -->
- <tar longfile="gnu" destfile="backup_dllearner_${today}.tar.gz" compression="gzip">
+ <!-- create copy developer documentation -->
+ <copy todir="${release_tmp_dir}/doc/eclipse/">
+ <fileset dir="doc/eclipse/"/>
+ </copy>
+ <copy todir="${release_tmp_dir}/doc/javadoc/">
+ <fileset dir="doc/javadoc/"/>
+ </copy>
+
+ <!-- create backup (= standard build + source code + developer documentation) -->
+ <tar longfile="gnu" destfile="dllearner_developer_${today}.tar.gz" compression="gzip">
<tarfileset dir="release/" mode="755">
<include name="${version_dir}/dllearner" />
<include name="${version_dir}/quickstart" />
@@ -144,6 +152,7 @@
<delete dir="release" />
</target>
+ <!-- generate JAXWS classes -->
<target name="wsgen" >
<path id="wsgen">
<path refid="classpath"/>
@@ -160,38 +169,31 @@
</exec>
</target>
-
-
+ <!-- generate startup scripts -->
<target name="createScripts" >
<path id="addjar">
<path refid="classpath"/>
<pathelement location="${lib_dir}/dllearner.jar"/>
</path>
- <path id="removeprefix"><pathelement location="."/> </path>
- <pathconvert refid="removeprefix" property="removeprefix" />
-
- <pathconvert refid="addjar" property="pathStringUnix" targetos="unix">
- <map from="${removeprefix}" to="."/>
- </pathconvert>
- <pathconvert refid="addjar" property="pathStringWin" targetos="windows">
- <map from="${removeprefix}" to="."/>
- </pathconvert>
+ <path id="removeprefix"><pathelement location="."/> </path>
+ <pathconvert refid="removeprefix" property="removeprefix" />
+
+ <pathconvert refid="addjar" property="pathStringUnix" targetos="unix">
+ <map from="${removeprefix}" to="."/>
+ </pathconvert>
+ <pathconvert refid="addjar" property="pathStringWin" targetos="windows">
+ <map from="${removeprefix}" to="."/>
+ </pathconvert>
- <!--<echo message="${removeprefix}"/>
- <echo message="${pathStringUnix}"/>
- <echo message="${pathStringWin}"/>-->
-
- <echo file="bin/quickstart.bat" message="java -cp ${pathStringWin} org.dllearner.QuickStart"/>
- <echo file="bin/dllearner.bat" message="java -cp ${pathStringWin} org.dllearner.parser.DLLearner %*"/>
- <echo file="bin/ws.bat" message="java -cp ${pathStringWin} org.dllearner.server.DLLearnerWSStart %*"/>
- <echo file="bin/quickstart" message="java -cp ${pathStringUnix} org.dllearner.QuickStart"/>
- <echo file="bin/dllearner" message="java -cp ${pathStringUnix} org.dllearner.parser.DLLearner $@"/>
- <echo file="bin/ws" message="java -cp ${pathStringUnix} org.dllearner.server.DLLearnerWSStart $@"/>
-
+ <echo file="bin/quickstart.bat" message="java -cp ${pathStringWin} org.dllearner.QuickStart"/>
+ <echo file="bin/dllearner.bat" message="java -cp ${pathStringWin} org.dllearner.parser.DLLearner %*"/>
+ <echo file="bin/ws.bat" message="java -cp ${pathStringWin} org.dllearner.server.DLLearnerWSStart %*"/>
+ <echo file="bin/quickstart" message="java -cp ${pathStringUnix} org.dllearner.QuickStart"/>
+ <echo file="bin/dllearner" message="java -cp ${pathStringUnix} org.dllearner.parser.DLLearner $@"/>
+ <echo file="bin/ws" message="java -cp ${pathStringUnix} org.dllearner.server.DLLearnerWSStart $@"/>
</target>
-
-
+ <!-- generate Javadoc -->
<target name="javadoc">
<pathconvert refid="classpath" property="jdocclasspath"/>
<!--classpath="library/owlapi/antlr-runtime-3.0.jar:library/owlapi/owlapi-rdfxmlparser.jar:library/owlapi/owlapi-owlxmlrenderer.jar:library/owlapi/owlapi-mansyntaxrenderer.jar:library/owlapi/owlapi-metrics.jar:library/owlapi/owlapi-owlxmlparser.jar:library/owlapi/owlapi-change.jar:library/owlapi/owlapi-rdfxmlrenderer.jar:library/owlapi/owlapi-apibinding.jar:library/xbean.jar:library/owlapi/owlapi-oboparser.jar:library/jena/jena.jar:library/owlapi/commons-lang-2.2.jar:library/jena/commons-logging.jar:library/owlapi/owlapi-dig1_1.jar:library/owlapi/owlapi-api.jar:library/owlapi/owlapi-debugging.jar:library/jena/iri.jar:library/kaon2.jar:library/jena/xercesImpl.jar:library/owlapi/owlapi-krssparser.jar:library/jena/antlr-2.7.5.jar:library/owlapi/owlapi-functionalrenderer.jar:library/modules/sparqlModule.jar:library/owlapi/owlapi-mansyntaxparser.jar:library/jena/icu4j_3_4.jar:library/owlapi/owlapi-util.jar:library/dig1.1-xmlbeans.jar:library/jena/concurrent.jar:library/owlapi/owlapi-functionalparser.jar:library/owlapi/owlapi-impl.jar:library/owlapi/owlapi-rdfapi.jar" -->
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2007-08-29 18:14:00
|
Revision: 91
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=91&view=rev
Author: kurzum
Date: 2007-08-28 07:06:01 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
Modified Paths:
--------------
trunk/examples/forte/forte.conf
Modified: trunk/examples/forte/forte.conf
===================================================================
--- trunk/examples/forte/forte.conf 2007-08-28 14:03:01 UTC (rev 90)
+++ trunk/examples/forte/forte.conf 2007-08-28 14:06:01 UTC (rev 91)
@@ -16,7 +16,7 @@
algorithm = hybridGP;
gp.algorithmType = generational;
-gp.numberOfIndividuals = 100;
+gp.numberOfIndividuals = 101;
// gp.selectionType = tournament;
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-29 18:09:50
|
Revision: 94
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=94&view=rev
Author: jenslehmann
Date: 2007-08-28 07:54:28 -0700 (Tue, 28 Aug 2007)
Log Message:
-----------
created README and INSTALL release files
Modified Paths:
--------------
trunk/INSTALL
trunk/README
Modified: trunk/INSTALL
===================================================================
--- trunk/INSTALL 2007-08-28 14:38:05 UTC (rev 93)
+++ trunk/INSTALL 2007-08-28 14:54:28 UTC (rev 94)
@@ -1 +1,37 @@
-
+Requirements
+============
+Java 6 and a reasoner is required.
+
+Installation
+============
+No further installation is necessary. Just download and extract DL-Learner.
+
+Running Instructions
+====================
+The instructions assume that you have a usable reasoner running (usually a
+DIG capable reasoner running on http://localhost:8081).
+
+Linux (and other systems)
+
+Make sure the file "dllearner" is executable and run it on the command line
+followed by the name of the file to process, e.g.
+"./dllearner examples/father.conf".
+
+Windows:
+
+Run "dllearner.bat" followed by the name of the file to process, e.g.
+"dllearner.bat examples/father.conf".
+
+All:
+
+You can use the "java" command to run the program directly. Have a look at
+"dllearner" and "dllearner.bat" to see what the command looks like.
+
+Web-Service
+===========
+
+If you want to run DL-Learner as a Web Service, you can run the scripts "ws" or
+"ws.bat". They create an own local webserver running DL-Learner. An example
+PHP client is also provided by DL-Learner. It can be downloaded at the
+sourceforge.net project website:
+http://sourceforge.net/project/showfiles.php?group_id=203619
Modified: trunk/README
===================================================================
--- trunk/README 2007-08-28 14:38:05 UTC (rev 93)
+++ trunk/README 2007-08-28 14:54:28 UTC (rev 94)
@@ -1,319 +1,14 @@
-DL-Learner ist a program to learn Description Logic concepts from positive and
-negative examples.
-
-Requirements
-============
-
-Java 6 is required. No installation is necessary. Just download and extract
-DL-Learner.
-
-Instructions
-============
-
-Linux (and other systems)
-
-Make sure the file "dllearner" is executable and run it on the command line
-followed by the name of the file to process, e.g.
-"./dllearner examples/father.conf".
-
-Windows:
-
-Run "dllearner.bat" followed by the name of the file to process, e.g.
-"dllearner.bat examples/father.conf".
-
-All:
-
-You can use the "java" command to run the program directly. Have a look at
-"dllearner" and "dllearner.bat" to see what the command looks like.
-
-Syntax
+README
======
-The background knowledge can either be given as OWL DL file (using the import
-function in the configuration files) or by specifying it directly in the
-configuration file (which we refer to as the internal knowledge base).
+DL-Learner ist a tool to learn Description Logic concepts from positive and
+negative examples. Equivalently, it can learn OWL classes given objects as
+positive and negative instances.
-Some examples of the syntax of the background knowledge in the internal
-knowledge base:
+Homepage: http://dl-learner.org
+Sourceforge.net Project Page: http://sourceforge.net/projects/dl-learner/
+Bugs & Feature Requests: http://sourceforge.net/tracker/?group_id=203619
+Mailing Lists: http://sourceforge.net/mail/?group_id=203619
+Latest Release: http://sourceforge.net/project/showfiles.php?group_id=203619
-person = (male OR female).
-mother = (female AND EXISTS hasChild.TOP).
-motherManyDaughters = (female AND >= 4 hasChild.female).
-(mother AND father) SUBCLASSOF person.
-
-Also see the example files.
-
-This is the EBNF description of the input language [slightly outdated]:
-
-Number = ["1"-"9"] (["0"-"9"])*
-Id = ["a"-"z"] (["_","a"-"z","A"-"Z","0"-"9"])*
-String: "\"" (~["\"","\\","\n","\r"])* "\""
-Instruction = ConfOption
- | FunctionCall
- | PosExample
- | NegExample
- | ABoxConcept
- | ABoxRole
- | Transitive
- | Functional
- | Symmetric
- | Inverse
- | Subrole
- | TBoxEquiv
- | TBoxSub
-ConfOption = Id [ "." Id ] "=" ( Id | Number ) ";"
-FunctionCall = Id "(" String ")" ";"
-PosExample = "+" Id "(" Id ")" "."
-NegExample = "-" Id "(" Id ")" "."
-ABoxConcept = Concept "(" Id ")" "."
-ABoxRole = Id "(" Id "," Id ")" "."
-Transitive = "Transitive" "(" Id ")" "."
-Functional = "Functional" "(" Id ")" "."
-Symmetric = "Symmetric" "(" Id ")" "."
-Inverse = "Inverse" "(" Id "," Id ")" "."
-Subrole = "Subrole" "(" Id "," Id ")" "."
-TBoxEquiv = Concept "=" Concept "."
-TBoxSub = Concept ("SUBCLASSOF" | "SUB" ) Concept "."
-Concept = "TOP"
- | "BOTTOM"
- | Id
- | "(" Concept "AND" Concept ")"
- | "(" Concept "OR" Concept ")"
- | "EXISTS" Id "." Concept
- | "ALL" Id "." Concept
- | "NOT" Concept
- | ">=" Number Id "." Concept
- | "<=" Number Id "." Concept
-
-Configuration Options
-=====================
-
-General
--------
-
-Option: algorithm
-Possible Values: bruteForce, gp, random, refinement, hybridGP
-Default: refinement
-Effect: Specifies the algorithm to use for solving the learning problem. Note,
- that hybridGP is not an algorithm itself, but starts the GP algorithm
- with a sensible set of default values for the hybrid algorithm combining
- GP with refinement operators. In particular the probability of all
- operators except refinement is set to 0.
-
-Option: reasoner
-Possible Values: dig, kaon2, fastRetrieval
-Default: dig
-Effect: Specifies the reasoner to be used. DIG communicates with a reasoner
- using the DIG Interface. KAON2 means to use the KAON2 Java API directly.
- FastRetrieval is an internal algorithm, which can only be used for
- retrieval (not for subsumption). Currently the DIG reasoner cannot read
- OWL files.
-
-Option: digReasonerURL
-Possible Values: a valid URL
-Default: http://localhost:8081
-Effect: Specifies the URL to be used to look for a DIG capable reasoner.
-
-Option: writeDIGProtocol
-Possible Values: true, false
-Default: false
-Effect: Specifies whether to store all DIG communication.
-
-Option: digProtocolFile
-Possible Values: strings
-Default: digProtocol.txt
-Effect: The file to store all DIG communication if writeDIGProtocol is true.
-
-Option: useRetrievalForClassification
-Possible Values: true, false
-Default: false
-Effect: To measure which concepts are covered, one can either use one retrieval
- or several instance checks (at most one for each example). This option
- controls which of both options should be used.
-
-Option: percentPerLengthUnit
-Possible Values: 0-1
-Default: 0.05
-Effect: How much percent (wrt classification accuracy) can a concept be worse to
- justify an increase in length of 1. This variable is used for GP and in
- refinement when the flexible heuristic is used. For GP, you should use a
- value smaller than the default.
-
-> general options below are ignored <
-> by the refinement operator algorithm <
-
-Option: accuracyPenalty
-Possible Values: 1-1000
-Default: 1
-Effect: Sets the penalty for "small misclassifications".
-
-Option: errorPenalty
-Possible Values: 1-1000
-Default: 3
-Effect: Sets the penalty for classification errors.
-
-Option: maxLength
-Possible Values: 1-20
-Default: 7
-Effect: For the brute force learner this specifies the depth limit for the
- search. The GP learner currently ignores it.
-
-Option: scoreMethod
-Possible Values: full, positive
-Default: positive
-Effect: The positive score method ignores if a negative examples cannot be
- classified. This is often usefull, because of the limited expressiveness
- of SHIQ wrt. negated role assertions. The full method penalizes this.
-
-Option: showCorrectClassifications
-Possible Values: true, false
-Default: false
-Effect: Controls if correct classifications are printed (does not effect the
- algorithm).
-
-Option: penalizeNeutralExamples
-Possible Values: true, false
-Default: false
-Effect: If true there is a penalty if a neutral (neither positive nor negative)
- individual is classified as either positive or negative. This should
- usually be set to false.
-
-Refinement Operator Algorithm Specific
---------------------------------------
-
-Option: refinement.horizontalExpansionFactor
-Possible Values: 0-1
-Default: 0.6
-Effect: Specifies horizontal expansion factor.
-
-Option: refinement.writeSearchTree
-Possible Values: true, false
-Default: false
-Effect: Specifies whether to write the search tree to a file.
-
-Option: refinement.searchTreeFile
-Possible Values: strings
-Default: "searchTree.txt"
-Effect: Specifies a file to save the current search tree after each loop of
- the refinement algorithm.
-
-Option: refinement.heuristic
-Possible Values: flexible, lexicographic
-Default: lexicographic
-Effect: The refinement operator together with a heuristic yields a learning
- algorithm. The lexicographic heuristic uses a lexicographic order of
- covered negative examples and horizontal expansion of a node (i.e.
- the covered examples are the first criterion, the horizontal expansion
- the second criterion). The flexible heuristic computes a combined node
- score of both criteria. Note, that the lexicographic needs a horizontal
- expansion factor greater than 0 to ensure correctness of the learning
- algorithm.
-
-Option: refinement.quiet
-Possible Values: true, false
-Default: false
-Effect: If set to true, no messages will be shown during the run of the
- algorithm (but there will still be startup and summary messages).
-
-Option: refinement.applyAllFilter
-Possible Values: true, false
-Default: true
-Effect: Specifies wether all equivalences should be used.
-
-Option: refinement.applyExistsFilter
-Possible Values: true, false
-Default: true
-Effect: Specifies wether exists equivalences should be used.
-
-Option: refinement.useTooWeakList
-Possible Values: true, false
-Default: true
-Effect: Specifies wether a too weak list should be used to reduce reasoner
- requests.
-
-Option: refinement.useOverlyGeneralList
-Possible Values: true, false
-Default: true
-Effect: Specifies wether an overly general list should be used to reduce
- reasoner requests.
-
-Option: refinement.useShortConceptConstruction
-Possible Values: true, false
-Default: true
-Effect: Specifies wether the algorithm should try to reduce a concept to a
- known more general concept to reduce the number of necessary
- subsumption checks for the reasoner.
-
-Option: refinement.useDIGMultiInstanceChecks
-Possible Values: never, twoChecks, oneCheck
-Default: twoChecks
-Effect: The DIG protocol allows to send several queries to a DIG reasoner at
- once. [This is automatically done for subsumption tests.] However,
- for instance checks this has the disadvantage that it may not be
- necessary to send all instance to the DIG reasoner if one of the
- positive examples is not covered (meaning that the concept is
- classified as too weak).
- If the option is set to never, then each instance check is send
- separately.
- If the option is set to twoChecks, then first all positive examples will
- be send in one query. If all of them are covered, i.e. the concept is
- not classified as too weak, then all the negative examples are send in
- one query.
- If the option is set to oneCheck, then all examples will be send in one
- query.
-
-Genetic Programming Specific
-----------------------------
-
-Option: gp.algorithmType
-Possible Values: steadyState, generational
-Default: steadyState
-Effect: Uses either a steady state (population partly replaced) or generational
- (population completely replaced) algorithm.
-
-Option: gp.elitism
-Possible Values: true, false
-Default: true
-Effect: If true an the GP algorithm uses elitism, i.e. the best individual is
- guarenteed to survive.
-
-Option: gp.numberOfIndividuals
-Possible Values: 1-1000000
-Default: 1000
-Effect: Sets the number of individuals in the population. A higher value
- improves classification, but is computationally more expensive.
-
-Option: gp.numberOfSelectedIndividuals
-Possible Values: 1-1000000
-Default: 960
-Effect: Sets the number of individuals, which are selected for replacement in a
- steady state GP algorithm.
-
-Option: gp.crossoverPercent
-Possible Values: 0-100
-Default: 95
-Effect: The probability that offspring is produced using crossover (in contrast
- to simply being copied over to the next generation).
-
-Option: gp.mutationPercent
-Possible Values: 0-100
-Default: 3
-Effect: The probability that offspring is mutated after reproduction.
-
-Option: gp.hillClimbingPercent
-Possible Values: 0-100
-Default: 0
-Effect: The probability that offspring is produced using the hill climbing
- operator.
-
-Option: gp.refinementPercent
-Possible Values: 0-100
-Default: 0
-Effect: The probability that offspring is produced using the genetic refinement
- operator.
-
-Option: gp.postConvergenceGenerations
-Possible Values: 10-1000
-Default: 50
-Effect: If the algorithm does not find a better solution for this number of
- generations it stops.
\ No newline at end of file
+DL-Learner is Open Source and licenced unter the GNU General Public License.
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-29 17:15:32
|
Revision: 117
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=117&view=rev
Author: jenslehmann
Date: 2007-08-29 10:15:31 -0700 (Wed, 29 Aug 2007)
Log Message:
-----------
added cache to ignored directories
Property Changed:
----------------
trunk/
Property changes on: trunk
___________________________________________________________________
Name: svn:ignore
- .settings
.project
.classpath
classes
log
+ .settings
.project
.classpath
classes
log
cache
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-29 17:09:47
|
Revision: 116
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=116&view=rev
Author: jenslehmann
Date: 2007-08-29 10:09:40 -0700 (Wed, 29 Aug 2007)
Log Message:
-----------
fixed bug related to role hierarchy
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/server/ClientState.java
Modified: trunk/src/dl-learner/org/dllearner/server/ClientState.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/server/ClientState.java 2007-08-29 16:51:08 UTC (rev 115)
+++ trunk/src/dl-learner/org/dllearner/server/ClientState.java 2007-08-29 17:09:40 UTC (rev 116)
@@ -432,6 +432,7 @@
reasoner.prepareSubsumptionHierarchy();
if (Config.Refinement.improveSubsumptionHierarchy) {
try {
+ reasoner.prepareRoleHierarchy();
reasoner.getSubsumptionHierarchy().improveSubsumptionHierarchy();
} catch (ReasoningMethodUnsupportedException e) {
// solange DIG-Reasoner eingestellt ist, schlägt diese Operation nie fehl
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2007-08-29 16:51:11
|
Revision: 115
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=115&view=rev
Author: jenslehmann
Date: 2007-08-29 09:51:08 -0700 (Wed, 29 Aug 2007)
Log Message:
-----------
modified build script, because sf.net releases are required to include the source code
Modified Paths:
--------------
trunk/build.xml
Modified: trunk/build.xml
===================================================================
--- trunk/build.xml 2007-08-29 16:26:06 UTC (rev 114)
+++ trunk/build.xml 2007-08-29 16:51:08 UTC (rev 115)
@@ -82,7 +82,7 @@
</copy>
<!-- create tar.gz files (allows storing whether a file is executable) -->
- <tar longfile="gnu" destfile="dllearner_${today}.tar.gz" compression="gzip">
+ <tar longfile="gnu" destfile="dllearner-nosource-${today}.tar.gz" compression="gzip">
<!-- extra set for executable files -->
<tarfileset dir="release/" mode="755">
<include name="${version_dir}/dllearner" />
@@ -111,7 +111,7 @@
</copy>
<!-- create backup (= standard build + source code + developer documentation) -->
- <tar longfile="gnu" destfile="dllearner_developer_${today}.tar.gz" compression="gzip">
+ <tar longfile="gnu" destfile="dllearner-${today}.tar.gz" compression="gzip">
<tarfileset dir="release/" mode="755">
<include name="${version_dir}/dllearner" />
<include name="${version_dir}/quickstart" />
@@ -145,7 +145,7 @@
</copy>
<!-- create release -->
- <tar destfile="php_client_${today}.tar.gz" compression="gzip">
+ <tar destfile="php-client-${today}.tar.gz" compression="gzip">
<tarfileset dir="release" />
</tar>
@@ -196,7 +196,6 @@
<!-- generate Javadoc -->
<target name="javadoc">
<pathconvert refid="classpath" property="jdocclasspath"/>
- <!--classpath="library/owlapi/antlr-runtime-3.0.jar:library/owlapi/owlapi-rdfxmlparser.jar:library/owlapi/owlapi-owlxmlrenderer.jar:library/owlapi/owlapi-mansyntaxrenderer.jar:library/owlapi/owlapi-metrics.jar:library/owlapi/owlapi-owlxmlparser.jar:library/owlapi/owlapi-change.jar:library/owlapi/owlapi-rdfxmlrenderer.jar:library/owlapi/owlapi-apibinding.jar:library/xbean.jar:library/owlapi/owlapi-oboparser.jar:library/jena/jena.jar:library/owlapi/commons-lang-2.2.jar:library/jena/commons-logging.jar:library/owlapi/owlapi-dig1_1.jar:library/owlapi/owlapi-api.jar:library/owlapi/owlapi-debugging.jar:library/jena/iri.jar:library/kaon2.jar:library/jena/xercesImpl.jar:library/owlapi/owlapi-krssparser.jar:library/jena/antlr-2.7.5.jar:library/owlapi/owlapi-functionalrenderer.jar:library/modules/sparqlModule.jar:library/owlapi/owlapi-mansyntaxparser.jar:library/jena/icu4j_3_4.jar:library/owlapi/owlapi-util.jar:library/dig1.1-xmlbeans.jar:library/jena/concurrent.jar:library/owlapi/owlapi-functionalparser.jar:library/owlapi/owlapi-impl.jar:library/owlapi/owlapi-rdfapi.jar" -->
<javadoc access="public"
author="true"
classpath="${jdocclasspath}"
@@ -224,35 +223,4 @@
</javadoc>
</target>
-
- <!--
- Some old elements which are kept for reference for a couple of days
-
-
- <target name="wsgen_linux" >
- <exec dir="${source_dir}" executable="wsgen">
- <arg value="-keep"/>
- <arg value="-verbose"/>
- <arg value="-cp"/>
- <arg value=".:../../classes/:../../library/dig1.1-xmlbeans.jar:../../library/kaon2.jar:../../library/xbean.jar:../../library/owlapi/:../../library/owlapi/antlr-runtime-3.0.jar:../../library/owlapi/commons-lang-2.2.jar:../../library/owlapi/owlapi-api.jar:../../library/owlapi/owlapi-apibinding.jar:../../library/owlapi/owlapi-change.jar:../../library/owlapi/owlapi-debugging.jar:../../library/owlapi/owlapi-dig1_1.jar:../../library/owlapi/owlapi-functionalparser.jar:../../library/owlapi/owlapi-functionalrenderer.jar:../../library/owlapi/owlapi-impl.jar:../../library/owlapi/owlapi-krssparser.jar:../../library/owlapi/owlapi-mansyntaxparser.jar:../../library/owlapi/owlapi-mansyntaxrenderer.jar:../../library/owlapi/owlapi-metrics.jar:../../library/owlapi/owlapi-oboparser.jar:../../library/owlapi/owlapi-owlxmlparser.jar:../../library/owlapi/owlapi-owlxmlrenderer.jar:../../library/owlapi/owlapi-rdfapi.jar:../../library/owlapi/owlapi-rdfxmlparser.jar:../../library/owlapi/owlapi-rdfxmlrenderer.jar:../../library/owlapi/owlapi-util.jar"/>
- <arg value="org.dllearner.server.DLLearnerWS"/>
- </exec>
- </target>
-
- <path id="classpath">
- <pathelement location="."/>
- <pathelement location="${kaon2}"/>
- <pathelement location="${xbean}"/>
- <pathelement location="${dig1.1_xmlbeans}"/>
- <pathelement location="${jena}"/>
- <pathelement location="${owlapi-api}"/>
- <pathelement location="${owlapi-apibinding}"/>
- <pathelement location="${owlapi-dig1_1}"/>
- </path>
-
- -->
-
-
-
-
</project>
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
3 messages has been excluded from this view by a project administrator.
