Menu
▾
▴
dl-learner-svn — DL-Learner Subversion commits
You can subscribe to this list here.
| 2007 |
Jan
|
Feb
|
Mar
|
Apr
|
May
|
Jun
|
Jul
|
Aug
(120) |
Sep
(36) |
Oct
(116) |
Nov
(17) |
Dec
(44) |
|---|---|---|---|---|---|---|---|---|---|---|---|---|
| 2008 |
Jan
(143) |
Feb
(192) |
Mar
(74) |
Apr
(84) |
May
(105) |
Jun
(64) |
Jul
(49) |
Aug
(120) |
Sep
(159) |
Oct
(156) |
Nov
(51) |
Dec
(28) |
| 2009 |
Jan
(17) |
Feb
(55) |
Mar
(33) |
Apr
(57) |
May
(54) |
Jun
(28) |
Jul
(6) |
Aug
(16) |
Sep
(38) |
Oct
(30) |
Nov
(26) |
Dec
(52) |
| 2010 |
Jan
(7) |
Feb
(91) |
Mar
(65) |
Apr
(2) |
May
(14) |
Jun
(25) |
Jul
(38) |
Aug
(48) |
Sep
(80) |
Oct
(70) |
Nov
(75) |
Dec
(77) |
| 2011 |
Jan
(68) |
Feb
(53) |
Mar
(51) |
Apr
(35) |
May
(65) |
Jun
(101) |
Jul
(29) |
Aug
(230) |
Sep
(95) |
Oct
(49) |
Nov
(110) |
Dec
(63) |
| 2012 |
Jan
(41) |
Feb
(42) |
Mar
(25) |
Apr
(46) |
May
(51) |
Jun
(44) |
Jul
(45) |
Aug
(29) |
Sep
(12) |
Oct
(9) |
Nov
(17) |
Dec
(2) |
| 2013 |
Jan
(12) |
Feb
(14) |
Mar
(7) |
Apr
(16) |
May
(54) |
Jun
(27) |
Jul
(11) |
Aug
(5) |
Sep
(85) |
Oct
(27) |
Nov
(37) |
Dec
(32) |
| 2014 |
Jan
(8) |
Feb
(29) |
Mar
(5) |
Apr
(3) |
May
(22) |
Jun
(3) |
Jul
(4) |
Aug
(3) |
Sep
|
Oct
|
Nov
|
Dec
|
|
From: <ku...@us...> - 2008-05-16 11:04:56
|
Revision: 877
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=877&view=rev
Author: kurzum
Date: 2008-05-16 04:04:35 -0700 (Fri, 16 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java 2008-05-16 09:59:28 UTC (rev 876)
+++ trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java 2008-05-16 11:04:35 UTC (rev 877)
@@ -22,7 +22,7 @@
private SortedSet<String> posExamples;
private SortedSet<String> negExamples;
public SortedSet<String> totalSKOSset;
- private int limit=2000;
+ private int limit=1000;
public AutomaticExampleFinderSPARQL(SparqlEndpoint se){
@@ -318,7 +318,7 @@
" a " +
"?subject " +
"\n" +
- "}";
+ "} LIMIT "+limit;
SparqlQuery sq = new SparqlQuery(query, se);
//System.out.println(query);
String JSON = c.executeSparqlQuery(sq);
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 09:59:31
|
Revision: 876
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=876&view=rev
Author: kurzum
Date: 2008-05-16 02:59:28 -0700 (Fri, 16 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java
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/utilities/LearnSparql.java
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java 2008-05-16 08:48:56 UTC (rev 875)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java 2008-05-16 09:59:28 UTC (rev 876)
@@ -291,10 +291,10 @@
Helper.checkConcepts(rs, allowedConcepts);
usedConcepts = allowedConcepts;
} else if(ignoredConcepts != null) {
- System.out.println(ignoredConcepts);
+ //System.out.println(ignoredConcepts);
usedConcepts = Helper.computeConceptsUsingIgnoreList(rs, ignoredConcepts);
//RBC
- System.out.println(usedConcepts);
+ //System.out.println(usedConcepts);
} else {
usedConcepts = Helper.computeConcepts(rs);
}
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 08:48:56 UTC (rev 875)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 09:59:28 UTC (rev 876)
@@ -362,8 +362,8 @@
logger.debug("--- loop " + loop + " started ---");
}
//RBC
- logger.debug("--- loop " + loop + " started ---");
- printStatistics(false);
+ //logger.debug("--- loop " + loop + " started ---");
+ //printStatistics(false);
//sc.printAndSet("before Traverse");
// traverse the current search tree to find a solution
if(useTreeTraversal && (currentTime - lastTreeTraversalTime > traversalInterval)) {
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 08:48:56 UTC (rev 875)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 09:59:28 UTC (rev 876)
@@ -41,8 +41,7 @@
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);
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 08:48:56 UTC (rev 875)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 09:59:28 UTC (rev 876)
@@ -88,7 +88,7 @@
//cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
- cm.applyConfigEntry(la,"logLevel","TRACE");
+ cm.applyConfigEntry(la,"logLevel","DEBUG");
//cm.applyConfigEntry(la,"quiet",false);
//System.out.println(ignoredConcepts.first());;
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 08:49:25
|
Revision: 875
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=875&view=rev
Author: kurzum
Date: 2008-05-16 01:48:56 -0700 (Fri, 16 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 08:20:16 UTC (rev 874)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 08:48:56 UTC (rev 875)
@@ -362,7 +362,8 @@
logger.debug("--- loop " + loop + " started ---");
}
//RBC
- //logger.debug("--- loop " + loop + " started ---");
+ logger.debug("--- loop " + loop + " started ---");
+ printStatistics(false);
//sc.printAndSet("before Traverse");
// traverse the current search tree to find a solution
if(useTreeTraversal && (currentTime - lastTreeTraversalTime > traversalInterval)) {
Modified: trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java 2008-05-16 08:20:16 UTC (rev 874)
+++ trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java 2008-05-16 08:48:56 UTC (rev 875)
@@ -122,6 +122,14 @@
ae.initDBpediaSKOS(concept, 0.1, useRelated, useParallelClasses);
posExamples = ae.getPosExamples();
negExamples = ae.getNegExamples();
+
+ for (String string2 : negExamples) {
+ logger.debug("-"+string2);
+ }
+
+ for (String string2 : posExamples) {
+ logger.debug("+"+string2);
+ }
SortedSet<String> totalSKOSset= ae.totalSKOSset;
SortedSet<String> rest= ae.rest;
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 08:20:16 UTC (rev 874)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 08:48:56 UTC (rev 875)
@@ -11,9 +11,7 @@
import org.apache.log4j.Level;
import org.apache.log4j.Logger;
import org.apache.log4j.SimpleLayout;
-import org.dllearner.core.KnowledgeSource;
import org.dllearner.kb.sparql.Cache;
-import org.dllearner.kb.sparql.SparqlKnowledgeSource;
import org.dllearner.kb.sparql.SparqlQuery;
import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
import org.dllearner.utilities.AutomaticExampleFinderSPARQL;
@@ -40,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
@@ -81,6 +79,7 @@
//System.out.println(selectDBpediaConcepts(10));
tmpSet=initConcepts();
int number=tmpSet.size();
+ //System.out.println(number);
//concepts.add("\"http://dbpedia.org/class/yago/Flamethrower103356559\"");
for (String string : tmpSet) {
//System.out.println("\""+string+"\",");
@@ -154,6 +153,9 @@
String comment3="# "+examples+"examples\n";
String f3=pre+"2avgTimeLearning_"+examples+"example"+concepts.size()+"classes";
writeToFile(f3, comment3+Statistics.getAVGTimeLearning(number));
+ String comment4="# "+examples+"examples\n";
+ String f4=pre+"2avgTotalTime_"+examples+"example"+concepts.size()+"classes";
+ writeToFile(f4, comment4+Statistics.getAVGtotalTime(number));
Statistics.reset();
}//outer
@@ -194,27 +196,27 @@
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/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/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/CookingOil107673145");
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");
-// concepts.add("http://dbpedia.org/class/yago/Flintstone114871268");
-// concepts.add("http://dbpedia.org/class/yago/Form105930736");
-// concepts.add("http://dbpedia.org/class/yago/Hypochondriac110195487");
-// concepts.add("http://dbpedia.org/class/yago/Industrialist110204177");
-// concepts.add("http://dbpedia.org/class/yago/Lifeboat103662601");
-// concepts.add("http://dbpedia.org/class/yago/Particulate114839439");
-// concepts.add("http://dbpedia.org/class/yago/Reservation108587174");
-// 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/Curlew102033561");
+ concepts.add("http://dbpedia.org/class/yago/DataStructure105728493");
+ concepts.add("http://dbpedia.org/class/yago/Disappearance100053609");
+ concepts.add("http://dbpedia.org/class/yago/Flintstone114871268");
+ concepts.add("http://dbpedia.org/class/yago/Form105930736");
+ concepts.add("http://dbpedia.org/class/yago/Hypochondriac110195487");
+ concepts.add("http://dbpedia.org/class/yago/Industrialist110204177");
+ concepts.add("http://dbpedia.org/class/yago/Lifeboat103662601");
+ concepts.add("http://dbpedia.org/class/yago/Particulate114839439");
+ concepts.add("http://dbpedia.org/class/yago/Reservation108587174");
+ concepts.add("http://dbpedia.org/class/yago/Schoolteacher110560352");
+ concepts.add("http://dbpedia.org/class/yago/Singer110599806");
+ concepts.add("http://dbpedia.org/class/yago/SupremeCourt108336188");
+
return concepts;
}
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 08:20:16 UTC (rev 874)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 08:48:56 UTC (rev 875)
@@ -84,7 +84,7 @@
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,"noisePercentage",0.5);
//cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
@@ -152,6 +152,7 @@
//cm.applyConfigEntry(r,"useExistsConstructor",true);
r.init();
rs = new ReasoningService(r);
+ //System.out.println("satisfy: "+rs.isSatisfiable());
lp = new PosNegDefinitionLP(rs);
//cm.applyConfigEntry(lp, "positiveExamples",toInd(posExamples));
Modified: trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-16 08:20:16 UTC (rev 874)
+++ trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-16 08:48:56 UTC (rev 875)
@@ -12,7 +12,9 @@
private static HashMap<String, Integer> numberOfTriples = new HashMap<String, Integer>();
private static HashMap<String, Long> timeCollecting = new HashMap<String, Long>();
private static HashMap<String, Long> timeLearning = new HashMap<String, Long>();
+ private static HashMap<String, Long> timeTotal = new HashMap<String, Long>();
+
private static HashMap<String, Integer> numberOfSparqlQueries = new HashMap<String, Integer>();
private static HashMap<String, Integer> numberOfCachedSparqlQueries = new HashMap<String, Integer>();
@@ -31,6 +33,7 @@
}
public static void addTimeCollecting(long value) {
+ addTimeTotal(value);
Long current = timeCollecting.get(currentLabel);
if(current==null)
timeCollecting.put(currentLabel, new Long(value));
@@ -38,9 +41,21 @@
timeCollecting.put(currentLabel, new Long(current.longValue()+value));
}
+
}
+ public static void addTimeTotal(long value) {
+ Long current = timeTotal.get(currentLabel);
+ if(current==null)
+ timeTotal.put(currentLabel, new Long(value));
+ else {
+ timeTotal.put(currentLabel, new Long(current.longValue()+value));
+ }
+
+ }
+
public static void addTimeLearning(long value) {
+ addTimeTotal(value);
Long current = timeLearning.get(currentLabel);
if(current==null)
@@ -135,6 +150,18 @@
return ret;
}
+ public static String getAVGtotalTime(int number){
+
+ String ret="#Label, i.e. rec depth \t avg total time \n";
+ for (int i = 0; i < order.size(); i++) {
+ String label=order.get(i);
+ try {
+ ret+=label+"\t"+ (timeTotal.get(label).longValue()/number)+"\n";
+ } catch (Exception e) { }
+ }
+ return ret;
+ }
+
public static void printIntAVG(HashMap<String, Integer> hm, int number, String str){
for (int i = 0; i < order.size(); i++) {
String label=order.get(i);
@@ -187,6 +214,7 @@
numberOfTriples = new HashMap<String, Integer>();
timeCollecting = new HashMap<String, Long>();
timeLearning = new HashMap<String, Long>();
+ timeTotal = new HashMap<String, Long>();
numberOfSparqlQueries = new HashMap<String, Integer>();
numberOfCachedSparqlQueries = new HashMap<String, Integer>();
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <jen...@us...> - 2008-05-16 08:19:29
|
Revision: 873
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=873&view=rev
Author: jenslehmann
Date: 2008-05-16 01:19:26 -0700 (Fri, 16 May 2008)
Log Message:
-----------
adjusted settings
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java
trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.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-16 07:05:09 UTC (rev 872)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 08:19:26 UTC (rev 873)
@@ -124,7 +124,7 @@
// but the disadvantage of properness testing are additional reasoner
// queries and a search bias towards ALL r.something because
// ALL r.TOP is improper and automatically expanded further
- private boolean testProperness = true;
+ private boolean testProperness = false;
// tree traversal means to run through the most promising concepts
// and connect them in an intersection to find a solution
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java 2008-05-16 07:05:09 UTC (rev 872)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/MultiHeuristic.java 2008-05-16 08:19:26 UTC (rev 873)
@@ -77,11 +77,11 @@
// heuristic parameters
private double expansionPenaltyFactor;
private double gainBonusFactor;
- private double nodeChildPenalty = 0.0001;
+ private double nodeChildPenalty = 0.0001; // (use higher values than 0.0001 for simple learning problems);
private double startNodeBonus = 0.1; //was 2.0
// penalise errors on positive examples harder than on negative examples
// (positive weight = 1)
- private double negativeWeight = 0.8;
+ private double negativeWeight = 1.0; // was 0.8;
// examples
private int nrOfNegativeExamples;
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 07:05:09 UTC (rev 872)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 08:19:26 UTC (rev 873)
@@ -76,45 +76,20 @@
for(Description c : allowedConceptsInSubsumptionHierarchy) {
// schauen, ob es mehrere allgemeinere Nachbarn gibt
SortedSet<Description> moreGeneral = subsumptionHierarchyUp.get(c);
- //RBC //HACK
- //if(moreGeneral != null && moreGeneral.size()>0) {
- if(moreGeneral != null ) {
- //System.out.println(moreGeneral);
- if(moreGeneral.size()==0) {
- subsumptionHierarchyUp.remove(c);
- moreGeneral=null;
- //hierarchyDownNew.get(new Thing()).add(c);
- //moreGeneral.add(new Thing());
- //subsumptionHierarchyUp.put(c, null);
-
- }else {
- Description chosenParent = moreGeneral.first();
- hierarchyDownNew.get(chosenParent).add(c);
- }
+ if(moreGeneral != null && moreGeneral.size() != 0) {
+ Description chosenParent = moreGeneral.first();
+ hierarchyDownNew.get(chosenParent).add(c);
}
}
// for(Concept c : allowedConceptsInSubsumptionHierarchy) {
for(Description c : allowedConceptsInSubsumptionHierarchy) {
SortedSet<Description> moreSpecial = subsumptionHierarchyDown.get(c);
- //RBC //HACK
-
- //if(moreSpecial != null && moreSpecial.size()>0) {
- if(moreSpecial != null ) {
- if(moreSpecial.size()==0){
- subsumptionHierarchyDown.remove(c);
- moreSpecial=null;
- //hierarchyUpNew.get(new Nothing()).add(c);
- //moreSpecial.add(new Nothing());
- //subsumptionHierarchyDown.put(c, null);
- }
- else {
- Description chosenParent = moreSpecial.first();
- hierarchyUpNew.get(chosenParent).add(c);
- }
-
+ if(moreSpecial != null && moreSpecial.size() != 0) {
+ Description chosenParent = moreSpecial.first();
+ hierarchyUpNew.get(chosenParent).add(c);
}
- }
+ }
subsumptionHierarchyDown = hierarchyDownNew;
subsumptionHierarchyUp = hierarchyUpNew;
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 07:05:09 UTC (rev 872)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 08:19:26 UTC (rev 873)
@@ -40,7 +40,7 @@
static boolean useParallelClasses = true;
static int poslimit = 0;
static int neglimit = 0;
- static boolean randomizeCache = true;
+ static boolean randomizeCache = false;
/**
* @param args
@@ -194,27 +194,27 @@
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/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/CookingOil107673145");
- /*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");
- concepts.add("http://dbpedia.org/class/yago/Flintstone114871268");
- concepts.add("http://dbpedia.org/class/yago/Form105930736");
- concepts.add("http://dbpedia.org/class/yago/Hypochondriac110195487");
- concepts.add("http://dbpedia.org/class/yago/Industrialist110204177");
- concepts.add("http://dbpedia.org/class/yago/Lifeboat103662601");
- concepts.add("http://dbpedia.org/class/yago/Particulate114839439");
- concepts.add("http://dbpedia.org/class/yago/Reservation108587174");
- 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");
+// 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/CookingOil107673145");
+ 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");
+// concepts.add("http://dbpedia.org/class/yago/Flintstone114871268");
+// concepts.add("http://dbpedia.org/class/yago/Form105930736");
+// concepts.add("http://dbpedia.org/class/yago/Hypochondriac110195487");
+// concepts.add("http://dbpedia.org/class/yago/Industrialist110204177");
+// concepts.add("http://dbpedia.org/class/yago/Lifeboat103662601");
+// concepts.add("http://dbpedia.org/class/yago/Particulate114839439");
+// concepts.add("http://dbpedia.org/class/yago/Reservation108587174");
+// 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");*/
return concepts;
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 07:05:12
|
Revision: 872
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=872&view=rev
Author: kurzum
Date: 2008-05-16 00:05:09 -0700 (Fri, 16 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
trunk/src/dl-learner/org/dllearner/core/LearningAlgorithm.java
trunk/src/dl-learner/org/dllearner/kb/sparql/Cache.java
trunk/src/dl-learner/org/dllearner/kb/sparql/ExtractionAlgorithm.java
trunk/src/dl-learner/org/dllearner/kb/sparql/Manager.java
trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlQuery.java
trunk/src/dl-learner/org/dllearner/kb/sparql/TypedSparqlQuery.java
trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java
trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
Added Paths:
-----------
trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java
trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSKOSSPARQL.java
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -25,6 +25,7 @@
import java.util.LinkedList;
import java.util.List;
import java.util.Set;
+import java.util.SortedSet;
import org.apache.log4j.Level;
import org.apache.log4j.Logger;
@@ -383,6 +384,12 @@
public synchronized List<Description> getBestSolutions(int nrOfSolutions) {
return algorithm.getBestSolutions(nrOfSolutions);
}
+
+ //HACK
+ @Override
+ public SortedSet<String> getBestSolutionsAsKBSyntax(int nrOfSolutions){
+ return this.algorithm.getBestSolutionsAsKBSyntax(nrOfSolutions);
+ }
@Override
public void stop() {
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -48,7 +48,6 @@
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
@@ -1061,6 +1060,7 @@
List<Description> best = new LinkedList<Description>();
int i=0;
for(ExampleBasedNode n : candidatesStable.descendingSet()) {
+
best.add(n.getConcept());
if(i==nrOfSolutions)
return best;
@@ -1069,7 +1069,27 @@
return best;
}
+ //HACK
+ public SortedSet<String> getBestSolutionsAsKBSyntax(int nrOfSolutions){
+ SortedSet<String> result = new TreeSet<String>();
+ for (Description d : solutions) {
+ result.add(d.toKBSyntaxString());
+ //if(result.size()==nrOfSolutions)break;
+ }
+ /*if(result.size()<nrOfSolutions){
+
+ for(ExampleBasedNode n : candidatesStable.descendingSet()) {
+
+ result.add(n.getConcept().toKBSyntaxString());
+ if(result.size()>=nrOfSolutions)
+ return result;
+
+ }
+ }*/
+ return result;
+ }
+
public void printBestSolutions(int nrOfSolutions, boolean showOrderedSolutions){
if(!logger.isTraceEnabled())
return;
Modified: trunk/src/dl-learner/org/dllearner/core/LearningAlgorithm.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/LearningAlgorithm.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/core/LearningAlgorithm.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -22,6 +22,7 @@
import java.util.Collection;
import java.util.LinkedList;
import java.util.List;
+import java.util.SortedSet;
import org.dllearner.core.owl.Description;
@@ -63,6 +64,11 @@
return single;
}
+ //HACK
+ public SortedSet<String> getBestSolutionsAsKBSyntax(int nrOfSolutions){
+ return null;
+ }
+
/**
* Returns all learning problems supported by this component.
*/
Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/Cache.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/Cache.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/Cache.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -31,6 +31,7 @@
import java.util.LinkedList;
import org.apache.log4j.Logger;
+import org.dllearner.core.KnowledgeSource;
import org.dllearner.utilities.SimpleClock;
import org.dllearner.utilities.Statistics;
@@ -59,8 +60,9 @@
*/
public class Cache implements Serializable {
- private static Logger logger = Logger.getLogger(Cache.class);
+ private static Logger logger = Logger.getLogger(KnowledgeSource.class);
+
private static final long serialVersionUID = 843308736471742205L;
// maps hash of a SPARQL queries to JSON representation
Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/ExtractionAlgorithm.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/ExtractionAlgorithm.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/ExtractionAlgorithm.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -24,6 +24,7 @@
import java.util.Vector;
import org.apache.log4j.Logger;
+import org.dllearner.core.KnowledgeSource;
import org.dllearner.kb.sparql.configuration.Configuration;
import org.dllearner.kb.sparql.datastructure.ClassNode;
import org.dllearner.kb.sparql.datastructure.InstanceNode;
@@ -42,7 +43,7 @@
// private boolean getAllSuperClasses = true;
// private boolean closeAfterRecursion = true;
private static Logger logger = Logger
- .getLogger(ExtractionAlgorithm.class);
+ .getLogger(KnowledgeSource.class);
public ExtractionAlgorithm(Configuration Configuration) {
this.configuration = Configuration;
Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/Manager.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/Manager.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/Manager.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -24,6 +24,8 @@
import java.util.SortedSet;
import java.util.TreeSet;
+import org.apache.log4j.Logger;
+import org.dllearner.core.KnowledgeSource;
import org.dllearner.kb.sparql.configuration.Configuration;
import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
import org.dllearner.kb.sparql.configuration.SparqlQueryType;
@@ -42,7 +44,10 @@
private TypedSparqlQuery typedSparqlQuery;
private ExtractionAlgorithm extractionAlgorithm;
+ private static Logger logger = Logger
+ .getLogger(KnowledgeSource.class);
+
public void useConfiguration(SparqlQueryType SparqlQueryType,
SparqlEndpoint SparqlEndpoint, Manipulator manipulator,
int recursiondepth, boolean getAllSuperClasses,
@@ -76,8 +81,10 @@
// System.out.println(ExtractionAlgorithm.getFirstNode(uri));
System.out.println("Start extracting");
SortedSet<String> ret = new TreeSet<String>();
-
+ int progress=0;
for (String one : instances) {
+ progress++;
+ logger.info("Progress: "+progress+" of "+instances.size()+" finished");
try {
Node n = extractionAlgorithm.expandNode(new URI(one),
typedSparqlQuery);
Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlQuery.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlQuery.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/SparqlQuery.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -24,8 +24,8 @@
import java.nio.charset.Charset;
import org.apache.log4j.Logger;
+import org.dllearner.core.KnowledgeSource;
import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
-import org.dllearner.utilities.SimpleClock;
import com.hp.hpl.jena.query.ResultSet;
import com.hp.hpl.jena.query.ResultSetFactory;
@@ -42,7 +42,7 @@
*/
public class SparqlQuery {
- private static Logger logger = Logger.getLogger(SparqlKnowledgeSource.class);
+ private static Logger logger = Logger.getLogger(KnowledgeSource.class);
public String extraDebugInfo = "";
private boolean isRunning = false;
Modified: trunk/src/dl-learner/org/dllearner/kb/sparql/TypedSparqlQuery.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/kb/sparql/TypedSparqlQuery.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/kb/sparql/TypedSparqlQuery.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -24,6 +24,8 @@
import java.util.List;
import java.util.Set;
+import org.apache.log4j.Logger;
+import org.dllearner.core.KnowledgeSource;
import org.dllearner.kb.sparql.configuration.Configuration;
import org.dllearner.utilities.SimpleClock;
import org.dllearner.utilities.StringTuple;
@@ -39,6 +41,10 @@
*
*/
public class TypedSparqlQuery implements TypedSparqlQueryInterface {
+
+ private static Logger logger = Logger.getLogger(KnowledgeSource.class);
+
+
boolean print_flag = false;
protected Configuration configuration;
private SparqlQueryMaker sparqlQueryMaker;
Added: trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java (rev 0)
+++ trunk/src/dl-learner/org/dllearner/scripts/SKOS7030.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -0,0 +1,221 @@
+package org.dllearner.scripts;
+
+import java.util.SortedSet;
+import java.util.TreeSet;
+
+import org.apache.log4j.ConsoleAppender;
+import org.apache.log4j.FileAppender;
+import org.apache.log4j.Level;
+import org.apache.log4j.Logger;
+import org.apache.log4j.SimpleLayout;
+import org.dllearner.core.KnowledgeSource;
+import org.dllearner.kb.sparql.Cache;
+import org.dllearner.kb.sparql.SparqlQuery;
+import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
+import org.dllearner.utilities.AutomaticExampleFinderSKOSSPARQL;
+import org.dllearner.utilities.JenaResultSetConvenience;
+import org.dllearner.utilities.LearnSparql;
+import org.dllearner.utilities.SetManipulation;
+import org.dllearner.utilities.SimpleClock;
+
+import com.hp.hpl.jena.query.ResultSet;
+
+public class SKOS7030 {
+
+ static Cache c;
+ static SparqlEndpoint se;
+ private static Logger logger = Logger.getRootLogger();
+
+ static String standardSettings="";
+ static String algorithm="refexamples";
+ static String standardSettingsRefexamples =
+ "refexamples.minExecutionTimeInSeconds = 30;\n" +
+ "refexamples.maxExecutionTimeInSeconds = 30;\n" +
+ "//refexamples.guaranteeXgoodDescriptions = 10;\n" +
+ "refexamples.logLevel=\"TRACE\";\n" +
+ "refexamples.noisePercentage = 0.10;\n" +
+ "refexamples.writeSearchTree = false;\n" +
+ "refexamples.searchTreeFile = \"searchTree.txt\";\n" +
+ "refexamples.replaceSearchTree = true;\n\n" ;
+
+ static String standardSettingsRefinement =
+ "refinement.minExecutionTimeInSeconds = 30;\n" +
+ "refinement.maxExecutionTimeInSeconds = 30;\n" +
+ "//refinement.guaranteeXgoodDescriptions = 10;\n" +
+ "refinement.logLevel=\"TRACE\";\n" +
+ "refinement.writeSearchTree = false;\n" +
+ "refinement.searchTreeFile = \"searchTree.txt\";\n" +
+ "refinement.replaceSearchTree = true;\n\n" ;
+
+
+
+ static String standardDBpedia="" +
+ "sparql.recursionDepth = 1;\n" +
+ "sparql.predefinedFilter = \"YAGO\";\n" +
+ "sparql.predefinedEndpoint = \"DBPEDIA\";\n";
+ //"sparql.logLevel = \"INFO\";\n";
+
+
+ //vars
+ static boolean useRelated = false;
+ static boolean useSuperClasses = false;
+ static boolean useParallelClasses = true;
+ static int poslimit = 10;
+ static int neglimit = 20;
+
+ /**
+ * @param args
+ */
+ public static void main(String[] args) {
+ init();
+ //logger.setLevel(Level.TRACE);
+ Logger.getLogger(KnowledgeSource.class).setLevel(Level.INFO);
+ //System.out.println(Logger.getLogger(SparqlQuery.class).getLevel());
+ SimpleClock sc=new SimpleClock();
+
+ standardSettings=standardSettingsRefexamples+standardDBpedia;
+ //standardSettings=standardSettingsRefinement+standardDBpedia;
+
+ DBpediaSKOS();
+ //algorithm="refinement";
+ //roles();
+
+ /*System.out.println(Level.DEBUG.getClass());
+ System.out.println(Level.toLevel("INFO"));
+ System.out.println(Level.INFO);*/
+ //System.exit(0);
+
+
+
+ sc.printAndSet("Finished");
+
+ }
+
+
+
+ static void DBpediaSKOS(){
+ se = SparqlEndpoint.EndpointLOCALDBpedia();
+ String url = "http://dbpedia.openlinksw.com:8890/sparql";
+ url = "http://139.18.2.37:8890/sparql";
+
+ SortedSet<String> concepts = new TreeSet<String>();
+
+ concepts.add("http://dbpedia.org/resource/Category:Prime_Ministers_of_the_United_Kingdom");
+ //concepts.add("http://dbpedia.org/resource/Category:Grammy_Award_winners");
+ //concepts.add("EXISTS \"http://dbpedia.org/property/grammyawards\".TOP");
+
+ SortedSet<String> posExamples = new TreeSet<String>();
+ SortedSet<String> negExamples = new TreeSet<String>();
+
+ //HashMap<String, ResultSet> result = new HashMap<String, ResultSet>();
+ //HashMap<String, String> result2 = new HashMap<String, String>();
+ //System.out.println(concepts.first());
+ //logger.setLevel(Level.TRACE);
+ String concept=concepts.first();
+
+ AutomaticExampleFinderSKOSSPARQL ae= new AutomaticExampleFinderSKOSSPARQL( se);
+ useRelated = false;
+ useParallelClasses = true;
+ int recursiondepth=1;
+ boolean closeAfterRecursion=true;
+ boolean randomizeCache=false;
+ ae.initDBpediaSKOS(concept, 0.1, useRelated, useParallelClasses);
+ posExamples = ae.getPosExamples();
+ negExamples = ae.getNegExamples();
+ SortedSet<String> totalSKOSset= ae.totalSKOSset;
+ SortedSet<String> rest= ae.rest;
+
+
+
+ LearnSparql ls = new LearnSparql();
+
+ //igno.add(oneConcept.replaceAll("\"", ""));
+
+ SortedSet<String> conceptresults= ls.learnDBpediaSKOS(posExamples, negExamples, url,new TreeSet<String>(),recursiondepth, closeAfterRecursion,randomizeCache);
+ System.out.println(conceptresults);
+ for (String string : conceptresults) {
+ SortedSet<String> instances = ae.queryConceptAsStringSet(string, 0);
+ if(instances.size()>0)System.out.println("size "+instances.size());
+ if(instances.size()<=15 && instances.size()>0) System.out.println(instances);
+ }
+
+
+
+ //System.out.println("AAAAAAAA");
+ //System.exit(0);
+ //"relearned concept: ";
+ //cf.writeSPARQL(confname, posExamples, negExamples, url, new TreeSet<String>(),standardSettings,algorithm);
+ //
+
+
+ //Statistics.print();
+ }
+
+
+ /***************************************************************************
+ * *********************OLDCODE String
+ * conj="(\"http://dbpedia.org/class/yago/Person100007846\" AND
+ * \"http://dbpedia.org/class/yago/Head110162991\")";
+ *
+ *
+ * concepts.add("EXISTS \"http://dbpedia.org/property/disambiguates\".TOP");
+ * concepts.add("EXISTS
+ * \"http://dbpedia.org/property/successor\".\"http://dbpedia.org/class/yago/Person100007846\"");
+ * concepts.add("EXISTS \"http://dbpedia.org/property/successor\"."+conj);
+ * //concepts.add("ALL \"http://dbpedia.org/property/disambiguates\".TOP");
+ * //concepts.add("ALL
+ * \"http://dbpedia.org/property/successor\".\"http://dbpedia.org/class/yago/Person100007846\"");
+ * concepts.add("\"http://dbpedia.org/class/yago/Person100007846\"");
+ * concepts.add(conj);
+ * concepts.add("(\"http://dbpedia.org/class/yago/Person100007846\" OR
+ * \"http://dbpedia.org/class/yago/Head110162991\")");
+ *
+ * //concepts.add("NOT \"http://dbpedia.org/class/yago/Person100007846\"");
+ *
+ * for (String kbsyntax : concepts) {
+ * result.put(kbsyntax,queryConcept(kbsyntax)); }
+ * System.out.println("************************"); for (String string :
+ * result.keySet()) { System.out.println("KBSyntayString: "+string);
+ * System.out.println("Query:\n"+result.get(string).hasNext());
+ * System.out.println("************************"); }
+ **************************************************************************/
+
+
+
+
+
+ public static void init() {
+
+ SimpleLayout layout = new SimpleLayout();
+ // create logger (a simple logger which outputs
+ // its messages to the console)
+ FileAppender fileAppender =null; ;
+ try{
+ fileAppender = new FileAppender(layout,"the_log.txt",false);
+ }catch (Exception e) {e.printStackTrace();}
+
+ ConsoleAppender consoleAppender = new ConsoleAppender(layout);
+ logger.removeAllAppenders();
+ logger.addAppender(consoleAppender);
+ logger.addAppender(fileAppender);
+ logger.setLevel(Level.DEBUG);
+ c = new Cache("cachetemp");
+
+
+ }
+
+ public static SortedSet<String> selectDBpediaConcepts(int number){
+ String query = "SELECT DISTINCT ?concept WHERE { \n" +
+ "[] a ?concept .FILTER (regex(str(?concept),'yago'))" +
+ " \n} \n"; //LIMIT "+number+"
+
+
+ String JSON = (c.executeSparqlQuery(new SparqlQuery(query, se)));
+ ResultSet rs =SparqlQuery.JSONtoResultSet(JSON);
+ JenaResultSetConvenience rsc = new JenaResultSetConvenience(rs);
+ return SetManipulation.fuzzyShrink(rsc.getStringListForVariable("concept"),number);
+ }
+
+
+
+}
Added: trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSKOSSPARQL.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSKOSSPARQL.java (rev 0)
+++ trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSKOSSPARQL.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -0,0 +1,408 @@
+package org.dllearner.utilities;
+
+import java.util.SortedSet;
+import java.util.TreeSet;
+
+import org.apache.log4j.Logger;
+import org.dllearner.core.ComponentManager;
+import org.dllearner.kb.sparql.Cache;
+import org.dllearner.kb.sparql.SparqlQuery;
+import org.dllearner.kb.sparql.SparqlQueryDescriptionConvertVisitor;
+import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
+
+import com.hp.hpl.jena.query.ResultSet;
+
+public class AutomaticExampleFinderSKOSSPARQL {
+
+ private static Logger logger = Logger
+ .getLogger(ComponentManager.class);
+
+ private Cache c;
+ private SparqlEndpoint se;
+ private SortedSet<String> posExamples= new TreeSet<String>();;
+ private SortedSet<String> negExamples= new TreeSet<String>();;
+ public SortedSet<String> totalSKOSset= new TreeSet<String>();;
+ public SortedSet<String> rest= new TreeSet<String>();;
+ private int limit=2000;
+
+
+ public AutomaticExampleFinderSKOSSPARQL(SparqlEndpoint se){
+ this.c=new Cache("cachetemp");
+ this.se=se;
+ posExamples = new TreeSet<String>();
+ negExamples = new TreeSet<String>();
+ }
+
+ public void initDBpediaSKOS(String concept, double percent, boolean useRelated,boolean useParallelClasses) {
+ dbpediaMakePositiveExamplesFromConcept( concept);
+ SortedSet<String> keepForClean = new TreeSet<String>();
+ keepForClean.addAll(this.posExamples);
+ totalSKOSset.addAll(this.posExamples);
+ rest.addAll(totalSKOSset);
+ int poslimit=(int)Math.round(percent*totalSKOSset.size());
+ int neglimit=2*poslimit;
+ while (this.posExamples.size()>poslimit) {
+ this.posExamples.remove(posExamples.last());
+ }
+ //this.posExamples = SetManipulation.fuzzyShrink(this.posExamples, poslimit);
+
+ rest.removeAll(this.posExamples);
+
+ logger.debug("pos Example size: "+posExamples.size());
+ logger.debug("totalSKOSset: "+totalSKOSset.size());
+ logger.debug("rest: "+rest.size());
+
+ if(useRelated) {
+ dbpediaMakeNegativeExamplesFromRelatedInstances(this.posExamples);
+ }
+
+ if(useParallelClasses) {
+ int limit = this.posExamples.size();
+ makeNegativeExamplesFromClassesOfInstances(limit);
+ }
+ //clean
+ negExamples.removeAll(keepForClean);
+ logger.debug("neg Example size after cleaning: "+negExamples.size());
+ this.negExamples = SetManipulation.fuzzyShrink(negExamples, neglimit);
+ logger.debug("pos Example size after shrinking: "+posExamples.size());
+ logger.debug("neg Example size after shrinking: "+negExamples.size());
+ logger.debug("Finished examples for concept: "+concept);
+ }
+
+/* public void init(String concept, String namespace, boolean useRelated, boolean useSuperclasses,boolean useParallelClasses, int poslimit, int neglimit) {
+ makePositiveExamplesFromConcept( concept);
+ SortedSet<String> keepForClean = new TreeSet<String>();
+ keepForClean.addAll(this.posExamples);
+ this.posExamples = SetManipulation.fuzzyShrink(this.posExamples, poslimit);
+ logger.trace("shrinking: pos Example size: "+posExamples.size());
+
+ if(useRelated) {
+ makeNegativeExamplesFromRelatedInstances(this.posExamples,namespace);
+ }
+ if(useSuperclasses) {
+ makeNegativeExamplesFromSuperClasses(concept);
+ }
+ if(useParallelClasses) {
+ makeNegativeExamplesFromClassesOfInstances();
+ }
+ //clean
+ negExamples.removeAll(keepForClean);
+ logger.debug("neg Example size after cleaning: "+negExamples.size());
+ this.negExamples = SetManipulation.fuzzyShrink(negExamples, neglimit);
+ logger.debug("pos Example size after shrinking: "+posExamples.size());
+ logger.debug("neg Example size after shrinking: "+negExamples.size());
+ logger.debug("Finished examples for concept: "+concept);
+ }*/
+
+
+
+ public SortedSet<String> dbpediaGetPosOnly(String concept, int limit){
+ dbpediaMakePositiveExamplesFromConcept( concept);
+ return SetManipulation.fuzzyShrink(this.posExamples, limit);
+ }
+
+ public SortedSet<String> getPosOnly(String concept, int limit){
+ makePositiveExamplesFromConcept( concept);
+ return SetManipulation.fuzzyShrink(this.posExamples, limit);
+ }
+
+ private void dbpediaMakePositiveExamplesFromConcept(String concept){
+ logger.debug("making Positive Examples from Concept: "+concept);
+ if(concept.contains("http://dbpedia.org/resource/Category:")) {
+ this.posExamples = new JenaResultSetConvenience(dbpediaQuerySKOSConcept(concept,limit))
+ .getStringListForVariable("subject");
+ }else {
+ this.posExamples = new JenaResultSetConvenience(queryConcept(concept,limit))
+ .getStringListForVariable("subject");
+ }
+ logger.debug("pos Example size: "+posExamples.size());
+ }
+
+ private void makePositiveExamplesFromConcept(String concept){
+ logger.debug("making Positive Examples from Concept: "+concept);
+ this.posExamples = new JenaResultSetConvenience(queryConcept(concept,0))
+ .getStringListForVariable("subject");
+ logger.debug(" pos Example size: "+posExamples.size());
+ }
+
+
+
+ /*private void makePositiveExamplesFromConcept(String concept){
+ logger.debug("making Positive Examples from Concept: "+concept);
+ if(concept.contains("http://dbpedia.org/resource/Category:")) {
+ this.posExamples = new JenaResultSetConvenience(querySKOSConcept(concept,0))
+ .getStringListForVariable("subject");
+ }else {
+ this.posExamples = new JenaResultSetConvenience(queryConcept(concept,0))
+ .getStringListForVariable("subject");
+ }
+ logger.debug(" pos Example size: "+posExamples.size());
+ }*/
+
+
+
+
+
+ private void dbpediaMakeNegativeExamplesFromRelatedInstances(SortedSet<String> subject) {
+ logger.debug("making examples from related instances");
+ for (String string : subject) {
+ dbpediaMakeNegativeExamplesFromRelatedInstances(string);
+ }
+ logger.debug(" negExample size: "+negExamples.size());
+ }
+
+ private void makeNegativeExamplesFromRelatedInstances(SortedSet<String> subject, String namespace) {
+ logger.debug("making examples from related instances");
+ for (String string : subject) {
+ makeNegativeExamplesFromRelatedInstances(string,namespace);
+ }
+ logger.debug(" negExample size: "+negExamples.size());
+ }
+
+
+ /**
+ *
+ * @param subject
+ * @return
+ */
+ private void dbpediaMakeNegativeExamplesFromRelatedInstances(String subject) {
+ // SortedSet<String> result = new TreeSet<String>();
+
+ String query = "SELECT * WHERE { \n" + "<" + subject + "> " + "?p ?o. \n"
+ + "FILTER (REGEX(str(?o), 'http://dbpedia.org/resource/')).\n"
+ + "FILTER (!REGEX(str(?p), 'http://www.w3.org/2004/02/skos'))\n"
+ + "}";
+
+ String JSON = (c.executeSparqlQuery(new SparqlQuery(query, se)));
+ ResultSet rs =SparqlQuery.JSONtoResultSet(JSON);
+ JenaResultSetConvenience rsc = new JenaResultSetConvenience(rs);
+ this.negExamples.addAll(rsc.getStringListForVariable("o"));
+
+
+ }
+
+ private void makeNegativeExamplesFromRelatedInstances(String subject, String namespace) {
+ // SortedSet<String> result = new TreeSet<String>();
+
+ String query = "SELECT * WHERE { \n" + "<" + subject + "> " + "?p ?o. \n"
+ + "FILTER (REGEX(str(?o), '"+namespace+"')).\n"
+ + "}";
+
+ String JSON = (c.executeSparqlQuery(new SparqlQuery(query, se)));
+ ResultSet rs =SparqlQuery.JSONtoResultSet(JSON);
+ JenaResultSetConvenience rsc = new JenaResultSetConvenience(rs);
+ this.negExamples.addAll(rsc.getStringListForVariable("o"));
+
+
+ }
+
+
+ private void makeNegativeExamplesFromSuperClasses(String concept) {
+
+ SortedSet<String> superClasses = new TreeSet<String>();
+ superClasses.add(concept.replace("\"", ""));
+ //logger.debug("before"+superClasses);
+ superClasses = getSuperClasses( superClasses, 4);
+ logger.debug("making neg Examples from "+superClasses.size()+" superclasses");
+ JenaResultSetConvenience rsc;
+ for (String oneSuperClass : superClasses) {
+ logger.debug(oneSuperClass);
+ rsc = new JenaResultSetConvenience(queryConcept("\""+oneSuperClass+"\"", limit));
+ this.negExamples.addAll(rsc.getStringListForVariable("subject"));
+ }
+ logger.debug(" neg Example size: "+negExamples.size());
+ }
+
+
+
+ private void makeNegativeExamplesFromClassesOfInstances(int limit) {
+ logger.debug("making neg Examples from parallel classes");
+ SortedSet<String> classes = new TreeSet<String>();
+ //superClasses.add(concept.replace("\"", ""));
+ //logger.debug("before"+superClasses);
+ //superClasses = dbpediaGetSuperClasses( superClasses, 4);
+ //logger.debug("getting negExamples from "+superClasses.size()+" superclasses");
+ JenaResultSetConvenience rsc;
+ ResultSet rs=null;
+ for (String instance : posExamples) {
+ //System.out.println(instance);
+ rs = getClassesForInstance(instance);
+ //System.out.println(ResultSetFormatter.asXMLString(rs));
+ rsc = new JenaResultSetConvenience(rs);
+ classes.addAll(rsc.getStringListForVariable("subject"));
+ //System.out.println(classes);
+ }
+ logger.debug("getting negExamples from "+classes.size()+" parallel classes");
+ for (String oneClass : classes) {
+ logger.debug(oneClass);
+ rsc = new JenaResultSetConvenience(queryConcept("\""+oneClass+"\"",limit));
+ this.negExamples.addAll(rsc.getStringListForVariable("subject"));
+ }
+ logger.debug("neg Example size: "+negExamples.size());
+
+ }
+
+ private SortedSet<String> getSuperClasses(SortedSet<String> superClasses, int depth) {
+ SortedSet<String> ret = new TreeSet<String>();
+ SortedSet<String> tmpset = new TreeSet<String>();
+ ret.addAll(superClasses);
+ //logger.debug(superClasses);
+ JenaResultSetConvenience rsc;
+
+ String query = "";
+ for (; depth != 0 ; depth--) {
+ for (String oneSuperClass : superClasses) {
+
+ //tmp = oneSuperClass.replace("\"", "");
+ query = "SELECT * WHERE { \n" + "<" + oneSuperClass + "> "
+ + "<http://www.w3.org/2000/01/rdf-schema#subClassOf> ?superclass. \n"
+ + "}";
+
+ String JSON = (c.executeSparqlQuery(new SparqlQuery(query, se)));
+ ResultSet rs =SparqlQuery.JSONtoResultSet(JSON);
+ rsc = new JenaResultSetConvenience(rs);
+ tmpset.addAll(rsc.getStringListForVariable("superclass"));
+
+ }
+ ret.addAll(tmpset);
+ //logger.debug(ret);
+ superClasses.clear();
+ superClasses.addAll(tmpset);
+ tmpset.clear();
+ }
+ //logger.debug(concept);
+ //logger.debug(query);
+ return ret;
+ }
+
+
+
+ public ResultSet queryConcept(String concept,int limit) {
+ ResultSet rs = null;
+ try {
+ String query = SparqlQueryDescriptionConvertVisitor
+ .getSparqlQuery(concept,limit);
+
+ SparqlQuery sq = new SparqlQuery(query, se);
+ String JSON = c.executeSparqlQuery(sq);
+ //System.out.println("JSON:\n"+JSON);
+ rs = SparqlQuery.JSONtoResultSet(JSON);
+
+ } catch (Exception e) {
+ e.printStackTrace();
+ }
+
+ return rs;
+ }
+
+ public SortedSet<String> queryConceptAsStringSet(String concept,int limit) {
+ ResultSet rs = null;
+ try {
+ String query = SparqlQueryDescriptionConvertVisitor
+ .getSparqlQuery(concept,limit);
+
+ SparqlQuery sq = new SparqlQuery(query, se);
+ String JSON = c.executeSparqlQuery(sq);
+ //System.out.println("JSON:\n"+JSON);
+ rs = SparqlQuery.JSONtoResultSet(JSON);
+
+ } catch (Exception e) {
+ e.printStackTrace();
+ }
+ return new JenaResultSetConvenience(rs).getStringListForVariable("subject");
+
+ }
+
+ public ResultSet dbpediaQuerySKOSConcept(String SKOSconcept,int limit) {
+ if(limit==0)limit=99999;
+ //
+ ResultSet rs = null;
+ try {
+
+ String query = "SELECT * WHERE { \n " +
+ "?subject " +
+ "<http://www.w3.org/2004/02/skos/core#subject> " +
+ "<" + SKOSconcept + "> \n" +
+ "} LIMIT "+limit;
+ SparqlQuery sq = new SparqlQuery(query, se);
+ String JSON = c.executeSparqlQuery(sq);
+ //System.out.println(JSON);
+ rs = SparqlQuery.JSONtoResultSet(JSON);
+
+ } catch (Exception e) {
+ e.printStackTrace();
+ }
+
+ return rs;
+ }
+
+ public ResultSet getClassesForInstance(String instance) {
+ ResultSet rs = null;
+ try {
+
+ String query = "SELECT ?subject WHERE { \n " +
+ "<" + instance + ">"+
+ " a " +
+ "?subject " +
+ "\n" +
+ "}";
+ SparqlQuery sq = new SparqlQuery(query, se);
+ //System.out.println(query);
+ String JSON = c.executeSparqlQuery(sq);
+ //System.out.println(JSON);
+ rs = SparqlQuery.JSONtoResultSet(JSON);
+
+ } catch (Exception e) {
+ e.printStackTrace();
+ }
+
+ return rs;
+ }
+
+ public SortedSet<String> getPosExamples() {
+ return posExamples;
+ }
+
+ public SortedSet<String> getNegExamples() {
+ return negExamples;
+ }
+
+
+ /**
+ * NOT WORKING
+ * @param description
+ */
+ public void getSubClasses(String description) {
+ ResultSet rs = null;
+ try {
+ String query = SparqlQueryDescriptionConvertVisitor
+ .getSparqlSubclassQuery(description.replace("\"", ""));
+
+ rs = new SparqlQuery(query, se).send();
+ System.out.println(query);
+ //System.out.println(SparqlQuery.getAsXMLString(rs));
+ System.out.println(rs.getResultVars());
+ SortedSet<String> remainingClasses = new JenaResultSetConvenience(rs).getStringListForVariable("subject");
+ SortedSet<String> alreadyQueried = new TreeSet<String>();
+ alreadyQueried.add(description);
+ while (remainingClasses.size()!=0){
+ String tmp = remainingClasses.first();
+ remainingClasses.remove(tmp);
+ query = SparqlQueryDescriptionConvertVisitor
+ .getSparqlSubclassQuery(tmp);
+ alreadyQueried.add(tmp);
+ rs = new SparqlQuery(query, se).send();
+ remainingClasses.addAll(new JenaResultSetConvenience(rs).getStringListForVariable("subject"));
+ }
+ //System.out.println(JSON);
+ System.out.println(alreadyQueried);
+
+ } catch (Exception e) {
+ e.printStackTrace();
+ }
+
+ }
+
+
+
+}
Modified: trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/utilities/AutomaticExampleFinderSPARQL.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -21,6 +21,7 @@
private SparqlEndpoint se;
private SortedSet<String> posExamples;
private SortedSet<String> negExamples;
+ public SortedSet<String> totalSKOSset;
private int limit=2000;
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 01:23:08 UTC (rev 871)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-16 07:05:09 UTC (rev 872)
@@ -110,6 +110,95 @@
//System.out.println( la.getBestSolution());;
}
+ public SortedSet<String> learnDBpediaSKOS(SortedSet<String> posExamples,SortedSet<String> negExamples,
+ String uri, SortedSet<String> ignoredConcepts, int recursiondepth,
+ boolean closeAfterRecursion, boolean randomizeCache){
+
+ ComponentManager cm = ComponentManager.getInstance();
+ LearningAlgorithm la = null;
+ ReasoningService rs = null;
+ LearningProblem lp = null;
+ SparqlKnowledgeSource ks =null;
+ try {
+ Set<KnowledgeSource> sources = new HashSet<KnowledgeSource>();
+
+ ks = cm.knowledgeSource(SparqlKnowledgeSource.class);
+
+ SortedSet<String> instances = new TreeSet<String>();
+ instances.addAll(posExamples);
+ instances.addAll(negExamples);
+ cm.applyConfigEntry(ks, "instances",instances);
+ cm.applyConfigEntry(ks, "url",uri);
+ cm.applyConfigEntry(ks, "recursionDepth",recursiondepth);
+ cm.applyConfigEntry(ks, "closeAfterRecursion",closeAfterRecursion);
+ cm.applyConfigEntry(ks, "predefinedFilter","YAGO");
+ cm.applyConfigEntry(ks, "predefinedEndpoint","LOCALDBPEDIA");
+ if(randomizeCache)
+ cm.applyConfigEntry(ks, "cacheDir","cache/"+System.currentTimeMillis()+"");
+ else {cm.applyConfigEntry(ks, "cacheDir","cacheSKOS");}
+ //cm.applyConfigEntry(ks, "format","KB");
+
+ sc.setTime();
+ ks.init();
+ Statistics.addTimeCollecting(sc.getTime());
+ sources.add(ks);
+ //if (true)return;
+ //System.out.println(ks.getNTripleURL());
+ //
+
+ ReasonerComponent r = new FastInstanceChecker(sources);
+ //cm.applyConfigEntry(r,"useAllConstructor",false);
+ //cm.applyConfigEntry(r,"useExistsConstructor",true);
+ r.init();
+ rs = new ReasoningService(r);
+
+ lp = new PosNegDefinitionLP(rs);
+ //cm.applyConfigEntry(lp, "positiveExamples",toInd(posExamples));
+ ((PosNegLP) lp).setPositiveExamples(SetManipulation.stringToInd(posExamples));
+ ((PosNegLP) lp).setNegativeExamples(SetManipulation.stringToInd(negExamples));
+ //cm.applyConfigEntry(lp, "negativeExamples",toInd(negExamples));
+ lp.init();
+
+ la = cm.learningAlgorithm(ExampleBasedROLComponent.class, lp, rs);
+
+ cm.applyConfigEntry(la,"useAllConstructor",false);
+ cm.applyConfigEntry(la,"useExistsConstructor",true);
+ cm.applyConfigEntry(la,"useCardinalityRestrictions",false);
+ cm.applyConfigEntry(la,"useNegation",false);
+ cm.applyConfigEntry(la,"minExecutionTimeInSeconds",0);
+ cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",50);
+ cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",15);
+ cm.applyConfigEntry(la,"writeSearchTree",true);
+ cm.applyConfigEntry(la,"searchTreeFile","log/SKOS.txt");
+ cm.applyConfigEntry(la,"replaceSearchTree",true);
+ //cm.applyConfigEntry(la,"noisePercentage",0.15);
+
+
+ //cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
+ cm.applyConfigEntry(la,"logLevel","TRACE");
+
+ //cm.applyConfigEntry(la,"quiet",false);
+ //System.out.println(ignoredConcepts.first());;
+ if(ignoredConcepts.size()>0)
+ cm.applyConfigEntry(la,"ignoredConcepts",ignoredConcepts);
+ la.init();
+
+ System.out.println("start learning");
+ sc.setTime();
+ la.start();
+ Statistics.addTimeLearning(sc.getTime());
+ return la.getBestSolutionsAsKBSyntax(15);
+ //if(sc.getTime()/1000 >= 20)System.out.println("XXXMAX time reached");
+
+ //System.out.println("best"+la(20));
+ //((ExampleBasedROLComponent)la).printBestSolutions(10000);
+
+ }catch (Exception e) {e.printStackTrace();}
+ return null;
+ //System.out.println( la.getBestSolution());;
+ }
+
+
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 01:23:20
|
Revision: 871
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=871&view=rev
Author: kurzum
Date: 2008-05-15 18:23:08 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 01:15:38 UTC (rev 870)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 01:23:08 UTC (rev 871)
@@ -194,12 +194,12 @@
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/Articulation107131854");
concepts.add("http://dbpedia.org/class/yago/Patriot110407310");
concepts.add("http://dbpedia.org/class/yago/Ceremony107450842");*/
- concepts.add("http://dbpedia.org/class/yago/CookingOil107673145");
+ //concepts.add("http://dbpedia.org/class/yago/CookingOil107673145");
/*concepts.add("http://dbpedia.org/class/yago/Corticosteroid114751417");
concepts.add("http://dbpedia.org/class/yago/Curlew102033561");
concepts.add("http://dbpedia.org/class/yago/DataStructure105728493");
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 01:15:53
|
Revision: 870
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=870&view=rev
Author: kurzum
Date: 2008-05-15 18:15:38 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 01:08:43 UTC (rev 869)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 01:15:38 UTC (rev 870)
@@ -194,13 +194,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");
@@ -214,7 +214,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;
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 01:08:49
|
Revision: 869
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=869&view=rev
Author: kurzum
Date: 2008-05-15 18:08:43 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 00:56:53 UTC (rev 868)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 01:08:43 UTC (rev 869)
@@ -77,17 +77,15 @@
// schauen, ob es mehrere allgemeinere Nachbarn gibt
SortedSet<Description> moreGeneral = subsumptionHierarchyUp.get(c);
//RBC //HACK
- if(moreGeneral.size()==0){
- subsumptionHierarchyUp.remove(c);
- moreGeneral=null;
- }
//if(moreGeneral != null && moreGeneral.size()>0) {
if(moreGeneral != null ) {
//System.out.println(moreGeneral);
if(moreGeneral.size()==0) {
+ subsumptionHierarchyUp.remove(c);
+ moreGeneral=null;
//hierarchyDownNew.get(new Thing()).add(c);
//moreGeneral.add(new Thing());
- subsumptionHierarchyUp.put(c, null);
+ //subsumptionHierarchyUp.put(c, null);
}else {
Description chosenParent = moreGeneral.first();
@@ -100,16 +98,15 @@
for(Description c : allowedConceptsInSubsumptionHierarchy) {
SortedSet<Description> moreSpecial = subsumptionHierarchyDown.get(c);
//RBC //HACK
- if(moreSpecial.size()==0){
- subsumptionHierarchyDown.remove(c);
- moreSpecial=null;
- }
+
//if(moreSpecial != null && moreSpecial.size()>0) {
if(moreSpecial != null ) {
if(moreSpecial.size()==0){
- //hierarchyUpNew.get(new Nothing()).add(c);
+ subsumptionHierarchyDown.remove(c);
+ moreSpecial=null;
+ //hierarchyUpNew.get(new Nothing()).add(c);
//moreSpecial.add(new Nothing());
- subsumptionHierarchyDown.put(c, null);
+ //subsumptionHierarchyDown.put(c, null);
}
else {
Description chosenParent = moreSpecial.first();
Modified: trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-16 00:56:53 UTC (rev 868)
+++ trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-16 01:08:43 UTC (rev 869)
@@ -41,6 +41,7 @@
}
public static void addTimeLearning(long value) {
+
Long current = timeLearning.get(currentLabel);
if(current==null)
timeLearning.put(currentLabel, new Long(value));
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 00:57:04
|
Revision: 868
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=868&view=rev
Author: kurzum
Date: 2008-05-15 17:56:53 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/cli/Start.java
trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
Modified: trunk/src/dl-learner/org/dllearner/cli/Start.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/cli/Start.java 2008-05-16 00:40:54 UTC (rev 867)
+++ trunk/src/dl-learner/org/dllearner/cli/Start.java 2008-05-16 00:56:53 UTC (rev 868)
@@ -71,6 +71,7 @@
import org.dllearner.kb.KBFile;
import org.dllearner.kb.OWLFile;
import org.dllearner.kb.sparql.SparqlKnowledgeSource;
+import org.dllearner.kb.sparql.TypedSparqlQuery;
import org.dllearner.learningproblems.PosNegDefinitionLP;
import org.dllearner.learningproblems.PosNegInclusionLP;
import org.dllearner.learningproblems.PosOnlyDefinitionLP;
@@ -126,7 +127,9 @@
logger.addAppender(consoleAppender);
logger.addAppender(fileAppender);
logger.setLevel(Level.TRACE);
- //Logger.getLogger(KnowledgeSource.class).setLevel(Level.TRACE);
+ Logger.getLogger(KnowledgeSource.class).setLevel(Level.WARN);
+ Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.WARN);
+ Logger.getLogger(TypedSparqlQuery.class).setLevel(Level.WARN);
Start start = null;
start = new Start(file);
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 00:40:54 UTC (rev 867)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 00:56:53 UTC (rev 868)
@@ -77,6 +77,10 @@
// schauen, ob es mehrere allgemeinere Nachbarn gibt
SortedSet<Description> moreGeneral = subsumptionHierarchyUp.get(c);
//RBC //HACK
+ if(moreGeneral.size()==0){
+ subsumptionHierarchyUp.remove(c);
+ moreGeneral=null;
+ }
//if(moreGeneral != null && moreGeneral.size()>0) {
if(moreGeneral != null ) {
//System.out.println(moreGeneral);
@@ -96,6 +100,10 @@
for(Description c : allowedConceptsInSubsumptionHierarchy) {
SortedSet<Description> moreSpecial = subsumptionHierarchyDown.get(c);
//RBC //HACK
+ if(moreSpecial.size()==0){
+ subsumptionHierarchyDown.remove(c);
+ moreSpecial=null;
+ }
//if(moreSpecial != null && moreSpecial.size()>0) {
if(moreSpecial != null ) {
if(moreSpecial.size()==0){
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 00:40:58
|
Revision: 867
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=867&view=rev
Author: kurzum
Date: 2008-05-15 17:40:54 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java
Modified: trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java 2008-05-16 00:34:06 UTC (rev 866)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLComponent.java 2008-05-16 00:40:54 UTC (rev 867)
@@ -292,6 +292,8 @@
} else if(ignoredConcepts != null) {
System.out.println(ignoredConcepts);
usedConcepts = Helper.computeConceptsUsingIgnoreList(rs, ignoredConcepts);
+ //RBC
+ System.out.println(usedConcepts);
} else {
usedConcepts = Helper.computeConcepts(rs);
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 00:34:15
|
Revision: 866
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=866&view=rev
Author: kurzum
Date: 2008-05-15 17:34:06 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 00:15:47 UTC (rev 865)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-16 00:34:06 UTC (rev 866)
@@ -41,8 +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);
+ System.out.println(subsumptionHierarchyDown);
+ System.out.println(subsumptionHierarchyUp);
this.subsumptionHierarchyDown = subsumptionHierarchyDown;
allowedConceptsInSubsumptionHierarchy = new TreeSet<Description>(conceptComparator);
allowedConceptsInSubsumptionHierarchy.addAll(atomicConcepts);
@@ -81,8 +81,10 @@
if(moreGeneral != null ) {
//System.out.println(moreGeneral);
if(moreGeneral.size()==0) {
- hierarchyDownNew.get(new Thing()).add(c);
- moreGeneral.add(new Thing());
+ //hierarchyDownNew.get(new Thing()).add(c);
+ //moreGeneral.add(new Thing());
+ subsumptionHierarchyUp.put(c, null);
+
}else {
Description chosenParent = moreGeneral.first();
hierarchyDownNew.get(chosenParent).add(c);
@@ -97,8 +99,9 @@
//if(moreSpecial != null && moreSpecial.size()>0) {
if(moreSpecial != null ) {
if(moreSpecial.size()==0){
- hierarchyUpNew.get(new Nothing()).add(c);
- moreSpecial.add(new Nothing());
+ //hierarchyUpNew.get(new Nothing()).add(c);
+ //moreSpecial.add(new Nothing());
+ subsumptionHierarchyDown.put(c, null);
}
else {
Description chosenParent = moreSpecial.first();
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-16 00:15:50
|
Revision: 865
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=865&view=rev
Author: kurzum
Date: 2008-05-15 17:15:47 -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-16 00:07:39 UTC (rev 864)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-16 00:15:47 UTC (rev 865)
@@ -363,7 +363,7 @@
logger.debug("--- loop " + loop + " started ---");
}
//RBC
- logger.debug("--- loop " + loop + " started ---");
+ //logger.debug("--- loop " + loop + " started ---");
//sc.printAndSet("before Traverse");
// traverse the current search tree to find a solution
if(useTreeTraversal && (currentTime - lastTreeTraversalTime > traversalInterval)) {
@@ -1071,11 +1071,9 @@
public void printBestSolutions(int nrOfSolutions, boolean showOrderedSolutions){
- System.out.println("alogger is "+logger.isTraceEnabled()+"||");
if(!logger.isTraceEnabled())
return;
- System.out.println("blogger is "+logger.isTraceEnabled()+"||");
-// if(!logger.getLevel().toString().equalsIgnoreCase("TRACE"))return;
+ //if(!logger.getLevel().toString().equalsIgnoreCase("TRACE"))return;
if(nrOfSolutions==0)
nrOfSolutions=candidatesStable.size();
int i=0;
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 00:07:39 UTC (rev 864)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-16 00:15:47 UTC (rev 865)
@@ -11,7 +11,9 @@
import org.apache.log4j.Level;
import org.apache.log4j.Logger;
import org.apache.log4j.SimpleLayout;
+import org.dllearner.core.KnowledgeSource;
import org.dllearner.kb.sparql.Cache;
+import org.dllearner.kb.sparql.SparqlKnowledgeSource;
import org.dllearner.kb.sparql.SparqlQuery;
import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
import org.dllearner.utilities.AutomaticExampleFinderSPARQL;
@@ -47,8 +49,9 @@
init();
System.out.println("Start");
//logger.setLevel(Level.TRACE);
- logger.setLevel(Level.TRACE);
- //Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.TRACE);
+ logger.setLevel(Level.WARN);
+ //Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.WARN);
+ //Logger.getLogger(KnowledgeSource.class).setLevel(Level.WARN);
//System.out.println(Logger.getLogger(SparqlQuery.class).getLevel());
SimpleClock sc=new SimpleClock();
LocalDBpediaEvaluation();
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
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.
|
|
From: <ku...@us...> - 2008-05-15 23:30:26
|
Revision: 863
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=863&view=rev
Author: kurzum
Date: 2008-05-15 16:30:00 -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
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 22:56:02 UTC (rev 862)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-15 23:30:00 UTC (rev 863)
@@ -359,7 +359,7 @@
lastPrintTime = currentTime;
logger.debug("--- loop " + loop + " started ---");
}
-
+ logger.debug("--- loop " + loop + " started ---");
// traverse the current search tree to find a solution
if(useTreeTraversal && (currentTime - lastTreeTraversalTime > traversalInterval)) {
traverseTree();
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 22:56:02 UTC (rev 862)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 23:30:00 UTC (rev 863)
@@ -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 22:56:02 UTC (rev 862)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 23:30:00 UTC (rev 863)
@@ -80,10 +80,10 @@
cm.applyConfigEntry(la,"useCardinalityRestrictions",false);
cm.applyConfigEntry(la,"useNegation",false);
cm.applyConfigEntry(la,"minExecutionTimeInSeconds",0);
- cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",400);
+ cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",30);
//cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
- cm.applyConfigEntry(la,"logLevel","DEBUG");
+ cm.applyConfigEntry(la,"logLevel","TRACE");
//cm.applyConfigEntry(la,"quiet",false);
//System.out.println(ignoredConcepts.first());;
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 22:57:49
|
Revision: 862
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=862&view=rev
Author: kurzum
Date: 2008-05-15 15:56:02 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 22:47:29 UTC (rev 861)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 22:56:02 UTC (rev 862)
@@ -80,7 +80,7 @@
cm.applyConfigEntry(la,"useCardinalityRestrictions",false);
cm.applyConfigEntry(la,"useNegation",false);
cm.applyConfigEntry(la,"minExecutionTimeInSeconds",0);
- cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",20);
+ cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",400);
//cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
cm.applyConfigEntry(la,"logLevel","DEBUG");
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 22:48:56
|
Revision: 861
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=861&view=rev
Author: kurzum
Date: 2008-05-15 15:47:29 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 22:36:48 UTC (rev 860)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 22:47:29 UTC (rev 861)
@@ -75,7 +75,7 @@
SortedSet<String> concepts = new TreeSet<String>();
SortedSet<String> tmpSet = new TreeSet<String>();
- //selectDBpediaConcepts(number);
+ //System.out.println(selectDBpediaConcepts(10));
tmpSet=initConcepts();
int number=tmpSet.size();
//concepts.add("\"http://dbpedia.org/class/yago/Flamethrower103356559\"");
@@ -181,7 +181,7 @@
public static SortedSet<String> selectDBpediaConcepts(int number){
String query = "SELECT DISTINCT ?concept WHERE { \n" +
"[] a ?concept .FILTER (regex(str(?concept),'yago'))" +
- " \n} LIMIT "+4000+" \n "; //
+ " \n} LIMIT "+1000+" \n "; //
String JSON = (c.executeSparqlQuery(new SparqlQuery(query, se)));
ResultSet rs =SparqlQuery.JSONtoResultSet(JSON);
@@ -194,7 +194,7 @@
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/Caliphate108550766");
+ concepts.add("http://dbpedia.org/class/yago/Patriot110407310");
concepts.add("http://dbpedia.org/class/yago/Ceremony107450842");
concepts.add("http://dbpedia.org/class/yago/CookingOil107673145");
concepts.add("http://dbpedia.org/class/yago/Corticosteroid114751417");
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 22:39:04
|
Revision: 860
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=860&view=rev
Author: kurzum
Date: 2008-05-15 15:36:48 -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
trunk/src/dl-learner/org/dllearner/utilities/Statistics.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 22:07:25 UTC (rev 859)
+++ trunk/src/dl-learner/org/dllearner/algorithms/refexamples/ExampleBasedROLearner.java 2008-05-15 22:36:48 UTC (rev 860)
@@ -1061,8 +1061,10 @@
public void printBestSolutions(int nrOfSolutions, boolean showOrderedSolutions){
+ System.out.println("alogger is "+logger.isTraceEnabled()+"||");
if(!logger.isTraceEnabled())
return;
+ System.out.println("blogger is "+logger.isTraceEnabled()+"||");
// if(!logger.getLevel().toString().equalsIgnoreCase("TRACE"))return;
if(nrOfSolutions==0)
nrOfSolutions=candidatesStable.size();
Modified: trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-15 22:07:25 UTC (rev 859)
+++ trunk/src/dl-learner/org/dllearner/core/owl/SubsumptionHierarchy.java 2008-05-15 22:36:48 UTC (rev 860)
@@ -75,10 +75,15 @@
// schauen, ob es mehrere allgemeinere Nachbarn gibt
SortedSet<Description> moreGeneral = subsumptionHierarchyUp.get(c);
//RBC //HACK
- if(moreGeneral != null && moreGeneral.size()>0) {
+ //if(moreGeneral != null && moreGeneral.size()>0) {
+ if(moreGeneral != null ) {
//System.out.println(moreGeneral);
- Description chosenParent = moreGeneral.first();
- hierarchyDownNew.get(chosenParent).add(c);
+ if(moreGeneral.size()==0) {
+ hierarchyDownNew.get(new Thing()).add(c);
+ }else {
+ Description chosenParent = moreGeneral.first();
+ hierarchyDownNew.get(chosenParent).add(c);
+ }
}
}
@@ -86,9 +91,16 @@
for(Description c : allowedConceptsInSubsumptionHierarchy) {
SortedSet<Description> moreSpecial = subsumptionHierarchyDown.get(c);
//RBC //HACK
- if(moreSpecial != null && moreSpecial.size()>0) {
- Description chosenParent = moreSpecial.first();
- hierarchyUpNew.get(chosenParent).add(c);
+ //if(moreSpecial != null && moreSpecial.size()>0) {
+ if(moreSpecial != null ) {
+ if(moreSpecial.size()==0){
+ hierarchyUpNew.get(new Nothing()).add(c);
+ }
+ else {
+ Description chosenParent = moreSpecial.first();
+ hierarchyUpNew.get(chosenParent).add(c);
+ }
+
}
}
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 22:07:25 UTC (rev 859)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 22:36:48 UTC (rev 860)
@@ -112,6 +112,7 @@
for(recursiondepth=0;recursiondepth<4;recursiondepth++) {
+ Statistics.setCurrentLabel(recursiondepth+"");
printProgress(concount, concepts.size(),recursiondepth, oneConcept,total.getTime());
/*if(i==0){;}
else if(closeAfterRecursion) {
@@ -125,7 +126,7 @@
Statistics.print(number);
- System.out.println("currently at label "+Statistics.getCurrentLabel()+"||i: "+recursiondepth);
+ //System.out.println("currently at label "+Statistics.getCurrentLabel()+"||i: "+recursiondepth);
LearnSparql ls = new LearnSparql();
TreeSet<String> igno = new TreeSet<String>();
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 22:07:25 UTC (rev 859)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 22:36:48 UTC (rev 860)
@@ -83,7 +83,7 @@
cm.applyConfigEntry(la,"maxExecutionTimeInSeconds",20);
//cm.applyConfigEntry(la,"guaranteeXgoodDescriptions",999999);
- cm.applyConfigEntry(la,"logLevel","TRACE");
+ cm.applyConfigEntry(la,"logLevel","DEBUG");
//cm.applyConfigEntry(la,"quiet",false);
//System.out.println(ignoredConcepts.first());;
@@ -95,6 +95,7 @@
sc.setTime();
la.start();
Statistics.addTimeLearning(sc.getTime());
+
if(sc.getTime()/1000 >= 20)System.out.println("XXXMAX time reached");
//System.out.println("best"+la(20));
Modified: trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-15 22:07:25 UTC (rev 859)
+++ trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-15 22:36:48 UTC (rev 860)
@@ -37,6 +37,7 @@
else {
timeCollecting.put(currentLabel, new Long(current.longValue()+value));
}
+
}
public static void addTimeLearning(long value) {
@@ -85,6 +86,7 @@
printInt(numberOfSparqlQueries,"total queries\t");
+
//printIntAVG(numberOfTriples,number,"triples avg\t");
@@ -187,6 +189,7 @@
numberOfSparqlQueries = new HashMap<String, Integer>();
numberOfCachedSparqlQueries = new HashMap<String, Integer>();
+ System.out.println("xxxRESET");
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 22:09:23
|
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.
|
|
From: <ku...@us...> - 2008-05-15 21:46:17
|
Revision: 858
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=858&view=rev
Author: kurzum
Date: 2008-05-15 14:45:15 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 21:38:20 UTC (rev 857)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 21:45:15 UTC (rev 858)
@@ -98,7 +98,7 @@
int concount=1;
for (String oneConcept : concepts) {
- printProgress(concount, concepts.size(),0, oneConcept,total.getTime());
+ printProgress(concount++, concepts.size(),0, oneConcept,total.getTime());
int recursiondepth=0;
boolean closeAfterRecursion=true;
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 21:39:02
|
Revision: 857
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=857&view=rev
Author: kurzum
Date: 2008-05-15 14:38:20 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
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/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 21:34:50 UTC (rev 856)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 21:38:20 UTC (rev 857)
@@ -12,7 +12,6 @@
import org.apache.log4j.Logger;
import org.apache.log4j.SimpleLayout;
import org.dllearner.kb.sparql.Cache;
-import org.dllearner.kb.sparql.SparqlKnowledgeSource;
import org.dllearner.kb.sparql.SparqlQuery;
import org.dllearner.kb.sparql.configuration.SparqlEndpoint;
import org.dllearner.utilities.AutomaticExampleFinderSPARQL;
@@ -49,7 +48,7 @@
System.out.println("Start");
//logger.setLevel(Level.TRACE);
logger.setLevel(Level.WARN);
- Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.TRACE);
+ //Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.TRACE);
//System.out.println(Logger.getLogger(SparqlQuery.class).getLevel());
SimpleClock sc=new SimpleClock();
LocalDBpediaEvaluation();
@@ -236,7 +235,7 @@
public static void printProgress(int con, int consize,int recdepth, String conceptname, long needed){
int ex=poslimit+neglimit;
- System.out.println("" +
+ System.out.println("**********************STAT\n" +
"XXX num ex : "+ex+ " \n" +
"concept : "+con+"/"+consize+ " \n" +
"recursion : "+recdepth+" \n" +
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 21:34:50 UTC (rev 856)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 21:38:20 UTC (rev 857)
@@ -46,7 +46,7 @@
cm.applyConfigEntry(ks, "recursionDepth",recursiondepth);
cm.applyConfigEntry(ks, "closeAfterRecursion",closeAfterRecursion);
cm.applyConfigEntry(ks, "predefinedFilter","YAGO");
- cm.applyConfigEntry(ks, "predefinedEndpoint","DBPEDIA");
+ cm.applyConfigEntry(ks, "predefinedEndpoint","LOCALDBPEDIA");
if(randomizeCache)
cm.applyConfigEntry(ks, "cacheDir","cache/"+System.currentTimeMillis()+"");
else {}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 21:35:13
|
Revision: 856
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=856&view=rev
Author: kurzum
Date: 2008-05-15 14:34:50 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 20:50:51 UTC (rev 855)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 21:34:50 UTC (rev 856)
@@ -49,7 +49,7 @@
System.out.println("Start");
//logger.setLevel(Level.TRACE);
logger.setLevel(Level.WARN);
- Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.WARN);
+ Logger.getLogger(SparqlKnowledgeSource.class).setLevel(Level.TRACE);
//System.out.println(Logger.getLogger(SparqlQuery.class).getLevel());
SimpleClock sc=new SimpleClock();
LocalDBpediaEvaluation();
@@ -238,8 +238,8 @@
int ex=poslimit+neglimit;
System.out.println("" +
"XXX num ex : "+ex+ " \n" +
- "concept :"+con+"/"+consize+ " \n" +
- "recursion : "+recdepth+" " +
+ "concept : "+con+"/"+consize+ " \n" +
+ "recursion : "+recdepth+" \n" +
"conceptname : "+conceptname+ "\n" +
"needed total: "+needed);
}
Modified: trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-15 20:50:51 UTC (rev 855)
+++ trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-15 21:34:50 UTC (rev 856)
@@ -136,7 +136,7 @@
for (int i = 0; i < order.size(); i++) {
String label=order.get(i);
try {
- System.out.println(str+""+label+" "+ (hm.get(label).intValue()/number));
+ System.out.println(str+""+label+"\t"+ (hm.get(label).intValue()/number));
} catch (Exception e) { }
}
}
@@ -145,7 +145,7 @@
for (int i = 0; i < order.size(); i++) {
String label=order.get(i);
try {
- System.out.println(str+""+label+" "+hm.get(label));
+ System.out.println(str+""+label+"\t"+hm.get(label));
} catch (Exception e) { }
}
}
@@ -154,7 +154,7 @@
for (int i = 0; i < order.size(); i++) {
String label=order.get(i);
try {
- System.out.println(str+label+" "+ (hm.get(label).intValue()/number));
+ System.out.println(str+label+"\t"+ (hm.get(label).intValue()/number));
} catch (Exception e) { }
}
}
@@ -163,7 +163,7 @@
for (int i = 0; i < order.size(); i++) {
String label=order.get(i);
try {
- System.out.println(str+label+"|"+hm.get(label));
+ System.out.println(str+label+"\t"+hm.get(label));
} catch (Exception e) { }
}
}
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 20:50:53
|
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.
|
|
From: <ku...@us...> - 2008-05-15 19:24:28
|
Revision: 854
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=854&view=rev
Author: kurzum
Date: 2008-05-15 12:24:02 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 16:54:43 UTC (rev 853)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 19:24:02 UTC (rev 854)
@@ -93,8 +93,11 @@
poslimit+=5;
neglimit+=5;
-
+ System.out.println("XXX examplesize "+(poslimit+neglimit));
+ int concount=0;
for (String oneConcept : concepts) {
+ System.out.println("XXX "+concount+" of "+concepts.size()+""+oneConcept);concount++;
+
int recursiondepth=0;
boolean closeAfterRecursion=true;
@@ -106,7 +109,8 @@
posExamples = ae.getPosExamples();
negExamples = ae.getNegExamples();
- for(recursiondepth=0;recursiondepth<5;recursiondepth++) {
+ for(recursiondepth=0;recursiondepth<4;recursiondepth++) {
+ System.out.println("XXX recursiondepth "+recursiondepth+" con "+oneConcept);
/*if(i==0){;}
else if(closeAfterRecursion) {
@@ -138,17 +142,18 @@
}
Statistics.print(number);
String pre="log/gnu_";
- String comment1="# "+poslimit+neglimit+"examples\n";
- String f1=pre+"1avgtrip_"+poslimit+neglimit+"example"+concepts.size()+"classes";
+ int examples=poslimit+neglimit;
+ String comment1="# "+examples+"examples\n";
+ String f1=pre+"1avgtrip_"+examples+"example"+concepts.size()+"classes";
writeToFile(f1, comment1+Statistics.getAVGTriplesForRecursionDepth(number));
- String comment2="# "+poslimit+neglimit+"examples\n";
- String f2=pre+"2avgTimeExtraction_"+poslimit+neglimit+"example"+concepts.size()+"classes";
+ String comment2="# "+examples+"examples\n";
+ String f2=pre+"2avgTimeExtraction_"+examples+"example"+concepts.size()+"classes";
writeToFile(f2, comment2+Statistics.getAVGTimeCollecting(number));
- String comment3="# "+poslimit+neglimit+"examples\n";
- String f3=pre+"2avgTimeLearning_"+poslimit+neglimit+"example"+concepts.size()+"classes";
+ String comment3="# "+examples+"examples\n";
+ String f3=pre+"2avgTimeLearning_"+examples+"example"+concepts.size()+"classes";
writeToFile(f3, comment3+Statistics.getAVGTimeLearning(number));
+ Statistics.reset();
-
}//outer
}
Modified: trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 16:54:43 UTC (rev 853)
+++ trunk/src/dl-learner/org/dllearner/utilities/LearnSparql.java 2008-05-15 19:24:02 UTC (rev 854)
@@ -95,6 +95,7 @@
sc.setTime();
la.start();
Statistics.addTimeLearning(sc.getTime());
+ if(sc.getTime()/1000 >= 20)System.out.println("XXXMAX time reached");
//System.out.println("best"+la(20));
//((ExampleBasedROLComponent)la).printBestSolutions(10000);
Modified: trunk/src/dl-learner/org/dllearner/utilities/Statistics.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-15 16:54:43 UTC (rev 853)
+++ trunk/src/dl-learner/org/dllearner/utilities/Statistics.java 2008-05-15 19:24:02 UTC (rev 854)
@@ -178,6 +178,17 @@
return currentLabel;
}
+ public static void reset(){
+ currentLabel="";
+ order = new LinkedList<String>();
+ numberOfTriples = new HashMap<String, Integer>();
+ timeCollecting = new HashMap<String, Long>();
+ timeLearning = new HashMap<String, Long>();
+
+ numberOfSparqlQueries = new HashMap<String, Integer>();
+ numberOfCachedSparqlQueries = new HashMap<String, Integer>();
+
+ }
//stats
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
|
From: <ku...@us...> - 2008-05-15 16:54:50
|
Revision: 853
http://dl-learner.svn.sourceforge.net/dl-learner/?rev=853&view=rev
Author: kurzum
Date: 2008-05-15 09:54:43 -0700 (Thu, 15 May 2008)
Log Message:
-----------
Modified Paths:
--------------
trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
Modified: trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java
===================================================================
--- trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 16:43:44 UTC (rev 852)
+++ trunk/src/dl-learner/org/dllearner/scripts/SPARQLExtractionEvaluation.java 2008-05-15 16:54:43 UTC (rev 853)
@@ -106,7 +106,8 @@
posExamples = ae.getPosExamples();
negExamples = ae.getNegExamples();
- for(int i=0;i<3;i++) {
+ for(recursiondepth=0;recursiondepth<5;recursiondepth++) {
+
/*if(i==0){;}
else if(closeAfterRecursion) {
closeAfterRecursion=false;
@@ -117,11 +118,12 @@
}*/
//Statistics.setCurrentLabel(recursiondepth+""+((closeAfterRecursion)?"+":""));
- Statistics.setCurrentLabel(recursiondepth+""+((closeAfterRecursion)?"":""));
+ //Statistics.setCurrentLabel(recursiondepth+""+((closeAfterRecursion)?"":""));
+ Statistics.setCurrentLabel(recursiondepth+"");
Statistics.print(number);
- System.out.println("currently at label "+Statistics.getCurrentLabel()+"||i: "+i);
+ System.out.println("currently at label "+Statistics.getCurrentLabel()+"||i: "+recursiondepth);
LearnSparql ls = new LearnSparql();
TreeSet<String> igno = new TreeSet<String>();
This was sent by the SourceForge.net collaborative development platform, the world's largest Open Source development site.
|
3 messages has been excluded from this view by a project administrator.
