default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDXuemin Lin 0001
林学民
Person information
- unicode name: 林学民
- affiliation: Shanghai Jiao Tong University, Antai College of Economics and Management, China
- affiliation (former): University of New South Wales, School of Computer Science and Engineering, Sydney, NSW, Australia
- affiliation (PhD 1992): University of Queensland, QLD, Australia
Other persons with the same name
- Xuemin Lin 0002 — East China Normal University, Shanghai, China
- Xuemin Lin 0003 — Foshan University, School of Electronic and Information Engineering, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
showing all ?? records
2020 – today
- 2024
[j242]Guangxin Su, Hanchen Wang
, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Simple and deep graph attention networks. Knowl. Based Syst. 293: 111649 (2024)- [j241]Zhijie Zhang, Yujie Lu, Weiguo Zheng, Xuemin Lin:
A Comprehensive Survey and Experimental Study of Subgraph Matching: Trends, Unbiasedness, and Interaction. Proc. ACM Manag. Data 2(1): 60:1-60:29 (2024) - [j240]Jianwei Wang, Ying Zhang, Kai Wang, Xuemin Lin, Wenjie Zhang:
Missing Data Imputation with Uncertainty-Driven Network. Proc. ACM Manag. Data 2(3): 117 (2024) - [j239]Deming Chu, Fan Zhang, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Graph Summarization: Compactness Meets Efficiency. Proc. ACM Manag. Data 2(3): 140 (2024) - [j238]Jingyi Song, Dong Wen, Lantian Xu, Lu Qin, Wenjie Zhang, Xuemin Lin:
On Querying Historical Connectivity in Temporal Graphs. Proc. ACM Manag. Data 2(3): 157 (2024) - [j237]Kaiyu Chen, Dong Wen, Wenjie Zhang, Ying Zhang, Xiaoyang Wang, Xuemin Lin:
Querying Structural Diversity in Streaming Graphs. Proc. VLDB Endow. 17(5): 1034-1046 (2024) - [j236]Jiadong Xie, Zehua Chen, Deming Chu, Fan Zhang, Xuemin Lin, Zhihong Tian:
Influence Maximization via Vertex Countering. Proc. VLDB Endow. 17(6): 1297-1309 (2024) - [j235]Qi Liang, Dian Ouyang, Fan Zhang, Jianye Yang, Xuemin Lin, Zhihong Tian:
Efficient Regular Simple Path Queries under Transitive Restricted Expressions. Proc. VLDB Endow. 17(7): 1710-1722 (2024) - [j234]Jianwei Wang, Kai Wang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Efficient Unsupervised Community Search with Pre-trained Graph Transformer. Proc. VLDB Endow. 17(9): 2227-2240 (2024) - [j233]Jinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Influence Minimization via Node Blocking. Proc. VLDB Endow. 17(10): 2501-2513 (2024) - [j232]Long Yuan, Xia Li, Zi Chen, Xuemin Lin, Xiang Zhao, Wenjie Zhang:
I/O Efficient Label-Constrained Reachability Queries in Large Graphs. Proc. VLDB Endow. 17(10): 2590-2602 (2024) - [j231]Jianye Yang, Sheng Fang, Zhaoquan Gu, Ziyi Ma, Xuemin Lin, Zhihong Tian:
TC-Match: Fast Time-constrained Continuous Subgraph Matching. Proc. VLDB Endow. 17(11): 2791-2804 (2024) - [j230]Yanping Wu, Renjie Sun, Xiaoyang Wang, Dong Wen, Ying Zhang, Lu Qin, Xuemin Lin:
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs. Proc. VLDB Endow. 17(11): 3243-3255 (2024) - [j229]Xinrui Wang, Yiran Wang, Xuemin Lin, Jeffrey Xu Yu, Hong Gao, Xiuzhen Cheng, Dongxiao Yu:
Efficient Betweenness Centrality Computation over Large Heterogeneous Information Networks. Proc. VLDB Endow. 17(11): 3360-3372 (2024) - [j228]Qingshuai Feng, Junhua Zhang, Wenjie Zhang, Lu Qin, Ying Zhang, Xuemin Lin:
Efficient kNN Search in Public Transportation Networks. Proc. VLDB Endow. 17(11): 3402-3414 (2024) - [j227]Hanchen Wang, Jianke Yu, Xiaoyang Wang, Chen Chen, Wenjie Zhang, Xuemin Lin:
Neural Similarity Search on Supergraph Containment. IEEE Trans. Knowl. Data Eng. 36(1): 281-295 (2024) - [j226]Fan Zhang, Haicheng Guo, Dian Ouyang, Shiyu Yang, Xuemin Lin, Zhihong Tian:
Size-Constrained Community Search on Large Networks: An Effective and Efficient Solution. IEEE Trans. Knowl. Data Eng. 36(1): 356-371 (2024) - [j225]Han Chen, Hanchen Wang, Hongmei Chen, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Denoising Variational Graph of Graphs Auto-Encoder for Predicting Structured Entity Interactions. IEEE Trans. Knowl. Data Eng. 36(3): 1016-1029 (2024) - [j224]Renjie Sun, Yanping Wu, Xiaoyang Wang, Chen Chen, Wenjie Zhang, Xuemin Lin:
Efficient Balanced Signed Biclique Search in Signed Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 36(3): 1069-1083 (2024) - [j223]Yuren Mao, Yu Hao, Xin Cao, Yixiang Fang, Xuemin Lin, Hua Mao, Zhiqiang Xu:
Dynamic Graph Embedding via Meta-Learning. IEEE Trans. Knowl. Data Eng. 36(7): 2967-2979 (2024) - [j222]Jianhua Wang, Jianye Yang, Zhaoquan Gu, Dian Ouyang, Zhihong Tian, Xuemin Lin:
Efficient Maximal Biclique Enumeration on Large Signed Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 36(9): 4618-4631 (2024) - [j221]Deming Chu, Fan Zhang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yinglong Xia, Chenyi Zhang:
Discovering and Maintaining the Best $k$k in Core Decomposition. IEEE Trans. Knowl. Data Eng. 36(11): 5954-5971 (2024) - [j220]Yuren Mao, Yu Hao, Weiwei Liu, Xuemin Lin, Xin Cao:
Class-Imbalanced-Aware Distantly Supervised Named Entity Recognition. IEEE Trans. Neural Networks Learn. Syst. 35(9): 12117-12129 (2024) - [j219]Kai Wang, Minghao Cai, Xiaoshuang Chen, Xuemin Lin, Wenjie Zhang, Lu Qin, Ying Zhang:
Efficient algorithms for reachability and path queries on temporal bipartite graphs. VLDB J. 33(5): 1399-1426 (2024) - [j218]Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Discovering critical vertices for reinforcement of large-scale bipartite networks. VLDB J. 33(6): 1861-1886 (2024) - [j217]Qi Luo, Zhenzhen Xie, Yu Liu, Dongxiao Yu, Xiuzhen Cheng, Xuemin Lin, Xiaohua Jia:
Sampling hypergraphs via joint unbiased random walk. World Wide Web (WWW) 27(2): 15 (2024) - [c301]Qingshuai Feng, You Peng, Wenjie Zhang, Xuemin Lin, Ying Zhang:
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs. EDBT 2024: 116-128 - [c300]Yuting Zhang, Kai Wang, Wenjie Zhang, Wei Ni, Xuemin Lin:
Size-bounded Community Search over Large Bipartite Graphs. EDBT 2024: 320-331 - [c299]Xiaoyao Zhong, Jiabao Jin, Peng Cheng, Wangze Ni, Libin Zheng, Lei Chen, Xuemin Lin:
Wait to be Faster: A Smart Pooling Framework for Dynamic Ridesharing. ICDE 2024: 355-367 - [c298]Xiaoting Zhu, Libin Zheng, Chen Jason Zhang, Peng Cheng, Rui Meng, Lei Chen, Xuemin Lin, Jian Yin:
Privacy-Preserving Traffic Flow Release with Consistency Constraints. ICDE 2024: 1699-1711 - [c297]Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Wei Ni, Ying Zhang:
Butterfly Counting over Bipartite Graphs with Local Differential Privacy. ICDE 2024: 2351-2364 - [c296]Yue Zeng, Hongchao Qin, Rong-Hua Li, Kai Wang, Guoren Wang, Xuemin Lin:
Mining Quasi-Periodic Communities in Temporal Network. ICDE 2024: 2476-2488 - [c295]Shunyang Li, Kai Wang, Xuemin Lin, Wenjie Zhang, Yizhang He, Long Yuan:
Querying Historical Cohesive Subgraphs Over Temporal Bipartite Graphs. ICDE 2024: 2503-2516 - [c294]Jiujian Chen, Kai Wang, Ronghua Li, Hongchao Qin, Xuemin Lin, Guoren Wang:
Maximal Biclique Enumeration: A Prefix Tree Based Approach. ICDE 2024: 2544-2556 - [c293]Long Yuan, Kongzhang Hao, Xuemin Lin, Wenjie Zhang:
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs. ICDE 2024: 2557-2569 - [c292]Yanping Wu, Renjie Sun, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Maximal Temporal Plex Enumeration. ICDE 2024: 3098-3110 - [c291]Ziyi Ma, Jianye Yang, Xu Zhou, Guoqing Xiao, Jianhua Wang, Liang Yang, Kenli Li, Xuemin Lin:
Efficient Multi-Query Oriented Continuous Subgraph Matching. ICDE 2024: 3230-3243 - [c290]Yuanyuan Xu, Wenjie Zhang, Ying Zhang, Maria E. Orlowska, Xuemin Lin:
TimeSGN: Scalable and Effective Temporal Graph Neural Network. ICDE 2024: 3297-3310 - [c289]Jiexi Zhan, Han Wu, Peng Cheng, Libin Zheng, Lei Chen, Chen Jason Zhang, Xuemin Lin, Wenjie Zhang:
TrendSharing: A Framework to Discover and Follow the Trends for Shared Mobility Services. ICDE 2024: 4370-4382 - [c288]Kunming Wang, Shiyu Yang, Jiabao Jin, Peng Cheng, Jianye Yang, Xuemin Lin:
Efficient Learning-based Top-k Representative Similar Subtrajectory Query. ICDE 2024: 4396-4408 - [c287]Yiwei Zhao, Zi Chen, Chen Chen, Xiaoyang Wang, Xuemin Lin, Wenjie Zhang:
Finding the Maximum k- Balanced Biclique on Weighted Bipartite Graphs (Extended abstract). ICDE 2024: 5697-5698 - [c286]Hanchen Wang, Jianke Yu, Xiaoyang Wang, Chen Chen, Wenjie Zhang, Xuemin Lin:
Neural Similarity Search on Supergraph Containment (Extended Abstract). ICDE 2024: 5709-5710 - [c285]Fan Li, Xiaoyang Wang, Dawei Cheng, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Hypergraph Self-supervised Learning with Sampling-efficient Signals. IJCAI 2024: 4398-4406 - [c284]Yihong Huang, Yuang Zhang, Liping Wang, Fan Zhang, Xuemin Lin:
EntropyStop: Unsupervised Deep Outlier Detection with Loss Entropy. KDD 2024: 1143-1154 - [c283]Wangze Ni, Yiwei Zhao, Weijie Sun, Lei Chen, Peng Cheng, Chen Jason Zhang, Xuemin Lin:
Money Never Sleeps: Maximizing Liquidity Mining Yields in Decentralized Finance. KDD 2024: 2248-2259 - [i68]Hongyang Chen, Can Xu, Lingyu Zheng, Qiang Zhang, Xuemin Lin:
Diffusion-based graph generative methods. CoRR abs/2401.15617 (2024) - [i67]Xiaoyao Zhong, Jiabao Jin, Peng Cheng, Wangze Ni, Libin Zheng, Lei Chen, Xuemin Lin:
Wait to be Faster: a Smart Pooling Framework for Dynamic Ridesharing. CoRR abs/2403.11099 (2024) - [i66]Jianwei Wang, Kai Wang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Efficient Unsupervised Community Search with Pre-trained Graph Transformer. CoRR abs/2403.18869 (2024) - [i65]Jianwei Wang, Kai Wang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Neural Attributed Community Search at Billion Scale. CoRR abs/2403.18874 (2024) - [i64]Lingkai Meng, Yu Shao, Long Yuan, Longbin Lai, Peng Cheng, Xue Li, Wenyuan Yu, Wenjie Zhang, Xuemin Lin, Jingren Zhou:
A Survey of Distributed Graph Algorithms on Massive Graphs. CoRR abs/2404.06037 (2024) - [i63]Fan Li, Xiaoyang Wang, Dawei Cheng, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Hypergraph Self-supervised Learning with Sampling-efficient Signals. CoRR abs/2404.11825 (2024) - [i62]Qing Sima, Jianke Yu, Xiaoyang Wang, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Deep Overlapping Community Search via Subspace Embedding. CoRR abs/2404.14692 (2024) - [i61]Yihong Huang, Yuang Zhang, Liping Wang, Fan Zhang, Xuemin Lin:
EntropyStop: Unsupervised Deep Outlier Detection with Loss Entropy. CoRR abs/2405.12502 (2024) - [i60]Jinghao Wang, Yanping Wu, Xiaoyang Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Influence Minimization via Node Blocking. CoRR abs/2405.12871 (2024) - [i59]Yanping Wu, Renjie Sun, Xiaoyang Wang, Dong Wen, Ying Zhang, Lu Qin, Xuemin Lin:
Efficient Maximal Frequent Group Enumeration in Temporal Bipartite Graphs. CoRR abs/2407.03954 (2024) - [i58]Yiqi Wang, Long Yuan, Wenjie Zhang, Xuemin Lin, Zi Chen, Qing Liu:
Simpler is More: Efficient Top-K Nearest Neighbors Search on Large Road Networks. CoRR abs/2408.05432 (2024) - 2023
- [j216]Zi Chen, Bo Feng, Long Yuan, Xuemin Lin, Liping Wang:
Fully Dynamic Contraction Hierarchies with Label Restrictions on Road Networks. Data Sci. Eng. 8(3): 263-278 (2023) - [j215]Zhifeng Bao, Panagiotis Bouros, Reynold Cheng, Byron Choi, Anton Dignös, Wei Ding, Yixiang Fang, Boyang Han, Jilin Hu, Arijit Khan, Wenqing Lin, Xuemin Lin, Cheng Long, Nikos Mamoulis, Jian Pei, Matthias Renz, Shashi Shekhar, Jieming Shi, Eleni Tzirita Zacharatou, Sibo Wang, Xiao Wang, Xue Wang, Raymond Chi-Wing Wong, Da Yan, Xifeng Yan, Bin Yang, Dezhong Yao, Ce Zhang, Peilin Zhao, Rong Zhu:
A Summary of ICDE 2022 Research Session Panels. IEEE Data Eng. Bull. 46(4): 4-17 (2023) - [j214]Jialin Li, Sarp Saydam, Yuanyuan Xu, Boge Liu, Binghao Li, Xuemin Lin, Wenjie Zhang:
Class-aware tiny object recognition over large-scale 3D point clouds. Neurocomputing 529: 166-181 (2023) - [j213]Wancheng Long, Xiaowen Li, Liping Wang, Fan Zhang, Zhe Lin, Xuemin Lin:
Efficient m-closest entity matching over heterogeneous information networks. Knowl. Based Syst. 263: 110299 (2023) - [j212]Yuzheng Cai, Siyuan Liu, Weiguo Zheng, Xuemin Lin:
Towards Generating Hop-constrained s-t Simple Path Graphs. Proc. ACM Manag. Data 1(1): 61:1-61:26 (2023) - [j211]Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Scaling Up k-Clique Densest Subgraph Detection. Proc. ACM Manag. Data 1(1): 69:1-69:26 (2023) - [j210]Jiujing Zhang, Zhitao Shen, Shiyu Yang, Lingkai Meng, Chuan Xiao, Wei Jia, Yue Li, Qinhui Sun, Wenjie Zhang, Xuemin Lin:
High-Ratio Compression for Machine-Generated Data. Proc. ACM Manag. Data 1(4): 245:1-245:27 (2023) - [j209]Jiabao Jin, Peng Cheng, Lei Chen, Xuemin Lin, Wenjie Zhang:
Efficient Non-Learning Similar Subtrajectory Search. Proc. VLDB Endow. 16(11): 3111-3123 (2023) - [j208]Wangze Ni, Pengze Chen, Lei Chen, Peng Cheng, Chen Zhang, Xuemin Lin:
Utility-aware Payment Channel Network Rebalance. Proc. VLDB Endow. 17(2): 184-196 (2023) - [j207]Yu-Xuan Qiu, Dong Wen, Rong-Hua Li, Lu Qin, Michael Yu, Xuemin Lin:
Computing Significant Cliques in Large Labeled Networks. IEEE Trans. Big Data 9(3): 904-917 (2023) - [j206]Jianhua Wang, Jianye Yang, Chengyuan Zhang, Xuemin Lin:
Efficient Maximum Edge-Weighted Biclique Search on Large Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 35(8): 7921-7934 (2023) - [j205]Yiwei Zhao, Zi Chen, Chen Chen, Xiaoyang Wang, Xuemin Lin, Wenjie Zhang:
Finding the Maximum $k$-Balanced Biclique on Weighted Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 35(8): 7994-8007 (2023) - [j204]Yuren Mao, Zekai Wang, Weiwei Liu, Xuemin Lin, Wenbin Hu:
Task Variance Regularized Multi-Task Learning. IEEE Trans. Knowl. Data Eng. 35(8): 8615-8629 (2023) - [j203]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang:
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. IEEE Trans. Knowl. Data Eng. 35(11): 11079-11092 (2023) - [j202]Kai Wang, Gengda Zhao, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yizhang He, Chunxiao Li:
Cohesive Subgraph Discovery Over Uncertain Bipartite Graphs. IEEE Trans. Knowl. Data Eng. 35(11): 11165-11179 (2023) - [j201]Renjie Sun, Yanping Wu, Xiaoyang Wang, Chen Chen, Wenjie Zhang, Xuemin Lin:
Clique Identification in Signed Graphs: A Balance Theory Based Model. IEEE Trans. Knowl. Data Eng. 35(12): 12513-12527 (2023) - [j200]Qingqiang Sun, Wenjie Zhang, Xuemin Lin:
Progressive Hard Negative Masking: From Global Uniformity to Local Tolerance. IEEE Trans. Knowl. Data Eng. 35(12): 12932-12943 (2023) - [j199]Ruihong Huang, Jianmin Wang, Shaoxu Song, Xuemin Lin, Xiaochen Zhu, Jian Pei:
Efficiently Cleaning Structured Event Logs: A Graph Repair Approach. ACM Trans. Database Syst. 48(1): 3:1-3:44 (2023) - [j198]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Accelerated butterfly counting with vertex priority on bipartite graphs. VLDB J. 32(2): 257-281 (2023) - [j197]Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
Fast subgraph query processing and subgraph matching via static and dynamic equivalences. VLDB J. 32(2): 343-368 (2023) - [j196]Qi Luo, Dongxiao Yu, Zhipeng Cai, Xuemin Lin, Guanghui Wang, Xiuzhen Cheng:
Toward maintenance of hypercores in large-scale dynamic hypergraphs. VLDB J. 32(3): 647-664 (2023) - [j195]Jianye Yang, Yun Peng, Dian Ouyang, Wenjie Zhang, Xuemin Lin, Xiang Zhao:
(p,q)-biclique counting and enumeration for large sparse bipartite graphs. VLDB J. 32(5): 1137-1161 (2023) - [j194]Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang:
When hierarchy meets 2-hop-labeling: efficient shortest distance and path queries on road networks. VLDB J. 32(6): 1263-1287 (2023) - [j193]Qi Luo, Dongxiao Yu, Zhipeng Cai, Yanwei Zheng, Xiuzhen Cheng, Xuemin Lin:
Core maintenance for hypergraph streams. World Wide Web (WWW) 26(5): 3709-3733 (2023) - [c282]Kongzhang Hao, Long Yuan, Zhengyi Yang, Wenjie Zhang, Xuemin Lin:
Efficient and Scalable Distributed Graph Structural Clustering at Billion Scale. DASFAA (3) 2023: 234-251 - [c281]Bo Feng, Zi Chen, Long Yuan, Xuemin Lin, Liping Wang:
Contraction Hierarchies with Label Restrictions Maintenance in Dynamic Road Networks. DASFAA (3) 2023: 269-285 - [c280]You Peng, Xuemin Lin, Michael Yu, Wenjie Zhang, Lu Qin:
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs. ICDE 2023: 137-150 - [c279]Qingqiang Sun, Xuemin Lin, Ying Zhang, Wenjie Zhang, Chaoqi Chen:
Towards Higher-order Topological Consistency for Unsupervised Network Alignment. ICDE 2023: 177-190 - [c278]Xue Li, Ke Meng, Lu Qin, Longbin Lai, Wenyuan Yu, Zhengping Qian, Xuemin Lin, Jingren Zhou:
Flash: A Framework for Programming Distributed Graph Processing Algorithms. ICDE 2023: 232-244 - [c277]Qi Luo, Dongxiao Yu, Yu Liu, Yanwei Zheng, Xiuzhen Cheng, Xuemin Lin:
Finer-Grained Engagement in Hypergraphs. ICDE 2023: 423-435 - [c276]Jiujing Zhang, Shiyu Yang, Dian Ouyang, Fan Zhang, Xuemin Lin, Long Yuan:
Hop-Constrained s-t Simple Path Enumeration on Large Dynamic Graphs. ICDE 2023: 762-775 - [c275]Jiadong Xie, Fan Zhang, Kai Wang, Xuemin Lin, Wenjie Zhang:
Minimizing the Influence of Misinformation via Vertex Blocking. ICDE 2023: 789-801 - [c274]You Peng, Zhuo Ma, Wenjie Zhang, Xuemin Lin, Ying Zhang, Xiaoshuang Chen:
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs. ICDE 2023: 856-868 - [c273]Renjie Sun, Chen Chen, Xiaoyang Wang, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Efficient Maximum Signed Biclique Identification. ICDE 2023: 1313-1325 - [c272]Zhengyi Yang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Shunyang Li:
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs. ICDE 2023: 2063-2076 - [c271]Yuhan Wu, Yuanyuan Xu, Xuemin Lin, Wenjie Zhang:
A Holistic Approach for Answering Logical Queries on Knowledge Graphs. ICDE 2023: 2345-2357 - [c270]Yihong Huang, Liping Wang, Fan Zhang, Xuemin Lin:
Unsupervised Graph Outlier Detection: Problem Revisit, New Insight, and Superior Method. ICDE 2023: 2565-2578 - [c269]Yiqi Wang, Long Yuan, Zi Chen, Wenjie Zhang, Xuemin Lin, Qing Liu:
Towards Efficient Shortest Path Counting on Billion-Scale Graphs. ICDE 2023: 2579-2592 - [c268]Zi Chen, Yiwei Zhao, Long Yuan, Xuemin Lin, Kai Wang:
Index-Based Biclique Percolation Communities Search on Bipartite Graphs. ICDE 2023: 2699-2712 - [c267]Leilei Du, Peng Cheng, Libin Zheng, Wei Xi, Xuemin Lin, Wenjie Zhang, Jing Fang:
Dynamic Private Task Assignment under Differential Privacy. ICDE 2023: 2740-2752 - [c266]Fan Zhang, Qingyuan Linghu, Jiadong Xie, Kai Wang, Xuemin Lin, Wenjie Zhang:
Quantifying Node Importance over Network Structural Stability. KDD 2023: 3217-3228 - [i57]Zhengyi Yang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Shunyang Li:
HGMatch: A Match-by-Hyperedge Approach for Subgraph Matching on Hypergraphs. CoRR abs/2302.06119 (2023) - [i56]Leilei Du, Peng Cheng, Libin Zheng, Wei Xi, Xuemin Lin, Wenjie Zhang, Jing Fang:
Dynamic Private Task Assignment under Differential Privacy. CoRR abs/2302.09511 (2023) - [i55]Jiadong Xie, Fan Zhang, Kai Wang, Xuemin Lin, Wenjie Zhang:
Minimizing the Influence of Misinformation via Vertex Blocking. CoRR abs/2302.13529 (2023) - [i54]Yuzheng Cai, Siyuan Liu, Weiguo Zheng, Xuemin Lin:
Towards Generating Hop-constrained s-t Simple Path Graphs. CoRR abs/2304.12656 (2023) - [i53]Yihong Huang, Yuang Zhang, Liping Wang, Xuemin Lin:
Unleashing the Potential of Unsupervised Deep Outlier Detection through Automated Training Stopping. CoRR abs/2305.16777 (2023) - [i52]Qingshuai Feng, You Peng, Wenjie Zhang, Xuemin Lin, Ying Zhang:
DSPC: Efficiently Answering Shortest Path Counting on Dynamic Graphs. CoRR abs/2307.05918 (2023) - [i51]Jiabao Jin, Peng Cheng, Lei Chen, Xuemin Lin, Wenjie Zhang:
Efficient Non-Learning Similar Subtrajectory Search. CoRR abs/2307.10082 (2023) - [i50]Long Yuan, Zeyu Zhou, Xuemin Lin, Zi Chen, Xiang Zhao, Fan Zhang:
GPUSCAN++: Eficient Structural Graph Clustering on GPUs. CoRR abs/2311.12281 (2023) - [i49]Jiujing Zhang, Zhitao Shen, Shiyu Yang, Lingkai Meng, Chuan Xiao, Wei Jia, Yue Li, Qinhui Sun, Wenjie Zhang, Xuemin Lin:
High-Ratio Compression for Machine-Generated Data. CoRR abs/2311.13947 (2023) - [i48]Long Yuan, Kongzhang Hao, Xuemin Lin, Wenjie Zhang:
Batch Hop-Constrained s-t Simple Path Query Processing in Large Graphs. CoRR abs/2312.01424 (2023) - [i47]Jiadong Xie, Fan Zhang, Kai Wang, Jialu Liu, Xuemin Lin, Wenjie Zhang:
Influence Minimization via Blocking Strategies. CoRR abs/2312.17488 (2023) - 2022
- [b2]Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang:
Cohesive Subgraph Search Over Large Heterogeneous Information Networks. Springer Briefs in Computer Science, Springer 2022, ISBN 978-3-030-97567-8, pp. 1-63 - [j192]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(5): i-vi (2022) - [j191]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(6): i-vii (2022) - [j190]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(7): i-vii (2022) - [j189]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(8): i-vii (2022) - [j188]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(9): i-viii (2022) - [j187]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(10): i-vii (2022) - [j186]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(11): i-x (2022) - [j185]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(12): i-xiv (2022) - [j184]Fatma Özcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(13): i-vii (2022) - [j183]Chenji Huang, Yixiang Fang, Xuemin Lin, Xin Cao, Wenjie Zhang:
ABLE: Meta-Path Prediction in Heterogeneous Information Networks. ACM Trans. Knowl. Discov. Data 16(4): 73:1-73:21 (2022) - [j182]You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin:
Answering reachability and K-reach queries on large graphs with label constraints. VLDB J. 31(1): 101-127 (2022) - [j181]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Distance labeling: on parallelism, compression, and ordering. VLDB J. 31(1): 129-155 (2022) - [j180]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Towards efficient solutions of bitruss decomposition for large-scale bipartite graphs. VLDB J. 31(2): 203-226 (2022) - [j179]Qingyuan Linghu, Fan Zhang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Anchored coreness: efficient reinforcement of social networks. VLDB J. 31(2): 227-252 (2022) - [j178]Arif Hidayat, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Continuous monitoring of moving skyline and top-k queries. VLDB J. 31(3): 459-482 (2022) - [j177]Sheng Xiang, Dong Wen, Dawei Cheng, Ying Zhang, Lu Qin, Zhengping Qian, Xuemin Lin:
General graph generators: experiments, analyses, and improvements. VLDB J. 31(5): 897-925 (2022) - [j176]Bingqing Lyu, Lu Qin, Xuemin Lin, Ying Zhang, Zhengping Qian, Jingren Zhou:
Maximum and top-k diversified biclique search at scale. VLDB J. 31(6): 1365-1389 (2022) - [j175]Renjie Sun, Chen Chen, Xijuan Liu, Shuangyan Xu, Xiaoyang Wang, Xuemin Lin:
Critical Nodes Identification in Large Networks: The Inclined and Detached Models. World Wide Web 25(3): 1315-1341 (2022) - [c265]Yuren Mao, Zekai Wang, Weiwei Liu, Xuemin Lin, Pengtao Xie:
MetaWeighting: Learning to Weight Tasks in Multi-Task Learning. ACL (Findings) 2022: 3436-3448 - [c264]Qiuyu Guo, Xiang Zhao, Yang Fang, Shiyu Yang, Xuemin Lin, Dian Ouyang:
Learning Hypersphere for Few-shot Anomaly Detection on Attributed Networks. CIKM 2022: 635-645 - [c263]Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, Xuemin Lin:
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. ICDE 2022: 245-258 - [c262]Xuefeng Chen, Xin Cao, Yifeng Zeng, Yixiang Fang, Sibo Wang, Xuemin Lin, Liang Feng:
Constrained Path Search with Submodular Function Maximization. ICDE 2022: 325-337 - [c261]Yishu Wang, Ye Yuan, Wenjie Zhang, Yi Zhang, Xuemin Lin, Guoren Wang:
Reachability-Driven Influence Maximization in Time-dependent Road-social Networks. ICDE 2022: 367-379 - [c260]Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Efficient Reinforcement of Bipartite Networks at Billion Scale. ICDE 2022: 446-458 - [c259]Kai Wang, Wenjie Zhang, Xuemin Lin, Lu Qin, Alexander Zhou:
Efficient Personalized Maximum Biclique Search. ICDE 2022: 498-511 - [c258]Qingshuai Feng, You Peng, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach. ICDE 2022: 512-524 - [c257]Yuanhang Yu, Dong Wen, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
GPU-accelerated Proximity Graph Approximate Nearest Neighbor Search and Construction. ICDE 2022: 552-564 - [c256]Junhua Zhang, Wentao Li, Lu Qin, Ying Zhang, Dong Wen, Lizhen Cui, Xuemin Lin:
Reachability Labeling for Distributed Graphs. ICDE 2022: 686-698 - [c255]Chenji Huang, Yixiang Fang, Xuemin Lin, Xin Cao, Wenjie Zhang, Maria E. Orlowska:
Estimating Node Importance Values in Heterogeneous Information Networks. ICDE 2022: 846-858 - [c254]Libin Zheng, Peng Cheng, Lei Chen, Jianxing Yu, Xuemin Lin, Jian Yin:
Crowdsourced Fact Validation for Knowledge Bases. ICDE 2022: 938-950 - [c253]Deming Chu, Fan Zhang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Hierarchical Core Decomposition in Parallel: From Construction to Subgraph Search. ICDE 2022: 1138-1151 - [c252]Jiabao Jin, Peng Cheng, Lei Chen, Xuemin Lin, Wenjie Zhang:
GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models. ICDE 2022: 1193-1205 - [c251]Renjie Sun, Yanping Wu, Chen Chen, Xiaoyang Wang, Wenjie Zhang, Xuemin Lin:
Maximal Balanced Signed Biclique Enumeration in Signed Bipartite Graphs. ICDE 2022: 1887-1899 - [c250]Zhirong Yuan, You Peng, Peng Cheng, Li Han, Xuemin Lin, Lei Chen, Wenjie Zhang:
Efficient $k-\text{clique}$ Listing with Set Intersection Speedup. ICDE 2022: 1955-1968 - [c249]Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Shunyang Li:
Discovering Hierarchy of Bipartite Graphs with Cohesive Subgraphs. ICDE 2022: 2291-2305 - [c248]Gengda Zhao, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Yizhang He:
Efficient Computation of Cohesive Subgraphs in Uncertain Bipartite Graphs. ICDE 2022: 2333-2345 - [c247]Lingkai Meng, Long Yuan, Zi Chen, Xuemin Lin, Shiyu Yang:
Index-based Structural Clustering on Directed Graphs. ICDE 2022: 2831-2844 - [c246]Wentao Li, Miao Qiao, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
On Scalable Computation of Graph Eccentricities. SIGMOD Conference 2022: 904-916 - [c245]Xia Li, Kongzhang Hao, Zhengyi Yang, Xin Cao, Wenjie Zhang, Long Yuan, Xuemin Lin:
Hop-Constrained s-t Simple Path Enumeration in Billion-Scale Labelled Graphs. WISE 2022: 49-64 - [c244]Shaonan Long, Jinzhi Liao, Shiyu Yang, Xiang Zhao, Xuemin Lin:
Complex Question Answering Over Temporal Knowledge Graphs. WISE 2022: 65-80 - [i46]Jiabao Jin, Peng Cheng, Lei Chen, Xuemin Lin, Wenjie Zhang:
GridTuner: Reinvestigate Grid Size Selection for Spatiotemporal Prediction Models [Technical Report]. CoRR abs/2201.03244 (2022) - [i45]Hanchen Wang, Ying Zhang, Lu Qin, Wei Wang, Wenjie Zhang, Xuemin Lin:
Reinforcement Learning Based Query Vertex Ordering Model for Subgraph Matching. CoRR abs/2201.11251 (2022) - [i44]Zhirong Yuan, You Peng, Peng Cheng, Li Han, Xuemin Lin, Lei Chen, Wenjie Zhang:
Efficient k-clique Listing with Set Intersection Speedup [Technical Report]. CoRR abs/2203.13512 (2022) - [i43]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang:
Balanced Clique Computation in Signed Networks: Concepts and Algorithms. CoRR abs/2204.00515 (2022) - [i42]Qingshuai Feng, You Peng, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Towards Real-Time Counting Shortest Cycles on Dynamic Graphs: A Hub Labeling Approach. CoRR abs/2207.01035 (2022) - [i41]Qingqiang Sun, Xuemin Lin, Ying Zhang, Wenjie Zhang, Chaoqi Chen:
Towards Higher-order Topological Consistency for Unsupervised Network Alignment. CoRR abs/2208.12463 (2022) - [i40]You Peng, Xuemin Lin, Michael Yu, Wenjie Zhang, Lu Qin:
TDB: Breaking All Hop-Constrained Cycles in Billion-Scale Directed Graphs. CoRR abs/2209.05909 (2022) - [i39]Yihong Huang, Liping Wang, Fan Zhang, Xuemin Lin:
Are we really making much progress in unsupervised graph outlier detection? Revisiting the problem with new insight and superior method. CoRR abs/2210.12941 (2022) - [i38]You Peng, Zhuo Ma, Wenjie Zhang, Xuemin Lin, Ying Zhang, Xiaoshuang Chen:
Efficiently Answering Quality Constrained Shortest Distance Queries in Large Graphs. CoRR abs/2211.08648 (2022) - 2021
- [j174]Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Exploring cohesive subgraphs with vertex engagement and tie strength in bipartite graphs. Inf. Sci. 572: 277-296 (2021) - [j173]Zengfeng Huang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Communication-Efficient Distributed Covariance Sketch, with Application to Distributed PCA. J. Mach. Learn. Res. 22: 80:1-80:38 (2021) - [j172]Conggai Li, Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Discovering fortress-like cohesive subgraphs. Knowl. Inf. Syst. 63(12): 3217-3250 (2021) - [j171]Haobo Xiong, Shuting Wang, Mingrong Tang, Liping Wang, Xuemin Lin:
Knowledge Graph Question Answering with semantic oriented fusion model. Knowl. Based Syst. 221: 106954 (2021) - [j170]Zhe Lin, Fan Zhang, Xuemin Lin, Wenjie Zhang, Zhihong Tian:
Hierarchical Core Maintenance on Large Dynamic Graphs. Proc. VLDB Endow. 14(5): 757-770 (2021) - [j169]Yixing Yang, Yixiang Fang, Maria E. Orlowska, Wenjie Zhang, Xuemin Lin:
Efficient Bi-triangle Counting for Large Bipartite Networks. Proc. VLDB Endow. 14(6): 984-996 (2021) - [j168]Xiaoshuang Chen, Kai Wang, Xuemin Lin, Wenjie Zhang, Lu Qin, Ying Zhang:
Efficiently Answering Reachability and Path Queries on Temporal Bipartite Graphs. Proc. VLDB Endow. 14(10): 1845-1858 (2021) - [j167]Michael Yu, Dong Wen, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
On Querying Historical K-Cores. Proc. VLDB Endow. 14(11): 2033-2045 (2021) - [j166]Peng Cheng, Jiabao Jin, Lei Chen, Xuemin Lin, Libin Zheng:
A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing. Proc. VLDB Endow. 14(11): 2177-2189 (2021) - [j165]Fatma Ozcan, Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(1): i-vi (2021) - [j164]Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(2): i-vii (2021) - [j163]Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(3): i-vii (2021) - [j162]Juliana Freire, Xuemin Lin:
Front Matter. Proc. VLDB Endow. 15(4): i-vii (2021) - [j161]Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks V. S. Lakshmanan, Wenjie Zhang, Xuemin Lin:
Efficient Directed Densest Subgraph Discovery. SIGMOD Rec. 50(1): 33-40 (2021) - [j160]Haida Zhang, Zengfeng Huang, Xuemin Lin, Zhe Lin, Wenjie Zhang, Ying Zhang:
Efficient and High-Quality Seeded Graph Matching: Employing Higher-order Structural Information. ACM Trans. Knowl. Discov. Data 15(3): 51:1-51:31 (2021) - [j159]Jianbin Qin, Chuan Xiao, Yaoshu Wang, Wei Wang, Xuemin Lin, Yoshiharu Ishikawa, Guoren Wang:
Generalizing the Pigeonhole Principle for Similarity Search in Hamming Space. IEEE Trans. Knowl. Data Eng. 33(2): 489-505 (2021) - [j158]Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks V. S. Lakshmanan, Wenjie Zhang, Xuemin Lin:
On Directed Densest Subgraph Discovery. ACM Trans. Database Syst. 46(4): 13:1-13:45 (2021) - [j157]Weixin Zeng, Xiang Zhao, Jiuyang Tang, Xuemin Lin, Paul Groth:
Reinforcement Learning-based Collective Entity Alignment with Adaptive Features. ACM Trans. Inf. Syst. 39(3): 26:1-26:31 (2021) - [j156]Wanqi Liu, Hanchen Wang, Ying Zhang, Wei Wang, Lu Qin, Xuemin Lin:
EI-LSH: An early-termination driven I/O efficient incremental c-approximate nearest neighbor search. VLDB J. 30(2): 215-235 (2021) - [j155]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin:
Efficient structural node similarity computation on billion-scale graphs. VLDB J. 30(3): 471-493 (2021) - [j154]You Peng, Xuemin Lin, Ying Zhang, Wenjie Zhang, Lu Qin, Jingren Zhou:
Efficient Hop-constrained s-t Simple Path Enumeration. VLDB J. 30(5): 799-823 (2021) - [j153]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xiangjian He, Yiguang Lin, Xuemin Lin:
Binarized graph neural network. World Wide Web 24(3): 825-848 (2021) - [c243]Yuren Mao, Zekai Wang, Weiwei Liu, Xuemin Lin, Wenbin Hu:
BanditMTL: Bandit-based Multi-task Learning for Text Classification. ACL/IJCNLP (1) 2021: 5506-5516 - [c242]Dongdong Jin, Peng Cheng, Xuemin Lin, Lei Chen:
Co-authorship Prediction Based on Temporal Graph Attention. APWeb/WAIM (1) 2021: 3-19 - [c241]Qize Xie, Liping Wang, Peidong Song, Xuemin Lin:
SQKT: A Student Attention-Based and Question-Aware Model for Knowledge Tracing. APWeb/WAIM (2) 2021: 221-236 - [c240]Maocheng Li, Jiachuan Wang, Libin Zheng, Han Wu, Peng Cheng, Lei Chen, Xuemin Lin:
Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server. CIKM 2021: 947-956 - [c239]Yuting Zhang, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Pareto-optimal Community Search on Large Bipartite Graphs. CIKM 2021: 2647-2656 - [c238]You Peng, Wenjie Zhao, Wenjie Zhang, Xuemin Lin, Ying Zhang:
DLQ: A System for Label-Constrained Reachability Queries on Dynamic Graphs. CIKM 2021: 4764-4768 - [c237]Kai Wang, Yiheng Hu, Xuemin Lin, Wenjie Zhang, Lu Qin, Ying Zhang:
A Cohesive Structure Based Bipartite Graph Analytics System. CIKM 2021: 4799-4803 - [c236]Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Yuting Zhang:
Efficient and Effective Community Search on Large-scale Bipartite Graphs. ICDE 2021: 85-96 - [c235]Boge Liu, Fan Zhang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Efficient Community Search with Size Constraint. ICDE 2021: 97-108 - [c234]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin, Boge Liu:
A Framework to Quantify Approximate Simulation on Graph Data. ICDE 2021: 1308-1319 - [c233]Zhengmin Lai, You Peng, Shiyu Yang, Xuemin Lin, Wenjie Zhang:
PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA. ICDE 2021: 1320-1331 - [c232]Michael Yu, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
DPTL+: Efficient Parallel Triangle Listing on Batch-Dynamic Graphs. ICDE 2021: 1332-1343 - [c231]Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, You Peng:
FAST: FPGA-based Subgraph Matching on Massive Graphs. ICDE 2021: 1452-1463 - [c230]Yuanhang Yu, Dong Wen, Ying Zhang, Xiaoyang Wang, Wenjie Zhang, Xuemin Lin:
Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems. ICDE 2021: 1871-1876 - [c229]Qi Luo, Dongxiao Yu, Zhipeng Cai, Xuemin Lin, Xiuzhen Cheng:
Hypercore Maintenance in Dynamic Hypergraphs. ICDE 2021: 2051-2056 - [c228]Peilun Yang, Hanchen Wang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
T3S: Effective Representation Learning for Trajectory Similarity Computation. ICDE 2021: 2183-2188 - [c227]Wangze Ni, Nian Chen, Peng Cheng, Lei Chen, Xuemin Lin:
Crowdrebate: An Effective Platform to Get more Rebate for Customers. ICDE 2021: 2261-2266 - [c226]Hyunjoon Kim, Yunyoung Choi, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
Versatile Equivalences: Speeding up Subgraph Query Processing and Subgraph Matching. SIGMOD Conference 2021: 925-937 - [c225]Wangze Ni, Peng Cheng, Lei Chen, Xuemin Lin:
When the Recursive Diversity Anonymity Meets the Ring Signature. SIGMOD Conference 2021: 1359-1371 - [c224]Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, Wenjie Zhang:
HUGE: An Efficient and Scalable Subgraph Enumeration System. SIGMOD Conference 2021: 2049-2062 - [c223]Yue Li, Shiyu Yang, Muhammad Aamir Cheema, Zhou Shao, Xuemin Lin:
IndoorViz: A Demonstration System for Indoor Spatial Data Management. SIGMOD Conference 2021: 2755-2759 - [c222]Yixiang Fang, Kai Wang, Xuemin Lin, Wenjie Zhang:
Cohesive Subgraph Search over Big Heterogeneous Information Networks: Applications, Challenges, and Solutions. SIGMOD Conference 2021: 2829-2838 - [c221]Chen Chen, Xijuan Liu, Shuangyan Xu, Mengqi Zhang, Xiaoyang Wang, Xuemin Lin:
Critical Nodes Identification in Large Networks: An Inclination-Based Model. WISE (1) 2021: 453-468 - [c220]Shunyang Li, Zhengyi Yang, Xianhang Zhang, Wenjie Zhang, Xuemin Lin:
SQL2Cypher: Automated Data and Query Migration from RDBMS to GDBMS. WISE (2) 2021: 510-517 - [i37]Weixin Zeng, Xiang Zhao, Jiuyang Tang, Xuemin Lin, Paul Groth:
Reinforcement Learning based Collective Entity Alignment with Adaptive Features. CoRR abs/2101.01353 (2021) - [i36]Xin Jin, Zhengyi Yang, Xuemin Lin, Shiyu Yang, Lu Qin, You Peng:
FAST: FPGA-based Subgraph Matching on Massive Graphs. CoRR abs/2102.10768 (2021) - [i35]Zhengyi Yang, Longbin Lai, Xuemin Lin, Kongzhang Hao, Wenjie Zhang:
HUGE: An Efficient and Scalable Subgraph Enumeration System. CoRR abs/2103.14294 (2021) - [i34]Zi Chen, Long Yuan, Xuemin Lin, Zhengping Qian, Lu Qin:
Higher-Order Neighborhood Truss Decomposition. CoRR abs/2103.16037 (2021) - [i33]Peng Cheng, Jiabao Jin, Lei Chen, Xuemin Lin, Libin Zheng:
A Queueing-Theoretic Framework for Vehicle Dispatching in Dynamic Car-Hailing [technical report]. CoRR abs/2107.08662 (2021) - [i32]Maocheng Li, Jiachuan Wang, Libin Zheng, Han Wu, Peng Cheng, Lei Chen, Xuemin Lin:
Privacy-Preserving Batch-based Task Assignment in Spatial Crowdsourcing with Untrusted Server. CoRR abs/2108.09019 (2021) - [i31]Qingyuan Linghu, Fan Zhang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Towards User Engagement Dynamics in Social Networks. CoRR abs/2110.12193 (2021) - 2020
- [j152]Dong-Wan Choi, Jian Pei, Xuemin Lin:
On spatial keyword covering. Knowl. Inf. Syst. 62(7): 2577-2612 (2020) - [j151]Dian Ouyang, Long Yuan, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
Efficient Shortest Path Index Maintenance on Dynamic Road Networks with Theoretical Guarantees. Proc. VLDB Endow. 13(5): 602-615 (2020) - [j150]You Peng, Ying Zhang, Xuemin Lin, Lu Qin, Wenjie Zhang:
Answering Billion-Scale Label-Constrained Reachability Queries within Microsecond. Proc. VLDB Endow. 13(6): 812-825 (2020) - [j149]Yixiang Fang, Yixing Yang, Wenjie Zhang, Xuemin Lin, Xin Cao:
Effective and Efficient Community Search over Large Heterogeneous Information Networks. Proc. VLDB Endow. 13(6): 854-867 (2020) - [j148]Jiachuan Wang, Peng Cheng, Libin Zheng, Chao Feng, Lei Chen, Xuemin Lin, Zheng Wang:
Demand-Aware Route Planning for Shared Mobility Services. Proc. VLDB Endow. 13(7): 979-991 (2020) - [j147]Bingqing Lyu, Lu Qin, Xuemin Lin, Ying Zhang, Zhengping Qian, Jingren Zhou:
Maximum Biclique Search at Billion Scale. Proc. VLDB Endow. 13(9): 1359-1372 (2020) - [j146]Hyunjoon Kim, Seunghwan Min, Kunsoo Park, Xuemin Lin, Seok-Hee Hong, Wook-Shin Han:
IDAR: Fast Supergraph Search Using DAG Integration. Proc. VLDB Endow. 13(9): 1456-1468 (2020) - [j145]Zhao Chen, Peng Cheng, Lei Chen, Xuemin Lin, Cyrus Shahabi:
Fair Task Assignment in Spatial Crowdsourcing. Proc. VLDB Endow. 13(11): 2479-2492 (2020) - [j144]Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Mingjie Li, Wenjie Zhang, Xuemin Lin:
Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement. IEEE Trans. Knowl. Data Eng. 32(8): 1475-1488 (2020) - [j143]Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin:
A survey of community search over big graphs. VLDB J. 29(1): 353-392 (2020) - [j142]Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, Jingren Zhou:
Efficient (α, β)-core computation in bipartite graphs. VLDB J. 29(5): 1075-1099 (2020) - [j141]Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin:
Correction: A survey of community search over big graphs. VLDB J. 29(5): 1219 (2020) - [c219]Maryam Ghafouri, Kai Wang, Fan Zhang, Ying Zhang, Xuemin Lin:
Efficient Graph Hierarchical Decomposition with User Engagement and Tie Strength. DASFAA (2) 2020: 448-465 - [c218]Michael Yu, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
AOT: Pushing the Efficiency Boundary of Main-Memory Triangle Listing. DASFAA (2) 2020: 516-533 - [c217]Chen Zhang, Fan Zhang, Wenjie Zhang, Boge Liu, Ying Zhang, Lu Qin, Xuemin Lin:
Exploring Finer Granularity within the Cores: Efficient (k, p)-Core Computation. ICDE 2020: 181-192 - [c216]Mingjie Li, Ying Zhang, Yifang Sun, Wei Wang, Ivor W. Tsang, Xuemin Lin:
I/O Efficient Approximate Nearest Neighbour Search based on Learned Functions. ICDE 2020: 289-300 - [c215]Jianye Yang, Wenjie Zhang, Xiang Wang, Ying Zhang, Xuemin Lin:
Distributed Streaming Set Similarity Join. ICDE 2020: 565-576 - [c214]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs. ICDE 2020: 661-672 - [c213]Deming Chu, Fan Zhang, Xuemin Lin, Wenjie Zhang, Ying Zhang, Yinglong Xia, Chenyi Zhang:
Finding the Best k in Core Decomposition: A Time and Space Optimal Solution. ICDE 2020: 685-696 - [c212]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang, Dian Ouyang:
Speeding Up GED Verification for Graph Similarity Search. ICDE 2020: 793-804 - [c211]Yixing Yang, Yixiang Fang, Xuemin Lin, Wenjie Zhang:
Effective and Efficient Truss Computation over Large Heterogeneous Information Networks. ICDE 2020: 901-912 - [c210]Wangze Ni, Peng Cheng, Lei Chen, Xuemin Lin:
Task Allocation in Dependency-aware Spatial Crowdsourcing. ICDE 2020: 985-996 - [c209]Dong Wen, Yilun Huang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficiently Answering Span-Reachability Queries in Large Temporal Graphs. ICDE 2020: 1153-1164 - [c208]Boxuan Li, Reynold Cheng, Jiafeng Hu, Yixiang Fang, Min Ou, Ruibang Luo, Kevin Chen-Chuan Chang, Xuemin Lin:
MC-Explorer: Analyzing and Visualizing Motif-Cliques on Large Networks. ICDE 2020: 1722-1725 - [c207]Weixin Zeng, Xiang Zhao, Jiuyang Tang, Xuemin Lin:
Collective Entity Alignment via Adaptive Features. ICDE 2020: 1870-1873 - [c206]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin:
StructSim: Querying Structural Node Similarity at Billion Scale. ICDE 2020: 1950-1953 - [c205]Yuren Mao, Weiwei Liu, Xuemin Lin:
Adaptive Adversarial Multi-task Representation Learning. ICML 2020: 6724-6733 - [c204]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xuemin Lin:
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions. IJCAI 2020: 1317-1323 - [c203]Mingrong Tang, Haobo Xiong, Liping Wang, Xuemin Lin:
A Dynamic Answering Path Based Fusion Model for KGQA. KSEM (1) 2020: 235-246 - [c202]Yuting Sun, Liping Wang, Qize Xie, Youbin Dong, Xuemin Lin:
Online Programming Education Modeling and Knowledge Tracing. KSEM (1) 2020: 259-270 - [c201]Ran Wang, Zhengyi Yang, Wenjie Zhang, Xuemin Lin:
An Empirical Study on Recent Graph Database Systems. KSEM (1) 2020: 328-340 - [c200]Chenhao Ma, Yixiang Fang, Reynold Cheng, Laks V. S. Lakshmanan, Wenjie Zhang, Xuemin Lin:
Efficient Algorithms for Densest Subgraph Discovery on Large Directed Graphs. SIGMOD Conference 2020: 1051-1066 - [c199]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Scaling Up Distance Labeling on Graphs with Core-Periphery Properties. SIGMOD Conference 2020: 1367-1381 - [c198]Dian Ouyang, Dong Wen, Lu Qin, Lijun Chang, Ying Zhang, Xuemin Lin:
Progressive Top-K Nearest Neighbors Search in Large Road Networks. SIGMOD Conference 2020: 1781-1795 - [c197]Qingyuan Linghu, Fan Zhang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Global Reinforcement of Social Networks: The Anchored Coreness Problem. SIGMOD Conference 2020: 2211-2226 - [c196]Zi Chen, Long Yuan, Xuemin Lin, Lu Qin, Jianye Yang:
Efficient Maximal Balanced Clique Enumeration in Signed Networks. WWW 2020: 339-349 - [e12]Guojun Wang, Xuemin Lin, James A. Hendler, Wei Song, Zhuoming Xu, Genggeng Liu:
Web Information Systems and Applications - 17th International Conference, WISA 2020, Guangzhou, China, September 23-25, 2020, Proceedings. Lecture Notes in Computer Science 12432, Springer 2020, ISBN 978-3-030-60028-0 [contents] - [i30]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Efficient Bitruss Decomposition for Large-scale Bipartite Graphs. CoRR abs/2001.06111 (2020) - [i29]Xubo Wang, Lu Qin, Lijun Chang, Ying Zhang, Dong Wen, Xuemin Lin:
Graph3S: A Simple, Speedy and Scalable Distributed Graph Processing System. CoRR abs/2003.00680 (2020) - [i28]Wangze Ni, Han Wu, Peng Cheng, Lei Chen, Xuemin Lin, Lei Chen, Xin Lai, Xiao Zhang:
CoinMagic: A Differential Privacy Framework for Ring Signature Schemes. CoRR abs/2003.06826 (2020) - [i27]Lu Qin, Longbin Lai, Kongzhang Hao, Zhongxin Zhou, Yiwei Zhao, Yuxing Han, Xuemin Lin, Zhengping Qian, Jingren Zhou:
Taming the Expressiveness and Programmability of Graph Analytical Queries. CoRR abs/2004.09045 (2020) - [i26]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xiangjian He, Yiguang Lin, Xuemin Lin:
Binarized Graph Neural Network. CoRR abs/2004.11147 (2020) - [i25]Hanchen Wang, Defu Lian, Ying Zhang, Lu Qin, Xuemin Lin:
GoGNN: Graph of Graphs Neural Network for Predicting Structured Entity Interactions. CoRR abs/2005.05537 (2020) - [i24]Michael Yu, Lu Qin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
AOT: Pushing the Efficiency Boundary of Main-memory Triangle Listing. CoRR abs/2006.11494 (2020) - [i23]Yuanhang Yu, Dong Wen, Ying Zhang, Xiaoyang Wang, Wenjie Zhang, Xuemin Lin:
Efficient Matrix Factorization on Heterogeneous CPU-GPU Systems. CoRR abs/2006.15980 (2020) - [i22]Yizhang He, Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Exploring Cohesive Subgraphs with Vertex Engagement and Tie Strength in Bipartite Graphs. CoRR abs/2008.04054 (2020) - [i21]Xiaoshuang Chen, Longbin Lai, Lu Qin, Xuemin Lin, Boge Liu:
A Framework to Quantify Approximate Simulation on Graph Data. CoRR abs/2010.08938 (2020) - [i20]Kai Wang, Wenjie Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Yuting Zhang:
Efficient and Effective Community Search on Large-scale Bipartite Graphs. CoRR abs/2011.08399 (2020) - [i19]Zhengmin Lai, You Peng, Shiyu Yang, Xuemin Lin, Wenjie Zhang:
PEFP: Efficient k-hop Constrained s-t Simple Path Enumeration on FPGA. CoRR abs/2012.11128 (2020)
2010 – 2019
- 2019
- [j140]Yang Yang, Wenjie Zhang, Ying Zhang, Xuemin Lin, Liping Wang:
Selectivity Estimation on Set Containment Search. Data Sci. Eng. 4(3): 254-268 (2019) - [j139]Jianye Yang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Cost optimization based on influence and user preference. Knowl. Inf. Syst. 61(2): 695-732 (2019) - [j138]Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou:
Distributed Subgraph Matching on Timely Dataflow. Proc. VLDB Endow. 12(10): 1099-1112 (2019) - [j137]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks. Proc. VLDB Endow. 12(10): 1139-1152 (2019) - [j136]Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V. S. Lakshmanan, Xuemin Lin:
Efficient Algorithms for Densest Subgraph Discovery. Proc. VLDB Endow. 12(11): 1719-1732 (2019) - [j135]Bohua Yang, Dong Wen, Lu Qin, Ying Zhang, Xubo Wang, Xuemin Lin:
Fully Dynamic Depth-First Search in Directed Graphs. Proc. VLDB Endow. 13(2): 142-154 (2019) - [j134]Conggai Li, Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficient Progressive Minimum k-core Search. Proc. VLDB Endow. 13(3): 362-375 (2019) - [j133]You Peng, Ying Zhang, Xuemin Lin, Wenjie Zhang, Lu Qin, Jingren Zhou:
Hop-constrained s-t Simple Path Enumeration: Towards Bridging Theory and Practice. Proc. VLDB Endow. 13(4): 463-476 (2019) - [j132]Weiwei Liu, Xiaobo Shen, Bo Du, Ivor W. Tsang, Wenjie Zhang, Xuemin Lin:
Hyperspectral Imagery Classification via Stochastic HHSVMs. IEEE Trans. Image Process. 28(2): 577-588 (2019) - [j131]Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
I/O Efficient Core Graph Decomposition: Application to Degeneracy Ordering. IEEE Trans. Knowl. Data Eng. 31(1): 75-90 (2019) - [j130]Yifan Chen, Xiang Zhao, Xuemin Lin, Yang Wang, Deke Guo:
Efficient Mining of Frequent Patterns on Uncertain Graphs. IEEE Trans. Knowl. Data Eng. 31(2): 287-300 (2019) - [j129]Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, Jeffrey Xu Yu:
Supergraph Search in Graph Databases via Hierarchical Feature-Tree. IEEE Trans. Knowl. Data Eng. 31(2): 385-400 (2019) - [j128]Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Leveraging set relations in exact and dynamic set similarity join. VLDB J. 28(2): 267-292 (2019) - [j127]Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Efficient structural graph clustering: an index-based approach. VLDB J. 28(3): 377-399 (2019) - [j126]Weiren Yu, Xuemin Lin, Wenjie Zhang, Jian Pei, Julie A. McCann:
SimRank*: effective and scalable pairwise similarity search based on graph topology. VLDB J. 28(3): 401-426 (2019) - [j125]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Eccentricities on small-world networks. VLDB J. 28(5): 765-792 (2019) - [j124]Fan Zhang, Xuemin Lin, Ying Zhang, Lu Qin, Wenjie Zhang:
Efficient community discovery with user engagement and similarity. VLDB J. 28(6): 987-1012 (2019) - [c195]Chen Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, Fan Zhang, Xuemin Lin:
Selecting the Optimal Groups: Efficiently Computing Skyline k-Cliques. CIKM 2019: 1211-1220 - [c194]Kongzhang Hao, Zhengyi Yang, Longbin Lai, Zhengmin Lai, Xin Jin, Xuemin Lin:
PatMat: A Distributed Pattern Matching Engine with Cypher. CIKM 2019: 2921-2924 - [c193]Yang Yang, Wenjie Zhang, Ying Zhang, Xuemin Lin, Liping Wang:
Selectivity Estimation on Set Containment Search. DASFAA (1) 2019: 330-349 - [c192]Xudong Wu, Long Yuan, Xuemin Lin, Shiyu Yang, Wenjie Zhang:
Towards Efficient k-TriPeak Decomposition on Large Graphs. DASFAA (1) 2019: 604-621 - [c191]Zhongxin Zhou, Fan Zhang, Xuemin Lin, Wenjie Zhang, Chen Chen:
K-Core Maximization: An Edge Addition Approach. IJCAI 2019: 4867-4873 - [c190]Weijie Zhu, Mengqi Zhang, Chen Chen, Xiaoyang Wang, Fan Zhang, Xuemin Lin:
Pivotal Relationship Identification: The K-Truss Minimization Problem. IJCAI 2019: 4874-4880 - [c189]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Scaling Distance Labeling on Small-World Networks. SIGMOD Conference 2019: 1060-1077 - [c188]Boge Liu, Fan Zhang, Chen Zhang, Wenjie Zhang, Xuemin Lin:
CoreCube: Core Decomposition in Multilayer Graphs. WISE 2019: 694-710 - [c187]Boge Liu, Long Yuan, Xuemin Lin, Lu Qin, Wenjie Zhang, Jingren Zhou:
Efficient (a,β)-core Computation: an Index-based Approach. WWW 2019: 1130-1141 - [i18]Yixiang Fang, Xin Huang, Lu Qin, Ying Zhang, Wenjie Zhang, Reynold Cheng, Xuemin Lin:
A Survey of Community Search Over Big Graphs. CoRR abs/1904.12539 (2019) - [i17]Yixiang Fang, Kaiqiang Yu, Reynold Cheng, Laks V. S. Lakshmanan, Xuemin Lin:
Efficient Algorithms for Densest Subgraph Discovery. CoRR abs/1906.00341 (2019) - [i16]Longbin Lai, Zhu Qing, Zhengyi Yang, Xin Jin, Zhengmin Lai, Ran Wang, Kongzhang Hao, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang, Zhengping Qian, Jingren Zhou:
A Survey and Experimental Analysis of Distributed Subgraph Matching. CoRR abs/1906.11518 (2019) - [i15]Zhongxin Zhou, Fan Zhang, Xuemin Lin, Wenjie Zhang, Chen Chen:
K-Core Maximization through Edge Additions. CoRR abs/1906.12334 (2019) - [i14]Wenjie Zhu, Mengqi Zhang, Chen Chen, Xiaoyang Wang, Fan Zhang, Xuemin Lin:
Critical Edge Identification: A K-Truss Based Model. CoRR abs/1906.12335 (2019) - [i13]Weixin Zeng, Xiang Zhao, Jiuyang Tang, Xuemin Lin:
Collective Embedding-based Entity Alignment via Adaptive Features. CoRR abs/1912.08404 (2019) - 2018
- [j123]Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang, Long Yuan:
Distributed computing connected components with linear communication cost. Distributed Parallel Databases 36(3): 555-592 (2018) - [j122]Longbing Cao, Jae-Gil Lee, Xuemin Lin:
Introduction to the special issue on Data Science in Asia (with PAKDD'2017). Int. J. Data Sci. Anal. 6(4): 271-272 (2018) - [j121]Fei Bi, Lijun Chang, Xuemin Lin, Wenjie Zhang:
An Optimal and Progressive Approach to Online Search of Top-K Influential Communities. Proc. VLDB Endow. 11(9): 1056-1068 (2018) - [j120]Xiafei Qiu, Wubin Cen, Zhengping Qian, You Peng, Ying Zhang, Xuemin Lin, Jingren Zhou:
Real-time Constrained Cycle Detection in Large Dynamic Graphs. Proc. VLDB Endow. 11(12): 1876-1888 (2018) - [j119]Yang Wang, Lin Wu, Xuemin Lin, Junbin Gao:
Multiview Spectral Clustering via Structured Low-Rank Matrix Factorization. IEEE Trans. Neural Networks Learn. Syst. 29(10): 4833-4843 (2018) - [j118]Xiang Zhao, Chuan Xiao, Xuemin Lin, Wenjie Zhang, Yang Wang:
Efficient structure similarity searches: a partition-based approach. VLDB J. 27(1): 53-78 (2018) - [j117]Weiren Yu, Xuemin Lin, Wenjie Zhang, Julie A. McCann:
Dynamical SimRank search on time-varying networks. VLDB J. 27(1): 79-104 (2018) - [j116]Jianye Yang, Wenjie Zhang, Shiyu Yang, Ying Zhang, Xuemin Lin, Long Yuan:
Efficient set containment join. VLDB J. 27(4): 471-495 (2018) - [c186]Weiwei Liu, Zhuanghua Liu, Ivor W. Tsang, Wenjie Zhang, Xuemin Lin:
Doubly Approximate Nearest Neighbor Classification. AAAI 2018: 3683-3690 - [c185]Maryam Ghafouri, Xiang Wang, Long Yuan, Ying Zhang, Xuemin Lin:
Maintaining Boolean Top-K Spatial Temporal Results in Publish-Subscribe Systems. ADC 2018: 147-160 - [c184]Alexander Zhou, Fan Zhang, Long Yuan, Ying Zhang, Xuemin Lin:
Finding Maximal Stable Cores in Social Networks. ADC 2018: 224-235 - [c183]Weijie Zhu, Chen Chen, Xiaoyang Wang, Xuemin Lin:
K-core Minimization: An Edge Manipulation Approach. CIKM 2018: 1667-1670 - [c182]Mingjie Li, Ying Zhang, Yifang Sun, Wei Wang, Ivor W. Tsang, Xuemin Lin:
An Efficient Exact Nearest Neighbor Search by Compounded Embedding. DASFAA (1) 2018: 37-54 - [c181]Yanhui Li, Guoren Wang, Ye Yuan, Xin Cao, Long Yuan, Xuemin Lin:
PrivTS: Differentially Private Frequent Time-Constrained Sequential Pattern Mining. DASFAA (2) 2018: 92-111 - [c180]Zhu Qing, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin, Wenjie Zhang:
External Topological Sorting in Large Graphs. DASFAA (1) 2018: 203-220 - [c179]Dian Ouyang, Long Yuan, Fan Zhang, Lu Qin, Xuemin Lin:
Towards Efficient Path Skyline Computation in Bicriteria Networks. DASFAA (1) 2018: 239-254 - [c178]Fan Zhang, Long Yuan, Ying Zhang, Lu Qin, Xuemin Lin, Alexander Zhou:
Discovering Strong Communities with User Engagement and Tie Strength. DASFAA (1) 2018: 425-441 - [c177]Shenlu Wang, Ying Zhang, Xuemin Lin, Muhammad Aamir Cheema:
Maximize Spatial Influence of Facility Bundle Considering Reverse k Nearest Neighbors. DASFAA (1) 2018: 684-700 - [c176]Jianbin Qin, Yaoshu Wang, Chuan Xiao, Wei Wang, Xuemin Lin, Yoshiharu Ishikawa:
GPH: Similarity Search in Hamming Space. ICDE 2018: 29-40 - [c175]Kai Wang, Xin Cao, Xuemin Lin, Wenjie Zhang, Lu Qin:
Efficient Computing of Radius-Bounded k-Cores. ICDE 2018: 233-244 - [c174]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Efficiently Reinforcing Social Networks over User Engagement and Tie Strength. ICDE 2018: 557-568 - [c173]Wentao Li, Miao Qiao, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Exacting Eccentricity for Small-World Networks. ICDE 2018: 785-796 - [c172]You Peng, Ying Zhang, Wenjie Zhang, Xuemin Lin, Lu Qin:
Efficient Probabilistic K-Core Computation on Uncertain Graphs. ICDE 2018: 1192-1203 - [c171]Dian Ouyang, Lu Qin, Lijun Chang, Xuemin Lin, Ying Zhang, Qing Zhu:
When Hierarchy Meets 2-Hop-Labeling: Efficient Shortest Distance Queries on Road Networks. SIGMOD Conference 2018: 709-724 - [r2]Xuemin Lin:
Data Sketch/Synopsis. Encyclopedia of Database Systems (2nd ed.) 2018 - [i12]Haida Zhang, Zengfeng Huang, Xuemin Lin, Zhe Lin, Wenjie Zhang, Ying Zhang:
Efficient and High-Quality Seeded Graph Matching: Employing High Order Structural Information. CoRR abs/1810.11152 (2018) - [i11]Kai Wang, Xuemin Lin, Lu Qin, Wenjie Zhang, Ying Zhang:
Vertex Priority Based Butterfly Counting for Large-scale Bipartite Networks. CoRR abs/1812.00283 (2018) - 2017
- [j115]Xuemin Lin, Jeffrey Xu Yu:
Special Issue on Graph Processing: Techniques and Applications. Data Sci. Eng. 2(1): 1 (2017) - [j114]Fan Zhang, Wenjie Zhang, Ying Zhang, Lu Qin, Xuemin Lin:
OLAK: An Efficient Algorithm to Prevent Unraveling in Social Networks. Proc. VLDB Endow. 10(6): 649-660 (2017) - [j113]Xubo Wang, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Leveraging Set Relations in Exact Set Similarity Join. Proc. VLDB Endow. 10(9): 925-936 (2017) - [j112]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks. Proc. VLDB Endow. 10(10): 998-1009 (2017) - [j111]Dong Wen, Lu Qin, Ying Zhang, Lijun Chang, Xuemin Lin:
Efficient Structural Graph Clustering: An Index-Based Approach. Proc. VLDB Endow. 11(3): 243-255 (2017) - [j110]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
Effective and Efficient Dynamic Graph Coloring. Proc. VLDB Endow. 11(3): 338-351 (2017) - [j109]Yang Wang, Xuemin Lin, Lin Wu, Wenjie Zhang:
Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval. IEEE Trans. Image Process. 26(3): 1393-1404 (2017) - [j108]Jian Pei, Xuemin Lin:
Editorial. IEEE Trans. Knowl. Data Eng. 29(1): 1 (2017) - [j107]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Chen Chen:
Bring Order into the Samples: A Novel Scalable Method for Influence Maximization. IEEE Trans. Knowl. Data Eng. 29(2): 243-256 (2017) - [j106]Xuemin Lin:
New EIC Editorial. IEEE Trans. Knowl. Data Eng. 29(3): 495-496 (2017) - [j105]Juan Lu, Zhiguo Gong, Xuemin Lin:
A Novel and Fast SimRank Algorithm. IEEE Trans. Knowl. Data Eng. 29(3): 572-585 (2017) - [j104]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Efficient Distance-Aware Influence Maximization in Geo-Social Networks. IEEE Trans. Knowl. Data Eng. 29(3): 599-612 (2017) - [j103]Yuxing Han, Junjie Yao, Xuemin Lin, Liping Wang:
GALLOP: GlobAL Feature Fused LOcation Prediction for Different Check-in Scenarios. IEEE Trans. Knowl. Data Eng. 29(9): 1874-1887 (2017) - [j102]Yang Wang, Wenjie Zhang, Lin Wu, Xuemin Lin, Xiang Zhao:
Unsupervised Metric Fusion Over Multiview Data by Graph Random Walk-Based Cross-View Diffusion. IEEE Trans. Neural Networks Learn. Syst. 28(1): 57-70 (2017) - [j101]Shiyu Yang, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wenjie Zhang:
Reverse k nearest neighbors queries and spatial reverse top-k queries. VLDB J. 26(2): 151-176 (2017) - [j100]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
I/O efficient ECC graph decomposition via graph reduction. VLDB J. 26(2): 275-300 (2017) - [j99]Xiang Wang, Wenjie Zhang, Ying Zhang, Xuemin Lin, Zengfeng Huang:
Top-k spatial-keyword publish/subscribe over sliding window. VLDB J. 26(3): 301-326 (2017) - [j98]Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang:
Scalable subgraph enumeration in MapReduce: a cost-oriented approach. VLDB J. 26(3): 421-446 (2017) - [j97]Jianye Yang, Wenjie Zhang, Ying Zhang, Xiaoyang Wang, Xuemin Lin:
Categorical top-k spatial influence query. World Wide Web 20(2): 175-203 (2017) - [c170]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
Finding Critical Users for Social Network Engagement: The Collapsed k-Core Problem. AAAI 2017: 245-251 - [c169]Deming Chu, Zhitao Shen, Yu Zhang, Shiyu Yang, Xuemin Lin:
Real-Time Popularity Prediction on Instagram. ADC 2017: 275-279 - [c168]Shanqing Jiang, Chengyuan Zhang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Xiaoyang Wang:
DSKQ: A System for Efficient Processing of Diversified Spatial-Keyword Query. ADC 2017: 280-284 - [c167]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Chen Chen:
Bring Order into the Samples: A Novel Scalable Method for Influence Maximization (Extended Abstract). ICDE 2017: 55-56 - [c166]Lijun Chang, Chen Zhang, Xuemin Lin, Lu Qin:
Scalable Top-K Structural Diversity Search. ICDE 2017: 95-98 - [c165]Jianye Yang, Wenjie Zhang, Shiyu Yang, Ying Zhang, Xuemin Lin:
TT-Join: Efficient Set Containment Join. ICDE 2017: 509-520 - [c164]Haida Zhang, Zengfeng Huang, Zhewei Wei, Wenjie Zhang, Xuemin Lin:
Tracking Matrix Approximation over Distributed Sliding Windows. ICDE 2017: 833-844 - [c163]Zengfeng Huang, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Efficient Matrix Sketching over Distributed Data. PODS 2017: 347-359 - [c162]Peipei Li, Junjie Yao, Liping Wang, Xuemin Lin:
SPOT: Selecting occuPations frOm Trajectories. SIGIR 2017: 813-816 - [c161]Tao Guo, Xin Cao, Gao Cong, Jiaheng Lu, Xuemin Lin:
Distributed Algorithms on Exact Personalized PageRank. SIGMOD Conference 2017: 479-494 - [e11]Jinho Kim, Kyuseok Shim, Longbing Cao, Jae-Gil Lee, Xuemin Lin, Yang-Sae Moon:
Advances in Knowledge Discovery and Data Mining - 21st Pacific-Asia Conference, PAKDD 2017, Jeju, South Korea, May 23-26, 2017, Proceedings, Part I. Lecture Notes in Computer Science 10234, 2017, ISBN 978-3-319-57453-0 [contents] - [e10]Jinho Kim, Kyuseok Shim, Longbing Cao, Jae-Gil Lee, Xuemin Lin, Yang-Sae Moon:
Advances in Knowledge Discovery and Data Mining - 21st Pacific-Asia Conference, PAKDD 2017, Jeju, South Korea, May 23-26, 2017, Proceedings, Part II. Lecture Notes in Computer Science 10235, 2017, ISBN 978-3-319-57528-5 [contents] - [i10]Yang Wang, Xuemin Lin, Lin Wu, Wenjie Zhang:
Effective Multi-Query Expansions: Collaborative Deep Networks for Robust Landmark Retrieval. CoRR abs/1701.05003 (2017) - [i9]Dong Wen, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Enumerating k-Vertex Connected Components in Large Graphs. CoRR abs/1703.08668 (2017) - [i8]Lijun Chang, Xing Feng, Xuemin Lin, Lu Qin, Wenjie Zhang:
Efficient Graph Edit Distance Computation and Verification via Anchor-aware Lower Bound Estimation. CoRR abs/1709.06810 (2017) - [i7]Weiren Yu, Xuemin Lin, Wenjie Zhang, Julie A. McCann:
Dynamical SimRank Search on Time-Varying Networks. CoRR abs/1711.00121 (2017) - [i6]Fei Bi, Lijun Chang, Xuemin Lin, Wenjie Zhang:
An Optimal and Progressive Approach to Online Search of Top-k Important Communities. CoRR abs/1711.05857 (2017) - 2016
- [j96]Yang Wang, Xuemin Lin, Lin Wu, Qing Zhang, Wenjie Zhang:
Shifting multi-hypergraphs via collaborative probabilistic voting. Knowl. Inf. Syst. 46(3): 515-536 (2016) - [j95]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
I/O Efficient ECC Graph Decomposition via Graph Reduction. Proc. VLDB Endow. 9(7): 516-527 (2016) - [j94]Xiang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Zengfeng Huang:
SKYPE: Top-k Spatial-keyword Publish/Subscribe Over Sliding Window. Proc. VLDB Endow. 9(7): 588-599 (2016) - [j93]Longbin Lai, Lu Qin, Xuemin Lin, Ying Zhang, Lijun Chang:
Scalable Distributed Subgraph Enumeration. Proc. VLDB Endow. 10(3): 217-228 (2016) - [j92]Zheng Yu, Haixun Wang, Xuemin Lin, Min Wang:
Understanding Short Texts through Semantic Enrichment and Hashing. IEEE Trans. Knowl. Data Eng. 28(2): 566-579 (2016) - [j91]Wenjie Zhang, Xuemin Lin, Ying Zhang, Ke Zhu, Gaoping Zhu:
Efficient Probabilistic Supergraph Search. IEEE Trans. Knowl. Data Eng. 28(4): 965-978 (2016) - [j90]Chengyuan Zhang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Inverted Linear Quadtree: Efficient Top K Spatial Keyword Search. IEEE Trans. Knowl. Data Eng. 28(7): 1706-1721 (2016) - [j89]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Efficient Identification of Local Keyword Patterns in Microblogging Platforms. IEEE Trans. Knowl. Data Eng. 28(10): 2621-2634 (2016) - [j88]Jianmin Wang, Shaoxu Song, Xiaochen Zhu, Xuemin Lin, Jiaguang Sun:
Efficient Recovery of Missing Events. IEEE Trans. Knowl. Data Eng. 28(11): 2943-2957 (2016) - [j87]Xiaoling Zhou, Jianbin Qin, Chuan Xiao, Wei Wang, Xuemin Lin, Yoshiharu Ishikawa:
BEVA: An Efficient Query Processing Algorithm for Error-Tolerant Autocompletion. ACM Trans. Database Syst. 41(1): 5:1-5:44 (2016) - [j86]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
Diversified top-k clique search. VLDB J. 25(2): 171-196 (2016) - [j85]Peng Peng, Lei Zou, Lei Chen, Xuemin Lin, Dongyan Zhao:
Answering subgraph queries over massive disk resident graphs. World Wide Web 19(3): 417-448 (2016) - [c160]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Distance-aware influence maximization in geo-social network. ICDE 2016: 1-12 - [c159]Xing Feng, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang:
Computing Connected Components with linear communication cost in pregel-like systems. ICDE 2016: 85-96 - [c158]Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
I/O efficient Core Graph Decomposition at web scale. ICDE 2016: 133-144 - [c157]Bingqing Lyu, Lu Qin, Xuemin Lin, Lijun Chang, Jeffrey Xu Yu:
Scalable supergraph search in large graph databases. ICDE 2016: 157-168 - [c156]Lijun Chang, Wei Li, Xuemin Lin, Lu Qin, Wenjie Zhang:
pSCAN: Fast and exact structural graph clustering. ICDE 2016: 253-264 - [c155]Dong-Wan Choi, Jian Pei, Xuemin Lin:
Finding the minimum spatial keyword cover. ICDE 2016: 685-696 - [c154]Jianye Yang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Influence based cost optimization on user preference. ICDE 2016: 709-720 - [c153]Shenlu Wang, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Dongxi Liu:
Efficiently computing reverse k furthest neighbors. ICDE 2016: 1110-1121 - [c152]Wenjie Zhang, Xuemin Lin, Ying Zhang, Ke Zhu, Gaoping Zhu:
Efficient probabilistic supergraph search. ICDE 2016: 1542-1543 - [c151]Zheng Yu, Haixun Wang, Xuemin Lin, Min Wang:
Understanding short texts through semantic enrichment and hashing. ICDE 2016: 1552-1553 - [c150]Yang Wang, Wenjie Zhang, Lin Wu, Xuemin Lin, Meng Fang, Shirui Pan:
Iterative Views Agreement: An Iterative Low-Rank Based Structured Optimization Method to Multi-View Spectral Clustering. IJCAI 2016: 2153-2159 - [c149]Xuemin Lin:
Towards Processing of Big Graphs: from Theory, Algorithm to System (Invited Talk). ISAAC 2016: 1:1-1:1 - [c148]Fei Bi, Lijun Chang, Xuemin Lin, Lu Qin, Wenjie Zhang:
Efficient Subgraph Matching by Postponing Cartesian Products. SIGMOD Conference 2016: 1199-1214 - [c147]Hao Wei, Jeffrey Xu Yu, Can Lu, Xuemin Lin:
Speedup Graph Processing by Graph Ordering. SIGMOD Conference 2016: 1813-1828 - [i5]Yang Wang, Wenjie Zhang, Lin Wu, Xuemin Lin, Meng Fang, Shirui Pan:
Iterative Views Agreement: An Iterative Low-Rank based Structured Optimization Method to Multi-View Spectral Clustering. CoRR abs/1608.05560 (2016) - [i4]Wen Li, Ying Zhang, Yifang Sun, Wei Wang, Wenjie Zhang, Xuemin Lin:
Approximate Nearest Neighbor Search on High Dimensional Data - Experiments, Analyses, and Improvement (v1.0). CoRR abs/1610.02455 (2016) - [i3]Xiang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Zengfeng Huang:
Top-k Spatial-keyword Publish/Subscribe Over Sliding Window. CoRR abs/1611.03204 (2016) - [i2]Fan Zhang, Ying Zhang, Lu Qin, Wenjie Zhang, Xuemin Lin:
When Engagement Meets Similarity: Efficient (k, r)-Core Computation on Social Networks. CoRR abs/1611.03254 (2016) - 2015
- [j84]Shenlu Wang, Muhammad Aamir Cheema, Xuemin Lin:
Efficiently Monitoring Reverse k-Nearest Neighbors in Spatial Networks. Comput. J. 58(1): 40-56 (2015) - [j83]Shiyu Yang, Muhammad Aamir Cheema, Xuemin Lin:
Impact Set: Computing Influence Using Query Logs. Comput. J. 58(11): 2928-2943 (2015) - [j82]Lijun Chang, Xuemin Lin, Wenjie Zhang, Jeffrey Xu Yu, Ying Zhang, Lu Qin:
Optimal Enumeration: Efficient Top-k Tree Matching. Proc. VLDB Endow. 8(5): 533-544 (2015) - [j81]Shiyu Yang, Muhammad Aamir Cheema, Xuemin Lin, Wei Wang:
Reverse k Nearest Neighbors Query Processing: Experiments and Analysis. Proc. VLDB Endow. 8(5): 605-616 (2015) - [j80]Longbin Lai, Lu Qin, Xuemin Lin, Lijun Chang:
Scalable Subgraph Enumeration in MapReduce. Proc. VLDB Endow. 8(10): 974-985 (2015) - [j79]Yang Wang, Xuemin Lin, Lin Wu, Wenjie Zhang, Qing Zhang, Xiaodi Huang:
Robust Subspace Clustering for Multi-View Data by Exploiting Correlation Consensus. IEEE Trans. Image Process. 24(11): 3939-3949 (2015) - [j78]Weiren Yu, Xuemin Lin, Wenjie Zhang, Julie A. McCann:
Fast All-Pairs SimRank Assessment on Large Graphs and Bipartite Domains. IEEE Trans. Knowl. Data Eng. 27(7): 1810-1823 (2015) - [j77]Liming Zhan, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Finding Top k Most Influential Spatial Facilities over Uncertain Objects. IEEE Trans. Knowl. Data Eng. 27(12): 3289-3303 (2015) - [j76]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin:
I/O efficient: computing SCCs in massive graphs. VLDB J. 24(2): 245-270 (2015) - [j75]Xiang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Wei Wang:
AP-Tree: efficiently support location-aware Publish/Subscribe. VLDB J. 24(6): 823-848 (2015) - [j74]Xuemin Lin, Jeffrey Xu Yu:
Guest editorial: web information technologies. World Wide Web 18(5): 1199-1200 (2015) - [c146]Liming Zhan, Ying Zhang, Wenjie Zhang, Xiaoyang Wang, Xuemin Lin:
Range Search on Uncertain Trajectories. CIKM 2015: 921-930 - [c145]Yuxing Han, Liping Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Spatial Keyword Range Search on Trajectories. DASFAA (2) 2015: 223-240 - [c144]Fei Bi, Lijun Chang, Wenjie Zhang, Xuemin Lin:
Efficient String Similarity Search: A Cross Pivotal Based Approach. DASFAA (1) 2015: 545-564 - [c143]Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Jian Pei:
Efficiently Computing Top-K Shortest Path Join. EDBT 2015: 133-144 - [c142]Jianmin Wang, Shaoxu Song, Xuemin Lin, Xiaochen Zhu, Jian Pei:
Cleaning structured event logs: A graph repair approach. ICDE 2015: 30-41 - [c141]Long Yuan, Lu Qin, Xuemin Lin, Lijun Chang, Wenjie Zhang:
Diversified top-k clique search. ICDE 2015: 387-398 - [c140]Xiang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Wei Wang:
AP-Tree: Efficiently support continuous spatial-keyword queries over stream. ICDE 2015: 1107-1118 - [c139]Yifan Chen, Xiang Zhao, Xuemin Lin, Yang Wang:
Towards Frequent Subgraph Mining on Single Large Uncertain Graphs. ICDM 2015: 41-50 - [c138]Zheng Yu, Haixun Wang, Xuemin Lin, Min Wang:
Learning Term Embeddings for Hypernymy Identification. IJCAI 2015: 1390-1397 - [c137]Yang Wang, Xuemin Lin, Lin Wu, Wenjie Zhang:
Effective Multi-Query Expansions: Robust Landmark Retrieval. ACM Multimedia 2015: 79-88 - [c136]Yang Wang, Xuemin Lin, Lin Wu, Wenjie Zhang, Qing Zhang:
LBMCH: Learning Bridging Mapping for Cross-modal Hashing. SIGIR 2015: 999-1002 - [c135]Shenlu Wang, Muhammad Aamir Cheema, Ying Zhang, Xuemin Lin:
Selecting Representative Objects Considering Coverage and Diversity. GeoRich@SIGMOD 2015: 31-38 - [c134]Lijun Chang, Xuemin Lin, Lu Qin, Jeffrey Xu Yu, Wenjie Zhang:
Index-based Optimal Algorithms for Computing Steiner Components with Maximum Connectivity. SIGMOD Conference 2015: 459-474 - [c133]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema:
Optimal Spatial Dominance: An Effective Search of Nearest Neighbor Candidates. SIGMOD Conference 2015: 923-938 - [i1]Dong Wen, Lu Qin, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
I/O Efficient Core Graph Decomposition at Web Scale. CoRR abs/1511.00367 (2015) - 2014
- [j73]Yifang Sun, Wei Wang, Jianbin Qin, Ying Zhang, Xuemin Lin:
SRS: Solving c-Approximate Nearest Neighbor Queries in High Dimensional Euclidean Space with a Tiny Index. Proc. VLDB Endow. 8(1): 1-12 (2014) - [j72]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Wei Wang:
Selectivity Estimation on Streaming Spatio-Textual Data Using Local Correlations. Proc. VLDB Endow. 8(2): 101-112 (2014) - [j71]Ying Zhang, Wenjie Zhang, Jian Pei, Xuemin Lin, Qianlu Lin, Aiping Li:
Consensus-Based Ranking of Multivalued Objects: A Generalized Borda Count Approach. IEEE Trans. Knowl. Data Eng. 26(1): 83-96 (2014) - [j70]Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin, Heng Tao Shen:
Effectively Indexing the Multidimensional Uncertain Objects. IEEE Trans. Knowl. Data Eng. 26(3): 608-622 (2014) - [j69]Wei Cheng, Xiaoming Jin, Jian-Tao Sun, Xuemin Lin, Xiang Zhang, Wei Wang:
Searching Dimension Incomplete Databases. IEEE Trans. Knowl. Data Eng. 26(3): 725-738 (2014) - [j68]Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Haixun Wang:
A Generic Framework for Top-k Pairs and Top-k Objects Queries over Sliding Windows. IEEE Trans. Knowl. Data Eng. 26(6): 1349-1366 (2014) - [j67]Muhammad Aamir Cheema, Xuemin Lin, Haixun Wang, Wenjie Zhang:
A Unified Framework for Answering k Closest Pairs Queries and Variants. IEEE Trans. Knowl. Data Eng. 26(11): 2610-2624 (2014) - [j66]Wenjie Zhang, Liming Zhan, Ying Zhang, Muhammad Aamir Cheema, Xuemin Lin:
Efficient top-k similarity join processing over multi-valued objects. World Wide Web 17(3): 285-309 (2014) - [c132]Yuxing Han, Lijun Chang, Wenjie Zhang, Xuemin Lin, Liping Wang:
Efficiently Retrieving Top-k Trajectories by Locations via Traveling Time. ADC 2014: 122-134 - [c131]Xiang Zhao, Chuan Xiao, Wenjie Zhang, Xuemin Lin, Jiuyang Tang:
Improving Performance of Graph Similarity Joins Using Selected Substructures. DASFAA (1) 2014: 156-172 - [c130]Liming Zhan, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Identifying Top k Dominating Objects over Uncertain Data. DASFAA (1) 2014: 388-405 - [c129]Chengyuan Zhang, Ying Zhang, Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Xiaoyang Wang:
Diversified Spatial Keyword Search On Road Networks. EDBT 2014: 367-378 - [c128]Muhammad Aamir Cheema, Zhitao Shen, Xuemin Lin, Wenjie Zhang:
A Unified Framework for Efficiently Processing Ranking Related Queries. EDBT 2014: 427-438 - [c127]Weiren Yu, Xuemin Lin, Wenjie Zhang:
Fast incremental SimRank on link-evolving graphs. ICDE 2014: 304-315 - [c126]Shiyu Yang, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang:
SLICE: Reviving regions-based pruning for reverse k nearest neighbors queries. ICDE 2014: 760-771 - [c125]Yang Wang, Xuemin Lin, Lin Wu, Wenjie Zhang, Qing Zhang:
Exploiting Correlation Consensus: Towards Subspace Clustering for Multi-modal Data. ACM Multimedia 2014: 981-984 - [c124]Yang Wang, Jian Pei, Xuemin Lin, Qing Zhang, Wenjie Zhang:
An Iterative Fusion Approach to Graph-Based Semi-Supervised Learning from Multiple Views. PAKDD (2) 2014: 162-173 - [c123]Yang Wang, Xuemin Lin, Qing Zhang, Lin Wu:
Shifting Hypergraphs by Probabilistic Voting. PAKDD (2) 2014: 234-246 - [c122]Xiaoyang Wang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Efficiently identify local frequent keyword co-occurrence patterns in geo-tagged Twitter stream. SIGIR 2014: 1215-1218 - [c121]Lu Qin, Jeffrey Xu Yu, Lijun Chang, Hong Cheng, Chengqi Zhang, Xuemin Lin:
Scalable big graph processing in MapReduce. SIGMOD Conference 2014: 827-838 - [c120]Ying Zhang, Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Chengqi Zhang:
Matching dominance: capture the semantics of dominance for multi-dimensional uncertain objects. SSDBM 2014: 18:1-18:12 - 2013
- [j65]Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang, Gaoping Zhu, Jeffrey Xu Yu:
Probabilistic skyline operator over sliding windows. Inf. Syst. 38(8): 1212-1233 (2013) - [j64]Qing Liu, Xiang Zhao, Kerry Taylor, Xuemin Lin, Geoffrey Squire, Corne Kloppers, Richard Miller:
Towards semantic comparison of multi-granularity process traces. Knowl. Based Syst. 52: 91-106 (2013) - [j63]Jianmin Wang, Shaoxu Song, Xiaochen Zhu, Xuemin Lin:
Efficient Recovery of Missing Events. Proc. VLDB Endow. 6(10): 841-852 (2013) - [j62]Weiren Yu, Xuemin Lin, Wenjie Zhang, Lijun Chang, Jian Pei:
More is Simpler: Effectively and Efficiently Assessing Node-Pair Similarities Based on Hyperlinks. Proc. VLDB Endow. 7(1): 13-24 (2013) - [j61]Xiang Zhao, Chuan Xiao, Xuemin Lin, Qing Liu, Wenjie Zhang:
A Partition-Based Approach to Structure Similarity Search. Proc. VLDB Endow. 7(3): 169-180 (2013) - [j60]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) - [j59]Wei Wang, Jianbin Qin, Chuan Xiao, Xuemin Lin, Heng Tao Shen:
VChunkJoin: An Efficient Algorithm for Edit Similarity Joins. IEEE Trans. Knowl. Data Eng. 25(8): 1916-1929 (2013) - [j58]Jianbin Qin, Wei Wang, Chuan Xiao, Yifei Lu, Xuemin Lin, Haixun Wang:
Asymmetric signature schemes for efficient exact edit similarity query processing. ACM Trans. Database Syst. 38(3): 16 (2013) - [j57]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin:
High efficiency and quality: large graphs matching. VLDB J. 22(3): 345-368 (2013) - [j56]Xiang Zhao, Chuan Xiao, Xuemin Lin, Wei Wang, Yoshiharu Ishikawa:
Efficient processing of graph similarity queries with edit distance constraints. VLDB J. 22(6): 727-752 (2013) - [j55]Qianlu Lin, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Efficient general spatial skyline computation. World Wide Web 16(3): 247-270 (2013) - [c119]Yang Wang, Xuemin Lin, Qing Zhang:
Towards metric fusion on multi-view data: a cross-view based graph random walk approach. CIKM 2013: 805-810 - [c118]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 - [c117]Xiang Zhao, Haichuan Shang, Wenjie Zhang, Xuemin Lin, Weidong Xiao:
On Efficient Graph Substructure Selection. DASFAA (2) 2013: 284-300 - [c116]Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang:
A safe zone based approach for monitoring moving skyline queries. EDBT 2013: 275-286 - [c115]Qing Zhang, Pengjie Ye, Xuemin Lin, Ying Zhang:
Skyline probability over uncertain preferences. EDBT 2013: 395-405 - [c114]Weiren Yu, Xuemin Lin, Wenjie Zhang:
Towards efficient SimRank computation on large networks. ICDE 2013: 601-612 - [c113]Chengyuan Zhang, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Inverted linear quadtree: Efficient top k spatial keyword search. ICDE 2013: 901-912 - [c112]Ming Gao, Cheqing Jin, Wei Wang, Xuemin Lin, Aoying Zhou:
Similarity query processing for probabilistic sets. ICDE 2013: 913-924 - [c111]Yang Wang, Muhammad Aamir Cheema, Xuemin Lin, Qing Zhang:
Multi-Manifold Ranking: Using Multiple Features for Better Image Retrieval. PAKDD (2) 2013: 449-460 - [c110]Weiren Yu, Xuemin Lin:
IRWR: incremental random walk with restart. SIGIR 2013: 1017-1020 - [c109]Zhiwei Zhang, Jeffrey Xu Yu, Lu Qin, Lijun Chang, Xuemin Lin:
I/O efficient: computing SCCs in massive graphs. SIGMOD Conference 2013: 181-192 - [c108]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin, Chengfei Liu, Weifa Liang:
Efficiently computing k-edge connected components via graph decomposition. SIGMOD Conference 2013: 205-216 - [c107]Qing Liu, Kerry Taylor, Xiang Zhao, Geoffrey Squire, Xuemin Lin, Corne Kloppers, Richard Miller:
CTrace: semantic comparison of multi-granularity process traces. SIGMOD Conference 2013: 1121-1124 - [e9]Xuemin Lin, Yannis Manolopoulos, Divesh Srivastava, Guangyan Huang:
Web Information Systems Engineering - WISE 2013 - 14th International Conference, Nanjing, China, October 13-15, 2013, Proceedings, Part I. Lecture Notes in Computer Science 8180, Springer 2013, ISBN 978-3-642-41229-5 [contents] - [e8]Xuemin Lin, Yannis Manolopoulos, Divesh Srivastava, Guangyan Huang:
Web Information Systems Engineering - WISE 2013 - 14th International Conference, Nanjing, China, October 13-15, 2013, Proceedings, Part II. Lecture Notes in Computer Science 8181, Springer 2013, ISBN 978-3-642-41153-3 [contents] - 2012
- [j54]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) - [j53]Chunyang Ma, Rui Zhang, Xuemin Lin, Gang Chen:
DuoWave: Mitigating the curse of dimensionality for uncertain data. Data Knowl. Eng. 76: 16-38 (2012) - [j52]Wenjie Zhang, Muhammad Aamir Cheema, Ying Zhang, Xuemin Lin:
Skyline: Stacking Optimal Solutions in Exact and Uncertain Worlds. Int. J. Softw. Informatics 6(4): 475-493 (2012) - [j51]Bin Jiang, Jian Pei, Xuemin Lin, Yidong Yuan:
Probabilistic skylines on uncertain data: model and bounding-pruning-refining methods. J. Intell. Inf. Syst. 38(1): 1-39 (2012) - [j50]Ying Zhang, Xuemin Lin, Yufei Tao, Wenjie Zhang, Haixun Wang:
Efficient Computation of Range Aggregates against Uncertain Location-Based Queries. IEEE Trans. Knowl. Data Eng. 24(7): 1244-1258 (2012) - [j49]Wenjie Zhang, Xuemin Lin, Ying Zhang, Muhammad Aamir Cheema, Qing Zhang:
Stochastic skylines. ACM Trans. Database Syst. 37(2): 14:1-14:34 (2012) - [j48]Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang, Xuefei Li:
Continuous reverse k nearest neighbors queries in Euclidean space and in spatial networks. VLDB J. 21(1): 69-95 (2012) - [j47]Muhammad Aamir Cheema, Wenjie Zhang, Xuemin Lin, Ying Zhang:
Efficiently processing snapshot and continuous reverse k nearest neighbors queries. VLDB J. 21(5): 703-728 (2012) - [j46]Weiren Yu, Wenjie Zhang, Xuemin Lin, Qing Zhang, Jiajin Le:
A space and time efficient algorithm for SimRank computation. World Wide Web 15(3): 327-353 (2012) - [c106]Liming Zhan, Ying Zhang, Wenjie Zhang, Xuemin Lin:
Finding top k most influential spatial facilities over uncertain objects. CIKM 2012: 922-931 - [c105]Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin:
Loyalty-based selection: retrieving objects that persistently satisfy criteria. CIKM 2012: 2189-2193 - [c104]Gaoping Zhu, Ke Zhu, Wenjie Zhang, Xuemin Lin, Chuan Xiao:
Efficient Subgraph Similarity All-Matching. DASFAA (1) 2012: 455-469 - [c103]Wenjie Zhang, Jing Xu, Xin Liang, Ying Zhang, Xuemin Lin:
Top-k Similarity Join over Multi-valued Objects. DASFAA (1) 2012: 509-525 - [c102]Ying Zhang, Wenjie Zhang, Qianlu Lin, Xuemin Lin:
Effectively indexing the multi-dimensional uncertain objects for range searching. EDBT 2012: 504-515 - [c101]Zhitao Shen, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Haixun Wang:
Efficiently Monitoring Top-k Pairs over Sliding Windows. ICDE 2012: 798-809 - [c100]Xiang Zhao, Chuan Xiao, Xuemin Lin, Wei Wang:
Efficient Graph Similarity Joins with Edit Distance Constraints. ICDE 2012: 834-845 - [c99]Weiren Yu, Xuemin Lin, Wenjie Zhang, Ying Zhang, Jiajin Le:
SimFusion+: extending simfusion towards efficient estimation on large and dynamic networks. SIGIR 2012: 365-374 - [c98]Gaoping Zhu, Xuemin Lin, Ke Zhu, Wenjie Zhang, Jeffrey Xu Yu:
TreeSpan: efficiently computing similarity all-matching. SIGMOD Conference 2012: 529-540 - [c97]Weiren Yu, Jiajin Le, Xuemin Lin, Wenjie Zhang:
On the Efficiency of Estimating Penetrating Rank on Large Graphs. SSDBM 2012: 231-249 - [c96]Jianbin Qin, Chuan Xiao, Wei Wang, Xuemin Lin:
A Space-Efficient Indexing Algorithm for Boolean Query Processing. WISE 2012: 638-644 - 2011
- [j45]Ying Zhang, Wenjie Zhang, Xuemin Lin, Bin Jiang, Jian Pei:
Ranking uncertain sky: The probabilistic top-k skyline operator. Inf. Syst. 36(5): 898-915 (2011) - [j44]Keqiu Li, Laurence Tianruo Yang, Xuemin Lin:
Advanced topics in cloud computing. J. Netw. Comput. Appl. 34(4): 1033-1034 (2011) - [j43]Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang:
Continuous Monitoring of Distance-Based Range Queries. IEEE Trans. Knowl. Data Eng. 23(8): 1182-1199 (2011) - [j42]Yi Luo, Wei Wang, Xuemin Lin, Xiaofang Zhou, Jianmin Wang, Keqiu Li:
SPARK2: Top-k Keyword Query in Relational Databases. IEEE Trans. Knowl. Data Eng. 23(12): 1763-1780 (2011) - [j41]Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu, Guoren Wang:
Efficient similarity joins for near-duplicate detection. ACM Trans. Database Syst. 36(3): 15:1-15:41 (2011) - [j40]Ming Hua, Jian Pei, Xuemin Lin:
Ranking queries on uncertain data. VLDB J. 20(1): 129-153 (2011) - [c95]Yuanyuan Zhu, Lu Qin, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin:
High efficiency and quality: large graphs matching. CIKM 2011: 1755-1764 - [c94]Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang:
A Unified Algorithm for Continuous Monitoring of Spatial Queries. DASFAA (2) 2011: 104-118 - [c93]Ke Zhu, Wenjie Zhang, Gaoping Zhu, Ying Zhang, Xuemin Lin:
BMC: An Efficient Method to Evaluate Probabilistic Reachability Queries. DASFAA (1) 2011: 434-449 - [c92]Muhammad Aamir Cheema, Xuemin Lin, Wenjie Zhang, Ying Zhang:
Influence zone: Efficiently processing reverse k nearest neighbors queries. ICDE 2011: 577-588 - [c91]Xuemin Lin, Ying Zhang, Wenjie Zhang, Muhammad Aamir Cheema:
Stochastic skyline operator. ICDE 2011: 721-732 - [c90]Muhammad Aamir Cheema, Xuemin Lin, Haixun Wang, Jianmin Wang, Wenjie Zhang:
A unified approach for computing top-k pairs in multidimensional space. ICDE 2011: 1031-1042 - [c89]Jianbin Qin, Wei Wang, Yifei Lu, Chuan Xiao, Xuemin Lin:
Efficient exact edit similarity query processing with the asymmetric signature scheme. SIGMOD Conference 2011: 1033-1044 - [c88]Peng Peng, Lei Zou, Lei Chen, Xuemin Lin, Dongyan Zhao:
Subgraph Search over Massive Disk Resident Graphs. SSDBM 2011: 312-321 - 2010
- [j39]Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu:
Duplicate-Insensitive Order Statistics Computation over Data Streams. IEEE Trans. Knowl. Data Eng. 22(4): 493-507 (2010) - [j38]Muhammad Aamir Cheema, Xuemin Lin, Wei Wang, Wenjie Zhang, Jian Pei:
Probabilistic Reverse Nearest Neighbor Queries on Uncertain Data. IEEE Trans. Knowl. Data Eng. 22(4): 550-564 (2010) - [j37]Ying Zhang, Xuemin Lin, Wenjie Zhang, Jianmin Wang, Qianlu Lin:
Effectively Indexing the Uncertain Space. IEEE Trans. Knowl. Data Eng. 22(9): 1247-1261 (2010) - [j36]Wenjie Zhang, Xuemin Lin, Ying Zhang, Jian Pei, Wei Wang:
Threshold-based probabilistic top-k dominating queries. VLDB J. 19(2): 283-305 (2010) - [j35]Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin:
Sliding-window top-k queries on uncertain streams. VLDB J. 19(3): 411-435 (2010) - [c87]Wenjie Zhang, Ying Zhang, Muhammad Aamir Cheema, Xuemin Lin:
Counting distinct objects over sliding windows. ADC 2010: 75-84 - [c86]Weiren Yu, Xuemin Lin, Jiajin Le:
A Space and Time Efficient Algorithm for SimRank Computation. APWeb 2010: 164-170 - [c85]Ke Zhu, Ying Zhang, Xuemin Lin, Gaoping Zhu, Wei Wang:
NOVA: A Novel and Efficient Framework for Finding Subgraph Isomorphism Mappings in Large Graphs. DASFAA (1) 2010: 140-154 - [c84]Mahady Hasan, Muhammad Aamir Cheema, Wenyu Qu, Xuemin Lin:
Efficient Algorithms to Monitor Continuous Constrained k Nearest Neighbor Queries. DASFAA (1) 2010: 233-249 - [c83]Lijun Chang, Jeffrey Xu Yu, Lu Qin, Xuemin Lin:
Probabilistic ranking over relations. EDBT 2010: 477-488 - [c82]Wenjie Zhang, Xuemin Lin, Muhammad Aamir Cheema, Ying Zhang, Wei Wang:
Quantile-based KNN over multi-valued objects. ICDE 2010: 16-27 - [c81]Ying Zhang, Xuemin Lin, Gaoping Zhu, Wenjie Zhang, Qianlu Lin:
Efficient rank based KNN query processing over uncertain data. ICDE 2010: 28-39 - [c80]Muhammad Aamir Cheema, Ljiljana Brankovic, Xuemin Lin, Wenjie Zhang, Wei Wang:
Multi-guarded safe zone: An effective technique to monitor moving circular range queries. ICDE 2010: 189-200 - [c79]Haichuan Shang, Ke Zhu, Xuemin Lin, Ying Zhang, Ryutaro Ichise:
Similarity search on supergraph containment. ICDE 2010: 637-648 - [c78]Haichuan Shang, Xuemin Lin, Ying Zhang, Jeffrey Xu Yu, Wei Wang:
Connected substructure similarity search. SIGMOD Conference 2010: 903-914 - [c77]Chaokun Wang, Jianmin Wang, Xuemin Lin, Wei Wang, Haixun Wang, Hongsong Li, Wanpeng Tian, Jun Xu, Rui Li:
MapDupReducer: detecting near duplicates over massive datasets. SIGMOD Conference 2010: 1119-1122 - [c76]Gaoping Zhu, Xuemin Lin, Wenjie Zhang, Wei Wang, Haichuan Shang:
PrefIndex: An Efficient Supergraph Containment Search Technique. SSDBM 2010: 360-378 - [c75]Weiren Yu, Xuemin Lin, Jiajin Le:
Taming Computational Complexity: Efficient and Parallel SimRank Optimizations on Undirected Graphs. WAIM 2010: 280-296
2000 – 2009
- 2009
- [j34]Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang, Wei Wang, Wenjie Zhang:
Lazy Updates: An Efficient Technique to Continuously Monitoring Reverse kNN. Proc. VLDB Endow. 2(1): 1138-1149 (2009) - [j33]Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-fung Leung:
Top-k typicality queries and efficient query answering methods on large databases. VLDB J. 18(3): 809-835 (2009) - [c74]Yufei Tao, Ling Ding, Xuemin Lin, Jian Pei:
Distance-Based Representative Skyline. ICDE 2009: 892-903 - [c73]Chuan Xiao, Wei Wang, Xuemin Lin, Haichuan Shang:
Top-k Set Similarity Joins. ICDE 2009: 916-927 - [c72]Wenjie Zhang, Xuemin Lin, Ying Zhang, Wei Wang, Jeffrey Xu Yu:
Probabilistic Skyline Operator over Sliding Windows. ICDE 2009: 1060-1071 - [c71]Ying Zhang, Xuemin Lin, Yufei Tao, Wenjie Zhang:
Uncertain Location Based Range Aggregates in a Multi-dimensional Space. ICDE 2009: 1247-1250 - [c70]Wei Wang, Chuan Xiao, Xuemin Lin, Chengqi Zhang:
Efficient approximate entity extraction with edit distance constraints. SIGMOD Conference 2009: 759-770 - [c69]Yi Chen, Wei Wang, Ziyang Liu, Xuemin Lin:
Keyword search on structured and semi-structured data. SIGMOD Conference 2009: 1005-1010 - [c68]Mahady Hasan, Muhammad Aamir Cheema, Xuemin Lin, Ying Zhang:
Efficient Construction of Safe Regions for Moving kNN Queries over Dynamic Datasets. SSTD 2009: 373-379 - [c67]Shuxiang Yang, Wenjie Zhang, Ying Zhang, Xuemin Lin:
Probabilistic Threshold Range Aggregate Query Processing over Uncertain Data. APWeb/WAIM 2009: 51-62 - [e7]Athman Bouguettaya, Xuemin Lin:
Database Technologies 2009, Twentieth Australasian Database Conference (ADC 2009), Wellington, New Zealand, 20-23 January, 2009, Proceedings. CRPIT 92, Australian Computer Society 2009, ISBN 978-1-920682-73-6 [contents] - [r1]Xuemin Lin:
Data Sketch/Synopsis. Encyclopedia of Database Systems 2009: 634 - 2008
- [j32]Bin Wang, Xiaochun Yang, Guoren Wang, Ge Yu, Lei Chen, Xiaoyang Sean Wang, Xuemin Lin:
Continually Answering Constraint k - NN Queries in Unstructured P2P Systems. J. Comput. Sci. Technol. 23(4): 538-556 (2008) - [j31]Cheqing Jin, Ke Yi, Lei Chen, Jeffrey Xu Yu, Xuemin Lin:
Sliding-window top-k queries on uncertain streams. Proc. VLDB Endow. 1(1): 301-312 (2008) - [j30]Haichuan Shang, Ying Zhang, Xuemin Lin, Jeffrey Xu Yu:
Taming verification hardness: an efficient algorithm for testing subgraph isomorphism. Proc. VLDB Endow. 1(1): 364-375 (2008) - [j29]Chuan Xiao, Wei Wang, Xuemin Lin:
Ed-Join: an efficient algorithm for similarity joins with edit distance constraints. Proc. VLDB Endow. 1(1): 933-944 (2008) - [j28]Ke Deng, Xiaofang Zhou, Heng Tao Shen, Qing Liu, Kai Xu, Xuemin Lin:
A multi-resolution surface distance model for k-NN query processing. VLDB J. 17(5): 1101-1119 (2008) - [j27]Hongzhi Wang, Jianzhong Li, Wei Wang, Xuemin Lin:
Coding-based Join Algorithms for Structural Queries on Graph-Structured XML Document. World Wide Web 11(4): 485-510 (2008) - [c66]Xuemin Lin, Ying Zhang:
Aggregate Computation over Data Streams. APWeb 2008: 10-25 - [c65]Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu:
Fast computing reachability labelings for large graphs with high compression rate. EDBT 2008: 193-204 - [c64]Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin:
Efficiently Answering Probabilistic Threshold Top-k Queries on Uncertain Data. ICDE 2008: 1403-1405 - [c63]Yi Luo, Wei Wang, Xuemin Lin:
SPARK: A Keyword Search Engine on Relational Databases. ICDE 2008: 1552-1555 - [c62]Zheng Liu, Jeffrey Xu Yu, Yiping Ke, Xuemin Lin, Lei Chen:
Spotting Significant Changing Subgraphs in Evolving Graphs. ICDM 2008: 917-922 - [c61]Bin Jiang, Jian Pei, Xuemin Lin, David W. Cheung, Jiawei Han:
Mining preferences from superior and inferior examples. KDD 2008: 390-398 - [c60]Ming Hua, Jian Pei, Wenjie Zhang, Xuemin Lin:
Ranking queries on uncertain data: a probabilistic threshold approach. SIGMOD Conference 2008: 673-686 - [c59]Jian Pei, Ming Hua, Yufei Tao, Xuemin Lin:
Query answering techniques on uncertain and probabilistic data: tutorial summary. SIGMOD Conference 2008: 1357-1364 - [c58]Wenjie Zhang, Xuemin Lin, Jian Pei, Ying Zhang:
Managing Uncertain Data: Probabilistic Approaches. WAIM 2008: 405-412 - [c57]Chuan Xiao, Wei Wang, Xuemin Lin, Jeffrey Xu Yu:
Efficient similarity joins for near duplicate detection. WWW 2008: 131-140 - [e6]Alan D. Fekete, Xuemin Lin:
Database Technologies 2008. Proceedings of the Nineteenth Australasian Database Conference, ADC 2008, January 22-25, 2008, Wollongong, NSW, Australia. CRPIT 75, Australian Computer Society 2008, ISBN 978-1-920682-56-9 [contents] - [e5]Paolo Missier, Xuemin Lin, Ander de Keijzer, Maurice van Keulen:
Proceedings of the International Workshop on Quality in Databases and Management of Uncertain Data, Auckland, New Zealand, August 2008. 2008 [contents] - 2007
- [j26]Xuemin Lin, Qing Zhang, Yidong Yuan, Qing Liu:
Error minimization in approximate range aggregates. Data Knowl. Eng. 62(1): 156-176 (2007) - [c56]Xuemin Lin:
Continuously Maintaining Order Statistics over Data Streams. ADC 2007: 7-10 - [c55]Muhammad Aamir Cheema, Yidong Yuan, Xuemin Lin:
CircularTrip: An Effective Algorithm for Continuous k NN Queries. DASFAA 2007: 863-869 - [c54]Xuemin Lin, Yidong Yuan, Qing Zhang, Ying Zhang:
Selecting Stars: The k Most Representative Skyline Operator. ICDE 2007: 86-95 - [c53]Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Haixun Wang:
Computing Compressed Multidimensional Skyline Cubes Efficiently. ICDE 2007: 96-105 - [c52]Bolin Ding, Jeffrey Xu Yu, Shan Wang, Lu Qin, Xiao Zhang, Xuemin Lin:
Finding Top-k Min-Cost Connected Trees in Databases. ICDE 2007: 836-845 - [c51]Ying Zhang, Xuemin Lin, Yidong Yuan, Masaru Kitsuregawa, Xiaofang Zhou, Jeffrey Xu Yu:
Summarizing Order Statistics over Data Streams with Duplicates. ICDE 2007: 1329-1333 - [c50]Yi Luo, Xuemin Lin, Wei Wang, Xiaofang Zhou:
Spark: top-k keyword query in relational databases. SIGMOD Conference 2007: 115-126 - [c49]Jian Pei, Bin Jiang, Xuemin Lin, Yidong Yuan:
Probabilistic Skylines on Uncertain Data. VLDB 2007: 15-26 - [c48]Ming Hua, Jian Pei, Ada Wai-Chee Fu, Xuemin Lin, Ho-fung Leung:
Efficiently Answering Top-k Typicality Queries on Large Databases. VLDB 2007: 890-901 - [e4]Guozhu Dong, Xuemin Lin, Wei Wang, Yun Yang, Jeffrey Xu Yu:
Advances in Data and Web Management, Joint 9th Asia-Pacific Web Conference, APWeb 2007, and 8th International Conference, on Web-Age Information Management, WAIM 2007, Huang Shan, China, June 16-18, 2007, Proceedings. Lecture Notes in Computer Science 4505, Springer 2007, ISBN 978-3-540-72483-4 [contents] - 2006
- [j25]Peter Eades, Qing-Wen Feng, Xuemin Lin, Hiroshi Nagamochi:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. Algorithmica 44(1): 1-32 (2006) - [j24]Zhihong Chong, Jeffrey Xu Yu, Zhengjie Zhang, Xuemin Lin, Wei Wang, Aoying Zhou:
Efficient Computation of k-Medians over Data Streams Under Memory Constraints. J. Comput. Sci. Technol. 21(2): 284-296 (2006) - [j23]Xuemin Lin, Jian Xu, Qing Zhang, Hongjun Lu, Jeffrey Xu Yu, Xiaofang Zhou, Yidong Yuan:
Approximate Processing of Massive Continuous Quantile Queries over High-Speed Data Streams. IEEE Trans. Knowl. Data Eng. 18(5): 683-698 (2006) - [j22]Kai Xu, Xiaofang Zhou, Xuemin Lin, Heng Tao Shen, Ke Deng:
A Multiresolution Terrain Model for Efficient Visualization Query Processing. IEEE Trans. Knowl. Data Eng. 18(10): 1382-1396 (2006) - [j21]Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou, Hongjun Lu:
Summarizing level-two topological relations in large spatial datasets. ACM Trans. Database Syst. 31(2): 584-630 (2006) - [j20]Jian Pei, Yidong Yuan, Xuemin Lin, Wen Jin, Martin Ester, Qing Liu, Wei Wang, Yufei Tao, Jeffrey Xu Yu, Qing Zhang:
Towards multidimensional subspace skyline analysis. ACM Trans. Database Syst. 31(4): 1335-1381 (2006) - [c47]Bin Wang, Xiaochun Yang, Guoren Wang, Lei Chen, Xiaoyang Sean Wang, Xuemin Lin, Ge Yu:
Answering Constrained k-NN Queries in Unstructured P2P Systems. DBISP2P 2006: 397-405 - [c46]Jiefeng Cheng, Jeffrey Xu Yu, Xuemin Lin, Haixun Wang, Philip S. Yu:
Fast Computation of Reachability Labeling for Large Graphs. EDBT 2006: 961-979 - [c45]Ying Zhang, Xuemin Lin, Jian Xu, Flip Korn, Wei Wang:
Space-efficient Relative Error Order Sketch over Data Streams. ICDE 2006: 51 - [c44]Ke Deng, Xiaofang Zhou, Heng Tao Shen, Kai Xu, Xuemin Lin:
Surface k-NN Query Processing. ICDE 2006: 78 - 2005
- [c43]Wei Wang, Diep Bich Do, Xuemin Lin:
Term Graph Model for Text Classification. ADMA 2005: 19-30 - [c42]Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li:
Labeling Scheme and Structural Joins for Graph-Structured XML Data. APWeb 2005: 277-289 - [c41]Qing Liu, Xuemin Lin, Yidong Yuan:
Summarizing Spatial Relations - A Hybrid Histogram. APWeb 2005: 464-476 - [c40]Hongzhi Wang, Wei Wang, Jianzhong Li, Xuemin Lin, Raymond K. Wong:
Practical Indexing XML Document for Twig Query. ASIAN 2005: 208-222 - [c39]Xuemin Lin, Yidong Yuan, Wei Wang, Hongjun Lu:
Stabbing the Sky: Efficient Skyline Computation over Sliding Windows. ICDE 2005: 502-513 - [c38]Zheng Liu, Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Wei Wang:
Locating Motifs in Time-Series Data. PAKDD 2005: 343-353 - [c37]Wei Wang, Hongzhi Wang, Hongjun Lu, Haifeng Jiang, Xuemin Lin, Jianzhong Li:
Efficient Processing of XML Path Queries Using the Disk-based F&B Index. VLDB 2005: 145-156 - [c36]Yidong Yuan, Xuemin Lin, Qing Liu, Wei Wang, Jeffrey Xu Yu, Qing Zhang:
Efficient Computation of the Skyline Cube. VLDB 2005: 241-252 - [c35]Hongzhi Wang, Wei Wang, Xuemin Lin, Jianzhong Li:
Subgraph Join: Efficient Processing Subgraph Queries on Graph-Structured XML Document. WAIM 2005: 68-80 - [c34]Yi Luo, Zheng Liu, Xuemin Lin, Wei Wang, Jeffrey Xu Yu:
Similarity Search with Implicit Object Features. WAIM 2005: 150-161 - 2004
- [j19]Xuemin Lin:
Delay Optimization in Quorum Consensus. Algorithmica 38(2): 397-413 (2004) - [c33]Qing Zhang, Xuemin Lin:
Clustering Moving Objects for Spatio-temporal Selectivity Estimation. ADC 2004: 123-130 - [c32]Xuemin Lin, Hongjun Lu, Jian Xu, Jeffrey Xu Yu:
Continuously Maintaining Quantile Summaries of the Most Recent N Elements over a Data Stream. ICDE 2004: 362-373 - [c31]Kai Xu, Xiaofang Zhou, Xuemin Lin:
Direct Mesh: a Multiresolution Approach to Terrain Visualization. ICDE 2004: 766-776 - [c30]Jian Xu, Xuemin Lin, Xiaofang Zhou:
Space Efficient Quantile Summary for Constrained Sliding Windows on a Data Stream. WAIM 2004: 34-44 - [c29]Yi Luo, Hai-Xin Lu, Xuemin Lin:
A Scalable and I/O Optimal Skyline Processing Algorithm. WAIM 2004: 218-228 - [e3]Jeffrey Xu Yu, Xuemin Lin, Hongjun Lu, Yanchun Zhang:
Advanced Web Technologies and Applications, 6th Asia-Pacific Web Conference, APWeb 2004, Hangzhou, China, April 14-17, 2004, Proceedings. Lecture Notes in Computer Science 3007, Springer 2004, ISBN 3-540-21371-6 [contents] - 2003
- [j18]Chengfei Liu, Xuemin Lin, Maria E. Orlowska, Xiaofang Zhou:
Confirmation: increasing resource availability for transactional workflows. Inf. Sci. 153: 37-53 (2003) - [j17]Xuemin Lin, Peter Eades:
Towards area requirements for drawing hierarchically planar graphs. Theor. Comput. Sci. 292(3): 679-695 (2003) - [c28]Hai-Xin Lu, Yi Luo, Xuemin Lin:
An Optimal Divide-Conquer Algorithm for 2D Skyline Queries. ADBIS 2003: 46-60 - [c27]Qing Liu, Yidong Yuan, Xuemin Lin:
Multi-resolution Algorithms for Building Spatial Histograms. ADC 2003: 145-151 - [c26]Xuemin Lin, Qing Zhang:
Error Minimization for Approximate Computation of Range Aggregate. DASFAA 2003: 165-172 - [c25]Xuemin Lin, Qing Liu, Yidong Yuan, Xiaofang Zhou:
Multiscale Histograms: Summarizing Topological Relations in Large Spatial Datasets. VLDB 2003: 814-825 - 2002
- [j16]Ding-Zhu Du, Peter Eades, Xuemin Lin:
Foreword. Theor. Comput. Sci. 289(2): 877 (2002) - [c24]Xuemin Lin, Hai-Xin Lu, Qing Zhang:
Graph Partition Based Muti-Way Spatial Joins. IDEAS 2002: 23-32 - [c23]Qing Zhang, Xuemin Lin:
On Linear-Spline Based Histograms. WAIM 2002: 354-366 - 2001
- [c22]Jiajin Le, Xuemin Lin:
On Processing Cycle Query's Strategy for Semistructure Data Model and Its Role in Design. CSCWD 2001: 384-388 - [c21]Chengfei Liu, Maria E. Orlowska, Xuemin Lin, Xiaofang Zhou:
Improving Backward Recovery in Workflow Systems. DASFAA 2001: 276-283 - [c20]Xuemin Lin:
Delay Optimizations in Quorum Consensus. ISAAC 2001: 575-586 - [c19]Xuemin Lin, Xiaomei Zhou, Chengfei Liu, Xiaofang Zhou:
Efficiently Computing Weighted Proximity Relationships in Spatial Databases. WAIM 2001: 279-290 - 2000
- [j15]Xuemin Lin:
On the computational complexity of edge concentration. Discret. Appl. Math. 101(1-3): 197-205 (2000) - [j14]Xuemin Lin, Xiaomei Zhou, Chengfei Liu:
Efficient computation of a proximity matching in spatial databases. Data Knowl. Eng. 33(1): 85-102 (2000) - [j13]Xiaomei Zhou, Xuemin Lin, Chengfei Liu, Jiannong Cao:
Spatial Query Processing Using Generalized Filter. Int. J. Cooperative Inf. Syst. 9(1-2): 77-92 (2000) - [j12]Peter Eades, Xuemin Lin:
Spring algorithms and symmetry. Theor. Comput. Sci. 240(2): 379-405 (2000) - [c18]Yijun Li, Xuemin Lin, Chi Ping Tsang:
An Efficient Distributed Algorithm for Computing Association Rules. Web-Age Information Management 2000: 109-120 - [e2]Ding-Zhu Du, Peter Eades, Vladimir Estivill-Castro, Xuemin Lin, Arun Sharma:
Computing and Combinatorics, 6th Annual International Conference, COCOON 2000, Sydney, Australia, July 26-28, 2000, Proceedings. Lecture Notes in Computer Science 1858, Springer 2000, ISBN 3-540-67787-9 [contents]
1990 – 1999
- 1999
- [j11]Xuemin Lin, Yijun Li, Chi Ping Tsang:
Applying On-line Bitmap Indexing to Reduce Counting Costs in Mining Association Rules. Inf. Sci. 120(1-4): 197-208 (1999) - [c17]Xuemin Lin, Peter Eades:
Area Minimization for Grid Visibility Representation of Hierarchically Planar Graphs. COCOON 1999: 92-102 - [c16]Xiaofang Zhou, Yanchun Zhang, Xuemin Lin, Chengfei Liu:
On the Optimization of Complex Spatial Queries. CODAS 1999: 252-263 - [c15]Chengfei Liu, Maria E. Orlowska, Xiaofang Zhou, Xuemin Lin:
Confirmation: A Solution for Non-Compensatability in Workflow Applications. ICDE 1999: 102 - [c14]Xuemin Lin, Xiaomei Zhou, Chengfei Liu:
Efficiently Matching Proximity Relationships in Spatial Databases. SSD 1999: 188-206 - [c13]Chengfei Liu, Xuemin Lin, Xiaofang Zhou, Maria E. Orlowska:
Building a Repository for Workflow Systems. TOOLS (31) 1999: 348-357 - [c12]Xuemin Lin, Chengfei Liu, Yanchun Zhang, Xiaofang Zhou:
Efficiently Computing Frequent Tree-Like Topology Patterns in a Web Environment. TOOLS (31) 1999: 440-447 - 1998
- [e1]Xuemin Lin:
Proceedings of Computing: The Fourth Australasian Theory Symposium (CATS'98), Perth, WA, Australia, February 2-3, 1998. Australian Computer Science Communications 20(3), Springer-Verlag Singapore Pte. Ltd. 1998 [contents] - 1997
- [j10]Xuemin Lin:
A Fully Distributed Quorum Consensus Method with High Fault-Tolerance and Low Communication Overhead. Theor. Comput. Sci. 185(2): 259-275 (1997) - [c11]Peter Eades, Xuemin Lin:
Spring Algorithms and Symmetry. COCOON 1997: 202-211 - [c10]Xuemin Lin, Peter Eades:
Area Requirements for Drawing Hierarchically Planar Graphs. GD 1997: 219-229 - 1996
- [j9]Peter Eades, Xuemin Lin, Roberto Tamassia:
An Algorithm for Drawing a Hierarchical Graph. Int. J. Comput. Geom. Appl. 6(2): 145-156 (1996) - [j8]Xuemin Lin, Maria E. Orlowska:
An Optimal Voting Scheme for Minimizing the Overall Communication Cost in Replicated Data Management. J. Parallel Distributed Comput. 35(1): 97-103 (1996) - [c9]Peter Eades, Qing-Wen Feng, Xuemin Lin:
Straight-Line Drawing Algorithms for Hierarchical Graphs and Clustered Graphs. GD 1996: 113-128 - [c8]Xuemin Lin, Jian Chen:
An optimal deadlock resolution algorithm in multidatabase systems. ICPADS 1996: 516-521 - [c7]Xuemin Lin, Simon Fox:
An effective parallelization of execution of multijoins in multiprocessor systems. ISPAN 1996: 63-69 - 1995
- [j7]Peter Eades, Xuemin Lin:
A heuristic for the feedback arc set problem. Australas. J Comb. 12: 15-26 (1995) - [j6]Xuemin Lin, Maria E. Orlowska:
An Efficient Processing of a Chain Join with the Minimum Communication Cost in Distributed Database Systems. Distributed Parallel Databases 3(1): 69-83 (1995) - [j5]Xuemin Lin, Maria E. Orlowska:
An Integer Linear Programming Approach to Data Allocation with the Minimum Total Communication Cost in Distributed Database Systems. Inf. Sci. 85(1-3): 1-10 (1995) - [c6]Xuemin Lin, Maria E. Orlowska:
A Highly Fault-Tolerant Quorum Consensus Method for Managing Replicated Data. COCOON 1995: 171-180 - 1994
- [c5]Xuemin Lin, Maria E. Orlowska:
An Efficient Optimal Algorithm for Minimizing the Overall Communication Cost in Replicated Data Management. ISAAC 1994: 243-251 - 1993
- [j4]Peter Eades, Xuemin Lin, Nicholas C. Wormald:
Performance Guarantees for Motion Planning with Temporal Uncertainty. Aust. Comput. J. 25(1): 21-28 (1993) - [j3]Xuemin Lin, Maria E. Orlowska, Yanchun Zhang:
A Graph Based Cluster Approach for Vertical Partitioning in Database Design. Data Knowl. Eng. 11(2): 151-169 (1993) - [j2]Peter Eades, Tao Lin, Xuemin Lin:
Two Tree Drawing Conventions. Int. J. Comput. Geom. Appl. 3(2): 133-153 (1993) - [j1]Peter Eades, Xuemin Lin, W. F. Smyth:
A Fast and Effective Heuristic for the Feedback Arc Set Problem. Inf. Process. Lett. 47(6): 319-323 (1993) - [c4]Xuemin Lin, Yanchun Zhang:
A New Graphical Method of Vertical Partitioning in Database Design. Australian Database Conference 1993: 131-144 - [c3]Xuemin Lin, Maria E. Orlowska, Yanchun Zhang:
On Data Allocation with the Minimum Overall Communication Costs in Distributed Database Design. ICCI 1993: 539-544 - 1992
- [b1]Xuemin Lin:
Analysis of algorithms for drawing graphs. University of Queensland, Australia, 1992 - [c2]Peter Eades, Tao Lin, Xuemin Lin:
Minimum Size h-v Drawings. Advanced Visual Interfaces 1992: 386-394
1980 – 1989
- 1989
- [c1]Peter Eades, Xuemin Lin:
How to draw a directed graph. VL 1989: 13-17
Coauthor Index
[j194] [j181] [c246] [j151] [c212] [c199] [c198] [i29] [j129] [j128] [j127] [j125] [c189] [j123] [j121] [c173] [c171] [j113] [j111] [j110] [j100] [j98] [c166] [i9] [i8] [i6] [j95] [j93] [j86] [c159] [c157] [c156] [c148] [j82] [j80] [j76] [c144] [c143] [c141] [c134] [c132] [c121] [j62] [c109] [c108] [c83]
[j238] [j233] [j230] [j228] [j219] [c292] [i60] [i59] [j207] [j203] [j198] [j194] [c280] [c278] [j182] [j181] [j180] [j177] [j176] [c263] [c259] [c257] [c256] [c246] [i45] [i43] [i40] [j172] [j168] [j167] [j156] [j155] [j154] [j153] [c237] [c236] [c234] [c232] [c231] [c228] [i36] [i34] [j151] [j150] [j147] [j143] [j142] [j141] [c218] [c217] [c214] [c212] [c209] [c206] [c204] [c199] [c198] [c196] [i30] [i29] [i27] [i26] [i25] [i24] [i21] [i20] [j138] [j137] [j135] [j134] [j133] [j131] [j129] [j128] [j127] [j125] [j124] [c195] [c189] [c187] [i18] [i16] [j123] [c180] [c179] [c178] [c175] [c174] [c173] [c172] [c171] [i11] [j114] [j113] [j112] [j111] [j110] [j100] [j98] [c170] [c166] [i9] [i8] [j95] [j93] [j86] [c159] [c158] [c157] [c156] [c148] [i2] [j82] [j80] [j76] [c143] [c141] [c134] [i1] [c121] [j57] [c109] [c108] [c95] [c83] [c52]
[c263] [i45] [j159] [j156] [j144] [c216] [c182] [c176] [j87] [i4] [j81] [j75] [c140] [j73] [j72] [j65] [j59] [j58] [j56] [c112] [c100] [c96] [j43] [j42] [j41] [c89] [j38] [j36] [c85] [c82] [c80] [c78] [c77] [c76] [j34] [c73] [c72] [c70] [c69] [j29] [j27] [c63] [c57] [c50] [e4] [j24] [j20] [c45] [c43] [c42] [c40] [c39] [c38] [c37] [c36] [c35] [c34]
[j242] [j240] [j239] [j238] [j237] [j234] [j233] [j232] [j228] [j227] [j225] [j224] [j221] [j219] [j218] [c301] [c300] [c297] [c295] [c293] [c292] [c290] [c289] [c287] [c286] [c285] [i66] [i65] [i64] [i63] [i62] [i60] [i58] [j214] [j211] [j210] [j209] [j205] [j203] [j202] [j201] [j200] [j198] [j195] [c282] [c280] [c279] [c275] [c274] [c273] [c272] [c271] [c269] [c267] [c266] [i57] [i56] [i55] [i52] [i51] [i49] [i48] [i47] [b2] [j183] [j182] [j180] [j179] [j178] [c263] [c261] [c260] [c259] [c258] [c257] [c255] [c253] [c252] [c251] [c250] [c249] [c248] [c245] [i46] [i45] [i44] [i43] [i42] [i41] [i40] [i38] [j174] [j173] [j172] [j170] [j169] [j168] [j167] [j161] [j160] [j158] [j154] [c239] [c238] [c237] [c236] [c235] [c233] [c232] [c230] [c228] [c224] [c222] [c220] [i35] [i31] [j150] [j149] [j144] [j143] [j142] [j141] [c218] [c217] [c215] [c214] [c213] [c212] [c211] [c209] [c201] [c200] [c197] [i30] [i24] [i23] [i22] [i20] [i19] [j140] [j139] [j138] [j137] [j134] [j133] [j132] [j126] [j124] [c195] [c193] [c192] [c191] [c188] [c187] [i18] [i16] [i15] [j123] [j121] [j118] [j117] [j116] [c186] [c180] [c175] [c174] [c172] [i12] [i11] [j114] [j112] [j110] [j109] [j107] [j104] [j102] [j101] [j100] [j99] [j97] [c170] [c168] [c167] [c165] [c164] [c163] [i10] [i8] [i7] [i6] [j96] [j95] [j94] [j91] [j90] [j89] [j86] [c160] [c159] [c156] [c154] [c152] [c150] [c148] [i5] [i4] [i3] [i2] [j82] [j79] [j78] [j77] [j75] [c146] [c145] [c144] [c141] [c140] [c137] [c136] [c134] [c133] [j72] [j71] [j70] [j68] [j67] [j66] [c132] [c131] [c130] [c129] [c128] [c127] [c125] [c124] [c122] [c120] [j65] [j62] [j61] [j55] [c118] [c117] [c116] [c114] [c113] [j52] [j50] [j49] [j48] [j47] [j46] [c106] [c104] [c103] [c102] [c101] [c99] [c98] [c97] [j45] [j43] [c94] [c93] [c92] [c91] [c90] [j38] [j37] [j36] [c87] [c82] [c81] [c80] [c76] [j34] [c72] [c71] [c67] [c64] [c60] [c58]
[j242] [j240] [j239] [j237] [j234] [j233] [j230] [j228] [j225] [j221] [j219] [j218] [c301] [c297] [c292] [c290] [c285] [i66] [i65] [i63] [i62] [i60] [i59] [j211] [j202] [j198] [j194] [c279] [c274] [c273] [c272] [i57] [i52] [j182] [j181] [j180] [j179] [j178] [j177] [j176] [c263] [c260] [c258] [c257] [c256] [c253] [c249] [c248] [c246] [i45] [i42] [i41] [i38] [j174] [j173] [j172] [j168] [j167] [j160] [j156] [j154] [j153] [c239] [c238] [c237] [c236] [c235] [c232] [c230] [c228] [i31] [j151] [j150] [j147] [j144] [j143] [j141] [c219] [c218] [c217] [c216] [c215] [c214] [c213] [c209] [c204] [c199] [c198] [c197] [i30] [i29] [i26] [i25] [i24] [i23] [i22] [i20] [j140] [j139] [j138] [j137] [j135] [j134] [j133] [j131] [j128] [j127] [j125] [j124] [c195] [c193] [c189] [i18] [i16] [j120] [j116] [c185] [c184] [c182] [c178] [c177] [c174] [c173] [c172] [c171] [i12] [i11] [j114] [j113] [j112] [j111] [j107] [j104] [j101] [j99] [j97] [c170] [c168] [c167] [c165] [c163] [i9] [j94] [j93] [j91] [j90] [j89] [c160] [c158] [c154] [c153] [c152] [i4] [i3] [i2] [j82] [j77] [j75] [c146] [c145] [c140] [c135] [c133] [i1] [j73] [j72] [j71] [j70] [j66] [c130] [c129] [c126] [c122] [c120] [j65] [j55] [c118] [c116] [c115] [c113] [j52] [j50] [j49] [j48] [j47] [c106] [c103] [c102] [c99] [j45] [c93] [c92] [c91] [j39] [j37] [j36] [c87] [c85] [c82] [c81] [c79] [c78] [j34] [c72] [c71] [c68] [c67] [j30] [c66] [c58] [c54] [c51] [c45]
manage site settings
To protect your privacy, all features that rely on external API calls from your browser are turned off by default. You need to opt-in for them to become active. All settings here will be stored as cookies with your web browser. For more information see our F.A.Q.
Unpaywalled article links
Add open access links from 
to the list of external document links (if available).
Privacy notice: By enabling the option above, your browser will contact the API of unpaywall.org to load hyperlinks to open access articles. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Unpaywall privacy policy.
Archived links via Wayback Machine
For web page which are no longer available, try to retrieve content from the 
of the Internet Archive (if available).
Privacy notice: By enabling the option above, your browser will contact the API of archive.org to check for archived content of web pages that are no longer available. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Internet Archive privacy policy.
Reference lists
Add a list of references from 
, 
, and 
to record detail pages.
load references from crossref.org and opencitations.net
Privacy notice: By enabling the option above, your browser will contact the APIs of crossref.org, opencitations.net, and semanticscholar.org to load article reference information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the Crossref privacy policy and the OpenCitations privacy policy, as well as the AI2 Privacy Policy covering Semantic Scholar.
Citation data
Add a list of citing articles from and to record detail pages.
load citations from opencitations.net
Privacy notice: By enabling the option above, your browser will contact the API of opencitations.net and semanticscholar.org to load citation information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the OpenCitations privacy policy as well as the AI2 Privacy Policy covering Semantic Scholar.
OpenAlex data
Load additional information about publications from 
.
Privacy notice: By enabling the option above, your browser will contact the API of openalex.org to load additional information. Although we do not have any reason to believe that your call will be tracked, we do not have any control over how the remote server uses your data. So please proceed with care and consider checking the information given by OpenAlex.
last updated on 2024-11-06 21:35 CET by the dblp team
all metadata released as open data under CC0 1.0 license
see also: Terms of Use | Privacy Policy | Imprint
dblp was originally created in 1993 at:
since 2018, dblp has been operated and maintained by:
the dblp computer science bibliography is funded and supported by:
