Bin Ruan

dblp:360/3808 · DBLP profile ↗
← Back
8ranked-venue papers
5as first author
8since 2021 · last 2027
—ORCID · conflict

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 4 first-author · 5 since 2021Artificial intelligence and machine learning · 3 · 1 first-author · 3 since 2021Graphics, computer vision, multimedia, augmented reality and games · 1 · 1 since 2021
YearPublicationVenuePosition
2027 NestStruct-Net: A structure-aware 3D segmentation network for nested tumor subregions
Bin Ruan, Tiancai Yi, Shengtao Xiao, Yebin Huang, Lifang Wei
Expert Syst. Appl.1
2026 Prediction of compression modulus of Nantong fine-grained soil based on an interpretability-driven GSA-optimized CatBoost model
Bin Ruan, Yaodong Hu, Chongjin Liu, Zhenglong Zhou
Adv. Eng. Informatics1
2026 Predicting the damping ratio of saturated coral sand using explainable artificial intelligence
Zhenglong Zhou, Lingxiao Hua, Zichao Zhu, Bin Ruan
Adv. Eng. Informatics4
2025 UGDA: A Unified Graph-Based Method with Domain-Specific Adaptation for Multi-Domain Recommendation
Bin Ruan, Yitian Tu, Zhiying Deng, Zhiqiang Guo, Jianjun Li 0010
DASFAA (5)1
2025 Multi-objective optimization design of foam concrete mechanical properties through the integration of FEM and DL
Bin Ruan, Juncheng Li 0016, Zhenglong Zhou
Adv. Eng. Informatics1
2025 Prediction of compression coefficient of Nanjing floodplain soft soil based on explainable artificial intelligence
Bin Ruan, Chongjin Liu, Zhenglong Zhou, Jianxiong Miao
Adv. Eng. Informatics1
2024 LGMRec: Local and Global Graph Learning for Multimodal Recommendation
abstract
The multimodal recommendation has gradually become the infrastructure of online media platforms, enabling them to provide personalized service to users through a joint modeling of user historical behaviors (e.g., purchases, clicks) and item various modalities (e.g., visual and textual). The majority of existing studies typically focus on utilizing modal features or modal-related graph structure to learn user local interests. Nevertheless, these approaches encounter two limitations: (1) Shared updates of user ID embeddings result in the consequential coupling between collaboration and multimodal signals; (2) Lack of exploration into robust global user interests to alleviate the sparse interaction problems faced by local interest modeling. To address these issues, we propose a novel Local and Global Graph Learning-guided Multimodal Recommender (LGMRec), which jointly models local and global user interests. Specifically, we present a local graph embedding module to independently learn collaborative-related and modality-related embeddings of users and items with local topological relations. Moreover, a global hypergraph embedding module is designed to capture global user and item embeddings by modeling insightful global dependency relations. The global embeddings acquired within the hypergraph embedding space can then be combined with two decoupled local embeddings to improve the accuracy and robustness of recommendations. Extensive experiments conducted on three benchmark datasets demonstrate the superiority of our LGMRec over various state-of-the-art recommendation baselines, showcasing its effectiveness in modeling both local and global user interests.
Zhiqiang Guo, Jianjun Li 0010, Guohui Li 0001, Chaoyang Wang 0002, Bin Ruan
AAAI6
2023 Fast 3D Object Measurement Based on Point Cloud Modeling
abstract
Automated object measurement is becoming increasingly important due to its ability to reduce manual costs, increase production efficiency, and minimize errors in various fields. In this paper, we present a novel approach to three-dimensional (3D) object measurement based on point cloud modeling. Our method introduces a fast point cloud modeling computation framework consisting of five stages: coordinate centralization, rotation and translation, noise filtering, plane projection, and geometric computation. Furthermore, we propose a fast convex hull optimization algorithm to reduce the high complexity problem of traditional convex hull calculation. Our extensive experiments demonstrate that our approach outperforms existing methods in terms of measurement error rate and time savings, with a maximum time saving of 31.03% under certain error conditions.
Gang Wang 0023, Mingliang Zhou 0001, Bin Fang 0001, Yugui Zhang, Shouqin Guan, Bin Ruan
Int. J. Pattern Recognit. Artif. Intell.6