Lines Matching refs:centers
56 // graph. centers will contain the vertices that are the identified
57 // as the canonical views/cluster centers, and membership is a map
65 vector<int>* centers,
71 const vector<int>& centers) const;
73 void ComputeClusterMembership(const vector<int>& centers,
89 vector<int>* centers,
93 cv.ComputeClustering(options, graph, centers, membership);
102 vector<int>* centers,
105 CHECK_NOTNULL(centers)->clear();
121 ComputeClusteringQualityDifference(*view, *centers);
133 (centers->size() >= options_.min_views)) {
137 centers->push_back(best_view);
142 ComputeClusterMembership(*centers, membership);
163 const vector<int>& centers) const {
187 for (int i = 0; i < centers.size(); ++i) {
189 graph_->EdgeWeight(centers[i], candidate);
215 const vector<int>& centers,
221 for (int i = 0; i < centers.size(); ++i) {
222 center_to_cluster_id[centers[i]] = i;
