Qiansheng Cheng
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Qiansheng Cheng has a total of 13 co-authors. Here are the top co-authors by number of shared publications:
- Benyu Zhang
Microsoft Research Asia, 49 Zhichun Road, Beijing, 100080, P.R. China.
1 shared publication - Benyu Zhang
Microsoft Research Asia
1 shared publication Dong Xu
1 shared publication- Hong-Jiang Zhang
Microsoft Advanced Technology Center
1 shared publication - Jun Yan
School of Mathematical Science, Peking University
1 shared publication - Ning Liu
Tsinghua University
1 shared publication
Latest Publications
- 30 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 17 (4) , 468-477
Nonlinear Discriminant Analysis on Embedded Manifold
Traditional manifold learning algorithms, such as ISOMAP, LLE, and Laplacian Eigenmap, mainly focus on uncovering the latent low-dimensional geometry structure of the training samples in an unsupervised manner where useful class information is ignored. Therefore, the derived low-dimensional representations are not necessarily optimal in discriminative capability. In this paper, we study the discriminant analysis problem by considering the nonlinear manifold structure of data space. To this end, firstly, a new clustering algorithm, called Intra-Cluster Balanced K-Means (ICBKM), is proposed to partition the samples into multiple clusters while ensure that there are balanced samples for the classes within each cluster; approximately, each cluster can be considered as a local patch on the embedded manifold. Then, the local discriminative projections for different clusters are simultaneously calculated by optimizing the global Fisher Criterion based on the cluster weighted data representation. Compared with traditional linear/kernel discriminant analysis (KDA) algorithms, our proposed algorithm has the following characteristics: 1) it essentially is a KDA algorithm with specific geometry-adaptive-kernel tailored to the specific data structure, in contrast to traditional KDA in which the kernel is fixed and independent to the data set; 2) it is approximately a locally linear while globally nonlinear discriminant analyzer; 3) it does not need to store the original samples for computing the low-dimensional representation of a new data; and 4) it is computationally efficient compared with traditional KDA when the sample number is large. The toy problem on artificial data demonstrates the effectiveness of our proposed algorithm in deriving discriminative representations for problems with nonlinear classification hyperplane. The face recognition experiments on YALE and CMU PIE databases show that our proposed algorithm significantly outperforms linear discriminant analysis (LDA) as well as Mixture LDA, and has higher accuracy than KDA with traditional kernels
- 30 April 2007
- Published by Institute of Electrical and Electronics Engineers (IEEE) in IEEE Transactions on Circuits and Systems for Video Technology
- Vol. 17 (4) , 468-477
Nonlinear Discriminant Analysis on Embedded Manifold
Traditional manifold learning algorithms, such as ISOMAP, LLE, and Laplacian Eigenmap, mainly focus on uncovering the latent low-dimensional geometry structure of the training samples in an unsupervised manner where useful class information is ignored. Therefore, the derived low-dimensional representations are not necessarily optimal in discriminative capability. In this paper, we study the discriminant analysis problem by considering the nonlinear manifold structure of data space. To this end, firstly, a new clustering algorithm, called Intra-Cluster Balanced K-Means (ICBKM), is proposed to partition the samples into multiple clusters while ensure that there are balanced samples for the classes within each cluster; approximately, each cluster can be considered as a local patch on the embedded manifold. Then, the local discriminative projections for different clusters are simultaneously calculated by optimizing the global Fisher Criterion based on the cluster weighted data representation. Compared with traditional linear/kernel discriminant analysis (KDA) algorithms, our proposed algorithm has the following characteristics: 1) it essentially is a KDA algorithm with specific geometry-adaptive-kernel tailored to the specific data structure, in contrast to traditional KDA in which the kernel is fixed and independent to the data set; 2) it is approximately a locally linear while globally nonlinear discriminant analyzer; 3) it does not need to store the original samples for computing the low-dimensional representation of a new data; and 4) it is computationally efficient compared with traditional KDA when the sample number is large. The toy problem on artificial data demonstrates the effectiveness of our proposed algorithm in deriving discriminative representations for problems with nonlinear classification hyperplane. The face recognition experiments on YALE and CMU PIE databases show that our proposed algorithm significantly outperforms linear discriminant analysis (LDA) as well as Mixture LDA, and has higher accuracy than KDA with traditional kernels
- 4 April 2006
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 12 (2-3) , 249-273
Mining Adaptive Ratio Rules from Distributed Data Sources
- 4 April 2006
- Published by Springer Nature in Data Mining and Knowledge Discovery
- Vol. 12 (2-3) , 249-273
Mining Adaptive Ratio Rules from Distributed Data Sources
- 3 October 2002
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 132 (1) , 83-90
The stability problem for fuzzy bidirectional associative memories
- 3 October 2002
- Published by Elsevier in Fuzzy Sets and Systems
- Vol. 132 (1) , 83-90
The stability problem for fuzzy bidirectional associative memories
- 1 September 2000
- Published by Springer Nature in Chinese Science Bulletin
- Vol. 45 (18) , 1726-1728
Nonlinear fusion filters based on prediction and smoothing
- 1 September 2000
- Published by Springer Nature in Chinese Science Bulletin
- Vol. 45 (18) , 1726-1728
Nonlinear fusion filters based on prediction and smoothing