Biblio

Export 94 results:
Filters: First Letter Of Last Name is Z  [Clear All Filters]
2013
Zhang, Z., J. Xu Yu, L. Qin, L. Chang, and X. Lin, "I/O efficient: computing SCCs in massive graphs", SIGMOD Conference: ACM, pp. 181-192, 2013.
Cheng, H., J. Ye, and Z. Zhu, "What's Your Next Move: User Activity Prediction in Location-based Social Networks", SDM: SIAM, pp. 171-179, 2013.
2012
Zhu, Y., L. Qin, J. Xu Yu, and H. Cheng, "Finding top-k similar graphs in graph databases", EDBT, pp. 456-467, 2012.
Zhu, Y., J. Xu Yu, H. Cheng, and L. Qin, "Graph classification: a diversified discriminative feature selection approach", CIKM, pp. 205-214, 2012.
Zhang, Z., J. Xu Yu, L. Qin, Q. Zhu, and X. Zhou, "I/O cost minimization: reachability queries processing over massive graphs", EDBT, pp. 468-479, 2012.
Zhang, Z., J. Xu Yu, L. Qin, Q. Zhu, and X. Zhou, "I/O cost minimization: reachability queries processing over massive graphs", EDBT, pp. 468-479, 2012.
Zhang, Z., J. Xu Yu, L. Qin, Q. Zhu, and X. Zhou, "I/O cost minimization: reachability queries processing over massive graphs", EDBT, pp. 468-479, 2012.
2011
Cheng, H., Y. Zhou, and J. Xu Yu, "Clustering Large Attributed Graphs: A Balance between Structural and Attribute Similarities", TKDD, vol. 5, no. 2, pp. 12, 2011.
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
Zhu, Y., L. Qin, J. Xu Yu, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", CIKM, pp. 1755-1764, 2011.
Gao, J., J. Xu Yu, R. Jin, J. Zhou, T. Wang, and D. Yang, "Neighborhood-privacy protected shortest distance computing in cloud", SIGMOD Conference, pp. 409-420, 2011.
2009
Zhou, Y., H. Cheng, and J. Xu Yu, "Graph Clustering Based on Structural/Attribute Similarities", PVLDB, vol. 2, no. 1, pp. 718-729, 2009.
Cheng, H., D. Lo, Y. Zhou, X. Wang, and X. Yan, "Identifying bug signatures using discriminative graph mining", Proceedings of the eighteenth international symposium on Software testing and analysis, New York, NY, USA, ACM, pp. 141–152, 2009.
2008
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.
2007
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.
Zhao, P., J. Xu Yu, and P. S. Yu, "Graph Indexing: Tree + Delta $>$= Graph", VLDB, pp. 938-949, 2007.
Zhao, P., and J. Xu Yu, "Mining Closed Frequent Free Trees in Graph Databases", DASFAA, pp. 91-102, 2007.
2006
Zhao, P., and J. Xu Yu, "Fast Frequent Free Tree Mining in Graph Databases", ICDM Workshops, pp. 315-319, 2006.
2004
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.

Pages