Huijings code for getting the centroids and nearest neighbors

2008-02-14 19:10:38 +00:00
parent 91bff5516c
commit 97fa6032d2
4 changed files with 1061 additions and 0 deletions
@@ -0,0 +1,3 @@
+binrule(name="cent",
+		sources=["get_nodes.cc"],
+		deplibs=["fastlib:fastlib", "mlpack/allknn:allknn"])
@@ -0,0 +1,58 @@
+#include "fastlib/fastlib.h"
+#include "mlpack/allknn/allknn.h"
+#include <string>
+
+typedef AllkNN::QueryTree Tree;
+
+void GetCenters(Tree *node, ArrayList<Vector> *centers) { 
+  if (!node->is_leaf()) {
+	  GetCenters(node->left(), centers);
+		GetCenters(node->right(), centers);
+	} else {
+	  node->bound().CalculateMidpoint(centers->AddBack());	
+	}
+}
+
+int main(int argc, char *argv[]) {
+	FILE *fp;
+	fx_init(argc, argv);
+	std::string data_file = fx_param_str_req(NULL, "file");
+  index_t leaf_size=fx_param_int(NULL, "lsize", 20);
+	index_t knns = fx_param_int(NULL, "knns", 5);
+  AllkNN allknn;
+	Matrix data_for_tree;
+  data::Load(data_file.c_str(), &data_for_tree);
+	allknn.Init(data_for_tree, data_for_tree, leaf_size, knns);
+  ArrayList<index_t> resulting_neighbors_tree;
+  ArrayList<double> distances_tree;
+  allknn.ComputeNeighbors(&resulting_neighbors_tree,
+                              &distances_tree);
+	fp=fopen("neighbors.txt", "w");
+	if (fp==NULL) {
+	  FATAL("Could not open results.txt for writing\n");
+	}
+  for(index_t i=0; i<resulting_neighbors_tree.size()/knns; i++) {
+	  for(index_t j=0; j<knns; j++) {
+	    fprintf(fp, "%li %li  %lg\n", i, resulting_neighbors_tree[i*knns+j],
+						                              distances_tree[i*knns+j]);
+		}
+	}
+	fclose(fp);
+	ArrayList<Vector> centers;
+	centers.Init();
+	GetCenters(allknn.get_query_tree(), &centers);
+	fp=fopen("centroind.txt", "w");
+	if (fp==NULL) {
+	  FATAL("Could not open centroids.txt for writing\n");
+	}
+	for(index_t i=0; i<centers.size(); i++) {
+		for(index_t j=0; j<centers[i].length(); j++) {
+	    fprintf(fp, "%lg ", centers[i][j]);
+		}
+		fprintf(fp, "\n");
+	}
+	fclose(fp);
+	fx_done();
+}
+ 
+