秦小麟
Personal Homepage
Paper Publications
Dynamic feature selection algorithm based on minimum vertex cover of hypergraph
Hits:

Affiliation of Author(s):计算机科学与技术学院/人工智能学院/软件学院

Journal:Lect. Notes Comput. Sci.

Abstract:Feature selection is an important pre-processing step in many fields, such as data mining, machine learning and pattern recognition. This paper focuses on dynamically updating a subset of features with new samples arriving and provides a hypergraph model to deal with dynamic feature selection problem. Firstly, we discuss the relationship between feature selection of information system and minimum vertex cover of hypergraph, and feature selection is converted to a minimum vertex cover problem based on this relationship. Then, an algorithm for generating induced hypergraph from information system is presented, the induced hypergraph can be divided into two part: the original induced hypergraph and the added hypergraph with new samples arriving. Finally, a novel dynamic feature selection algorithm based on minimum vertex cover of hypergraph is proposed, and this algorithm only needs a small amount of computation. Experiments show that the proposed method is feasible and highly effective. © Springer International Publishing AG, part of Springer Nature 2018.

ISSN No.:0302-9743

Translation or Not:no

Date of Publication:2018-01-01

Co-author:Xie, Xiaojun

Correspondence Author:qxz

Personal information

Professor

Gender:Male

Alma Mater:南京航空学院

Education Level:Graduate with a professional diploma

Degree:Master's Degree in Engineering

School/Department:College of Computer Science and Technology

Click:

Open time:..

The Last Update Time:..


Copyright©2018- Nanjing University of Aeronautics and Astronautics·Informationization Department(Informationization Technology Center)

MOBILE Version