Distributed Feature Selection Considering Data Pricing Based on Edge Computing in Electricity Spot Markets

With the rapid development of information technology, the multisource heterogeneous data containing meaningful information have been significantly generated by various edge devices in Internet of Energy, which is one of essential foundations of many knowledge discovery tasks based on edge computing....

Ausführliche Beschreibung

Gespeichert in:
Bibliographische Detailangaben
Veröffentlicht in:IEEE internet of things journal 2023-02, Vol.10 (3), p.2231-2244
Hauptverfasser: Hu, Yufei, Guan, Xin, Hu, Benran, Liu, Yongnan, Chen, Hongyang, Ohtsuki, Tomoaki
Format: Artikel
Sprache:eng
Schlagworte:
Online-Zugang:Volltext bestellen
Tags: Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
Beschreibung
Zusammenfassung:With the rapid development of information technology, the multisource heterogeneous data containing meaningful information have been significantly generated by various edge devices in Internet of Energy, which is one of essential foundations of many knowledge discovery tasks based on edge computing. For some complicated tasks, essential features are owned by different data sellers offering data by blockchains. With limited budgets, buying features are crucial steps in knowledge discovery tasks in electricity spot markets, especially for learning-based algorithms. However, there are lack of proper data pricing mechanisms tailored to dynamic learning processes. Besides, existing methods cannot efficiently employ edge computing servers to obtain optimal policies for selecting features according to dynamic pricing with limited budgets. To overcome such drawbacks, a data pricing mechanism is proposed in this article, which consists of static and dynamic pricing parts. Based on this mechanism, given limited budgets, a feature selection (FS) algorithm considering multiple new factors is proposed, which offers near-optimal solutions for FS at different scenarios. Numeric results show the effectiveness of the proposed algorithms.
ISSN:2327-4662
2327-4662
DOI:10.1109/JIOT.2021.3127894