Changeset 35227

Timestamp:

2021-07-15T23:34:59+12:00 (3 years ago)

Author:

davidb

Message:

With some refactoring

File:

• main/trunk/model-sites-dev/mars/src/java/org/greenstone/mars/WekaCLFindNN.java (modified) (3 diffs)

main/trunk/model-sites-dev/mars/src/java/org/greenstone/mars/WekaCLFindNN.java

@@ -1 +1 @@
 package org.greenstone.mars;
 
+import weka.core.Instance;
 import weka.core.Instances;
 import weka.core.converters.ConverterUtils.DataSource;
 
 import weka.core.neighboursearch.LinearNNSearch;
+import weka.core.neighboursearch.NearestNeighbourSearch;
 //import weka.core.neighboursearch.KDTree;
 
@@ -12 +14 @@
 public class WekaCLFindNN 
 {
+    public static void findNearestNN(NearestNeighbourSearch knn, Instance sample_instance, int k_nearest)
+    {
+    try {
+        Instances nearest_instances= knn.kNearestNeighbours(sample_instance, k_nearest);
+        
+        //cycle through the instances and printout the nearestneighbors
+        
+        System.out.println("\n" + sample_instance);
+        for(int i =0; i<k_nearest; i++) {
+        System.out.println("\t" + nearest_instances.instance(i));        
+        }   
+    }
+    catch (Exception e) {
+        e.printStackTrace();
+    }
+        
+    }
+
+
     public static void main(String[] args) throws Exception {
     
     if (args.length != 2) {
-        System.err.println("Usage: N ARFF-file");
+        System.err.println("Usage: k-nearest-num file.{arff,csv}");
         System.exit(1);
     }
-    String num_nearest_str     = args[0];
-    String input_arff_filename = args[1];
+    String k_nearest_str     = args[0];
+    String input_filename = args[1];
     
-    int num_nearest = Integer.parseInt(num_nearest_str);
+    int k_nearest = Integer.parseInt(k_nearest_str);
      
-    System.out.println("Weka Command Line Find Nearest " + num_nearest_str
-               + " Neighbors for each Instance in "  + input_arff_filename);
+    System.out.println("Weka Command Line Find Nearest " + k_nearest_str
+               + " Neighbors for each Instance in "  + input_filename);
     
-    DataSource source = new DataSource(input_arff_filename);
+    DataSource source = new DataSource(input_filename);
     Instances instances = source.getDataSet();
     
@@ -36 +57 @@
     int num_instances = instances.numInstances();
     for(int j=0; j<num_instances; j++) {
-        Instances nearestInstances= knn.kNearestNeighbours(instances.instance(j), num_nearest);
+        Instances nearestInstances= knn.kNearestNeighbours(instances.instance(j), k_nearest);
         
-        //cycle through the instances and printout the nearestneighbors
-        System.out.println("\n" + instances.instance(j));
-        for(int i =0; i<num_nearest; i++) {
-        System.out.println("\t" + nearestInstances.instance(i));         
-        }        
+        Instance sample_instance = instances.instance(j);
+        findNearestNN(knn,sample_instance,k_nearest);
     }    
     }