Biblio

Export 22 results:
Filters: First Letter Of Title is F  [Clear All Filters]
Conference Paper
Yu, J. Xu, Z. Chong, H. Lu, and A. Zhou, "False Positive or False Negative: Mining Frequent Itemsets from High Speed Transactional Data Streams", VLDB, pp. 204-215, 2004.
Cheng, J., J. Xu Yu, X. Lin, H. Wang, and P. S. Yu, "Fast Computation of Reachability Labeling for Large Graphs", EDBT, pp. 961-979, 2006.
Cheng, J., J. Xu Yu, X. Lin, H. Wang, and P. S. Yu, "Fast computing reachability labelings for large graphs with high compression rate", EDBT, pp. 193-204, 2008.
Zhao, P., and J. Xu Yu, "Fast Frequent Free Tree Mining in Graph Databases", ICDM Workshops, pp. 315-319, 2006.
Cheng, J., J. Xu Yu, B. Ding, P. S. Yu, and H. Wang, "Fast Graph Pattern Matching", ICDE, pp. 913-922, 2008.
Cheng, J., J. Xu Yu, and N. Tang, "Fast Reachability Query Processing", DASFAA, pp. 674-688, 2006.
Tang, N., J. Xu Yu, K-F. Wong, and H. Jiang, "Fast Structural Join with a Location Function", DASFAA, pp. 777-786, 2006.
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
Ding, B., J. Xu Yu, S. Wang, L. Qin, X. Zhang, and X. Lin, "Finding Top-k Min-Cost Connected Trees in Databases", ICDE, pp. 836-845, 2007.
Ding, B., J. Xu Yu, and L. Qin, "Finding time-dependent shortest paths over large graphs", EDBT, pp. 205-216, 2008.
Zhu, Y., L. Qin, J. Xu Yu, and H. Cheng, "Finding top-k similar graphs in graph databases", EDBT, pp. 456-467, 2012.
Liu, Z., R. Jin, H. Cheng, and J. Xu Yu, "Frequent Subgraph Summarization with Error Control", WAIM: Springer, pp. 1-12, 2013.
Xu, Y., J. Xu Yu, G. Liu, and H. Lu, "From Path Tree To Frequent Patterns: A Framework for Mining Frequent Patterns", ICDM, pp. 514-521, 2002.
Zhang, H., M. Qiao, J. Xu Yu, and H. Cheng, "Fast Distributed Complex Join Processing", ICDE, pp. 2087-2092, 2021.
Zhang, Y., J. Xu Yu, Y. Zhang, and L. Qin, "A Fast Order-Based Approach for Core Maintenance", 33rd {IEEE} International Conference on Data Engineering, {ICDE} 2017, San Diego, CA, USA, April 19-22, 2017, pp. 337–348, 2017.
Peng, Y., S. Bian, R. Li, S. Wang, and J. Xu Yu, "Finding Top-r Influential Communities under Aggregation Functions", 38th IEEE International Conference on Data Engineering, ICDE 2022, Kuala Lumpur, Malaysia, May 9-12, 2022: IEEE, pp. 1941–1954, 2022.
Journal Article
Zhao, P., and J. Xu Yu, "Fast Frequent Free Tree Mining in Graph Databases", World Wide Web, vol. 11, no. 1, pp. 71-92, 2008.
Chang, L., J. Xu Yu, and L. Qin, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 2013.
Chang, L., J. Xu Yu, and L. Qin, "Fast Probabilistic Ranking under x-Relation Model", CoRR, vol. abs/0906.4927, 2009.
Zhang, Y., J. Xu Yu, Y. Zhang, and L. Qin, "A Fast Order-Based Approach for Core Maintenance", CoRR, vol. abs/1606.00200, 2016.
Zhao, K., Z. Zhang, Y. Rong, J. Xu Yu, and J. Huang, "Finding Critical Users in Social Communities via Graph Convolutions", IEEE Trans. Knowl. Data Eng., vol. 35, pp. 456–468, 2023.
Lu, C., J. Xu Yu, H. Wei, and Y. Zhang, "Finding the maximum clique in massive graphs", {PVLDB}, vol. 10, pp. 1538–1549, 2017.