Local feature weighting for data classification

2Citations
Citations of this article
2Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Feature weighting is an important task in data analyze, clustering and classification. Traditional algorithms focus on a common weight vector on the whole dataset which can easily lead to sensitiveness to the distribution of data. In contrast, a novel feature weighting algorithm called local feature weighting (LFW) that assign each sample a unique weight vector is proposed in this paper. We use clustering assumption to construct optimization task. Instead of considering the total intra-class and between-class features, we focus on the clustering performance on each training sample and the optimization goals are to minimize the total distances of a training sample to others in the same class and maximize the total distances in different classes. Data weight is added to the target function to emphasis nearby samples and finally use an iterative process to solve our problem. Experiments show that the new algorithm has a good performance on data classification. In addition, we provide a simple version of LFW which has less running time but with little accuracy loss.

Cite

CITATION STYLE

APA

Jia, G., Zhao, H., Pan, Z., & Wang, L. (2017). Local feature weighting for data classification. Lecture Notes in Computer Science (Including Subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics). Springer Verlag. https://doi.org/10.1007/978-3-662-54395-5_25

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