チェンジセット 283 : SPARQLBuilderWWW

更新日時:

2016/06/13 10:52:55 (8 年 前)

更新者:

atsuko

ログメッセージ:

ranking 変更

ファイル:

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

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

@@ -10 +10 @@
  */
 import java.util.*;
-
-public class OWLClassGraph extends LabeledMultiDigraph{
+import java.io.Serializable;
+
+public class OWLClassGraph extends LabeledMultiDigraph implements Serializable{
     int nsteps = 4;
-    int limit = 100;
+    //int limit = 100;
     
     List<String> nodeType;
@@ -52 +53 @@
         nodeType = new LinkedList<String>();
     }
-        
+    
     public OWLClassGraph(RDFSchemaAnalyzer rdfsa){ // for experiment
         super();
@@ -220 +221 @@
             addNode(classes[i].getClassURI());
             nodeType.add("class");
+            nodeweight.add(classes[i].getNumOfInstances());           
         }
         // setEdges
         for (int i = 0 ; i < classes.length; i++ ){
             try{
-                ClassLink[] classLinks = rdfsa.getNextClass(null, classes[i].getClassURI(), limit, true);
+                ClassLink[] classLinks = rdfsa.getNextClass(null, classes[i].getClassURI(), 10000, true);
                 for (int j = 0 ; j < classLinks.length; j++){
                     Integer n = labelednodes.get(classLinks[j].getLinkedClassURI());
@@ -242 +244 @@
                 System.err.println(e);
             }
-        }       
+        }
     }
 
@@ -249 +251 @@
         this.sparqlEndpoint = sparqlEndpoint;
         visited = new HashSet<Integer>();
-        //edgeweight = new LinkedList<Map<Integer,Integer>>();
         nodeweight = new LinkedList<Integer>();
         // setNodes for all classes
@@ -261 +262 @@
            addNode(classes[i].getClassURI());
            nodeType.add("class");
-           //edgeweight.add(new HashMap<Integer,Integer>());
            nodeweight.add(classes[i].getNumOfInstances());
         }
@@ -275 +275 @@
                 Integer crr = nit.next();
                 try{
-                    ClassLink[] classLinks = rdfsa.getNextClass(null, labels.get(crr), limit, true);
+                    ClassLink[] classLinks = rdfsa.getNextClass(null, labels.get(crr), 10000, true);
                     for (int j = 0 ; j < classLinks.length; j++){
                         Integer nn = labelednodes.get(classLinks[j].getLinkedClassURI());
@@ -294 +294 @@
             nodes = nextnodes;
             visited.addAll(nodes);
+            if ( visited.size() > labelednodes.size()){
+                System.out.println();
+            }
         }
         // cut visited
@@ -337 +340 @@
             if ( c1 < 0.5 && c2 < 0.5 ){ chk = false;}
             double prob2 = 1.0 - c1;
-                    //((double) ( crr.getNumOfOriginClassInstances())/ 
-                    //(double) (  nodeweight.get(labelednodes.get(prev.getLinkedClassURI())) ));
-            //if ( prob2 > 1.0 || prob2 < 0 ){
-            //    System.out.println("Prob2 > 1 or Prob2 < 0");
-            //    System.out.println(prev.getLinkedClassURI());
-                //classes[labelednodes.get(prev.getLinkedClassURI())].getNumOfInstances();
-            //    System.out.println(prev.getPropertyURI());
-            //}
             double prob3 = 1.0 - Math.pow(prob2, (double) prev.getNumOfLinkedClassInstances());
-            //if ( prob3 > 1.0 ){
-            //    System.out.println("Prob3 > 1");
-            //    System.out.println(prev.getLinkedClassURI());
-                //classes[labelednodes.get(prev.getLinkedClassURI())].getNumOfInstances();
-            //    System.out.println(prev.getPropertyURI());
-            //}
             prob = prob * prob3 ;
             prev = crr;