Menu
▾
▴
[DL-Learner SVN] SF.net SVN: dl-learner: [873] trunk/src/dl-learner/org/dllearner
|
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.
|
