Full List of Selected Publications

DBLP Page   10-Papers   Representative Publications   Journal Publications   Conference Publications   Proceedings and Journal Issues Edited

2020 / to appear

  • Z. Yang, L. Lai, X. Lin, K. Hao, W. Zhang, HUGE: An Efficient and Scalable Subgraph Enumeration Engine, SIGMOD 2021.

  • H. Kim, Y. Choi, K. Park, X. Lin, S-H. Hong, W-S. Han, Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching, SIGMOD 2021.

  • Z. Huang, X. Lin, W. Zhang, Y. Zhang, Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA, JMLR accepted 2021.

  • Y. Li, S. Yang, M. A. Cheema, Z. Shao, X. Lin, IndoorViz: A Demonstration System for Indoor Spatial Data Management (demo paper), SIGMOD 2021.

  • H. Zhang, Z. Huang, X. Lin, W. Zhang, Y. Zhang, Efficient and High-Quality Seeded Graph Matching: Employing Higher-order Structural Information, TKDD accepted 2020.

  • W. Zeng, X. Zhao, J. Tang, X. Lin, P. Groth, Reinforcement Learning based Collective Entity Alignment with Adaptive Features, TOIS accepted 2020.

  • M. Cheema, X. Lin, W. Zhang. Y. Zhang, Continuous Monitoring of Moving Skyline and Top-k Queries, VLDBJ accepted 2020.

  • X. Chen, L. Lai, L. Qin, X. Lin, Efficient Structural Node Similarity Computation on Billion-scale Graphs, VLDBJ accepted 2020.
  • W. Ni, P. Cheng, L. Chen, X. Lin, When the Recursive Diversity Anonymity Meets the Ring Signature, SIGMOD 2021.
  • Y. Yang, Y. Fang, M. Orlowska, W. Zhang, X. Lin, Efficient Bi-triangle Counting for Large Bipartite Networks, VLDB 2021.

  • Z. Lin, F. Zhang, X. Lin, W. Zhang, Z. Tian, Hierarchical Core Maintenance on Large Dynamic Graphs, VLDB 2021.

  • K. Wang, W. Zhang, X. Lin, Y. Zhang, L. Qin, Y. Zhang, Efficient and Effective Community Search on Large-scale Bipartite Graphs, ICDE 2021.

  • B. Liu, F. Zhang, W. Zhang, X. Lin, Y. Zhang, Efficient Community Search with Size Constraint, ICDE 2021.

  • X. Chen, L. Lai, L. Qin, X. Lin, B. Liu, A Framework to Quantify Approximate Simulation on Graph Data, ICDE 2021.

  • M. Yu, L. Qin, Y. Zhang, W. Zhang, X. Lin, DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs, ICDE 2021.

  • Z. Lai, Y. Peng, S. Yang, X. Lin, W. Zhang, PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA, ICDE 2021.

  • Y. Yu, D. Wen, Y. Zhang, X. Wang, W. Zhang, X. Lin, Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems, ICDE 2021.

  • P. yang, H. Wang, Y. Zhang, L. Qin, W. Zhang, X. Lin, T3S: Effective Representation Learning for Trajectory Similarity Computation, ICDE 2021.

  • Q. Luo, D. Yu, Z. Cai, X. Lin, X. Cheng, Hypercore Maintenance in Dynamic Hypergraphs, ICDE 2021.
  • Q. Linhu, F. Zhang, X. LIN, W. Zhang, Y. Zhang, Global Reinforcement of Social Networks: The Anchored Coreness Problem, SIGMOD2020: 2211-2226.

  • W. Li, M. Qiao, L. Qin, Y. Zhang, L. Chang, X. LIN, Scale Distance Labeling on Graphs with Core-Periphery Properties, SIGMOD2020: 1367-1381.

  • D. Ouyang, D. Wen, L. Qin, L. Chang, Y. Zhang, X. LIN, Progressive Top-K Nearest Neighbor Search in Large Road Networks, SIGMOD2020: 1781-1795.

  • C. Ma, Y. Fang, R. Cheng, L. Lakshmanan, W. Zhang, X. LIN, Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs, SIGMOD2020:1051-1066.

  • B. Lv, L. Qin, X. LIN, Y. Zhang, Z. Qian, J. Zhou, Maximum Biclique Search at Billion Scale, PVLDB 13(9): 1359-1372(VLDB2020).

  • H. Kim, S. Min, K. Park, X. LIN, S.H. Hong, W.S. Han, IDAR: Fast Supergraph Search Using DAG Integration, PVLDB 13(9): 1456-1468(VLDB2020).

  • J. Wang, P. Cheng, L. Zheng, C. Feng, L. Chen, X. LIN, Z. Wang, Demand-Aware Route Planning for Shared Mobility Services, PVLDB 13(7): 979-991(VLDB2020).

  • Y. Fang, Y. Yang, W. Zhang, X. LIN, X. Cao, Effective and Efficient Community Search over Large Heterogeneous Information Networks, PVLDB 13(6): 854-867(VLDB2020).

  • Y. Peng, Y. Zhang, X. LIN, W. Zhang, L. Qing, Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond, PVLDB 13(6): 812-825(VLDB2020).

  • Y. Peng, Y. Zhang, X. LIN, W. Zhang, L. Qin, Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice, PVLDB 13(4): 463-476(VLDB2020).

  • C. Li, F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Efficient Progressive Minimum k-core Search, PVLDB 13(3): 362-375(VLDB2020).

  • B. Yang, D. Wen, L. Qin, Y. Zhang, X. Wang, X. LIN, Fully Dynamic Depth-First Search in Directed Graphs, PVLDB 13(2): 142-154(VLDB2020).

  • D. Ouyang, L. Yuan, L. Qin, L. Chang, Y. Zhang, X. LIN, Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees, PVLDB 13(5): 602-615(VLDB2020).

  • J. Yang, W. Zhang, X. Wang, Y. Zhang, X. LIN, Distributed Streaming Set Sim ilarity Join, ICDE2020: 565-576.

  • L. Chang, X. Feng, X. LIN, L. Qin, W. Zhang, D. Ouyang: Speeding Up GED Verification for Graph Similarity Search. ICDE2020: 793-804.

  • D. Chu, F. Zhang, X. LIN, W. Zhang, Y. Zhang, Y. Xia, C. Zhang, Finding the Best k in Core Decomposition: A Time and Space Optimal Solution, ICDE2020: 685-696.

  • K. Wang, X. LIN, L. Qin, W. Zhang, Y. Zhang, Efficient Bitruss Decomposition for Large-scale Bipartite Graphs, ICDE2020: 661-672.

  • B. Li, R. Cheng, J. Hu, Y. Fang, M. Ou, R. Luo, K. Chang, X. LIN, MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks, ICDE2020: 1722-1725 (Demo)

  • W. Zeng, X. Zhao, J. Tang, X. LIN, Collective Entity Alignment via Adaptive Features, ICDE2020: 1870-1873 (short paper)

  • D. Wen, Y. Huang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Efficiently Answering Span-Reachability Queries in Large Temporal Graphs, ICDE2020: 1153-1164.

  • X. Chen, L. Lai, L. Qin, X. LIN, StructSim: Querying Structural Node Similarity at Billion Scale, ICDE2020: 1950-1953 (short paper).

  • W. Ni, P. Cheng, L. Chen, X. LIN, Task Allocation in Dependency-aware Spatial Crowdsourcing, ICDE 2020: 985-996.

  • C. Zhang, F. Zhang, W. Zhang, B. Liu, Y. Zhang, L. Qin, X. LIN, Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation, ICDE2020: 181-192.

  • M. Li, Y. Zhang, Y. Sun, W. Wang, I. W. Tsang, X. LIN, I/O Efficient Approximate Nearest Neighbour Search based on Learned Functions, ICDE2020: 289-300.

  • Y. Yang, Y. Fang, X. LIN, W. Zhang, Effective and Efficient Truss Computati on over Larger Heterogeneous Information Networks, ICDE2020: 901-912.

  • Y. Mao, W. Liu, X. LIN, Adaptive Adversarial Multi-task Representation Learning, ICML2020.

  • H. Wang, D. Lian, Y. Zhang, L. Qin, X. LIN, GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions, IJCAI 2020.

  • Z. Chen, L. Yuan, X. LIN, L. Qin, Efficient Maximal Balanced Clique Enumeration in Signed Networks, WWW2020: 339-349.

  • B. Liu, L. Yuan, X. LIN, L. Qin, W. Zhang, J. Zhou, Efficient (alpha, beta)-core Computation in Bipartite Graphs, VLDB Journal, 2020.

  • Y. Fang, X. Huang, L. Qin, Y. Zhang, W. Zhang, R. Cheng, X. LIN. A Survey of Community Search Over Big Graphs, VLDB Journal 29, 353-392(2020).

2019

  • F. Zhang, X. LIN, Y. Zhang, L. Qing, W. Zhang, Efficient Community Discovery with User Engagement and Similarity, VLDB Journal 28, 987-1012(2019) (accepted in Sept, 2019).

  • K. Wang, X. LIN, L. Qin, W. Zhang, Y. Zhang, Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks, VLDB2019.12(10): 1139-1152(2019).

  • Z. Zhou, F. Zhang, X. LIN, W. Zhang, C. Chen, K-core Maximization: An Edge Addition Approach, IJCAI2019: 4867-4873.

  • W. Zhu, M. Zhang, C. Chen, X. Wang, F. Zhang, X. LIN, Pivotal Relationship Identification: The K-Truss Minimization Problem, IJCAI2019: 4874-4880.

  • D. Wen, L. Qin, Y. Zhang, L. Chang, X. LIN, Efficient Structural Graph Clustering: An Index-Based Approach, VLDB Journal 28, 377-399(2019).

  • Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Mingjie Li, Wenjie Zhang, and XUEMIN LIN, "Approximate Nearest Neighbor Search on High Dimensional Data Experiments, Analyses, and Improvement", IEEE Transactions on Knowledge and Data Engineering (TKDE, Accepted in April 2019, Submitted Before my EIC).

  • B. Liu, L. Yuan, X. LIN, W. Zhang, L. Qin, J. Zhou, Efficient (alpha, beta)-Core Computation: an Index-based Approach, WWW2019: 1130-1141.

  • W. Li, M. Qiao, L. Qin, Y. Zhang, L. Chang, X. LIN, Scaling Distance Labeling on Small-World Networks, SIGMOD2019: 1060-1077.

  • X. Wang, L. Qin, X. LIN, Y. Zhang, L. Chang, Leveraging Set Relations in Exact and Dynamic Set Similarity Join, VLDBJ 28, 267-292(2019) (accepted in Nov, 2018).

  • W. Yu, X. LIN, W. Zhang, J. Pei, and J. McCann, SimRank*: Effective and Scalable Pairwise Similarity Search Based on Graph Topology, VLDBJ 28, 401-426(2019) (accepted in Dec, 2018)

2018

  • X. Qiu, W. Cen, Z. Qian, Y. Peng, Y. Zhang, X. LIN, J. Zhou, Real-time Constrained Cycle Detection in Large Dynamic Graphs, VLDB2018.11(12): 1876-1888(2018).

  • F. Bi, L. Chang, X. LIN, W. Zhang, An Optimal and Progressive Approach to Online Search of Importance-based Top-K Communities, VLDB2018.11(9): 1056-1068(2018).

  • B. Lv, L. Qin, X. LIN, L. Chang, J. Yu, Supergraph Search in Graph Databases vis Hierarchical Feature-Tree, TKDE, 31(2): 385-400(2018) (accept in April, 2018. Subbmited before my EIC term.)

  • D. Wen, L. Qin, Y. Zhang, X. LIN, J. Yu, I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering, TKDE, 31(1): 75-90(2018) (Best Paper Award in ICDE 2016).

  • D. Ouyang, L. Qin, L. Chang, X. LIN, Y. Zhang, Q. Zhu, When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks, SIGMOD2018: 709-724.

  • J. Yang, W. Zhang, S. Yang, Y. Zhang, X. LIN, L. Yuan, Efficient Set Containment Join, VLDB Journal 27, 471-495(2018) (accepted in March, 2018).

  • K. Wang, X. Cao, X. LIN, W. Zhang, L. Qin, Efficient Computing of Radius-Bounded k-Cores, ICDE2018: 233-244.

  • Y. Peng, Y. Zhang, W. Zhang, X. LIN, L. Qin, Efficient Probabilistic K-Core Computation on Uncertain Graphs, ICDE2018: 1192-1203.

  • F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Efficient Reinforcing Social Networks over User Engagement and Tie Strength, ICDE2018: 557-568.

  • J. Qin, Y. Wang, C. Xiao, W. Wang, X. LIN, Y. Ishikawa, GPH: Similarity Search in Hamming Space, ICDE2018: 29-40.

  • W. Li, M. Qiao, L. Qin, Y. Zhang, L. Chang, X. LIN, Exacting Eccentricity for Small-World Networks, ICDE2018: 785-796.

  • Y. Chen, X. Zhao, X. LIN, Y. Wang, D. Guo, Efficient Mining of Frequent Patterns on Uncertain Graphs, TKDE, 31(2): 287-300(2018) (accepted in Jan, 2018, submitted before my EIC term).

  • W. Yu, X. LIN, W. Zhang, and J. McCann. Dynamical SimRank Assessment on Time-Varying Networks. VLDB Journal 27, 79-104(2018). (33 pages, Accepted in OCT 2017).

  • X. Zhao, C. Xiao, X. LIN, Wenjie Zhang, Yan Wang, Efficient Structure Similarity Searches: A Partition-Based Approach, VLDB Journal 27, 53-78(2018).

  • W. Liu, Z. Liu, I. W. Tsang, W. Zhang, X. LIN, Doubly Approximate Nearest Neighbor Approximation, AAAI 2018: 3683-3690.

  • L. Yuan, L. Qin, X. LIN, L. Chang, W. Zhang, Effective and Efficient Dynamic Graph Coloring, VLDB2018.11(3): 338-351(2018).

  • D. Wen, L. Qin, L. Chang, Y. Zhang, X. LIN, Efficient Structural Graph Clustering: An Index-Based Approach, VLDB2018.11(3): 243-255(2018).

2017

  • F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks, VLDB2017.10(10): 998-1009(2017).

  • P. Li, J. Yao, L. Wang, and X. LIN, SPOT: Selecting occuPations frOm Trajectories, SIGIR 2017: 813-816 (Short Paper)

  • X. Wang, Q. Lu, X. LIN, Y. Zhang, L. Chang, Leveraging Set Relations in Exact Set Similarity Join, VLDB2017.10(9): 925-936(2017).

  • Z. Huang, X. LIN, W. Zhang, Y. Zhang, Efficient Matrix Sketching over Distributed Data, Proc. ACM SIGMOD-SIGACT-SIGART Symposium on Principles of Database Systems (PODS2017): 347-359.

  • J. Yang, W. Zhang, Y. Zhang, X. LIN, TT-Join: Efficient Set Containment Join, ICDE2017: 509-520.

  • L. Chang, C. Zhang, X. LIN, L. Qin Scalable Top-K Structural Diversity Search Short Paper, Proceedings of the 32st International Conference on Data Engineering (ICDE2017), 95-98(2017).

  • H. Zhang, Z. Huang, Z. Wei, W. Zhang, X. LIN, Tracking Matrix Approximations over Distributed Sliding Windows, ICDE2017: 833-844.

  • L. Yuan, L. Qin, X. LIN, L. Chang, W. Zhang, I/O Efficient ECC Graph Decomposition via Graph Reduction, VLDB Journal 26, 275-300(2017).

  • Xiang Wang, Wenjie Zhang, Ying Zhang, XUEMIN LIN, Zengfeng Huang, Top-k Spatial-keyword Publish/Subscribe Over Sliding Window , VLDB Journal 26, 301-326(2017) (VLDBJ, accepted by Dec 2016).

  • Fan Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, XUEMIN LIN, "OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks", 42nd International Conference on Very Large Data Bases (VLDB), 2017.10(6): 649-660(2017).

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, Efficient Distance-Aware Influence Maximization in Geo-social Networks, IEEE Transactions on Knowledge an d Data Engineering, 29(3): 599-612(2017) (accepted in Nov, 2016).

  • T. Gao, X. Cao, G. Cong, J. Lu, X. LIN, Distributed Algorithms on Exact Personalized PageRank, SIGMOD2017: 479-494.

  • F. Zhang, Y. Zhang, L. Qin, W. Zhang, X. LIN, Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem, AAAI2017: 245-251.

  • J. Lu, Z. Gong, X. LIN, A Novel and Fast SimRank Algorithm, TKDE, 29(3): 572-585(2017) (accepted in Nov, 2016).

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, C. Chen, Bring Order into the Samples:A Novel Scalable Method for Influnce Maximization, TKDE, 29(2): 243-256(2017) (accepted in Oct, 2016).

  • L. Lai, Q. Lu, X. LIN, Y. Zhang, L. Chang, S. Yang, Scalable Distributed Subgraph Enumeration, VLDB2017. 10(3): 2150-8097(2017).

  • S. Yang, M.A. Cheema, X. LIN, Y. Zhang, W. Zhang, Reverse k nearest neighbors queries and spatial reverse top-k queries, VLDB Journal 26, 151-176(2017) (accepted in Oct, 2016).

2016

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, Efficient Identification of Local Keyword Patterns in Microblogging Platforms, IEEE Transactions on Knowledge and Data Engineering, 28(10): 2621-2634(2016) (TKDE, accepted in May, 2016).

  • S. Song, J. Wang, X. Zhu, X. LIN, J. Sun, Efficient Recovery of Missing Events, ppear in IEEE Transactions on Knowledge and Data Engineering, 28(11): 2943-2957(2016) (TKDE, accepted in July, 2016).

  • F. Bi, L. Chang, X. LIN, L. Qin, W. Zhang, Efficient Subgraph Matching by Postponing Cartesian Products, SIGMOD 2016: 1199-1214.

  • H. Wei, J.X. Yu, C. Lu, X. LIN, Speedup Graph Processing by Graph Ordering, SIGMOD 2016: 1813-1828.

  • Y. Wang, W. Zhang, L. Hu, X. LIN, Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering, IJCAI 2016: 2153-2159.

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, Z. Huang, SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window, VLDB2016. 9(10): 588-599(2016).

  • L. Yuan, L. Qin, X. LIN, L. Chang, W. Zhang, I/O Efficient ECC Graph Decomposition via Graph Reduction, VLDB2016. 9(7): 516-527(2016).

  • B. Lyu, L. Qin, X. LIN, L. Chang, J.X. Yu, Scalable Supergraph Search in Large Graph Databases, ICDE2016: 157-168.

  • X. Feng, L. Chang, X. LIN, L. Qin, W. Zhang, Computing Connected Components with Linear Communication Cost in Pregel-like Systems, ICDE2016: 85-96.

  • L. Chang, W. Li, X. LIN, L. Qin, W. Zhang, pScan: Fast and Exact Structural Graph Clustering, ICDE2016: 253-264.

  • J. Yang, Y. Zhang, W. Zhang, X. LIN, Influence based cost optimization on user preference, ICDE2016: 709-720.

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, Distance-Aware Influence Maximization in Geo-social Network, ICDE2016: 1-12.

  • S. Wang, M. Cheema, X. LIN, Y. Zhang, D. Liu, Efficiently Computing Reverse k Furthest Neighbors, ICDE2016: 1110-1121.

  • D.-W. Choi, J. Pei, X. LIN, Finding the Minimum Spatial Keyword Cover, ICDE2016: 685-696.

  • D. Wen, L. Qin, Y. Zhang, X. LIN, J.X. Yu, I/O Efficient Core Graph Decomposition at Web Scale, ICDE2016: 133-144 (BEST PAPER AWARD).

  • W. Zhang, X. LIN, Y. Zhang, K. Zhu, G. Zhu, Efficient Probabilistic Supergraph Search (ICDE/TKDE Poster), ICDE2016: 1542-1543.

  • Y. Zheng, H. Wang, X. LIN, M. Wang, Understanding Short Texts through Semantic Enrichment and Hashing (ICDE/TKDE Poster), ICDE2016: 1552-1553.

  • Y. Wang, W. Zhang, L. Wu, X. LIN, X. Zhao, Unsupervised Metric Fusion over Multi-view Data by Graph Random Walk based Cross-view Diffusion, IEEE Transactions on Neural Networks and Learning Systems (TNNLS, accepted in Nov 2015), 28(1): 57-70.

  • W. Zhang, X. LIN, Y. Zhang, K. Zhu, G. Zhu, Efficient Probabilistic Supergraph Search, IEEE Transactions on Knowledge and Engineering, 28(4): 965-978 (TKDE, accepted in Nov 2015).

  • X. Zhou, J. Qin, W.Wang, C. Xiao, X. LIN, BEVA: An Efficient Query Processing Algorithm for Error Tolerant Autocompletion, ACMTODS: 1-44 (accepted in Oct, 2015).

  • L. Yuan, L. Qin, X. LIN, L. Chang, W. Zhang, Diversified Top-K Clique Search, VLDB J 25, 171-196(2016) (accepted in Oct 2015).

  • Z. Yu, H. Wang, X. LIN, M. Wang, Understanding Short Texts through Semantic Enrichment and Hashing, IEEE Transactions on Knowledge and Data Engineering, 28(2): 566-579 (TKDE, accepted in Sept 2015).

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, W. Wang, AP-Tree: Efficiently Support Location-aware Publish/Subscribe, VLDBJ 24, 823-848 (2015) (accepted Sept, 2015).

2015

  • Yang Wang, XUEMIN LIN, Lin Wu and Wenjie Zhang, Effective Multi-Query Expansions: Robust Landmark Retrieval, ACM MM2015: 79-88.

  • Yifan Chen, Xiang Zhao, XUEMIN LIN, Towards Frequent Subgraph Mining on Single Large Uncertain Graphs, ICDM2015: 41-50.

  • Y. Wang, X. LIN, L. Wu, W. Zhang, X. Huang, Q. Zhang, Robust Subspace Clustering for Multi-view Data by Exploiting Correlation Consensus, IEEE Transactions on Image Processing, 24(11): 3939-3949(2015) (Accepted in July, 2015).

  • Y. Zhang, L. Zhan, W. Zhang, X. LIN, Finding Top k Most Influential Spatial Facilities over Uncertain Objects, IEEE Transactions on Knowledge and Data Engineering, 27(12):922-931 (TKDE, accepted in July 2015)

  • Z. Yu, H. Wang, X. LIN, M. Wang, Learning Term Embeddings for Hypernymy Identification, IJCAI 2015: 1390-1397.

  • Y. Wang, X. LIN, L. Hu, W. Zhang, LBMCH: Learning Bridging Mapping for Cross-modal Hashing, SIGIR 2015: 999-1002 (short paper).

  • L. Chang, X.LIN, Q. Lu, J .X. Yu, W. Zhang, Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity, SIGMOD 2015: 459-474.

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, M. A. Cheema, Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates, SIGMOD 2015: 923-938.

  • L. Chang, X. LIN, Q. Lu, J.X. Yu, J. Pei, Efficiently Computing Top-k Shortest Path Join, EDBT2015: 133-144.

  • L. Lai, L. Qin, X. LIN, L. Chang, Scalable Subgraph Enumeration in MapReduce, VLDB 2015, 8(10): 974-985(2015).

  • L. Chang, X. LIN, W. Zhang, J.X. Yu, Y. Zhang, L. Qin, Optimal Enumeration: Efficient Top-k Tree Matching, VLDB 2015, 8(5): 533-544(2015).

  • S. Yang, M.A., Cheema, X. LIN, W. Wang, Reverse k Nearest Neighbors Query Processing: Experiments and Analysis, VLDB 2015, 8(5): 605-616(2015).

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, W. Wang, Selectivity Estimation On Streaming Spatio-Textual Data Using Local Correlations, VLDB2015, 8(2): 101-112(2015).

  • Y. Sun, W. Wang, J. Qin, Y. Zhang, X. LIN, SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index, VLDB 2015, 8(1): 1-12(2015).

  • J. Wang, S. Song, X. LIN, X. Zhu, J. Pei, Clean Structured Event Logs: A Graph Repair Approach, ICDE2015: 30-41.

  • L. Yuan, Lu. Qin, X. LIN, L. Chang, W. Zhang, Diversified Top-K Clique Search, ICDE2015: 387-398.

  • X. Wang, Y. Zhang, W. Zhang, X. LING, W. Wang, AP-Tree: Efficiently Support Continuous Spatial-Keyword Queries Over Stream, ICDE2015: 1107-1118.

  • Z. Zhang, J.X. Yu, L. Qin, L. Chang, X. LIN, I/O Efficient: Computing SCCs in Massive Graphs, VLDB Journal 24, 245-270 (2015) (accepted in Sept, 2014).

2014

  • W. Yu, X. LIN, W. Zhang, J. A. McCann, Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains, TKDE2014, 27(7): 1810-1823.

  • X. Wang, Y. Zhang, W. Zhang, X. LIN, Efficiently Identify Local Frequent Keyword Co-occurrence Pattrns in Geo-tagged Twitter Stream, SIGIR 2014: 1215-1218.

  • Y. Wang, X. LIN, L. Wu, W. Zhang, Q. Zhang, Exploiting Correlation Consensus: Towards Subspace Clustering for Multi-modal data, MM 2014: 981-984.

  • L. Qu, J.X. Yu, L. Chang, H. Cheng, C. Zhang, X. LIN, Scalable Big Graph Processing in MapReduce, SIGMOD 2014: 827-838.

  • Y. Zhang, W. Zhang, X. LIN, M. A. Cheema, C. Zhang, Matching Dominance: Capture the Semantics of Dominance for Multi-dimensional Uncertain Objects, SSDBM 2014: 18.

  • Y. Han, L. Chang, W. Zhang, X. LIN, L. Wang, Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time, ADC 2014: 122-134.

  • M.A. Cheema, X. LIN, H. Wang, J. Wang, W. Zhang, A Unified Framework for Answering k Closest Pairs Queries and Variants", IEEE Transactions on Knowledge and Data Engineering, 26(11): 2610-2624(2014) (TKDE, accepted in Jan, 2014).

  • Z. Shen, M. A. Cheema, X. LIN, W. Zhang, H. Wang, A Generic Framework for Top-k Pairs and Top-k Objects Queries over Sliding Windows, TKDE 26(6): 1349-1366, 2014.

  • X. Zhao, C. Xiao, W. Zhang, X. LIN, Improving Performance of Graph Similarity Joins Using Selected Substructures, DASFAA 2014 (1): 122-134.

  • L. Zhan, Y. Zhang, W. Zhang, X. LIN, Identifying Top k Dominating Objects over Uncertain Data, DASFAA 2014 (1): 388-405.

  • Y. Wang, J. Pei, X. LIN, Q. Zhang, W. Zhang, An iterative fusion approach for graph based semi-supervised learning from multi-views, PAKDD 2014 (2): 162-173.

  • Y. Wang, X. LIN, Q. Zhang, Shifting Hypergraphs by probabilistic Voting, PAKDD 2014 (2): 234-246. ( Best Paper Runner-Up Award )

  • W. Yu, X. LIN, W. Zhang, Fast Incremental SimRank on Link-Evolving Graphs, ICDE 2014: 304-315.

  • S. Yang, M.A. Cheema, X. LIN, Y. Zhang, SLICE: Reviving Regions-Based Pruning for Reverse k Nearest Neighbors Queries, ICDE 2014: 760-711.

  • M.A. Cheema, Z. Shen, X. LIN, W. Zhang, A Unified Framework for Efficiently Processing Ranking Related Queries, EDBT 2014: 427-438.

  • C. Zhang, Y. Zhang, W. Zhang, X. LIN, M.A. Cheema, X. Wang, Diversified Spatial Keyword Search on Road Networks, EDBT 2014: 367-378.

2013

  • X. Zhao, C. Xiao, X. LIN, Q. Liu, W. Zhang, A Partition-Based Approach to Structure Similarity Search, Proceedings of the VLDB Endowment, 2013, 7(3).

  • S. Wang, M.A. Cheema, X. LIN, Efficiently Monitoring Reverse k Nearest Neighbors in Spatial Networks, the Computer Journal (accepted in Sept, 2013).

  • W. Yu, X. LIN, W. Zhang, L. Chang, J. Pei, More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarity based on Hype-links. PVLDB 7(1): 13-24 (2013).

  • Y. Wang, X.LIN, Q. Zhang, Towards Metric Fusion on Multi-view Data: A Cross based Graph Random Walk Approach. CIKM 2013: 805-810

  • J. Wang, S. Song, Z. Zhu, X. LIN, Efficient Recovery of Missing Events, PVLDB 6(10): 841-852 (2013).

  • W. Yu, X. LIN, IRWR: Incremental Random Walk with Resatrt, SIGIR 2013: 1017-1020.

  • J. Qin, W. Wang, Y. Lu, C. Xiao, X. LIN, H. Wang, Asymmetric Signature Schemes for Efficient Exact Edit Similarity Query Processing, ACM Trans. Database Syst.(TODS) 38(3): 1-44 (2013)

  • L. Chang, J. Yu, L. Qin, X. LIN, C. Liu, W. Liang, Efficiently Computing k-Edge Connected Components via Graph Decomposition, SIGMOD Conference 2013: 205-216.

  • Z. Zhang, J. Yu, L, Qin, L. Chang, X. LIN, I/O Efficient: Computing SCCs in Massive Graphs, SIGMOD Conference 2013: 181-192.

  • Q. Liu, K. Taylor, X. Zhao, G. Squire, X. LIN, C. Kloppers, R. Miller, CTrace: Semantic Comparison of Multi-Granularity Process Traces, SIGMOD Conference 2013: 1121-1124 (demo).

  • Wenjie Zhang, Liming Zhan, Ying Zhang, Muhammad Aamir Cheema, XUEMIN LIN, Efficient Top-k Similarity Join Processing over Multi-valued Objects, WWW Journal 17(3): 285-309, (2014).

  • X. Zhao, X. Chuan, X. LIN, W. Wang, Y. Ishikawa, Efficient Processing of Graph Similarity Queries with Edit Distance Constraints, VLDB J. 22(6): 727-752 (2013)

  • Y. Zhang, W. Zhang, Q. Lin, X. LIN, H.T. Shen, Effectively Indexing the Multi-dimensional Uncertain Objects, IEEE Transactions on Knowledge and Data Engineering, 26(3): 608-622, 2014 (TKDE).

  • Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin: AVR-Tree: Speeding Up the NN and ANN Queries on Location Data. DASFAA (1) 2013: 116-130

  • X. Zhao, H. Shang, W. Zhang, X. LIN, On Efficient Graph Substructure Selection,DASFAA (2) 2013: 284-300

  • Muhammad Cheema, XUEMIN LIN, Wenjie Zhang, Ying Zhang, A Safe Zone Based Approach for Monitoring Moving Skyline Queries, EDBT 2013: 275-286.

  • Qing Zhang, Penjie Ye, XUEMIN LIN, Ying Zhang, Skyline Probability over Uncertain Preferences, EDBT 2013: 395-405

  • Yang Wang, Muhammad Cheema, XUEMIN LIN, Qing Zhang, Multi-Manifold Ranking: Using Multiple Features for Better Image Retrieval, PAKDD (2) 2013: 449-460

  • Wei Cheng, Xiaoming Jin, Jian-Tao Sun, XUEMIN LIN, Xiang Zhang, and Wei Wang, Searching Dimension Incomplete Databases, IEEE Trans. Knowl. Data Eng. 26(3): 725-738, 2014 .

  • Ying Zhang, Wenjie Zhang, Jian Pei, XUEMIN LIN, Qianlu Lin, Aiping Li, Consensus-based Ranking of Multi-valued Objects: A Generalized Borda Count Approach, IEEE Trans. Knowl. Data Eng. 26(1): 83-96 (2014) .

  • Wenjie Zhang, Muhammad Aamir Cheema, Ying Zhang, Xuemin Lin, Skyline: Stacking Optimal Solutions in Exact and Uncertain Worlds, International Journal of Software and Informatics, 2012,6(4):475~493 (invited paper)

  • Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin, Efficient General Spatial Skyline Computation, World Wide Web 16(3): 247-270 (2013).

  • Weiren Yu, XUEMIN LIN, Wenjie Zhang, Towards efficient SimRank computation on large networks. ICDE 2013: 601-612 (One of the Best Papers )

  • Chengyuan Zhang, Ying Zhang, Wenjie Zhang, XUEMIN LIN, Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search, ICDE 2013: 901-912

  • Ming Gao, Cheqing Jin, Wei Wang, XUEMIN LIN, Aoying Zhou, Similarity Query Processing for Probabilistic Sets, ICDE 2013: 913-924

  • Zhitao Shen, Muhammad A. Cheema, XUEMIN LIN, Wenjie Zhang, Haixun Wang, Efficiently Monitoring Top-k Pairs over Sliding Windows. ICDE 2012: 798-809(Invited as one of the best papers in ICDE 2012)

  • Yuanyuan Zhu, Lu Qin, Jeffrey Yu, Yiping Ke, XUEMIN LIN, High Efficiency and Quality: Large Graphs Matching, VLDB J. 22(3): 345-368 (2013).

2012

  • L. Zhan, Y. Zhang, X. LIN, W. Zhang, Finding Top k Most Influential Spatial Facilities Over Uncertain Objects, CIKM 2012: 922-931.

  • Z. Shen, M.A. Cheema, X. LIN, Loyalty-based Selection: Retrieving Objects That Persistently Satisfy Criteria, CIKM 2012: 2189-2193(short paper)

  • Weiiren Yu, XUEMIN LIN, Wenjie Zhang, Ying Zhang, Jiajin Le, "SimFusion+: Extending SimiFusion Towards Efficient Estimation on Large Dynamic Networks", SIGIR 2012: 365-374

  • Weiren Yu, Jiajin Le, XUEMIN LIN, Wenjie Zhang. "On the Efficiency of Estimating Penetrating Rank on Large Graphs", SSDBM 2012, LNCS, 231-249

  • Jianbin Qin, Wei Wang, Chuan Xiao, XUEMIN LIN, Hengtao Shen, VChunkJoin: An Efficient Algorithm for Edit Similarity Joins, IEEE Trans. Knowl. Data Eng. 25(8): 1916-1929 (2013)
  • Chunyang Ma, Rui Zhang, Xuemin Lin, Gang Chen. DuoWave: Mitigating the curse of dimensionality for uncertain data. Data Knowl. Eng. 76: 16-38 (2012)

  • Wenjie Zhang, XUEMIN LIN, Ying Zhang, Muhammad A. Cheema, Qing Zhang, "Stochastic Skylines", ACM Transactions on Database Systems (TODS) 37(2): 1-34 (2012)
  • Wenjie Zhang, XUEMIN LIN, Ying Zhang, Wei Wang, Gaoping Zhu, Jeffrey X. Yu, Probabilistic Skyline Operator over Sliding Windows, Information Systems 38(8): 1212-1233(2013)
  • Gaoping Zhu, XUEMIN LIN, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yun, "TreeSpan: Efficiently Computing Similarity All-Matching", SIGMOD Conference 2012: 529-540
  • Muhammad A. Cheema, Wenjie Zhang, XUEMIN LIN, Ying Zhang "Efficiently Processing Snapshot and Continuous Reverse k Nearest Neighbors Queries", VLDB J. 21(5): 703-728 (2012)
  • Ying Zhang , Wenjie Zhang, Qianlu Lin, XUEMIN LIN , Effectively Indexing the Multi-Dimensional Uncertain Objects for Range Searching , EDBT 2012: 504-515
  • G. Zhu, K. Zhu, W. Zhang, X. LIN, C. Xiao, Efficient Subgraph Similarity Matching, DASFAA (1) 2012: 455-469 (Best Student Paper Award).

  • W. Zhang, J. Xu, X. Liang, Y. Zhang, X. LIN, Top-k Similarity Join Over Multi-valued Objects, DASFAA (1) 2012: 509-525.

  • Zhitao Shen, Muhammad Aamir Cheema, XUEMIN LIN, Wenjie Zhang, Haixun Wang, Efficiently Monitoring Top-k Pairs over Sliding Windows, ICDE 2012: 798-809 (one of the best papers).

  • Xiang Zhao, Chuan Xiao, XUEMIN LIN, Wei Wang, Efficient Graph Similarity Joins with Edit Distance Constraints, ICDE 2012: 834-845

  • Bin Jiang, Jian Pei, Yufei Tao, Xuemin Lin: Clustering Uncertain Data Based on Probability Distribution Similarity. IEEE Trans. Knowl. Data Eng. 25(4): 751-763 (2013)

  • Muhammad A. Cheema, Wenjie Zhang, XUEMIN LIN, Ying Zhang, Xuefei Li, Continuously Reverse k Nearest Neighbors Queries in Euclidean Space and in Spatial Networks, VLDB Journal, 21(1), 69-95 (2012)

  • Y. Zhang, X. LIN, Y. Tao, W. Zhang, H. Wang, Efficient Computing of Range Aggregates against Uncertain Location based Queries , IEEE Trans. Knowl. Data Eng. 24(7): 1244-1258 (2012)

  • W. Yu, W. Zhang, X. LIN, Q. Zhang, J. Le, A Space and Time Efficient Algorithm for SimRank Computation, WWW Journal, 15(3), 327-353, 2012.

  • B. Jiang, J. Pei, X. LIN, Y. Yuan, Probabilistic Skylines on Uncertain Data: Model and Bounding-Pruning-Refining Methods, Journal of Intelligent Information Systems, 38(1), 1-39 (2012).

  • Yang Wang, Lin Wu, Xiaodi Huang, XUEMIN LIN, Human Action Recognition from Video Sequences by Enforcing Tri-view Constraints, Comput. J. 55(9): 1030-1040 (2012)

2011

2010

2009:

2008:

2007:

2006

2005

2004

2003

2002

  • D. Du, P. Eades, X. LIN (gest editors), Computing and Combinatorics, a special issue in Theoretical Computer Science (289(2), 2002).

  • Q. Zhang and X. LIN, On Linear-Spline Based Histograms, WAIM 2002, LNCS, Springer-Verlag, pages 354-366, 2002.

  • X. LIN, H.X. Lu, and Q. Zhang, Graph Partition Based Multi-Way Joins, IDEAS02, IEEE CS Press, pages 23-32, 2002.

2001

2000

1999

1998

  • X. LIN (ed), Computing Theory (the proceedings of CATS'98), Springer-Verlag, 1998.

  • X. LIN, Y. Li, and C. P. Tsang, Reducing Counting Costs in Mining Association Rules by an On-Line Bitmap Index", Proceedings of 9th International Conference on Computing and Information , pages 3-9, 1998.

  • Y. Li, X. LIN, and C. P. Tsang, An Efficient Algorithm for Mining Distributed Association Rules, Proceedings of 1998 International Conference on Parallel and Distributed Processing Techniques and Applications , pages 1169-1175, 1998.

  • Y. C. Lin, X. LIN, and X. Zhou, Efficiently Mining Tree Traversal Patterns in a Web Environment, IEEE TENCOON'98 , IEEE, pages 115-118, 1998.

1997

1996

1995

  • X. LIN and M. Orlowska, An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems, Distributed and Parallel Databases , 3(1), pages 68-83, 1995.

  • X. LIN and M. Orlowska, An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems, Information Sciences: an international journal 85, pages 1-10, 1995.

  • P. Eades and X. LIN, "A Heuristic for the Feedback Arc Set Problem", The Australasian Journal of Combinatorics , 12, pages 15-26, 1995.

  • X. LIN and M. E. Orlowska, Using Parallel Semi-Join Reduction to Minimize Distributed Query Response Time, IEEE International Conference on Algorithms and Architectures for Parallel Processing (ICA^3P'95), IEEE CS press, pages 517-526, 1995.

  • J. Chen and X. LIN, "Clustering Classes Through Graph Transformations", 5th International CASE Symposium , pages 11-216, 1995.

1994

1993

  • X. LIN, M. Orlowska and Y. Zhang, A Graph Based Cluster Approach for Vertical Partitioning in Database Design, Data and Knowledge Engineering , 11(2), pages 151-169, October, 1993.

  • P. Eades, T. Lin and X. LIN, Two Tree Drawing Conventions, International Journal of Computational Geometry and Applications , 3(2), pages 133-153, 1993.

  • P. Eades, X. LIN and W. F. Smyth, A Fast and Effective Heuristic for the Feedback Arc Set Problem, Information Processing Letters , 47(6), pages 319-323, October, 1993.

  • P. Eades, X. LIN and N. Wormald, Performance Guarantees for Motion Planning with Temporal Uncertainty, Australian Computer Journal , 25(1), pages 21-29, 1993.

  • X. LIN, M. Orlowska and Y. Zhang, On Data Allocation with the Minimum Overall Communication Cost in Distributed Database Design, Proc. of 5th International Conference on Computing and Information , IEEE CS press, pages 539-544, 1993.

  • X. LIN and Y. Zhang, A New Graphical Method for Vertical Partitioning in Database Design, Advances in Database Research 93, World Scientific, ed. M. E. Orlowska and M. Papazoglo, pages 131-144, 1993.

before 1993

  • P. Eades, T. Lin and X. LIN, Minimum Size h-v Drawings", Advanced Visual Interfaces 1992, Rome, Italy, World Scientific Series in Computer Science Volume 36, 386-394, 1992.

  • P. Eades and X. LIN, Notes on the Layer Assignment Problem for Drawing Directed Graphs, Proc. of Australian Computer Science Conference 14, 26.1-26.10, 1991.

  • P. Eades, T. Lin and X. LIN, Representing Trees by Rectangle Inclusion, Proc. of Australian Computer Science Conference 14, 25.1-25.10, 1991.

  • P. Eades, X. LIN and R. Tamassia, A New Approach for Drawing a Hierarchical Graph, Proc. of Second Canadian Conference on Computational Geometry, 142-146, 1990.

  • P. Eades, X. LIN and N. Wormald, Performance Guarantees for Motion Planning with Temporal Uncertainty, Proc. of Australian Computer Science Conference 13, 25, 78-87, 1990.

  • P. Eades and X. LIN, How to Draw a Directed Graph, Proc. of IEEE Workshop on Visual Language, IEEE cs press, 13 -17, 1989.