Please use this identifier to cite or link to this item: https://doi.org/10.1109/TKDE.2010.34
Title: Trace-oriented feature analysis for large-scale text data dimension reduction
Authors: Yan, J.
Liu, N.
Yan, S. 
Yang, Q.
Fan, W.
Wei, W.
Chen, Z.
Keywords: Algebraic algorithms
computations on matrices
document analysis
global optimization
Issue Date: 2011
Source: Yan, J.,Liu, N.,Yan, S.,Yang, Q.,Fan, W.,Wei, W.,Chen, Z. (2011). Trace-oriented feature analysis for large-scale text data dimension reduction. IEEE Transactions on Knowledge and Data Engineering 23 (7) : 1103-1117. ScholarBank@NUS Repository. https://doi.org/10.1109/TKDE.2010.34
Abstract: Dimension reduction for large-scale text data is attracting much attention nowadays due to the rapid growth of the World Wide Web. We can categorize those popular dimension reduction algorithms into two groups: feature extraction and feature selection algorithms. In the former, new features are combined from their original features through algebraic transformation. Though many of them have been validated to be effective, these algorithms are typically associated with high computational overhead, making them difficult to be applied on real-world text data. In the latter, subsets of features are selected directly. These algorithms are widely used in real-world tasks owing to their efficiency, but are often based on greedy strategies rather than optimal solutions. An important problem remains: it has been troublesome to integrate these two types of algorithms into a single framework, making it difficult to reap the benefits from both. In this paper, we formulate the two algorithm categories through a unified optimization framework, under which we develop a novel feature selection algorithm called Trace-Oriented Feature Analysis (TOFA). In detail, we integrate the objective functions of several state-of-the-art feature extraction algorithms into a unified one under the optimization framework, and then we propose to optimize this objective function in the solution space of feature selection algorithms for dimensionality reduction. Since the proposed objective function of TOFA integrates many prominent feature extraction algorithms' objective functions, such as unsupervised Principal Component Analysis (PCA) and supervised Maximum Margin Criterion (MMC), TOFA can handle both supervised and unsupervised problems. In addition, by tuning a weight value, TOFA is also suitable to solve semisupervised learning problems. Experimental results on several real-world data sets validate the effectiveness and efficiency of TOFA in text data for dimensionality reduction purpose. © 2006 IEEE.
Source Title: IEEE Transactions on Knowledge and Data Engineering
URI: http://scholarbank.nus.edu.sg/handle/10635/57692
ISSN: 10414347
DOI: 10.1109/TKDE.2010.34
Appears in Collections:Staff Publications

Show full item record
Files in This Item:
There are no files associated with this item.

SCOPUSTM   
Citations

19
checked on Dec 5, 2017

WEB OF SCIENCETM
Citations

17
checked on Nov 4, 2017

Page view(s)

34
checked on Dec 9, 2017

Google ScholarTM

Check

Altmetric


Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.