Normal parameter reduction in soft set based on particle swarm optimization algorithm

Parameter reduction in soft set is a combinatorial problem. In the past, the problem of normal parameter reduction in soft set is usually be solved by deleting dispensable parameters, that is, by the trial and error method to search the dispensable parameters. This manual method usually need much ti...

Full description

Saved in:
Bibliographic Details
Published in:Applied mathematical modelling 2015-08, Vol.39 (16), p.4808-4820
Main Authors: Kong, Zhi, Jia, Wenhua, Zhang, Guodong, Wang, Lifu
Format: Article
Language:English
Subjects:
Normal parameter reduction
Particle swarm optimization
Reduction
Soft set
Citations: Items that this one cites
Items that cite this one
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Parameter reduction in soft set is a combinatorial problem. In the past, the problem of normal parameter reduction in soft set is usually be solved by deleting dispensable parameters, that is, by the trial and error method to search the dispensable parameters. This manual method usually need much time to reduce unnecessary parameters, and the method is more suitable for small data. For the large data, however, it is impossible for people to reduce parameters in soft set. In this paper, the particle swarm optimization is applied to reduce parameters in soft set. Firstly, a definition is introduced to define the dispensable core, and some cases about the dispensable core are discussed. Then the normal parameter reduction model is built and the particle swarm optimization algorithm is employed to reduce the parameters. Experiments have shown that the method is feasible and fast.
ISSN:0307-904X
DOI:10.1016/j.apm.2015.03.055