Home > Papers

 
 
An attribute reduction algorithm based on particle swarm optimization
Liu Jingyu *
State Key Laboratory of Networking and Switching Technology, Beijing University of Posts and Telecommunications, Beijing 100876
*Correspondence author
#Submitted by
Subject:
Funding: none
Opened online:15 April 2020
Accepted by: none
Citation: Liu Jingyu.An attribute reduction algorithm based on particle swarm optimization[OL]. [15 April 2020] http://en.paper.edu.cn/en_releasepaper/content/4751524
 
 
Due to the explosive growth of data, the attribute dimensions of the data sets are getting higher, and the volume is larger, which leads to increased training overhead and decreased prediction accuracy of machine learning algorithms. And most of the current attribute reduction algorithms are based on a single attribute reduction, which is not easy to obtain the global optimum and has a large amount of calculation. Based on this, this paper proposes an attribute reduction algorithm based on particle swarm optimization (ARPSO). This algorithm designs the importance function of the attribute set based on the variable precision rough set, and uses particle swarm optimization algorithm to construct the optimization space, optimizes the attribute set in the data set globally, and reduces the redundant attributes of the data set to reduce the training overhead of machine learning algorithms and improve their prediction accuracy. The experimental results show that the attribute reduction performance of the ARPSO algorithm is significantly better than the common attribute reduction algorithms, which verifies the effectiveness of it.
Keywords:Particle swarm; attribute reduction; optimization; ARPSO algorithm
 
 
 

For this paper

  • PDF (0B)
  • ● Revision 0   
  • ● Print this paper
  • ● Recommend this paper to a friend
  • ● Add to my favorite list

    Saved Papers

    Please enter a name for this paper to be shown in your personalized Saved Papers list

Tags

Add yours

Related Papers

Statistics

PDF Downloaded 14
Bookmarked 0
Recommend 0
Comments Array
Submit your papers