Issue No. 03 - March (2006 vol. 18)
DOI Bookmark: http://doi.ieeecomputersociety.org/10.1109/TKDE.2006.45
Dimensionality reduction is an essential data preprocessing technique for large-scale and streaming data classification tasks. It can be used to improve both the efficiency and the effectiveness of classifiers. Traditional dimensionality reduction approaches fall into two categories: Feature Extraction and Feature Selection. Techniques in the feature extraction category are typically more effective than those in feature selection category. However, they may break down when processing large-scale data sets or data streams due to their high computational complexities. Similarly, the solutions provided by the feature selection approaches are mostly solved by greedy strategies and, hence, are not ensured to be optimal according to optimized criteria. In this paper, we give an overview of the popularly used feature extraction and selection algorithms under a unified framework. Moreover, we propose two novel dimensionality reduction algorithms based on the Orthogonal Centroid algorithm (OC). The first is an Incremental OC (IOC) algorithm for feature extraction. The second algorithm is an Orthogonal Centroid Feature Selection (OCFS) method which can provide optimal solutions according to the OC criterion. Both are designed under the same optimization criterion. Experiments on Reuters Corpus Volume-1 data set and some public large-scale text data sets indicate that the two algorithms are favorable in terms of their effectiveness and efficiency when compared with other state-of-the-art algorithms.
Index Terms- Feature extraction, feature selection, orthogonal centroid algorithm.
Benyu Zhang, Zheng Chen, Weiguo Fan, Jun Yan, Qiansheng Cheng, Shuicheng Yan, Wensi Xi, Ning Liu, Qiang Yang, "Effective and Efficient Dimensionality Reduction for Large-Scale and Streaming Data Preprocessing", IEEE Transactions on Knowledge & Data Engineering, vol. 18, no. , pp. 320-333, March 2006, doi:10.1109/TKDE.2006.45