Biblio

Export 88 results:
Filters: First Letter Of Last Name is C  [Clear All Filters]
2010
Pan, Q., H. Cheng, D. Wu, J. Xu Yu, and Y. Ke, "Stock Risk Mining by News", ADC, 2010.
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.
Qin, L., J. Xu Yu, and L. Chang, "Computing structural statistics by keywords in databases", ICDE, pp. 363-374, 2011.
Chang, L., J. Xu Yu, L. Qin, Y. Zhu, and H. Wang, "Finding information nebula over large networks", CIKM, pp. 1465-1474, 2011.
Qiao, M., H. Cheng, and J. Xu Yu, "Querying Shortest Path Distance with Bounded Errors in Large Graphs", SSDBM, pp. 255-273, 2011.
Qin, L., J. Xu Yu, and L. Chang, "Scalable keyword search on large data streams", VLDB J., vol. 20, no. 1, pp. 35-57, 2011.
2012
Qin, L., J. Xu Yu, and L. Chang, "Computing Structural Statistics by Keywords in Databases", IEEE Trans. Knowl. Data Eng., vol. 24, no. 10, pp. 1731-1746, 2012.
Qin, L., J. Xu Yu, and L. Chang, "Diversifying Top-K Results", PVLDB, vol. 5, no. 11, pp. 1124-1135, 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.
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.
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.
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
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.
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.
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.

Pages