Using entropy metrics for pruning very large graph cubes.
Dritan BlecoYannis KotidisPublished in: Inf. Syst. (2019)
Keyphrases
- entropy measure
- graph theory
- random walk
- graph structure
- information theoretic
- graph theoretic
- directed graph
- information theory
- graph representation
- mutual information
- minimal spanning tree
- directed acyclic graph
- graph structures
- evaluation metrics
- stable set
- search space
- graph properties
- pruning algorithm
- pruning method
- graph based algorithm
- weighted graph
- graph model
- graph mining
- neural network
- multi dimensional
- spanning tree
- graph partitioning
- data cube
- connected components
- social network analysis
- image registration
- optimal solution
- pruning algorithms
- social networks