Designing algorithms for better data analysis and stronger networks | ASU News
A Local Algorithm for Structure-Preserving Graph Cut
MET: A Fast Algorithm for Minimizing Propagation in Large Graphs with Small Eigen-Gaps
lecture notes 1 - classification - CSE 575: Statistical Machine Learning Classification Hanghang Tong CIDSE, ASU Acknowledgement | Course Hero
Inside the Atoms: Mining a Network of Networks and Beyond by HangHang…
A Local Algorithm for Structure-Preserving Graph Cut
Chen Chen
Guest Editorial: Big Scholar Data Discovery and Collaboration
Towards Optimal Connectivity on Multi-layered Networks
Panther: Fast Top-k Similarity Search on Large Networks
Nadya Bliss on Twitter: "Love this so much! #worldscollide @MITLL colleague texted me a photo of @ASU @ASUEngineering @asu_gsi Prof. Hanghang Tong winning the @TheSIAMNews #SIAMSDM18 Early Career Award! So well deserved!
Inside the Atoms: Mining a Network of Networks and Beyond by HangHang…
ASU researcher works to design algorithms for more robust networks | ASU News
Hanghang Tong - Associate Professor - University of Illinois Urbana-Champaign | LinkedIn
Optimization of Block-based Tensor Decompositions through Sub-Tensor Impact Graphs and Applications to Dynamicity in Data and User Focus
Yuan Yao Joint work with Hanghang Tong, Feng Xu, and Jian Lu Predicting Long-Term Impact of CQA Posts: A Comprehensive Viewpoint 1 Aug 24-27, KDD ppt download
FINAL: Fast Attributed Network Alignment
Proceedings of the 24th International Conference on World Wide Web: Replacing the Irreplaceable: Fast Algorithms for Team Member
Detecting and tracking isolated malicious activities | Center for Accelerating Operational Efficiency
iPath: Forecasting the Pathway to Impact
Facets | Proceedings of the 21th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining
