/biclique_extraction

Primary LanguageC++

Identification and extraction of Bicliques using MinHash and Prefix Tree

Biclique

Usage

Compile

make

Flags:

  • -Dparallel : enable parallelism
  • -DBITS32 : compile with 32 bits
  • -DNUM_THREADS=value : set number of threads

Execute

./biclique_extractor params

Parameters

  • --file: file in bin or txt
  • --numSignature: number of Min hashes
  • --minClusterSize: minimum number of nodes in each cluster
  • --bicliqueSize: minimum number of SxC per biclique
  • --minAdyNodes: minimum number of adyancy nodes per node to make cluster
  • --bsDecrease: discount factor
  • --shingleSize: shingle size value
  • --selfLoop: flag for selfloops
  • --threshold: minimum bicliques founded per iteration
  • --debug: debug flag
  • --iterations: number of iterations

Execution example

bash run.sh

References

Hernández, C., & Navarro, G. (2014). Compressed representations for web and social graphs. Knowledge and information systems, 40(2), 279-313.