Shiyin Tan
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Research Subjects
Shiyin Tan has a total of 10 co-authors. Here are the top co-authors by number of shared publications:
- Dongyuan Li
Center for Spatial Information Science, The University of Tokyo, Tokyo, Japan
5 shared publications - Manabu Okumura
Institute of Science Tokyo, Tokyo, Japan
4 shared publications - Renhe Jiang
The University of Tokyo, Tokyo, Japan
4 shared publications - Zhen Wang
School of Information and Communication Engineering, Tokyo Institute of Technology, Tokyo, Japan
2 shared publications - Jae-Eon Park
Institute of Science Tokyo, Tokyo, Japan
1 shared publication - Kotaro Funakoshi
Laboratory for Future Interdisciplinary Research of Science and Technology, Institute of Integrated Research, Institute of Science Tokyo, Tokyo, Japan
1 shared publication
Latest Publications
- Open Access
- 11 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 72226-72243
Biclique-Guided Graph Contrastive Learning for Recommendation
Graph Contrastive Learning (GCL) has been widely adopted in recommendation systems to learn user and item representations from implicit user–item interactions. However, standard GCL formulations define positive pairs as the same node across augmented views and treat all other nodes as negatives, leading to critical limitations in user–item interaction graphs. Specifically, such designs introduce false negatives by contrasting users or items with highly similar interaction patterns and lack explicit semantic guidance, since contrastive pairs are determined implicitly by augmentation mechanics rather than meaningful interaction structures. To address these issues, we propose a biclique-guided graph contrastive learning framework that explicitly leverages user–item interaction structures to guide positive and negative sample selection. We model groups of users and items as soft bicliques, which act as relaxed structural prototypes capturing consistent collective preference patterns. By relaxing the strict connectivity constraints of hard bicliques, our formulation avoids NP-hard exact biclique discovery and remains effective under sparse interactions and missing edges. Nodes within the same soft biclique form positive contrastive pairs, while nodes across different bicliques provide more reliable negatives, injecting explicit semantic supervision beyond instance-level or clustering-based heuristics. Extensive experiments on multiple benchmark datasets demonstrate consistent performance improvements and superior representation quality over state-of-the-art contrastive recommendation methods.
- 11 May 2026
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Access
- Vol. 14, 72226-72243
Open AccessBiclique-Guided Graph Contrastive Learning for Recommendation
Graph Contrastive Learning (GCL) has been widely adopted in recommendation systems to learn user and item representations from implicit user–item interactions. However, standard GCL formulations define positive pairs as the same node across augmented views and treat all other nodes as negatives, leading to critical limitations in user–item interaction graphs. Specifically, such designs introduce false negatives by contrasting users or items with highly similar interaction patterns and lack explicit semantic guidance, since contrastive pairs are determined implicitly by augmentation mechanics rather than meaningful interaction structures. To address these issues, we propose a biclique-guided graph contrastive learning framework that explicitly leverages user–item interaction structures to guide positive and negative sample selection. We model groups of users and items as soft bicliques, which act as relaxed structural prototypes capturing consistent collective preference patterns. By relaxing the strict connectivity constraints of hard bicliques, our formulation avoids NP-hard exact biclique discovery and remains effective under sparse interactions and missing edges. Nodes within the same soft biclique form positive contrastive pairs, while nodes across different bicliques provide more reliable negatives, injecting explicit semantic supervision beyond instance-level or clustering-based heuristics. Extensive experiments on multiple benchmark datasets demonstrate consistent performance improvements and superior representation quality over state-of-the-art contrastive recommendation methods.
- Open Access
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 296-304
Video-based Transparent Object Segmentation via Temporal Feature Aggregation
- 27 October 2025
- Published by Association for Computing Machinery (ACM)
- p. 296-304
Open AccessVideo-based Transparent Object Segmentation via Temporal Feature Aggregation
- Open Access
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 2790-2800
Taming Recommendation Bias with Causal Intervention on Evolving Personal Popularity
- 3 August 2025
- Published by Association for Computing Machinery (ACM)
- p. 2790-2800
Open AccessTaming Recommendation Bias with Causal Intervention on Evolving Personal Popularity
- Open Access
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1423-1433
A Unified Retrieval Framework with Document Ranking and EDU Filtering for Multi-document Summarization
- 13 July 2025
- Published by Association for Computing Machinery (ACM)
- p. 1423-1433
Open AccessA Unified Retrieval Framework with Document Ranking and EDU Filtering for Multi-document Summarization
- Open Access
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4059-4063
Temporal and Topological Augmentation-based Cross-view Contrastive Learning Model for Temporal Link Prediction
- 21 October 2023
- Published by Association for Computing Machinery (ACM)
- p. 4059-4063
Open AccessTemporal and Topological Augmentation-based Cross-view Contrastive Learning Model for Temporal Link Prediction