Top-k densest subgraphs in sliding-window graph streams.
Muhammad Anis Uddin NasirAristides GionisGianmarco De Francisci MoralesSarunas GirdzijauskasPublished in: CoRR (2016)
Keyphrases
- sliding window
- graph mining
- dense subgraphs
- data streams
- graph databases
- graph data
- streaming data
- graph structures
- fixed size
- pattern mining
- window size
- graph properties
- stream data
- community discovery
- subgraph mining
- subgraph isomorphism
- skyline queries
- frequent subgraphs
- similarity graph
- continuous queries
- link prediction
- query processing
- labeled graphs
- connected components
- space efficient
- query graph
- maximum clique
- stream mining
- variable size
- functional modules
- limited memory
- reachability queries
- quasi cliques
- boyer moore
- biological networks
- directed graph
- structured data
- data structure
- data mining
- graph structure
- pattern discovery
- data distribution
- dynamic graph
- social networks
- fixed width
- data sets