• search
    search
  • reviewers
    reviewers
  • feeds
    feeds
  • assignments
    assignments
  • settings
  • logout

Finding a Concise, Precise, and Exhaustive Set of Near Bi-Cliques in Dynamic Graphs.

Hyeonjeong ShinTaehyung KwonNeil ShahKijung Shin
Published in: WSDM (2022)
Keyphrases
  • neural network
  • small number
  • graph structure
  • web pages
  • clustering algorithm
  • decision trees
  • search algorithm
  • probabilistic model
  • dynamic environments
  • method finds