DBSCAN revisited: Mis-claim, un-fixability, and approximation J Gan, Y Tao Proceedings of the 2015 ACM SIGMOD international conference on management of …, 2015 | 232 | 2015 |
Locality-sensitive hashing scheme based on dynamic collision counting J Gan, J Feng, Q Fang, W Ng Proceedings of the 2012 ACM SIGMOD international conference on management of …, 2012 | 205 | 2012 |
On the hardness and approximation of Euclidean DBSCAN J Gan, Y Tao ACM Transactions on Database Systems (TODS) 42 (3), 1-45, 2017 | 37 | 2017 |
Dynamic density based clustering J Gan, Y Tao Proceedings of the 2017 ACM International Conference on Management of Data …, 2017 | 30 | 2017 |
Personalized pagerank to a target node, revisited H Wang, Z Wei, J Gan, S Wang, Z Huang Proceedings of the 26th ACM SIGKDD International Conference on Knowledge …, 2020 | 10 | 2020 |
Unifying the global and local approaches: an efficient power iteration with forward push H Wu, J Gan, Z Wei, R Zhang Proceedings of the 2021 International Conference on Management of Data, 1996 …, 2021 | 7 | 2021 |
Fast Euclidean optics with bounded precision in low dimensional space J Gan, Y Tao Proceedings of the 2018 international conference on management of data, 1067 …, 2018 | 7 | 2018 |
Neural graph matching based collaborative filtering Y Su, R Zhang, S M. Erfani, J Gan Proceedings of the 44th International ACM SIGIR Conference on Research and …, 2021 | 6 | 2021 |
Range thresholding on streams M Qiao, J Gan, Y Tao Proceedings of the 2016 International Conference on Management of Data, 571-582, 2016 | 5 | 2016 |
Dynamic structural clustering on graphs B Ruan, J Gan, H Wu, A Wirth Proceedings of the 2021 International Conference on Management of Data, 1491 …, 2021 | 3 | 2021 |
Graph Clustering in All Parameter Regimes J Gan, DF Gleich, N Veldt, A Wirth, X Zhang arXiv preprint arXiv:1910.06435, 2019 | 3 | 2019 |
Incremental preference adjustment: a graph-theoretical approach L Song, J Gan, Z Bao, B Ruan, HV Jagadish, T Sellis The VLDB Journal 29 (6), 1475-1500, 2020 | 2 | 2020 |
Result-sensitive binary search with noisy information NS Epa, J Gan, A Wirth 30th International Symposium on Algorithms and Computation (ISAAC 2019), 2019 | 2 | 2019 |
Learning Based Distributed Tracking H Wu, J Gan, R Zhang Proceedings of the 26th ACM SIGKDD International Conference on Knowledge …, 2020 | 1 | 2020 |
An I/O-Efficient Algorithm for Computing Vertex Separators on Multi-Dimensional Grid Graphs and Its Applications. J Gan, Y Tao J. Graph Algorithms Appl. 22 (2), 297-327, 2018 | 1 | 2018 |
Approximate Range Thresholding Z Zhang, J Gan, Z Bao, SMH Kazemi, G Chen, F Zhu Proceedings of the 2022 International Conference on Management of Data, 1108 …, 2022 | | 2022 |
Edge-based Local Push for Personalized PageRank H Wang, Z Wei, J Gan, Y Yuan, X Du, JR Wen arXiv preprint arXiv:2203.07937, 2022 | | 2022 |
An Almost Optimal Algorithm for Unbounded Search with Noisy Information J Gan, A Wirth, X Zhang 18th Scandinavian Symposium and Workshops on Algorithm Theory (SWAT 2022), 2022 | | 2022 |
High Performance Density-based Clustering on Massive Data J Gan | | 2017 |
Approximate Range Thresholding Technical Report Z Zhang, J Gan, Z Bao, SM Hussein, G Chen, F Zhu | | |