Daniel S. Yeung

Daniel S. Yeung

Auto-generated profile, based on publicly available information

Daniel S. Yeung

School of Computer Science and Engineering, South China University of Technology, Guangzhou 510006, China

Research Focus & Metrics

Academic Career Length

20Years (2007-Present)

(Calculated once Scilit publication data is synced: current year − year of first publication + 1)

Representative Publications

View All Publications
8 March 2021 in IEEE Transactions on Neural Networks and Learning Systems
Verified
Journal Article
Closed access
WLWeiwen Liu
Weiwen Liu
YZYin Zhang
Yin Zhang
JWJianling Wang
Jianling Wang
YHYun He
Yun He
JCJames Caverlee
James Caverlee
PHPheng-Ann Heng
Pheng-Ann Heng
In a modern e-commerce recommender system, it is important to understand the relationships among products. Recognizing product relationships--such as complements or substitutes--accurately is an essential task for generating better recommendation results, as well as improving explainability in recommendation. Products and their associated relationships naturally form a product graph, yet existing efforts do not fully exploit the product graph's topological structure. They usually only consider the information from directly connected products. In fact, the connectivity of products a few hops away also contains rich semantics and could be utilized for improved relationship prediction. In this work, we formulate the problem as a multilabel link prediction task and propose a novel graph neural network-based framework, item relationship graph neural network (IRGNN), for discovering multiple complex relationships simultaneously. We incorporate multihop relationships of products by recursively updating node embeddings using the messages from their neighbors. An edge relational network is designed to effectively capture relational information between products. Extensive experiments are conducted on real-world product data, validating the effectiveness of IRGNN, especially on large and sparse product graphs.


8 June 2009 in Information Sciences
Verified
Journal Article
Closed access
DYDaniel S. Yeung
Daniel S. Yeung
PCPatrick P.K. Chan
Patrick P.K. Chan
WNWing Ng
Wing Ng

3 July 2012 in Information Sciences
Verified
Journal Article
Closed access
PCPatrick P.K. Chan
Patrick P.K. Chan
DYDaniel S. Yeung
Daniel S. Yeung
WNWing Ng
Wing Ng
Chih-Min LinChih-Min Lin
Chih-Min Lin
JLJames N.K. Liu
James N.K. Liu

27 June 2018 in IEEE Transactions on Cybernetics
Verified
Journal Article
Closed access
WNWing Ng
Wing Ng
XTXing Tian
Xing Tian
WPWitold Pedrycz
Witold Pedrycz
XWXizhao Wang
Xizhao Wang
DYDaniel S. Yeung
Daniel S. Yeung
Images are uploaded to the Internet over time which makes concept drifting and distribution change in semantic classes unavoidable. Current hashing methods being trained using a given static database may not be suitable for nonstationary semantic image retrieval problems. Moreover, directly retraining a whole hash table to update knowledge coming from new arriving image data may not be efficient. Therefore, this paper proposes a new incremental hash-bit learning method. At the arrival of new data, hash bits are selected from both existing and newly trained hash bits by an iterative maximization of a 3-component objective function. This objective function is also used to weight selected hash bits to re-rank retrieved images for better semantic image retrieval results. The three components evaluate a hash bit in three different angles: 1) information preservation; 2) partition balancing; and 3) bit angular difference. The proposed method combines knowledge retained from previously trained hash bits and new semantic knowledge learned from the new data by training new hash bits. In comparison to table-based incremental hashing, the proposed method automatically adjusts the number of bits from old data and new data according to the concept drifting in the given data via the maximization of the objective function. Experimental results show that the proposed method outperforms existing stationary hashing methods, table-based incremental hashing, and online hashing methods in 15 different simulated nonstationary data environments.

1 October 2007 in Pattern Recognition
Verified
Journal Article
Closed access
DWDefeng Wang
Defeng Wang
LSLin Shi
Lin Shi
DYDaniel S. Yeung
Daniel S. Yeung
ETEric C.C. Tsang
Eric C.C. Tsang
PHPheng Ann Heng
Pheng Ann Heng