Divide-and-Conquer Kronecker Product Decomposition for Memory-Efficient Graph Approximation.
Venkata Suhas MaringantiMing ShaoPublished in: IEEE BigData (2018)
Keyphrases
- memory efficient
- kronecker product
- graph search
- external memory
- iterative deepening
- graph structure
- efficient computation
- error bounds
- integral image
- structured data
- structural learning
- random walk
- graph theory
- directed graph
- decomposition algorithm
- connected components
- closed form
- graph mining
- graph model
- data structure
- approximation error
- tree decomposition