activity
20092021
most citedA Convex Sparse PCA for Feature Analysis

104 citations · 318 across the 24 of their papers we have counts for

collaborators
Showing cs.LGShow all

10 papers · 1 filter

cs.LG2020★ 3 cited

Federated Doubly Stochastic Kernel Learning for Vertically Partitioned Data

Bin Gu, Zhiyuan Dang, Xiang Li +1

In a lot of real-world data mining and machine learning applications, data are provided by multiple providers and each maintains private records of different feature sets about com…

cs.LG2019★ 2 cited

Robust Linear Discriminant Analysis Using Ratio Minimization of L1,2-Norms

Feiping Nie, Hua Wang, Zheng Wang +1

As one of the most popular linear subspace learning methods, the Linear Discriminant Analysis (LDA) method has been widely studied in machine learning community and applied to many…

cs.LG2017★ 55 cited

Deep Clustering via Joint Convolutional Autoencoder Embedding and Relative Entropy Minimization

Kamran Ghasedi Dizaji, Amirhossein Herandi, Cheng Deng +2

Image clustering is one of the most important computer vision applications, which has been extensively studied in literature. However, current clustering methods mostly suffer from…

cs.LG2016★ 1 cited

A Closed Form Solution to Multi-View Low-Rank Regression

Shuai Zheng, Xiao Cai, Chris Ding +2

Real life data often includes information from different channels. For example, in computer vision, we can describe an image using different image features, such as pixel intensity…

cs.LG2016★ 11 cited

Clinical Information Extraction via Convolutional Neural Network

Peng Li, Heng Huang

We report an implementation of a clinical information extraction tool that leverages deep neural network to annotate event spans and their attributes from raw clinical notes and pa…

cs.LG2016★ 11 cited

Non-Greedy L21-Norm Maximization for Principal Component Analysis

Feiping Nie, Heng Huang

Principal Component Analysis (PCA) is one of the most important unsupervised methods to handle high-dimensional data. However, due to the high computational complexity of its eigen…

cs.LG2015★ 2 cited

Theoretic Analysis and Extremely Easy Algorithms for Domain Adaptive Feature Learning

Wenhao Jiang, Cheng Deng, Wei Liu +3

Domain adaptation problems arise in a variety of applications, where a training dataset from the \textit{source} domain and a test dataset from the \textit{target} domain typically…

cs.LG2014★ 104 cited

A Convex Sparse PCA for Feature Analysis

Xiaojun Chang, Feiping Nie, Yi Yang +1

Principal component analysis (PCA) has been widely applied to dimensionality reduction and data pre-processing for different applications in engineering, biology and social science…

cs.LG2014★ 4 cited

Improved Spectral Clustering via Embedded Label Propagation

Xiaojun Chang, Feiping Nie, Yi Yang +1

Spectral clustering is a key research topic in the field of machine learning and data mining. Most of the existing spectral clustering algorithms are built upon Gaussian Laplacian…

cs.LG2012★ 28 cited

An Iterative Locally Linear Embedding Algorithm

Deguang Kong, Chris H. Q. Ding, Heng Huang +1

Local Linear embedding (LLE) is a popular dimension reduction method. In this paper, we first show LLE with nonnegative constraint is equivalent to the widely used Laplacian embedd…