default search action
Xiangyu Ke
Person information
- affiliation: Zhejiang University, Hangzhou, China
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
- [j13]Yuxiang Wang
, Chengjie Gu, Xiaoliang Xu
Efficient and effective (k, P)-core-based community search over attributed heterogeneous information networks. Inf. Sci. 661: 120076 (2024) - [j12]Tingyang Chen
View-based Explanations for Graph Neural Networks. Proc. ACM Manag. Data 2(1): 40:1-40:27 (2024) - [j11]Mengzhao Wang
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment. Proc. ACM Manag. Data 2(1): V2mod014:1-V2mod014:27 (2024) - [j10]Yifan Zhu
GTS: GPU-based Tree Index for Fast Similarity Search. Proc. ACM Manag. Data 2(3): 142 (2024) - [j9]Zhicheng Liang, Yu Yang, Xiangyu Ke, Xiaokui Xiao, Yunjun Gao:
A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs. Proc. VLDB Endow. 17(11): 3666-3679 (2024) - [j8]Mengzhao Wang, Haotian Wu, Xiangyu Ke, Yunjun Gao, Xiaoliang Xu, Lu Chen:
An Interactive Multi-modal Query Answering System with Retrieval-Augmented Large Language Models. Proc. VLDB Endow. 17(12): 4333-4336 (2024) - [c14]Tingyang Chen, Dazhuo Qiu, Yinghui Wu, Arijit Khan, Xiangyu Ke, Yunjun Gao:
View-based Explanations for Graph Neural Networks (Extended Abstract). ICDEW 2024: 1-2 - [c13]Yuxiang Wang, Shuzhan Ye, Xiaoliang Xu, Yuxia Geng, Zhenghe Zhao, Xiangyu Ke, Tianxing Wu:
Scalable Community Search with Accuracy Guarantee on Attributed Graphs. ICDE 2024: 2737-2750 - [c12]Linshan Qiu, Zhonggen Li, Xiangyu Ke, Lu Chen, Yunjun Gao:
Accelerating Biclique Counting on GPU. ICDE 2024: 3191-3203 - [c11]Linshan Qiu, Lu Chen, Hailiang Jie, Xiangyu Ke, Yunjun Gao, Yang Liu, Zetao Zhang:
GPU-Accelerated Batch-Dynamic Subgraph Matching. ICDE 2024: 3204-3216 - [c10]Mengzhao Wang, Xiangyu Ke, Xiaoliang Xu, Lu Chen, Yunjun Gao, Pinpin Huang, Runkai Zhu:
MUST: An Effective and Scalable Framework for Multimodal Search of Target Modality. ICDE 2024: 4747-4759 - [c9]Yuxiang Wang, Xiaoxuan Gou
Scalable Community Search over Large-scale Graphs based on Graph Transformer. SIGIR 2024: 1680-1690 - [c8]Tingyang Chen
User-friendly, Interactive, and Configurable Explanations for Graph Neural Networks with Graph Views. SIGMOD Conference Companion 2024: 512-515 - [i16]Tingyang Chen, Dazhuo Qiu, Yinghui Wu, Arijit Khan, Xiangyu Ke, Yunjun Gao:
View-based Explanations for Graph Neural Networks. CoRR abs/2401.02086 (2024) - [i15]Mengzhao Wang, Weizhi Xu, Xiaomeng Yi, Songlin Wu, Zhangyang Peng, Xiangyu Ke, Yunjun Gao, Xiaoliang Xu, Rentong Guo, Charles Xie:
Starling: An I/O-Efficient Disk-Resident Graph Index Framework for High-Dimensional Vector Similarity Search on Data Segment. CoRR abs/2401.02116 (2024) - [i14]Linshan Qiu, Lu Chen, Hailiang Jie, Xiangyu Ke, Yunjun Gao, Yang Liu, Zetao Zhang:
GPU-Accelerated Batch-Dynamic Subgraph Matching. CoRR abs/2401.17018 (2024) - [i13]Yuxiang Wang, Shuzhan Ye, Xiaoliang Xu, Yuxia Geng, Zhenghe Zhao, Xiangyu Ke, Tianxing Wu:
Scalable Community Search with Accuracy Guarantee on Attributed Graphs. CoRR abs/2402.17242 (2024) - [i12]Linshan Qiu, Zhonggen Li, Xiangyu Ke, Lu Chen, Yunjun Gao:
Accelerating Biclique Counting on GPU. CoRR abs/2403.07858 (2024) - [i11]Yifan Zhu, Ruiyao Ma, Baihua Zheng, Xiangyu Ke, Lu Chen, Yunjun Gao:
GTS: GPU-based Tree Index for Fast Similarity Search. CoRR abs/2404.00966 (2024) - [i10]Zhicheng Liang, Yu Yang, Xiangyu Ke, Xiaokui Xiao, Yunjun Gao:
A Benchmark Study of Deep-RL Methods for Maximum Coverage Problems over Graphs. CoRR abs/2406.14697 (2024) - [i9]Mengzhao Wang, Haotian Wu, Xiangyu Ke, Yunjun Gao, Xiaoliang Xu, Lu Chen:
An Interactive Multi-modal Query Answering System with Retrieval-Augmented Large Language Models. CoRR abs/2407.04217 (2024) - 2023
- [j7]Xueqin Chang, Xiangyu Ke, Lu Chen, Congcong Ge, Ziheng Wei, Yunjun Gao:
Host Profit Maximization: Leveraging Performance Incentives and User Flexibility. Proc. VLDB Endow. 17(1): 51-64 (2023) - [j6]Xin-Wei Cai, Xiangyu Ke, Kai Wang, Lu Chen, Tianming Zhang, Qing Liu, Yunjun Gao:
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs. Proc. VLDB Endow. 17(4): 657-670 (2023) - [j5]Yuxiang Wang
Efficient and Effective Academic Expert Finding on Heterogeneous Graphs through (k, 𝒫)-Core based Embedding. ACM Trans. Knowl. Discov. Data 17(6): 85:1-85:35 (2023) - [c7]Xiaoxuan Gou, Xiaoliang Xu, Xiangying Wu, Runhuai Chen, Yuxiang Wang, Tianxing Wu, Xiangyu Ke
Effective and Efficient Community Search with Graph Embeddings. ECAI 2023: 891-898 - [c6]Arkaprava Saha
Voting-based Opinion Maximization. ICDE 2023: 544-557 - [c5]Arkaprava Saha
Most Probable Densest Subgraphs. ICDE 2023: 1447-1460 - [i8]Xin-Wei Cai, Xiangyu Ke, Kai Wang, Lu Chen, Tianming Zhang, Qing Liu, Yunjun Gao:
Efficient Temporal Butterfly Counting and Enumeration on Temporal Bipartite Graphs. CoRR abs/2306.00893 (2023) - [i7]Mengzhao Wang, Xiangyu Ke, Xiaoliang Xu, Lu Chen, Yunjun Gao, Pinpin Huang, Runkai Zhu:
MUST: An Effective and Scalable Framework for Multimodal Search of Target Modality. CoRR abs/2312.06397 (2023) - 2022
- [j4]Xiangyu Ke
Multi-relation Graph Summarization. ACM Trans. Knowl. Discov. Data 16(5): 82:1-82:30 (2022) - [j3]Xiangyu Ke
Reliability Maximization in Uncertain Graphs. IEEE Trans. Knowl. Data Eng. 34(2): 894-913 (2022) - [c4]Xiaoliang Xu
Academic Expert Finding via $(k, \mathcal{P})$-Core based Embedding over Heterogeneous Graphs. ICDE 2022: 338-351 - [i6]Arkaprava Saha, Xiangyu Ke, Arijit Khan, Laks V. S. Lakshmanan:
Voting-based Opinion Maximization. CoRR abs/2209.06756 (2022) - [i5]Arkaprava Saha, Xiangyu Ke, Arijit Khan, Cheng Long:
Most Probable Densest Subgraphs. CoRR abs/2212.08820 (2022) - 2021
- [c3]Xiangyu Ke, Arijit Khan
Reliability Maximization in Uncertain Graphs (Extended Abstract). ICDE 2021: 2332-2333 - [i4]Xiangyu Ke, Arijit Khan, Francesco Bonchi:
Multi-relation Graph Summarization. CoRR abs/2112.15488 (2021)
2010 – 2019
- 2019
- [b1]Xiangyu Ke:
Querying and mining complex graphs : uncertainty and multi-relations. Nanyang Technological University, Singapore, 2019 - [j2]Xiangyu Ke
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs. Proc. VLDB Endow. 12(8): 864-876 (2019) - [i3]Xiangyu Ke, Arijit Khan, Mohammad Al Hasan, Rojin Rezvansangsari:
Budgeted Reliability Maximization in Uncertain Graphs. CoRR abs/1903.08587 (2019) - [i2]Xiangyu Ke, Arijit Khan, Leroy Lim Hong Quan:
An In-Depth Comparison of s-t Reliability Algorithms over Uncertain Graphs. CoRR abs/1904.05300 (2019) - 2018
- [j1]Xiangyu Ke
A Demonstration of PERC: Probabilistic Entity Resolution With Crowd Errors. Proc. VLDB Endow. 11(12): 1922-1925 (2018) - [c2]Xiangyu Ke
Finding Seeds and Relevant Tags Jointly: For Targeted Influence Maximization in Social Networks. SIGMOD Conference 2018: 1097-1111 - 2017
- [c1]Vijaya Krishna Yalavarthi, Xiangyu Ke
Select Your Questions Wisely: For Entity Resolution With Crowd Errors. CIKM 2017: 317-326 - [i1]Vijaya Krishna Yalavarthi, Xiangyu Ke, Arijit Khan:
Probabilistic Entity Resolution with Imperfect Crowd. CoRR abs/1701.08288 (2017)
Coauthor Index
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-12-22 19:01 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: