Endre søk
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf
Online Feature Selection for Efficient Learning in Networked Systems
KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Digital futures. KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Nätverk och systemteknik.ORCID-id: 0000-0002-2414-3108
KTH, Skolan för elektroteknik och datavetenskap (EECS), Datavetenskap, Nätverk och systemteknik. KTH, Skolan för elektroteknik och datavetenskap (EECS), Centra, Digital futures.ORCID-id: 0000-0001-6039-8493
2022 (engelsk)Inngår i: IEEE Transactions on Network and Service Management, E-ISSN 1932-4537, Vol. 19, nr 3, s. 2885-2898Artikkel i tidsskrift (Fagfellevurdert) Published
Abstract [en]

Current AI/ML methods for data-driven engineering use models that are mostly trained offline. Such models can be expensive to build in terms of communication and computing costs, and they rely on data that is collected over extended periods of time. Further, they become out-of-date when changes in the system occur. To address these challenges, we investigate online learning techniques that automatically reduce the number of available data sources for model training. We present an online algorithm called Online Stable Feature Set Algorithm (OSFS), which selects a small feature set from a large number of available data sources after receiving a small number of measurements. The algorithm is initialized with a feature ranking algorithm, a feature set stability metric, and a search policy. We perform an extensive experimental evaluation of this algorithm using traces from an in-house testbed and from two external datasets. We find that OSFS achieves a massive reduction in the size of the feature set by 1-3 orders of magnitude on all investigated datasets. Most importantly, we find that the accuracy of a predictor trained on a OSFS-produced feature set is somewhat better than when the predictor is trained on a feature set obtained through offline feature selection. OSFS is thus shown to be effective as an online feature selection algorithm and robust regarding the sample interval used for feature selection. We also find that, when concept drift in the data underlying the model occurs, its effect can be mitigated by recomputing the feature set and retraining the prediction model.

sted, utgiver, år, opplag, sider
Institute of Electrical and Electronics Engineers (IEEE) , 2022. Vol. 19, nr 3, s. 2885-2898
Emneord [en]
Feature extraction, Data models, Computational modeling, Predictive models, Task analysis, Soft sensors, Monitoring, Data-driven engineering, machine learning (ML), dimensionality reduction, online learning, online feature selection
HSV kategori
Identifikatorer
URN: urn:nbn:se:kth:diva-321009DOI: 10.1109/TNSM.2022.3180936ISI: 000866556800068Scopus ID: 2-s2.0-85131743339OAI: oai:DiVA.org:kth-321009DiVA, id: diva2:1708478
Merknad

QC 20251002

Tilgjengelig fra: 2022-11-04 Laget: 2022-11-04 Sist oppdatert: 2025-10-02bibliografisk kontrollert

Open Access i DiVA

Fulltekst mangler i DiVA

Andre lenker

Forlagets fulltekstScopus

Person

Wang, XiaoxuanStadler, Rolf

Søk i DiVA

Av forfatter/redaktør
Wang, XiaoxuanStadler, Rolf
Av organisasjonen
I samme tidsskrift
IEEE Transactions on Network and Service Management

Søk utenfor DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric

doi
urn-nbn
Totalt: 78 treff
RefereraExporteraLink to record
Permanent link

Direct link
Referera
Referensformat
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Annet format
Fler format
Språk
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Annet språk
Fler språk
Utmatningsformat
  • html
  • text
  • asciidoc
  • rtf