[DL-Learner SVN] SF.net SVN: dl-learner: [818] trunk/src/dl-learner/org/dllearner/algorithms

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

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

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

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

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-04-23 08:04:01 UTC (rev 817)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-04-23 09:20:23 UTC (rev 818)
@@ -1028,6 +1028,7 @@
 	
 	
 	public void printBestSolutions(int nrOfSolutions){
+		if(!logger.getLevel().toString().equalsIgnoreCase("TRACE"))return;
 		if(nrOfSolutions==0)nrOfSolutions=candidatesStable.size();
 		int i=0;
 		for(ExampleBasedNode n : candidatesStable.descendingSet()) {

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java	2008-04-23 08:04:01 UTC (rev 817)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refinement/ROLearner.java	2008-04-23 09:20:23 UTC (rev 818)
@@ -554,6 +554,7 @@
 		}
 		logger.info("  horizontal expansion: " + minimumHorizontalExpansion + " to " + maximumHorizontalExpansion);
 		logger.info("  size of candidate set: " + candidates.size());
+		printBestSolutions(0);
 		printStatistics(true);
 		
 		if(stop)
@@ -1015,6 +1016,18 @@
 	public Description getBestSolution() {
 		return candidatesStable.last().getConcept();
 	}
+	
+	public void printBestSolutions(int nrOfSolutions){
+		if(!logLevel.equalsIgnoreCase("TRACE"))return;
+		if(nrOfSolutions==0)nrOfSolutions=solutions.size();
+		int i=0;
+		for(;i==nrOfSolutions; i++) {
+			Description d = solutions.get(i);
+			logger.trace("  " + d.toString(baseURI,null) + " (length " + d.getLength() + " " +
+					""+getSolutionScore(d) );
+		}
+			
+	}
 
 	@Override
 	public synchronized List<Description> getBestSolutions(int nrOfSolutions) {
@@ -1036,6 +1049,14 @@
 		else
 			return learningProblem.computeScore(getBestSolution());
 	}
+	
+	
+	public Score getSolutionScore(Description d) {
+		if(posOnly)
+			return posOnlyLearningProblem.computeScore(d);
+		else
+			return learningProblem.computeScore(d);
+	}
 
 	@Override
 	public void stop() {


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