チェンジセット 159 : SPARQLBuilderWWW/src/java/org/biohackathon

更新日時:

2014/09/25 15:11:38 (10 年 前)

更新者:

atsuko

ログメッセージ:

Path 探索アルゴリズム変更

ファイル:

• SPARQLBuilderWWW/src/java/org/biohackathon/SPARQLBuilder/OWL/OWLClassGraph.java (変更) (5 diff)

SPARQLBuilderWWW/src/java/org/biohackathon/SPARQLBuilder/OWL/OWLClassGraph.java

@@ -20 +20 @@
     int limit;
     int th;
-    double concut;
-    double divcut;
+    int prunecut;
         
     public class LinkAndPath{
@@ -51 +50 @@
         nsteps = 3;
         limit = 1000;
-        //th = 0;
-        //concut = 2.0;
-        //divcut = - 2.0;
+        prunecut = 100;
     }
 
@@ -107 +104 @@
                            crrlp.classLink.getDirection() != classLinks[j].getDirection() &&
                            crrlp.originalClassURI.equals( classLinks[j].getLinkedClassURI()) ){
+                              System.out.println("P1");
+                              continue;
+                          }
+                          if ( checkPruning(crrlp.classLink, classLinks[j]) ){
+                              System.out.println("P2");
                               continue;
                           }
@@ -178 +180 @@
 */
     
-/*    
-    private boolean decideConvergence(ClassLink classLink){
+      private boolean checkPruning(ClassLink classLink1, ClassLink classLink2){
+          // true -> prune link2, false -> add link2
+          int noi1 = classLink1.getNumOfOriginInstances();
+          int nli1 = classLink1.getNumOfLinkedInstances();
+          int noi2 = classLink2.getNumOfOriginInstances();
+          int nli2 = classLink2.getNumOfLinkedInstances();
+          if ( noi1 == 0 || nli1 == 0 || noi2 == 0 || nli2 == 0 ){
+              return true;
+          }
+          return ( noi1 / nli1 > prunecut && nli2 / noi2 > prunecut );
+      }
+    
+/*    private boolean decideConvergence(ClassLink classLink){
         double con = getValueForConvergence(classLink.getNumOfOriginInstances(), 
                                               classLink.getNumOfLinkedInstances(),
@@ -209 +222 @@
     }
     */
+    private int getMinCutOfPath(){
+        int min = Integer.MAX_VALUE;
+        //KOKO
+        return min;
+    }
+    
 }