default search action
Google
Google Scholar
Semantic Scholar
Internet Archive Scholar
CiteSeerX
ORCIDKay Liu
Person information
Refine list
refinements active!
zoomed in on ?? of ?? records
view refined list in
export refined list as
2020 – today
- 2024
[j2]Kay Liu, Yingtong Dou, Xueying Ding, Xiyang Hu, Ruitong Zhang, Hao Peng, Lichao Sun, Philip S. Yu:
PyGOD: A Python Library for Graph Outlier Detection. J. Mach. Learn. Res. 25: 141:1-141:9 (2024)- [j1]Xiang Huang
, Hao Peng, Dongcheng Zou, Zhiwei Liu, Jianxin Li, Kay Liu, Jia Wu, Jianlin Su, Philip S. Yu:
CoSENT: Consistent Sentence Embedding via Similarity Ranking. IEEE ACM Trans. Audio Speech Lang. Process. 32: 2800-2813 (2024) - [i9]Wenjing Chang, Kay Liu, Kaize Ding, Philip S. Yu, Jianjun Yu:
Multitask Active Learning for Graph Anomaly Detection. CoRR abs/2401.13210 (2024) - [i8]Chen Wang, Fangxin Wang, Ruocheng Guo, Yueqing Liang, Kay Liu, Philip S. Yu:
Confidence-aware Fine-tuning of Sequential Recommendation Systems via Conformal Prediction. CoRR abs/2402.08976 (2024) - [i7]Qian Ma, Hongliang Chi, Hengrui Zhang, Kay Liu, Zhiwei Zhang, Lu Cheng, Suhang Wang, Philip S. Yu, Yao Ma:
Overcoming Pitfalls in Graph Contrastive Learning Evaluation: Toward Comprehensive Benchmarks. CoRR abs/2402.15680 (2024) - [i6]Fangxin Wang, Yuqing Liu, Kay Liu, Yibo Wang, Sourav Medya, Philip S. Yu:
Uncertainty in Graph Neural Networks: A Survey. CoRR abs/2403.07185 (2024) - [i5]Wenjing Chang, Kay Liu, Philip S. Yu, Jianjun Yu:
Enhancing Fairness in Unsupervised Graph Anomaly Detection through Disentanglement. CoRR abs/2406.00987 (2024) - 2023
- [c2]Fangxin Wang, Lu Cheng, Ruocheng Guo, Kay Liu, Philip S. Yu:
Equal Opportunity of Coverage in Fair Regression. NeurIPS 2023 - [i4]Fangxin Wang, Lu Cheng, Ruocheng Guo, Kay Liu, Philip S. Yu:
Equal Opportunity of Coverage in Fair Regression. CoRR abs/2311.02243 (2023) - [i3]Kay Liu, Hengrui Zhang, Ziqing Hu, Fangxin Wang, Philip S. Yu:
Data Augmentation for Supervised Graph Outlier Detection with Latent Diffusion Models. CoRR abs/2312.17679 (2023) - 2022
- [c1]Kay Liu, Yingtong Dou, Yue Zhao, Xueying Ding, Xiyang Hu, Ruitong Zhang, Kaize Ding, Canyu Chen, Hao Peng, Kai Shu, Lichao Sun, Jundong Li, George H. Chen, Zhihao Jia, Philip S. Yu:
BOND: Benchmarking Unsupervised Outlier Node Detection on Static Attributed Graphs. NeurIPS 2022 - [i2]Kay Liu, Yingtong Dou, Yue Zhao, Xueying Ding, Xiyang Hu, Ruitong Zhang, Kaize Ding, Canyu Chen, Hao Peng, Kai Shu, George H. Chen, Zhihao Jia, Philip S. Yu:
PyGOD: A Python Library for Graph Outlier Detection. CoRR abs/2204.12095 (2022) - [i1]Kay Liu, Yingtong Dou, Yue Zhao, Xueying Ding, Xiyang Hu, Ruitong Zhang, Kaize Ding, Canyu Chen, Hao Peng, Kai Shu, Lichao Sun, Jundong Li, George H. Chen, Zhihao Jia, Philip S. Yu:
Benchmarking Node Outlier Detection on Graphs. CoRR abs/2206.10071 (2022)
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-09-18 01:09 CEST 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:
