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

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

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

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


Modified Paths:
--------------
    trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlKnowledgeSource.java
    trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java

Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlKnowledgeSource.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlKnowledgeSource.java	2008-05-15 19:24:02 UTC (rev 854)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlKnowledgeSource.java	2008-05-15 20:50:51 UTC (rev 855)
@@ -440,4 +440,6 @@
 			System.out.println();
 		}
 	}*/
+	
+	
 }

Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java	2008-05-15 19:24:02 UTC (rev 854)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java	2008-05-15 20:50:51 UTC (rev 855)
@@ -61,6 +61,7 @@
 	
 	static void LocalDBpediaEvaluation(){
 		boolean local=true;
+		SimpleClock total =new SimpleClock();
 		String  url="";
 		if(local){
 			se = SparqlEndpoint.EndpointLOCALDBpedia();
@@ -93,11 +94,12 @@
 			
 			poslimit+=5;
 			neglimit+=5;
-			System.out.println("XXX examplesize "+(poslimit+neglimit));
-			int concount=0;
+			printProgress(0, concepts.size(),0, "beginning",total.getTime());
+			
+			int concount=1;
 		for (String oneConcept : concepts) {
-			System.out.println("XXX "+concount+" of "+concepts.size()+""+oneConcept);concount++;
 			
+			printProgress(concount, concepts.size(),0, oneConcept,total.getTime());
 			int recursiondepth=0;
 			boolean closeAfterRecursion=true;
 			
@@ -110,8 +112,8 @@
 			negExamples = ae.getNegExamples();
 		
 			for(recursiondepth=0;recursiondepth<4;recursiondepth++) {
-				System.out.println("XXX recursiondepth "+recursiondepth+" con "+oneConcept);
 				
+				printProgress(concount, concepts.size(),recursiondepth, oneConcept,total.getTime());
 				/*if(i==0){;}
 				else if(closeAfterRecursion) {
 					closeAfterRecursion=false;
@@ -232,5 +234,15 @@
 		}
 	}
 	
+	public static void printProgress(int con, int consize,int recdepth, String conceptname, long needed){
+		int ex=poslimit+neglimit;
+		System.out.println("" +
+				"XXX num ex  : "+ex+ "  \n" +
+				"concept     :"+con+"/"+consize+ " \n" +
+				"recursion   : "+recdepth+" " +
+				"conceptname : "+conceptname+ "\n" +
+				"needed total: "+needed);
+	}
+	
 
 }


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