Graph embedding to improve supervised classification and novel class detection: Application to prostate cancer

30Citations
Citations of this article
44Readers
Mendeley users who have this article in their library.

This article is free to access.

Abstract

Recently there has been a great deal of interest in algorithms for constructing low-dimensional feature-space embeddings of high dimensional data sets in order to visualize inter- and intra-class relationships. In this paper we present a novel application of graph embedding in improving the accuracy of supervised classification schemes, especially in cases where object class labels cannot be reliably ascertained. By refining the initial training set of class labels we seek to improve the prior class distributions and thus classification accuracy. We also present a novel way of visualizing the class embeddings which makes it easy to appreciate inter-class relationships and to infer the presence of new classes which were not part of the original classification. We demonstrate the utility of the method in detecting prostatic adenocarcinoma from high-resolution MRI. © Springer-Verlag Berlin Heidelberg 2005.

Cite

CITATION STYLE

APA

Madabhushi, A., Shi, J., Rosen, M., Tomaszeweski, J. E., & Feldman, M. D. (2005). Graph embedding to improve supervised classification and novel class detection: Application to prostate cancer. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 3749 LNCS, pp. 729–737). https://doi.org/10.1007/11566465_90

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free