scispace - formally typeset
M

Michael K. Ng

Researcher at University of Hong Kong

Publications -  658
Citations -  24376

Michael K. Ng is an academic researcher from University of Hong Kong. The author has contributed to research in topics: Cluster analysis & Computer science. The author has an hindex of 72, co-authored 608 publications receiving 20492 citations. Previous affiliations of Michael K. Ng include The Chinese University of Hong Kong & Vanderbilt University.

Papers
More filters
Journal ArticleDOI

Categorical data clustering with automatic selection of cluster number

TL;DR: A new categorical data clustering algorithm with automatic selection of k is proposed, which extends the k-modes clustering algorithms by introducing a penalty term to the objective function to make more clusters compete for objects.
Journal ArticleDOI

Multiscale Feature Tensor Train Rank Minimization for Multidimensional Image Recovery.

TL;DR: Zhang et al. as mentioned in this paper proposed a novel multiscale feature tensorization by exploiting the MSFs of multidimensional images, which not only helps to recover the missing values on a higher level, but also benefits subsequent image applications.
Journal ArticleDOI

On the Convergence of Nonconvex Minimization Methods for Image Recovery

TL;DR: The main contribution of this paper is to show the convergence of these alternating minimization schemes, based on the Kurdyka-Lojasiewicz property, to show that the iterates generated by the alternating minimizations scheme, converges to a critical point of this nonconvex nonsmooth objective function.
Journal ArticleDOI

Multi-label collective classification via Markov chain based learning method

TL;DR: The proposed algorithm is shown to be better than those of the binary relevance multi-label algorithm, collective classification algorithms (wvRN, ICA and Gibbs), and the ICML algorithm for the tested MLCC problems.
Journal ArticleDOI

Orthogonal Nonnegative Matrix Factorization by Sparsity and Nuclear Norm Optimization

TL;DR: It is demonstrated the coefficient matrix can be sparse and low-rank in the orthogonal nonnegative matrix factorization.