Faster and Scalable Algorithms for Densest Subgraph and Decomposition.
Elfarouk HarbKent QuanrudChandra ChekuriPublished in: NeurIPS (2022)
Keyphrases
- memory efficient
- orders of magnitude
- scale poorly
- machine learning algorithms
- clustering algorithm
- significant improvement
- computational cost
- learning algorithm
- benchmark datasets
- optimization problems
- computational complexity
- association rules
- theoretical analysis
- objective function
- decision trees
- times faster
- highly efficient
- graph mining
- highly scalable
- social networks
- computationally demanding
- data mining