Data

Classifying microarray cancer datasets using nearest subspace classification

Monash University
Kuldip K. Paliwal (Aggregated by) Michael C. Cohen (Aggregated by)
Viewed: [[ro.stat.viewed]] Cited: [[ro.stat.cited]] Accessed: [[ro.stat.accessed]]
ctx_ver=Z39.88-2004&rft_val_fmt=info%3Aofi%2Ffmt%3Akev%3Amtx%3Adc&rfr_id=info%3Asid%2FANDS&rft_id=info:doi10.4225/03/5a13727393276&rft.title=Classifying microarray cancer datasets using nearest subspace classification&rft.identifier=https://doi.org/10.4225/03/5a13727393276&rft.publisher=Monash University&rft.description=In this paper we implement and test the recently described nearest subspace classifier on a range of microarray cancer datasets. Its classification accuracy is tested against nearest neighbor and nearest centroid algorithms, and is shown to give a significant improvement. This classification system uses class-dependent PCA to construct a subspace for each class. Test vectors are assigned the class label of the nearest subspace, which is defined as the minimum reconstruction error across all subspaces. Furthermore, we demonstrate this distance measure is equivalent to the null-space component of the vector being analyzed. PRIB 2008 proceedings found at: http://dx.doi.org/10.1007/978-3-540-88436-1 Contributors: Monash University. Faculty of Information Technology. Gippsland School of Information Technology ; Chetty, Madhu ; Ahmad, Shandar ; Ngom, Alioune ; Teng, Shyh Wei ; Third IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB) (3rd : 2008 : Melbourne, Australia) ; Coverage: Rights: Copyright by Third IAPR International Conference on Pattern Recognition in Bioinformatics. All rights reserved.&rft.creator=Kuldip K. Paliwal&rft.creator=Michael C. Cohen&rft.date=2017&rft_rights=In Copyright&rft_subject=Bioinformatics -- Congresses&rft_subject=Computational biology -- Congresses&rft_subject=Computer vision in medicine -- Congresses&rft_subject=Computational biology -- Methods -- Congresses&rft_subject=Pattern recognition, automated -- Methods -- Congresses&rft_subject=2008&rft_subject=conference paper&rft_subject=1959.1/63710&rft_subject=monash:7862&rft_subject=Bioinformatics&rft_subject=Pattern Recognition and Data Mining&rft_subject=Bioinformatics Software&rft.type=dataset&rft.language=English Access the data

Licence & Rights:

view details

In Copyright

Access:

Other

Full description

In this paper we implement and test the recently described nearest subspace classifier on a range of microarray cancer datasets. Its classification accuracy is tested against nearest neighbor and nearest centroid algorithms, and is shown to give a significant improvement. This classification system uses class-dependent PCA to construct a subspace for each class. Test vectors are assigned the class label of the nearest subspace, which is defined as the minimum reconstruction error across all subspaces. Furthermore, we demonstrate this distance measure is equivalent to the null-space component of the vector being analyzed. PRIB 2008 proceedings found at: http://dx.doi.org/10.1007/978-3-540-88436-1 Contributors: Monash University. Faculty of Information Technology. Gippsland School of Information Technology ; Chetty, Madhu ; Ahmad, Shandar ; Ngom, Alioune ; Teng, Shyh Wei ; Third IAPR International Conference on Pattern Recognition in Bioinformatics (PRIB) (3rd : 2008 : Melbourne, Australia) ; Coverage: Rights: Copyright by Third IAPR International Conference on Pattern Recognition in Bioinformatics. All rights reserved.

Issued: 2017-11-21

Created: 2017-11-21

This dataset is part of a larger collection

Click to explore relationships graph
Identifiers