Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Tianhui Ma

dblp:180/5363 · DBLP profile ↗
← Back
4ranked-venue papers
3as first author
2since 2021 · last 2025
0000-0003-3693-3104ORCID · corroborated

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

Artificial intelligence and machine learning · 2 · 2 first-author · 2 since 2021Graphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-author · 1 since 2021Computer networks · 1Databases, data management, data science and information retrieval · 1 · 1 first-author · 1 since 2021

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 100%

Topics — the 2 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems › set recommendation
bundle recommendation
0.912025
Enhancing Long-Tail Bundle Recommendations Utilizing Composition Pattern Modeling · IJCAI 2025
Recommender systems
representation learning for recommendation
0.912025
Enhancing Long-Tail Bundle Recommendations Utilizing Composition Pattern Modeling · IJCAI 2025

Methods — techniques the papers use, named apart from their topics

prototype learning · 0.9contrastive learning · 0.9
YearPublicationVenuePosition
2025 Enhancing Long-Tail Bundle Recommendations Utilizing Composition Pattern Modeling
abstract
Bundle recommendation aims to provide users with a one-stop service by offering a collection of related items. However, these systems face a significant challenge, where a small portion of bundles accumulate most interactions while the long-tail bundles receive few interactions.This imbalance leads to poor performance for long-tail bundles despite their potential to satisfy diverse user needs. Existing long-tail item recommendation methods fail to effectively address this problem, as long-tail bundle recommendation requires not only capturing the user-bundle interactions but also the item compositions in different bundles. Therefore, in this paper, we propose Composition-Aware Long-tail Bundle Recommendation (CALBRec), which leverages the inherent composition patterns shared across different bundles as valuable signals for further representation augmentation and recommendation enhancement. Specifically, to solve the complexity of modeling shared composition patterns due to the exponential explosion caused by the growing number of items and bundle sizes, we first introduce a composition-aware tail adapter to capture the shared composition patterns and then adaptively integrate them into individual bundle representations. Moreover, to mitigate the impact of noise in user-bundle interaction data, we propose to map the bundle representations into a set of learnable prototypes, and we further propose a prototype learning module to combine the composition patterns with interaction signals for tail bundles. Extensive experiments on three public datasets demonstrate that our method can improve the performance on bundle recommendation significantly, especially on the long-tail bundles.
Tianhui Ma, Shuyao Wang, Zhi Zheng 0008, Hui Xiong 0001
IJCAI1
2025 Large Language Models Are Not Stable Recommender Systems: A Position Bias Perspective
Tianhui Ma, Zhi Zheng 0008, Hengshu Zhu, Hui Xiong 0001
KSEM (1)1
2017 Stochastic online control for energy-harvesting wireless networks with battery imperfections
abstract
In energy harvesting (EH) network, the energy storage devices (i.e., batteries) are usually not perfect. In this paper, we consider a practical battery model with finite battery capacity, energy (dis-)charging loss, and energy dissipation. Taking into account such battery imperfections, we rely on the Lyapunov optimization technique to develop a stochastic online control scheme that aims to maximize the utility of data rates for EH multi-hop wireless networks. It is established that the proposed algorithm can provide a feasible and efficient data admission, power allocation, routing and scheduling solution, without requiring any statistical knowledge of the stochastic channel, data-traffic, and EH processes.
Tianhui Ma, Xin Wang 0003
ICASSP1
2016 Stochastic Online Control for Energy-Harvesting Wireless Networks With Battery Imperfections
abstract
In energy harvesting (EH) networks, the energy storage devices (i.e., batteries) are usually not perfect. In this paper, we consider a practical battery model with finite battery capacity, energy (dis-)charging loss, and energy dissipation. Taking into account such battery imperfections, we rely on the Lyapunov optimization technique to develop a stochastic online control scheme that aims to maximize the utility of data rates for EH multi-hop wireless networks. It is established that the proposed algorithm can provide a feasible and efficient data admission, power allocation, routing and scheduling solution, without requiring any statistical knowledge of the stochastic channel, data-traffic, and EH processes. Numerical results demonstrate the merit of the proposed scheme.
Xin Wang 0003, Tianhui Ma
IEEE Trans. Wirel. Commun.2