no code implementations • 4 Aug 2023 • Michael Ng, Hanrui Wu, Andy Yip
The analysis sheds light on the design of hypergraph filters in collaborative networks, for instance, how the data and hypergraph filters should be scaled to achieve uniform stability of the learning process.
no code implementations • MM '22: Proceedings of the 30th ACM International Conference on Multimedia 2022 • Huafeng Liu, Liping Jing, Dahai Yu, Mingjie Zhou, Michael Ng
In this paper, we propose an intention neural process model (INP) for user cold-start recommendation (i. e., user with very few historical interactions), a novel extension of the neural stochastic process family using a general meta learning strategy with intrinsic and extrinsic intention learning for robust user preference learning.
1 code implementation • 15 Jul 2021 • Wei Liu, Pingping Zhang, Yinjie Lei, Xiaolin Huang, Jie Yang, Michael Ng
The effectiveness and superior performance of our approach are validated through comprehensive experiments in a range of applications.
no code implementations • 23 May 2019 • Ye Liu, Junjun Pan, Michael Ng
Deep neural networks have achieved a great success in solving many machine learning and computer vision problems.
no code implementations • 11 May 2019 • Xi-Le Zhao, Wen-Hao Xu, Tai-Xiang Jiang, Yao Wang, Michael Ng
By integrating deterministic low-rankness prior to the data-driven deep prior, we suggest a novel regularized tensor completion model for multi-dimensional image completion.
no code implementations • 8 Feb 2019 • Wen-Hao Xu, Xi-Le Zhao, Michael Ng
Recently, there has been a lot of research into tensor singular value decomposition (t-SVD) by using discrete Fourier transform (DFT) matrix.
no code implementations • 20 Mar 2018 • Jin Zeng, Gene Cheung, Michael Ng, Jiahao Pang, Cheng Yang
Due to discrete observations of the patches on the manifold, we approximate the manifold dimension computation defined in the continuous domain with a patch-based graph Laplacian regularizer and propose a new discrete patch distance measure to quantify the similarity between two same-sized surface patches for graph construction that is robust to noise.