Feature Selection Using Principal Feature Analysis
| dc.contributor.author | Lu, Yijuan | |
| dc.contributor.author | Cohen, Ira | |
| dc.contributor.author | Zhou, Xiang Sean | |
| dc.contributor.author | Tian, Qi | |
| dc.date.accessioned | 2023-10-24T14:23:00Z | |
| dc.date.available | 2023-10-24T14:23:00Z | |
| dc.date.issued | 2007-12 | |
| dc.description.abstract | Dimensionality reduction of a feature set is a common preprocessing step used for pattern recognition and classification applications. Principal Component Analysis (PCA) is one of the popular methods used, and can be shown to be optimal using different optimality criteria. However, it has the disadvantage that measurements from all the original features are used in the projection to the lower dimensional space. This paper proposes a novel method for dimensionality reduction of a feature set by choosing a subset of the original features that contains most of the essential information, using the same criteria as PCA. We call this method Principal Feature Analysis (PFA). The proposed method is successfully applied for choosing the principal features in face tracking and content-based image retrieval (CBIR) problems. Automated annotation of digital pictures has been a highly challenging problem for computer scientists since the invention of computers. The capability of annotating pictures by computers can lead to breakthroughs in a wide range of applications including Web image search, online picture-sharing communities, and scientific experiments. In our work, by advancing statistical modeling and optimization techniques, we can train computers about hundreds of semantic concepts using example pictures from each concept. The ALIPR (Automatic Linguistic Indexing of Pictures - Real Time) system of fully automatic and high speed annotation for online pictures has been constructed. Thousands of pictures from an Internet photo-sharing site, unrelated to the source of those pictures used in the training process, have been tested. The experimental results show that a single computer processor can suggest annotation terms in real-time and with good accuracy. | |
| dc.description.department | Computer Science | |
| dc.identifier.uri | https://hdl.handle.net/20.500.12588/2131 | |
| dc.language.iso | en_US | |
| dc.publisher | UTSA Department of Computer Science | |
| dc.relation.ispartofseries | Technical Report; CS-TR-2007-011 | |
| dc.subject | algorithms | |
| dc.subject | theory | |
| dc.subject | performance | |
| dc.subject | experimentation | |
| dc.subject | feature extraction | |
| dc.subject | feature selection | |
| dc.subject | principal component analysis | |
| dc.subject | discriminant analysis | |
| dc.title | Feature Selection Using Principal Feature Analysis | |
| dc.type | Technical Report |