Combination of Feature Selection and Learning Methods for IoT Data Fusion
In this paper, we propose five data fusion schemes for the Internet of Things (IoT) scenario,which are Relief and Perceptron (Re-P), Relief and Genetic Algorithm Particle Swarm Optimization (Re-GAPSO), Genetic Algorithm and Artificial Neural Network (GA-ANN), Rough and Perceptron (Ro-P)and Rough and...
Saved in:
| Main Authors: | , |
|---|---|
| Format: | Article |
| Language: | English |
| Published: |
Amirkabir University of Technology
2017-12-01
|
| Series: | AUT Journal of Electrical Engineering |
| Subjects: | |
| Online Access: | https://eej.aut.ac.ir/article_1960_5b7511e4f87d3b6a9eb1a6bc95cececc.pdf |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| Summary: | In this paper, we propose five data fusion schemes for the Internet of Things (IoT) scenario,which are Relief and Perceptron (Re-P), Relief and Genetic Algorithm Particle Swarm Optimization (Re-GAPSO), Genetic Algorithm and Artificial Neural Network (GA-ANN), Rough and Perceptron (Ro-P)and Rough and GAPSO (Ro-GAPSO). All the schemes consist of four stages, including preprocessingthe data set based on curve fitting, reducing the data dimension and identifying the most effective featuresets according to data correlation, training classification algorithms, and finally predicting new databased on classification algorithms. The results derived from five compound schemes are investigated andcompared with each other with three metrics, namely, Quality of Train (QoT) Accuracy (Ac) and StorageCapacity (SC). While the Re-P scheme is only capable of separating classes that are linearly separable,Re-GAPSO one is a dynamic method, appropriate for constantly changing problems of the real life. Onthe other hand, GA-ANN is a Wrapper method and despite Relief can adapt itself to the machine learningalgorithm. Meanwhile, Ro-P scheme is useful for analyzing vague and imprecise information and, unlikeGA-ANN, has less calculative costs. Among these five schemes, Ro-GAPSO is a more precise one, whichhas less calculative cost and does not become stuck in local minima. Experimental results show that Re-Poutperforms other proposed and existing methods in terms of computational time complexity. |
|---|---|
| ISSN: | 2588-2910 2588-2929 |