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

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

Revision: 859
          http://dl-learner.svn.sourceforge.net/dl-learner/?rev=859&view=rev
Author:   kurzum
Date:     2008-05-15 15:07:25 -0700 (Thu, 15 May 2008)

Log Message:
-----------


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

Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-05-15 21:45:15 UTC (rev 858)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java	2008-05-15 22:07:25 UTC (rev 859)
@@ -460,7 +460,8 @@
 		}
 		
 		logger.debug("size of candidate set: " + candidates.size());
-		printBestSolutions(0);
+		boolean showOrderedSolutions = false;
+		printBestSolutions(20,showOrderedSolutions);
 		printStatistics(true);
 		
 		if(stop)
@@ -1059,7 +1060,7 @@
 	}
 	
 	
-	public void printBestSolutions(int nrOfSolutions){
+	public void printBestSolutions(int nrOfSolutions, boolean showOrderedSolutions){
 		if(!logger.isTraceEnabled())
 			return;
 //		if(!logger.getLevel().toString().equalsIgnoreCase("TRACE"))return;
@@ -1074,8 +1075,8 @@
 			i++;
 		}
 		
-		boolean showOrderedSolutions = true;
 		
+		
 		if(showOrderedSolutions) {
 			logger.trace("ordered by generality (most special solutions first):");
 			SubsumptionComparator sc = new SubsumptionComparator(rs);

Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java	2008-05-15 21:45:15 UTC (rev 858)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java	2008-05-15 22:07:25 UTC (rev 859)
@@ -38,7 +38,7 @@
 	static boolean useParallelClasses = true;
 	static int poslimit = 0;
 	static int neglimit = 0;
-	static boolean randomizeCache = true;
+	static boolean randomizeCache = false;
 	
 	/**
 	 * @param args
@@ -95,10 +95,10 @@
 			neglimit+=5;
 			printProgress(0, concepts.size(),0, "beginning",total.getTime());
 			
-			int concount=1;
+			int concount=0;
 		for (String oneConcept : concepts) {
-			
-			printProgress(concount++, concepts.size(),0, oneConcept,total.getTime());
+			concount++;
+			printProgress(concount, concepts.size(),0, oneConcept,total.getTime());
 			int recursiondepth=0;
 			boolean closeAfterRecursion=true;
 			
@@ -121,10 +121,7 @@
 				else {
 					closeAfterRecursion=true;
 				}*/
-				//Statistics.setCurrentLabel(recursiondepth+""+((closeAfterRecursion)?"+":""));
 				
-				//Statistics.setCurrentLabel(recursiondepth+""+((closeAfterRecursion)?"":""));
-				Statistics.setCurrentLabel(recursiondepth+"");
 				
 				Statistics.print(number);
 				


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