59 citations · 245 across the 14 of their papers we have counts for
Showing 2018Show all
3 papers · 1 filter
cs.LG2018
Scalable Spectral Clustering Using Random Binning Features
Lingfei Wu, Pin-Yu Chen, Ian En-Hsu Yen +3
Spectral clustering is one of the most effective clustering approaches that capture hidden cluster structures in the data. However, it does not scale well to large-scale problems d…
cs.SI2018★ 1 cited
Local Partition in Rich Graphs
Scott Freitas, Hanghang Tong, Nan Cao +1
Local graph partitioning is a key graph mining tool that allows researchers to identify small groups of interrelated nodes (e.g. people) and their connective edges (e.g. interactio…
cs.SI2018
AURORA: Auditing PageRank on Large Graphs
Jian Kang, Meijia Wang, Nan Cao +3
Ranking on large-scale graphs plays a fundamental role in many high-impact application domains, ranging from information retrieval, recommender systems, sports team management, bio…