Export Citations
Save this search
Please login to be able to save your searches and receive alerts for new content matching your search criteria.
- research-articleOctober 2024
HC-GST: Heterophily-aware Distribution Consistency based Graph Self-training
CIKM '24: Proceedings of the 33rd ACM International Conference on Information and Knowledge ManagementPages 2326–2335https://doi.org/10.1145/3627673.3679622Graph self-training (GST), which selects and assigns pseudo-labels to unlabeled nodes, is popular for tackling label sparsity in graphs. However, recent study on homophily graphs show that GST methods could introduce and amplify distribution shift ...
- research-articleOctober 2024
Shape-aware Graph Spectral Learning
CIKM '24: Proceedings of the 33rd ACM International Conference on Information and Knowledge ManagementPages 2692–2701https://doi.org/10.1145/3627673.3679604Spectral Graph Neural Networks (GNNs) are gaining attention for their ability to surpass the limitations of message-passing GNNs. They rely on supervision from downstream tasks to learn spectral filters that capture useful graph frequency information. ...
- research-articleAugust 2024JUST ACCEPTED
Towards Prototype-Based Self-Explainable Graph Neural Network
ACM Transactions on Knowledge Discovery from Data (TKDD), Just Accepted https://doi.org/10.1145/3689647Graph Neural Networks (GNNs) have shown great ability in modeling graph-structured data for various domains. However, GNNs are known as black-box models that lack interpretability. Without understanding their inner working, we cannot fully trust them, ...
- research-articleAugust 2024
Rethinking Graph Backdoor Attacks: A Distribution-Preserving Perspective
KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 4386–4397https://doi.org/10.1145/3637528.3671910Graph Neural Networks (GNNs) have shown remarkable performance in various tasks. However, recent works reveal that GNNs are vulnerable to backdoor attacks. Generally, backdoor attack poisons the graph by attaching backdoor triggers and the target class ...
- research-articleAugust 2024
Multi-source Unsupervised Domain Adaptation on Graphs with Transferability Modeling
KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 4479–4489https://doi.org/10.1145/3637528.3671829In this paper, we tackle a new problem ofmulti-source unsupervised domain adaptation (MSUDA) for graphs, where models trained on annotated source domains need to be transferred to the unsupervised target graph for node classification. Due to the ...
-
- research-articleAugust 2024
Addressing Shortcomings in Fair Graph Learning Datasets: Towards a New Benchmark
KDD '24: Proceedings of the 30th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 5602–5612https://doi.org/10.1145/3637528.3671616Fair graph learning plays a pivotal role in numerous practical applications. Recently, many fair graph learning methods have been proposed; however, their evaluation often relies on poorly constructed semi-synthetic datasets or substandard real-world ...
- research-articleMay 2024
Hierarchical Query Classification in E-commerce Search
WWW '24: Companion Proceedings of the ACM Web Conference 2024Pages 338–345https://doi.org/10.1145/3589335.3648332E-commerce platforms typically store and structure product information and search data in a hierarchy. Efficiently categorizing user search queries into a similar hierarchical structure is paramount in enhancing user experience on e-commerce platforms as ...
- research-articleMay 2024
Disambiguated Node Classification with Graph Neural Networks
WWW '24: Proceedings of the ACM Web Conference 2024Pages 914–923https://doi.org/10.1145/3589334.3645637Graph Neural Networks (GNNs) have demonstrated significant success in learning from graph-structured data across various domains. Despite their great successful, one critical challenge is often overlooked by existing works, i.e., the learning of message ...
- research-articleApril 2024
Recent Developments in Recommender Systems: A Survey [Review Article]
IEEE Computational Intelligence Magazine (COMPINT), Volume 19, Issue 2Pages 78–95https://doi.org/10.1109/MCI.2024.3363984In this technical survey, the latest advancements in the field of recommender systems are comprehensively summarized. The objective of this study is to provide an overview of the current state-of-the-art in the field and highlight the latest trends in the ...
- research-articleMarch 2024
Interpretable Imitation Learning with Dynamic Causal Relations
- Tianxiang Zhao,
- Wenchao Yu,
- Suhang Wang,
- Lu Wang,
- Xiang Zhang,
- Yuncong Chen,
- Yanchi Liu,
- Wei Cheng,
- Haifeng Chen
WSDM '24: Proceedings of the 17th ACM International Conference on Web Search and Data MiningPages 967–975https://doi.org/10.1145/3616855.3635827Imitation learning, which learns agent policy by mimicking expert demonstration, has shown promising results in many applications such as medical treatment regimes and self-driving vehicles. However, it remains a difficult task to interpret control ...
- research-articleMarch 2024
Distribution Consistency based Self-Training for Graph Neural Networks with Sparse Labels
WSDM '24: Proceedings of the 17th ACM International Conference on Web Search and Data MiningPages 712–720https://doi.org/10.1145/3616855.3635793Few-shot node classification poses a significant challenge for Graph Neural Networks (GNNs) due to insufficient supervision and potential distribution shifts between labeled and unlabeled nodes. Self-training has emerged as a widely popular framework to ...
- research-articleMay 2024
Certifiably robust graph contrastive learning
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing SystemsArticle No.: 744, Pages 17008–17037Graph Contrastive Learning (GCL) has emerged as a popular unsupervised graph representation learning method. However, it has been shown that GCL is vulnerable to adversarial attacks on both the graph structure and node attributes. Although empirical ...
- research-articleMay 2024
Simple and asymmetric graph contrastive learning without augmentations
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing SystemsArticle No.: 710, Pages 16129–16152Graph Contrastive Learning (GCL) has shown superior performance in representation learning in graph-structured data. Despite their success, most existing GCL methods rely on prefabricated graph augmentation and homophily assumptions. Thus, they fail to ...
- research-articleMay 2024
Amazon-M2: a multilingual multi-locale shopping session dataset for recommendation and text generation
- Wei Jin,
- Haitao Mao,
- Zheng Li,
- Haoming Jiang,
- Chen Luo,
- Hongzhi Wen,
- Haoyu Han,
- Hanqing Lu,
- Zhengyang Wang,
- Ruirui Li,
- Zhen Li,
- Monica Cheng,
- Rahul Goutam,
- Haiyang Zhang,
- Karthik Subbian,
- Suhang Wang,
- Yizhou Sun,
- Jiliang Tang,
- Bing Yin,
- Xianfeng Tang
NIPS '23: Proceedings of the 37th International Conference on Neural Information Processing SystemsArticle No.: 351, Pages 8006–8026Modeling customer shopping intentions is a crucial task for e-commerce, as it directly impacts user experience and engagement. Thus, accurately understanding customer preferences is essential for providing personalized recommendations. Session-based ...
- research-articleDecember 2023
Learning fair models without sensitive attributes: A generative approach
AbstractMost existing fair classifiers rely on sensitive attributes to achieve fairness. However, for many scenarios, we cannot obtain sensitive attributes due to privacy and legal issues. The lack of sensitive attributes challenges many existing fair ...
- research-articleOctober 2023
Towards Fair Graph Neural Networks via Graph Counterfactual
CIKM '23: Proceedings of the 32nd ACM International Conference on Information and Knowledge ManagementPages 669–678https://doi.org/10.1145/3583780.3615092Graph neural networks have shown great ability in representation (GNNs) learning on graphs, facilitating various tasks. Despite their great performance in modeling graphs, recent works show that GNNs tend to inherit and amplify the bias from training ...
- research-articleOctober 2023
Faithful and Consistent Graph Neural Network Explanations with Rationale Alignment
ACM Transactions on Intelligent Systems and Technology (TIST), Volume 14, Issue 5Article No.: 92, Pages 1–23https://doi.org/10.1145/3616542Uncovering rationales behind predictions of graph neural networks (GNNs) has received increasing attention over recent years. Instance-level GNN explanation aims to discover critical input elements, such as nodes or edges, that the target GNN relies upon ...
- research-articleSeptember 2023
STAN: Stage-Adaptive Network for Multi-Task Recommendation by Learning User Lifecycle-Based Representation
RecSys '23: Proceedings of the 17th ACM Conference on Recommender SystemsPages 602–612https://doi.org/10.1145/3604915.3608796Recommendation systems play a vital role in many online platforms, with their primary objective being to satisfy and retain users. As directly optimizing user retention is challenging, multiple evaluation metrics are often employed. Current methods ...
- research-articleAugust 2023
Exploiting Intent Evolution in E-commercial Query Recommendation
- Yu Wang,
- Zhengyang Wang,
- Hengrui Zhang,
- Qingyu Yin,
- Xianfeng Tang,
- Yinghan Wang,
- Danqing Zhang,
- Limeng Cui,
- Monica Cheng,
- Bing Yin,
- Suhang Wang,
- Philip S. Yu
KDD '23: Proceedings of the 29th ACM SIGKDD Conference on Knowledge Discovery and Data MiningPages 5162–5173https://doi.org/10.1145/3580305.3599821Aiming at a better understanding of the search goals in the user search sessions, recent query recommender systems explicitly model the reformulations of queries, which hopes to estimate the intents behind these reformulations and thus benefit the next-...