n2v.h File Reference

#include "stdafx.h"
#include "Snap.h"
#include "biasedrandomwalk.h"
#include "word2vec.h"

Include dependency graph for n2v.h:

This graph shows which files directly or indirectly include this file:

Go to the source code of this file.

Functions
void	node2vec (PWNet &InNet, double &ParamP, double &ParamQ, int &Dimensions, int &WalkLen, int &NumWalks, int &WinSize, int &Iter, bool &Verbose, TIntFltVH &EmbeddingsHV)
	Calculates node2vec feature representation for nodes and writes them into EmbeddinsHV, see http://arxiv.org/pdf/1607.00653v1.pdf. More...
void	node2vec (PNGraph &InNet, double &ParamP, double &ParamQ, int &Dimensions, int &WalkLen, int &NumWalks, int &WinSize, int &Iter, bool &Verbose, TIntFltVH &EmbeddingsHV)
	Version for unweighted graphs. More...
void	node2vec (PNEANet &InNet, double &ParamP, double &ParamQ, int &Dimensions, int &WalkLen, int &NumWalks, int &WinSize, int &Iter, bool &Verbose, TIntFltVH &EmbeddingsHV)
	Version for weighted graphs. Edges must have TFlt attribute "weight". More...

Function Documentation

void node2vec	(	PWNet &	InNet,
		double &	ParamP,
		double &	ParamQ,
		int &	Dimensions,
		int &	WalkLen,
		int &	NumWalks,
		int &	WinSize,
		int &	Iter,
		bool &	Verbose,
		TIntFltVH &	EmbeddingsHV
	)

Calculates node2vec feature representation for nodes and writes them into EmbeddinsHV, see http://arxiv.org/pdf/1607.00653v1.pdf.

Definition at line 4 of file n2v.cpp.

References TVec< TVal, TSizeTy >::Add(), LearnEmbeddings(), TVec< TVal, TSizeTy >::Len(), PreprocessTransitionProbs(), TVVec< TVal, TSizeTy >::PutXY(), TVec< TVal, TSizeTy >::Shuffle(), and SimulateWalk().

Referenced by node2vec().

                          {
  //Preprocess transition probabilities
  PreprocessTransitionProbs(InNet, ParamP, ParamQ, Verbose);
  TIntV NIdsV;
  for (TWNet::TNodeI NI = InNet->BegNI(); NI < InNet->EndNI(); NI++) {
    NIdsV.Add(NI.GetId());
  }
  //Generate random walks
  int64 AllWalks = (int64)NumWalks * NIdsV.Len();
  TVVec<TInt, int64> WalksVV(AllWalks,WalkLen);
  TRnd Rnd(time(NULL));
  int64 WalksDone = 0;
  for (int64 i = 0; i < NumWalks; i++) {
    NIdsV.Shuffle(Rnd);
#pragma omp parallel for schedule(dynamic)
    for (int64 j = 0; j < NIdsV.Len(); j++) {
      if ( Verbose && WalksDone%10000 == 0 ) {
        printf("\rWalking Progress: %.2lf%%",(double)WalksDone*100/(double)AllWalks);fflush(stdout);
      }
      TIntV WalkV;
      SimulateWalk(InNet, NIdsV[j], WalkLen, Rnd, WalkV);
      for (int64 k = 0; k < WalkV.Len(); k++) { 
        WalksVV.PutXY(i*NIdsV.Len()+j, k, WalkV[k]);
      }
      WalksDone++;
    }
  }
  if (Verbose) {
    printf("\n");
    fflush(stdout);
  }
  //Learning embeddings
  LearnEmbeddings(WalksVV, Dimensions, WinSize, Iter, Verbose, EmbeddingsHV);
}

Here is the call graph for this function:

Here is the caller graph for this function:

void node2vec	(	PNGraph &	InNet,
		double &	ParamP,
		double &	ParamQ,
		int &	Dimensions,
		int &	WalkLen,
		int &	NumWalks,
		int &	WinSize,
		int &	Iter,
		bool &	Verbose,
		TIntFltVH &	EmbeddingsHV
	)

Version for unweighted graphs.

Definition at line 41 of file n2v.cpp.

References TNGraph::BegEI(), TNGraph::EndEI(), TPt< TRec >::New(), and node2vec().

                          {
  PWNet NewNet = PWNet::New();
  for (TNGraph::TEdgeI EI = InNet->BegEI(); EI < InNet->EndEI(); EI++) {
    if (!NewNet->IsNode(EI.GetSrcNId())) { NewNet->AddNode(EI.GetSrcNId()); }
    if (!NewNet->IsNode(EI.GetDstNId())) { NewNet->AddNode(EI.GetDstNId()); }
    NewNet->AddEdge(EI.GetSrcNId(), EI.GetDstNId(), 1.0);
  }
  node2vec(NewNet, ParamP, ParamQ, Dimensions, WalkLen, NumWalks, WinSize, Iter, 
   Verbose, EmbeddingsHV);
}

Here is the call graph for this function:

void node2vec	(	PNEANet &	InNet,
		double &	ParamP,
		double &	ParamQ,
		int &	Dimensions,
		int &	WalkLen,
		int &	NumWalks,
		int &	WinSize,
		int &	Iter,
		bool &	Verbose,
		TIntFltVH &	EmbeddingsHV
	)

Version for weighted graphs. Edges must have TFlt attribute "weight".

Definition at line 54 of file n2v.cpp.

References TPt< TRec >::New(), and node2vec().

                          {
  PWNet NewNet = PWNet::New();
  for (TNEANet::TEdgeI EI = InNet->BegEI(); EI < InNet->EndEI(); EI++) {
    if (!NewNet->IsNode(EI.GetSrcNId())) { NewNet->AddNode(EI.GetSrcNId()); }
    if (!NewNet->IsNode(EI.GetDstNId())) { NewNet->AddNode(EI.GetDstNId()); }
    NewNet->AddEdge(EI.GetSrcNId(), EI.GetDstNId(), InNet->GetFltAttrDatE(EI,"weight"));
  }
  node2vec(NewNet, ParamP, ParamQ, Dimensions, WalkLen, NumWalks, WinSize, Iter, 
   Verbose, EmbeddingsHV);
}

Here is the call graph for this function: