Biblio

Export 169 results:
2017
Rong, Y., and H. Cheng, "Minimizing Dependence between Graphs", Proceedings of the 2017 {ACM} on Conference on Information and Knowledge Management, {CIKM} 2017, Singapore, November 06 - 10, 2017, pp. 1827–1836, 2017.
Zheng, W., H. Cheng, L. Zou, J. Xu Yu, and K. Zhao, "Natural Language Question/Answering: Let Users Talk With The Knowledge Graph", Proceedings of the 2017 {ACM} on Conference on Information and Knowledge Management, {CIKM} 2017, Singapore, November 06 - 10, 2017, pp. 217–226, 2017.
Liu, Y., H. Cheng, and J. Cui, "PQBF: I/O-Efficient Approximate Nearest Neighbor Search by Product Quantization", Proceedings of the 2017 {ACM} on Conference on Information and Knowledge Management, {CIKM} 2017, Singapore, November 06 - 10, 2017, pp. 667–676, 2017.
Su, J., Q. Zhu, H. Wei, and J. Xu Yu, "Reachability Querying: Can It Be Even Faster?", {IEEE} Trans. Knowl. Data Eng., vol. 29, pp. 683–697, 2017.
2018
Lu, C., J. Xu Yu, and H. Wei, "Exploring Triangle-Free Dense Structures", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 278–291, 2018.
Huang, W., J. Xu Yu, and Z. Shang, "Handling query skew in large indexes: a view based approach", Frontiers Comput. Sci., vol. 12, pp. 146–162, 2018.
Wei, H., J. Xu Yu, C. Lu, and R. Jin, "Reachability querying: an independent permutation labeling approach", {VLDB} J., vol. 27, pp. 1–26, 2018.
Wei, H., J. Xu Yu, and C. Lu, "String Similarity Search: A Hash-Based Approach", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 170–184, 2018.
Huang, W., Y. Zhang, Z. Shang, and J. Xu Yu, "To Meet or Not to Meet: Finding the Shortest Paths in Road Networks", {IEEE} Trans. Knowl. Data Eng., vol. 30, pp. 772–785, 2018.
2019
Zheng, W., C. Piao, H. Cheng, and J. Xu Yu, "Computing a Near-Maximum Independent Set in Dynamic Graphs", ICDE, pp. 76-87, 2019.
Zheng, W., H. Cheng, J. Yu Xu, L. Zou, and K. Zhao, "Interactive natural language question answering over knowledge graphs", Inf. Sci., vol. 481, pp. 141-159, 2019.
Li, J., Z. Han, H. Cheng, J. Su, P. Wang, J. Zhang, and L. Pan, "Predicting Path Failure In Time-Evolving Graphs", KDD, pp. 1279-1289, 2019.
Li, J., Y. Rong, H. Cheng, H. Meng, W-. bin Huang, and J. Huang, "Semi-Supervised Graph Classification: A Hierarchical Graph Perspective.", WWW, pp. 972-982, 2019.
Zhang, Y., and J. Xu Yu, "Unboundedness and Efficiency of Truss Maintenance in Evolving Graphs", SIGMOD, pp. 1024-1041, 2019.
2020
Li, J., H. Zhang, Z. Han, Y. Rong, H. Cheng, and J. Huang, "Adversarial Attack on Community Detection by Hiding Individuals", WWW, pp. 917-927, 2020.
Li, J., J. Yu, J. Li, H. Zhang, K. Zhao, Y. Rong, H. Cheng, and J. Huang, "Dirichlet Graph Variational Autoencoder", NeurIPS, 2020.
Zhang, H., J. Xu Yu, Y. Zhang, K. Zhao, and H. Cheng, "Distributed Subgraph Counting: A General Approach", PVLDB, pp. 2493-2507, 2020.
Bian, S., Q. Gun, S. Wang, and J. Xu Yu, "Efficient Algorithms for Budgeted Influence Maximization on Massive Social Networks", PVLDB, pp. 1498-1510, 2020.
Zhang, Y., and J. Xu Yu, "Hub Labeling for Shortest Path Counting", SIGMOD, pp. 1813-1828, 2020.
Guo, Q., S. Wang, Z. Wei, and M. Chen, "Influence Maximization Revisited: Efficient Reverse Reachable Set Generation with Bound Tightened.", SIGMOD, pp. 2167-2181, 2020.
Piao, C., W. Zheng, Y. Rong, and H. Cheng, "Maximizing the Reduction Ability for Near-maximum Independent Set Computation", PVLDB, pp. 2466-2478, 2020.
2021
Cheng, X., and S. Wang, "Efficient Approximate Algorithms for Empirical Entropy and Mutual Information", SIGMOD, pp. 274-286, 2021.
Zhang, H., M. Qiao, J. Xu Yu, and H. Cheng, "Fast Distributed Complex Join Processing", ICDE, pp. 2087-2092, 2021.
Lu, C., J. Xu Yu, Z. Zhang, and H. Cheng, "Graph Iso/Auto-morphism: A Divide-&-Conquer Approach", SIGMOD, pp. 1195-1207, 2021.
Zhao, K., Y. Rong, J. Xu Yu, W. Huang, J. Huang, and H. Zhang, "Graph Ordering: Towards the Optimal by Learning", WISE, pp. 423-437, 2021.

Pages