A Greedy Algorithm to Construct L1 Graph with Ranked Dictionary.
Shuchu HanHong QinPublished in: PAKDD (2) (2016)
Keyphrases
- greedy algorithm
- greedy algorithms
- dynamic programming
- worst case
- objective function
- set cover
- random walk
- knapsack problem
- affinity graph
- sparse representation
- greedy heuristic
- np hard
- greedy strategy
- greedy approximation algorithm
- machine learning
- bipartite graph
- special case
- influence maximization
- influence spread
- connected components
- markov chain
- approximation ratio
- permutation flowshop