dl-learner-svn

[DL-Learner SVN] SF.net SVN: dl-learner: [691] trunk/src/dl-learner/org/dllearner/algorithms /refexamples/ExampleBasedROLearner.java

[<jen...@us...>]

Revision: 691
          http://dl-learner.svn.sourceforge.net/dl-learner/?rev=691&view=rev
Author:   jenslehmann
Date:     2008-03-05 23:05:58 -0800 (Wed, 05 Mar 2008)

Log Message:
-----------
output changes

Modified Paths:
--------------
    trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-03-05 18:30:41 UTC (rev 690)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-03-06 07:05:58 UTC (rev 691)
@@ -594,13 +594,14 @@
 		
 		if(!finalStats) {
 			ExampleBasedNode bestNode = candidatesStable.last();
-			double accuracy = 100 * ((bestNode.getCoveredPositives().size()
-			+ nrOfNegativeExamples - bestNode.getCoveredNegatives().size())/(double)nrOfExamples);
+//			double accuracy = 100 * ((bestNode.getCoveredPositives().size()
+//			+ nrOfNegativeExamples - bestNode.getCoveredNegatives().size())/(double)nrOfExamples);
 			// Refinementoperator auf Konzept anwenden
-			String bestNodeString = "currently best node: " + bestNode + " accuracy: " + df.format(accuracy) + "%";
+//			String bestNodeString = "currently best node: " + bestNode + " accuracy: " + df.format(accuracy) + "%";
+			String bestNodeString = "currently best node: " + bestNode.getShortDescription(nrOfPositiveExamples, nrOfNegativeExamples, baseURI);
 			// searchTree += bestNodeString + "\n";
 			System.out.println(bestNodeString);
-			String expandedNodeString = "next expanded node: " + candidates.last();
+			String expandedNodeString = "next expanded node: " + candidates.last().getShortDescription(nrOfPositiveExamples, nrOfNegativeExamples, baseURI);
 			// searchTree += expandedNodeString + "\n";
 			System.out.println(expandedNodeString);		
 			System.out.println("algorithm runtime " + Helper.prettyPrintNanoSeconds(algorithmRuntime));


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.

[DL-Learner SVN] SF.net SVN: dl-learner: [752] trunk/src/dl-learner/org/dllearner/algorithms /refexamples/ExampleBasedROLearner.java

[<ku...@us...>]

Revision: 752
          http://dl-learner.svn.sourceforge.net/dl-learner/?rev=752&view=rev
Author:   kurzum
Date:     2008-04-02 08:35:39 -0700 (Wed, 02 Apr 2008)

Log Message:
-----------
line for manchester syntax, minor importance

Modified Paths:
--------------
    trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-04-02 10:44:32 UTC (rev 751)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-04-02 15:35:39 UTC (rev 752)
@@ -21,6 +21,7 @@
 
 import java.io.File;
 import java.text.DecimalFormat;
+import java.util.HashMap;
 import java.util.HashSet;
 import java.util.Iterator;
 import java.util.LinkedList;
@@ -385,6 +386,8 @@
 			logger.info("\nsolutions:");
 			for(Description c : solutions) {
 				logger.info("  " + c + " (length " + c.getLength() +", depth " + c.getDepth() + ")");
+				//TODO remove this line
+				logger.info( "Manchester: " + c.toManchesterSyntaxString(baseURI, new HashMap<String,String>()) );
 			}
 		}
 		logger.debug("size of candidate set: " + candidates.size());


This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.