Biblio

Export 169 results:
2012
Li, R-H., J. Xu Yu, X. Huang, H. Cheng, and Z. Shang, "Measuring robustness of complex networks under MVC attack", CIKM, pp. 1512-1516, 2012.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", ICDE, pp. 462-473, 2012.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Robust Reputation-Based Ranking on Bipartite Rating Networks", SDM, pp. 612-623, 2012.
Huang, X., H. Cheng, J. Yang, J. Xu Yu, H. Fei, and J. Huan, "Semi-supervised Clustering of Graph Objects: A Subgraph Mining Approach", DASFAA (1), pp. 197-212, 2012.
Chang, L., J. Xu Yu, L. Qin, H. Cheng, and M. Qiao, "The exact distance to destination in undirected world", VLDB J., vol. 21, no. 6, pp. 869-888, 2012.
2013
Shang, Z., and J. Xu Yu, "Catch the Wind: Graph workload balancing on cloud", ICDE: IEEE Computer Society, pp. 553-564, 2013.
Qiao, M., H. Cheng, L. Qin, J. Xu Yu, P. S. Yu, and L. Chang, "Computing weight constraint reachability in large networks", VLDB J., vol. 22, no. 3, pp. 275-294, 2013.
Li, R-H., J. Liu, J. Xu Yu, H. Chen, and H. Kitagawa, "Co-occurrence prediction in a large location-based social network", Frontiers of Computer Science, vol. 7, no. 2, pp. 185-194, 2013.
Cheng, H., J. Han, X. Yan, and P. S. Yu, "Efficient Direct Mining of Selective Discriminative Patterns for Classification", Contrast Data Mining: CRC Press, pp. 39-58, 2013.
Chang, L., J. Xu Yu, L. Qin, X. Lin, C. Liu, and W. Liang, "Efficiently computing k-edge connected components via graph decomposition", SIGMOD Conference: ACM, pp. 205-216, 2013.
Chang, L., J. Xu Yu, and L. Qin, "Fast Maximal Cliques Enumeration in Sparse Graphs", Algorithmica, vol. 66, no. 1, pp. 173-186, 2013.
Liu, Z., R. Jin, H. Cheng, and J. Xu Yu, "Frequent Subgraph Summarization with Error Control", WAIM: Springer, pp. 1-12, 2013.
Zhu, Y., L. Qin, J. Xu Yu, Y. Ke, and X. Lin, "High efficiency and quality: large graphs matching", VLDB J., vol. 22, no. 3, pp. 345-368, 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.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Random-walk domination in large graphs: problem definitions and fast solutions", CoRR, vol. abs/1302.4546, 2013.
Li, R-H., and J. Xu Yu, "Scalable Diversified Ranking on Large Graphs", IEEE Trans. Knowl. Data Eng., vol. 25, no. 9, pp. 2133-2146, 2013.
Qiao, M., L. Qin, H. Cheng, J. Xu Yu, and W. Tian, "Top-K Nearest Keyword Search on Large Graphs", PVLDB, vol. 6, no. 10, pp. 901-912, 2013.
Huang, X., H. Cheng, R-H. Li, L. Qin, and J. Xu Yu, "Top-K Structural Diversity Search in Large Networks", PVLDB, vol. 6, no. 13, pp. 1618-1629, 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.
2014
Shang, Z., and J. Xu Yu, "Auto-Approximation of Graph Computing", {PVLDB}, vol. 7, pp. 1833–1844, 2014.
Zhang, Z., L. Qin, and J. Xu Yu, "Contract & Expand: I/O Efficient SCCs Computing", ICDE, pp. 208–219, 2014.
Li, R-H., J. Xu Yu, X. Huang, H. Cheng, and Z. Shang, "Measuring the impact of MVC attack in large complex networks", Inf. Sci., vol. 278, pp. 685–702, 2014.
Qiao, M., H. Cheng, L. Chang, and J. Xu Yu, "Approximate Shortest Distance Computing: A Query-Dependent Local Landmark Scheme", IEEE Trans. Knowl. Data Eng., vol. 26, no. 1, pp. 55-68, 2014.
Huang, X., H. Cheng, L. Qin, W. Tian, and J. Xu Yu, "Querying k-truss community in large and dynamic graphs", SIGMOD, pp. 1311–1322, 2014.
Li, R-H., J. Xu Yu, X. Huang, and H. Cheng, "Random-walk domination in large graphs", ICDE, pp. 736–747, 2014.

Pages