Menu
▾
▴
[DL-Learner SVN] SF.net SVN: dl-learner: [946] trunk
|
From: <jen...@us...> - 2008-06-06 10:35:39
|
Revision: 946
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=946&view=rev
Author: jenslehmann
Date: 2008-06-06 03:35:34 -0700 (Fri, 06 Jun 2008)
Log Message:
-----------
final statistics script
Modified Paths:
--------------
trunk/examples/cross-benchmark/forte/uncle_gp.conf
trunk/examples/cross-benchmark/forte/uncle_hybrid.conf
trunk/examples/cross-benchmark/forte/uncle_refexamples.conf
trunk/examples/cross-benchmark/forte/uncle_refexamples_fast.conf
trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples.conf
trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples_fast.conf
trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples.conf
trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples_fast.conf
trunk/examples/cross-benchmark/poker/pair_refexamples.conf
trunk/examples/cross-benchmark/poker/pair_refexamples_fast.conf
trunk/examples/cross-benchmark/poker/straight_refexamples.conf
trunk/examples/cross-benchmark/poker/straight_refexamples_fast.conf
trunk/examples/cross-benchmark/trains/trains_refexamples.conf
trunk/examples/cross-benchmark/trains/trains_refexamples_fast.conf
trunk/examples/yinyang_files/moralSimpleLearningProblem.xml
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java
Modified: trunk/examples/cross-benchmark/forte/uncle_gp.conf
===================================================================
--- trunk/examples/cross-benchmark/forte/uncle_gp.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/forte/uncle_gp.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -28,7 +28,7 @@
posNegDefinitionLP.percentPerLenghtUnit = 0.02;
gp.maxConceptLength = 30;
reasoner = owlAPI;
-import("forte_family.kb");
+import("forte_family.owl");
/** examples **/
Modified: trunk/examples/cross-benchmark/forte/uncle_hybrid.conf
===================================================================
--- trunk/examples/cross-benchmark/forte/uncle_hybrid.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/forte/uncle_hybrid.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -29,7 +29,7 @@
posNegDefinitionLP.percentPerLenghtUnit = 0.02;
gp.maxConceptLength = 30;
reasoner = owlAPI;
-import("forte_family.kb");
+import("forte_family.owl");
/** examples **/
Modified: trunk/examples/cross-benchmark/forte/uncle_refexamples.conf
===================================================================
--- trunk/examples/cross-benchmark/forte/uncle_refexamples.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/forte/uncle_refexamples.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -17,8 +17,9 @@
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = owlAPI;
-import("forte_family.kb");
+import("forte_family.owl");
/** examples **/
Modified: trunk/examples/cross-benchmark/forte/uncle_refexamples_fast.conf
===================================================================
--- trunk/examples/cross-benchmark/forte/uncle_refexamples_fast.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/forte/uncle_refexamples_fast.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -16,8 +16,9 @@
*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = fastInstanceChecker;
-import("forte_family.kb");
+import("forte_family.owl");
/** examples **/
Modified: trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples.conf
===================================================================
--- trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -9,6 +9,7 @@
***********************/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = owlAPI;
/** background knowledge **/
import("moral_43instances_complex.owl");
Modified: trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples_fast.conf
===================================================================
--- trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples_fast.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_complex_refexamples_fast.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -9,6 +9,7 @@
***********************/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = fastInstanceChecker;
/** background knowledge **/
import("moral_43instances_complex.owl");
Modified: trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples.conf
===================================================================
--- trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -9,6 +9,7 @@
***********************/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = owlAPI;
/** background knowledge **/
import("moral_43instances.owl");
Modified: trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples_fast.conf
===================================================================
--- trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples_fast.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/moral_reasoner/moral_43examples_simple_refexamples_fast.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -9,6 +9,7 @@
***********************/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = fastInstanceChecker;
/** background knowledge **/
import("moral_43instances.owl");
Modified: trunk/examples/cross-benchmark/poker/pair_refexamples.conf
===================================================================
--- trunk/examples/cross-benchmark/poker/pair_refexamples.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/poker/pair_refexamples.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -5,6 +5,7 @@
* Copyright (C) 2007, Jens Lehmann
*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = owlAPI;
/*Background knowledge*/
Modified: trunk/examples/cross-benchmark/poker/pair_refexamples_fast.conf
===================================================================
--- trunk/examples/cross-benchmark/poker/pair_refexamples_fast.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/poker/pair_refexamples_fast.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -6,6 +6,7 @@
*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = fastInstanceChecker;
/*Background knowledge*/
import("pair50.owl");
Modified: trunk/examples/cross-benchmark/poker/straight_refexamples.conf
===================================================================
--- trunk/examples/cross-benchmark/poker/straight_refexamples.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/poker/straight_refexamples.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -7,6 +7,7 @@
/*Background knowledge*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = owlAPI;
import("straight.owl");
Modified: trunk/examples/cross-benchmark/poker/straight_refexamples_fast.conf
===================================================================
--- trunk/examples/cross-benchmark/poker/straight_refexamples_fast.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/poker/straight_refexamples_fast.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -7,6 +7,7 @@
/*Background knowledge*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = fastInstanceChecker;
import("straight.owl");
Modified: trunk/examples/cross-benchmark/trains/trains_refexamples.conf
===================================================================
--- trunk/examples/cross-benchmark/trains/trains_refexamples.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/trains/trains_refexamples.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -6,6 +6,7 @@
*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = owlAPI;
hidePrefix = "http://example.com/foo#";
Modified: trunk/examples/cross-benchmark/trains/trains_refexamples_fast.conf
===================================================================
--- trunk/examples/cross-benchmark/trains/trains_refexamples_fast.conf 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/cross-benchmark/trains/trains_refexamples_fast.conf 2008-06-06 10:35:34 UTC (rev 946)
@@ -6,6 +6,7 @@
*/
algorithm = refexamples;
+refexamples.useCardinalityRestrictions = false;
reasoner = fastInstanceChecker;
hidePrefix = "http://example.com/foo#";
Modified: trunk/examples/yinyang_files/moralSimpleLearningProblem.xml
===================================================================
--- trunk/examples/yinyang_files/moralSimpleLearningProblem.xml 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/examples/yinyang_files/moralSimpleLearningProblem.xml 2008-06-06 10:35:34 UTC (rev 946)
@@ -19,7 +19,9 @@
>
-<Experiments/>
+<Experiments>
+ <kFoldCrossValidation k="5"/>
+ </Experiments>
<Namespaces>
<Namespace uri="http://localhost/foo#"></Namespace>
</Namespaces>
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java 2008-06-05 19:06:48 UTC (rev 945)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java 2008-06-06 10:35:34 UTC (rev 946)
@@ -51,7 +51,7 @@
* The value of a node is calculated as follows:
*
* <p><code>value = accuracy + gain bonus factor * accuracy gain - expansion penalty
- * factor * horizontal expansion</code></p>
+ * factor * horizontal expansion - node children penalty factor * number of children of node</code></p>
*
* <p><code>accuracy = (TP + TN)/(P + N)</code></p>
*
@@ -62,11 +62,6 @@
* N = number of negative examples<br />
* </code></p>
*
- * TODO: Maybe the number of children of a node could be used instead of
- * horiz. exp, because if a node has a very high number of children, the
- * algorithm gets stuck easily, while it could still be very agile in other
- * parts of the search space.
- *
* @author Jens Lehmann
*
*/
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
