A greedy algorithm to construct sparse graph by using ranked dictionary.
Shuchu HanHong QinPublished in: Int. J. Data Sci. Anal. (2016)
Keyphrases
- greedy algorithm
- orthogonal matching pursuit
- sparse representation
- greedy algorithms
- objective function
- greedy strategy
- dynamic programming
- worst case
- high dimensional
- compressive sensing
- affinity graph
- structured sparsity
- knapsack problem
- influence spread
- random walk
- bipartite graph
- sparse coding
- randomized algorithm
- random projections
- set cover
- directed graph
- approximation ratio
- influence maximization
- connected components
- special case
- website
- machine learning