Feature Reduction in Graph Analysis.docVIP

Sensors 2008, 8, 4758-4773; DOI: 10.3390/s8084758 OPEN ACCESS sensors ISSN 1424-8220 /sensors Article Feature Reduction in Graph Analysis Rapepun Piriyakul and Punpiti Piamsa-nga * Department of Computer Engineering, Faculty of Engineering, Kasetsart University, Jatujak, Bangkok, 10900, Thailand; Tel.: +66ext 1419; Fax: +66 E-mail: rapepunnight@ * Author to whom correspondence should be addressed; E-mail: pp@ku.ac.th Received: 10 July 2008; in revised form: 7 August 2008 / Accepted: 7 August 2008 / Published: 19 August 2008 Abstract: A common approach to improve medical image classification is to add more features to the classifiers; however, this increases the time required for preprocessing raw data and training the classifiers, and the increase in features is not always beneficial. The number of commonly used features in the literature for training of image feature classifiers is over 50. Existing algorithms for selecting a subset of available features for image analysis fail to adequately eliminate redundant features. This paper presents a new selection algorithm based on graph analysis of interactions among features and between features to classifier decision. A modification of path analysis is done by applying regression analysis, multiple logistic and posterior Bayesian inference in order to eliminate features that provide the same contributions. A database of 113 mammograms from the Mammographic Image Analysis Society was used in the experiments. Tested on two classifiers – ANN and logistic regression – cancer detection accuracy (true positive and false-positive rates) using a 13-feature set selected by our algorithm yielded substantially similar accuracy as using a 26-feature set selected by SFS and results using all 50-features. However, the 13-feature greatly reduced the amount of computation needed. Keywords: Path Analysis, Gra