Y
Yeow Meng Chee
Researcher at National University of Singapore
Publications - 226
Citations - 3290
Yeow Meng Chee is an academic researcher from National University of Singapore. The author has contributed to research in topics: Linear code & Block code. The author has an hindex of 28, co-authored 211 publications receiving 2781 citations. Previous affiliations of Yeow Meng Chee include Information Technology Institute & Media Development Authority.
Papers
More filters
Proceedings Article
Personalized ranking metric embedding for next new POI recommendation
TL;DR: This paper proposes a personalized ranking metric embedding method (PRME) to model personalized check-in sequences and develops a PRME-G model, which integrates sequential information, individual preference, and geographical influence, to improve the recommendation performance.
Proceedings ArticleDOI
Keyword Search in Spatial Databases: Towards Searching by Document
TL;DR: This work addresses a novel spatial keyword query called the m-closest keywords (mCK) query, which aims to find the spatially closest tuples which match m user-specified keywords, and introduces a new index called the bR*-tree, which is an extension of the R-tree.
Proceedings Article
POI2Vec: Geographical Latent Representation for Predicting Future Visitors
TL;DR: This work proposes a new latent representation model POI2Vec that is able to incorporate the geographical influence, which has been shown to be very important in modeling user mobility behavior, and proposes a method to jointly model the user preference and POI sequential transition influence for predicting potential visitors for a given POI.
Journal ArticleDOI
On the Security of Index Coding With Side Information
TL;DR: It is proved that for sufficiently large Q, an optimal linear index code which is strongly secure against such an adversary has length κq+μ+2δ .
Journal ArticleDOI
Influence Spreading Path and Its Application to the Time Constrained Social Influence Maximization Problem and Beyond
TL;DR: It is shown that the problem is NP-hard, and the monotonicity and submodularity of the time constrained influence spread function is proved, and a greedy algorithm is developed based on this, which is developed to improve the algorithm scalability.