Biblio

Export 91 results:
Filters: First Letter Of Last Name is L  [Clear All Filters]
Conference Paper
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.
Fung, G. Pui Cheong, J. Xu Yu, H. Wang, D. W. Cheung, and H. Liu, "A Balanced Ensemble Approach to Weighting Classifiers for Text Classification", ICDM, pp. 869-873, 2006.
Fung, G. Pui Cheong, J. Xu Yu, and H. Lu, "Classifying High-Speed Text Streams", WAIM, pp. 148-160, 2003.
Fung, G. Pui Cheong, J. Xu Yu, and H. Lu, "Classifying Text Streams in the Presence of Concept Drifts", PAKDD, pp. 373-383, 2004.
Tang, N., J. Xu Yu, K-F. Wong, K. Lü, and J. Li, "Accelerating XML Structural Join by Partitioning", DEXA, pp. 280-289, 2005.
Tang, N., J. Xu Yu, K-F. Wong, K. Lü, and J. Li, "Accelerating XML Structural Join by Partitioning", DEXA, pp. 280-289, 2005.
Fang, S., K. Zhao, G. Li, and J. Xu Yu, "Community search: a meta-learning approach", 2023 IEEE 39th International Conference on Data Engineering (ICDE): IEEE, pp. 2358–2371, 2023.
Li, Z., J. Xu Yu, H. Lu, Y. Xu, and G. Liu, "Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining", PAKDD, pp. 458-463, 2004.
Li, Z., J. Xu Yu, H. Lu, Y. Xu, and G. Liu, "Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining", PAKDD, pp. 458-463, 2004.
Li, Z., J. Xu Yu, H. Lu, Y. Xu, and G. Liu, "Data Mining Proxy: Serving Large Number of Users for Efficient Frequent Itemset Mining", PAKDD, pp. 458-463, 2004.
Liu, Z., J. Xu Yu, L. Chen 000, 2, and D. Wu, "Detection of Shape Anomalies: A Probabilistic Approach Using Hidden Markov Models", ICDE, pp. 1325-1327, 2008.
Liu, Z., and J. Xu Yu, "Discovering Burst Areas in Fast Evolving Graphs", DASFAA (1), pp. 171-185, 2010.
Fung, G. Pui Cheong, J. Xu Yu, and H. Lu, "Discriminative Category Matching: Efficient Text Classification for Huge Document Collections", ICDM, pp. 187-194, 2002.
Li, J., J. Yu, J. Li, H. Zhang, K. Zhao, Y. Rong, H. Cheng, and J. Huang, "Dirichlet Graph Variational Autoencoder", NeurIPS, 2020.
Li, J., J. Yu, J. Li, H. Zhang, K. Zhao, Y. Rong, H. Cheng, and J. Huang, "Dirichlet Graph Variational Autoencoder", NeurIPS, 2020.
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, 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, 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.
Shi, W., Z. Liu, W. Zheng, and J. Xu Yu, "Extracting Keyphrases Using Heterogeneous Word Relations", Databases Theory and Applications - 28th Australasian Database Conference, {ADC} 2017, Brisbane, QLD, Australia, September 25-28, 2017, Proceedings, pp. 165–177, 2017.
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.
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.
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.

Pages