graph_weighted_sampler.h 1.7 KB
Newer Older
S
seemingwang 已提交
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58
// Copyright (c) 2021 PaddlePaddle Authors. All Rights Reserved.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
//     http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.

#pragma once
#include <ctime>
#include <unordered_map>
#include <vector>
#include "paddle/fluid/distributed/table/graph_edge.h"
namespace paddle {
namespace distributed {

class Sampler {
 public:
  virtual ~Sampler() {}
  virtual void build(GraphEdgeBlob *edges) = 0;
  virtual std::vector<int> sample_k(int k) = 0;
};

class RandomSampler : public Sampler {
 public:
  virtual ~RandomSampler() {}
  virtual void build(GraphEdgeBlob *edges);
  virtual std::vector<int> sample_k(int k);
  GraphEdgeBlob *edges;
};

class WeightedSampler : public Sampler {
 public:
  WeightedSampler();
  virtual ~WeightedSampler();
  WeightedSampler *left, *right;
  float weight;
  int count;
  int idx;
  GraphEdgeBlob *edges;
  virtual void build(GraphEdgeBlob *edges);
  virtual void build_one(WeightedGraphEdgeBlob *edges, int start, int end);
  virtual std::vector<int> sample_k(int k);

 private:
  int sample(float query_weight,
             std::unordered_map<WeightedSampler *, float> &subtract_weight_map,
             std::unordered_map<WeightedSampler *, int> &subtract_count_map,
             float &subtract);
};
}
}