Menu
▾
▴
[DL-Learner SVN] SF.net SVN: dl-learner: [864] trunk/src/dl-learner/org/dllearner
|
From: <ku...@us...> - 2008-05-16 00:07:41
|
Revision: 864
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=864&view=rev
Author: kurzum
Date: 2008-05-15 17:07:39 -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/core/owl/SubsumptionHierarchy.java
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.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 23:30:00 UTC (rev 863)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 00:07:39 UTC (rev 864)
@@ -48,6 +48,7 @@
import org.dllearner.utilities.ConceptTransformation;
import org.dllearner.utilities.Files;
import org.dllearner.utilities.Helper;
+import org.dllearner.utilities.SimpleClock;
/**
* Implements the example based refinement operator learning
@@ -279,6 +280,8 @@
public void start() {
runtime=System.currentTimeMillis();
+ //RBC many comments can be removed
+ //SimpleClock sc =new SimpleClock();
// TODO: write a JUnit test for this problem (long-lasting or infinite loops because
// redundant children of a node are called recursively after when the node is extended
// twice)
@@ -359,12 +362,15 @@
lastPrintTime = currentTime;
logger.debug("--- loop " + loop + " started ---");
}
+ //RBC
logger.debug("--- loop " + loop + " started ---");
+ //sc.printAndSet("before Traverse");
// traverse the current search tree to find a solution
if(useTreeTraversal && (currentTime - lastTreeTraversalTime > traversalInterval)) {
traverseTree();
lastTreeTraversalTime = System.nanoTime();
}
+ //sc.printAndSet("Traverse");
// reduce candidates to focus on promising concepts
if(useCandidateReduction && (currentTime - lastReductionTime > reductionInterval)) {
@@ -373,6 +379,7 @@
// Logger.getRootLogger().setLevel(Level.TRACE);
}
+ //sc.printAndSet("candidates");
// System.out.println("next expanded: " + candidates.last().getShortDescription(nrOfPositiveExamples, nrOfNegativeExamples, baseURI));
// chose best node according to heuristics
bestNode = candidates.last();
@@ -387,6 +394,7 @@
candidates.addAll(newCandidates);
candidatesStable.addAll(newCandidates);
+ //sc.printAndSet("after candidates");
// System.out.println("done");
if(writeSearchTree) {
@@ -407,7 +415,7 @@
else
Files.appendFile(searchTreeFile, treeString);
}
-
+ //sc.printAndSet("before posonly");
// special situation for positive only learning: the expanded node can become a solution (see explanations
// for maxPosOnlyExpansion above)
if(posOnly && (bestNode.getHorizontalExpansion() - bestNode.getConcept().getLength() >= maxPosOnlyExpansion)) {
@@ -424,8 +432,10 @@
}
}
+ //sc.printAndSet("before stopping");
// handle termination criteria
handleStoppingConditions();
+ //sc.printAndSet("after stopping");
//logger.info(minExecutionTimeReached()+"aaaaaaa "+solutions.size()+"::"+guaranteeXgoodDescriptions);
//logger.info(solutionFound+"aaaaaaa "+stop);
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-15 23:30:00 UTC (rev 863)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 00:07:39 UTC (rev 864)
@@ -41,6 +41,8 @@
public SubsumptionHierarchy(Set<NamedClass> atomicConcepts, TreeMap<Description,TreeSet<Description>> subsumptionHierarchyUp , TreeMap<Description,TreeSet<Description>> subsumptionHierarchyDown) {
this.subsumptionHierarchyUp = subsumptionHierarchyUp;
+ //System.out.println(subsumptionHierarchyDown);
+ //System.out.println(subsumptionHierarchyUp);
this.subsumptionHierarchyDown = subsumptionHierarchyDown;
allowedConceptsInSubsumptionHierarchy = new TreeSet<Description>(conceptComparator);
allowedConceptsInSubsumptionHierarchy.addAll(atomicConcepts);
@@ -80,6 +82,7 @@
//System.out.println(moreGeneral);
if(moreGeneral.size()==0) {
hierarchyDownNew.get(new Thing()).add(c);
+ moreGeneral.add(new Thing());
}else {
Description chosenParent = moreGeneral.first();
hierarchyDownNew.get(chosenParent).add(c);
@@ -95,6 +98,7 @@
if(moreSpecial != null ) {
if(moreSpecial.size()==0){
hierarchyUpNew.get(new Nothing()).add(c);
+ moreSpecial.add(new Nothing());
}
else {
Description chosenParent = moreSpecial.first();
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 23:30:00 UTC (rev 863)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 00:07:39 UTC (rev 864)
@@ -38,7 +38,7 @@
static boolean useParallelClasses = true;
static int poslimit = 0;
static int neglimit = 0;
- static boolean randomizeCache = false;
+ static boolean randomizeCache = true;
/**
* @param args
@@ -47,7 +47,7 @@
init();
System.out.println("Start");
//logger.setLevel(Level.TRACE);
- logger.setLevel(Level.WARN);
+ logger.setLevel(Level.TRACE);
//Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.TRACE);
//System.out.println(Logger.getLogger(SparqlQuery.class).getLevel());
SimpleClock sc=new SimpleClock();
@@ -191,13 +191,13 @@
public static SortedSet<String> initConcepts(){
SortedSet<String> concepts = new TreeSet<String>();
- /*concepts.add("http://dbpedia.org/class/yago/AirLane108492546");
+ concepts.add("http://dbpedia.org/class/yago/AirLane108492546");
concepts.add("http://dbpedia.org/class/yago/AlphaBlocker102698769");
concepts.add("http://dbpedia.org/class/yago/Articulation107131854");
concepts.add("http://dbpedia.org/class/yago/Patriot110407310");
- concepts.add("http://dbpedia.org/class/yago/Ceremony107450842");*/
+ concepts.add("http://dbpedia.org/class/yago/Ceremony107450842");
concepts.add("http://dbpedia.org/class/yago/CookingOil107673145");
- /*concepts.add("http://dbpedia.org/class/yago/Corticosteroid114751417");
+ concepts.add("http://dbpedia.org/class/yago/Corticosteroid114751417");
concepts.add("http://dbpedia.org/class/yago/Curlew102033561");
concepts.add("http://dbpedia.org/class/yago/DataStructure105728493");
concepts.add("http://dbpedia.org/class/yago/Disappearance100053609");
@@ -211,7 +211,7 @@
concepts.add("http://dbpedia.org/class/yago/Schoolteacher110560352");
concepts.add("http://dbpedia.org/class/yago/Singer110599806");
concepts.add("http://dbpedia.org/class/yago/SupremeCourt108336188");
- concepts.add("http://dbpedia.org/class/yago/AirLane108492546");*/
+ concepts.add("http://dbpedia.org/class/yago/AirLane108492546");
return concepts;
}
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 23:30:00 UTC (rev 863)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 00:07:39 UTC (rev 864)
@@ -81,7 +81,12 @@
cm.applyConfigEntry(la,"useNegation",false);
cm.applyConfigEntry(la,"minExecutionTimeInSeconds",0);
cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",30);
+ cm.applyConfigEntry(la,"writeSearchTree",false);
+ cm.applyConfigEntry(la,"searchTreeFile","log/search.txt");
+ cm.applyConfigEntry(la,"replaceSearchTree",true);
+ cm.applyConfigEntry(la,"noisePercentage",0.15);
+
//cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
cm.applyConfigEntry(la,"logLevel","TRACE");
@@ -96,7 +101,7 @@
la.start();
Statistics.addTimeLearning(sc.getTime());
- if(sc.getTime()/1000 >= 20)System.out.println("XXXMAX time reached");
+ //if(sc.getTime()/1000 >= 20)System.out.println("XXXMAX time reached");
//System.out.println("best"+la(20));
//((ExampleBasedROLComponent)la).printBestSolutions(10000);
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
