Login / Signup

An Information-Theoretic Bound on p-Values for Detecting Communities Shared between Weighted Labeled Graphs.

Predrag ObradovicVladimir B. KovacevicXiqi LiAleksandar Milosavljevic
Published in: Entropy (2022)
Keyphrases
  • information theoretic
  • labeled graphs
  • information theory
  • mutual information
  • social networks
  • high dimensional
  • computer vision
  • feature selection
  • similarity function
  • regular expressions
  • frequent subgraphs