kth.sePublications
Change search
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf
Online Feature Selection for Low-overhead Learning in Networked Systems
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science.
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Network and Systems Engineering. RISE Res Inst Sweden, Gothenburg, Sweden.ORCID iD: 0000-0002-6343-7416
KTH, School of Electrical Engineering and Computer Science (EECS), Electrical Engineering, Electronics and Embedded systems, Electronic and embedded systems. Ericsson Res, Stockholm, Sweden.ORCID iD: 0000-0003-3743-9431
KTH, School of Electrical Engineering and Computer Science (EECS), Computer Science, Network and Systems Engineering. RISE Res Inst Sweden, Gothenburg, Sweden.ORCID iD: 0000-0001-6039-8493
2021 (English)In: Proceedings of the 2021 17th International Conference on Network and Service Management: Smart Management for Future Networks and Services, CNSM 2021 / [ed] Chemouil, P Ulema, M Clayman, S Sayit, M Cetinkaya, C Secci, S, Institute of Electrical and Electronics Engineers Inc. , 2021, p. 527-529Conference paper, Published paper (Refereed)
Abstract [en]

Data-driven functions for operation and management require measurements and readings from distributed data sources for model training and prediction. While the number of candidate data sources can be very large, research has shown that it is often possible to reduce the number of data sources significantly while still allowing for accurate prediction. Consequently, there is potential to lower communication and computing resources needed to continuously extract, collect, and process this data. We demonstrate the operation of a novel online algorithm called OSFS, which sequentially processes the collected data and reduces the number of data sources for training prediction models. OSFS builds on two main ideas, namely (1) ranking the available data sources using (unsupervised) feature selection algorithms and (2) identifying stable feature sets that include only the top features. The demonstration shows the search space exploration, the iterative selection of feature sets, and the evaluation of the stability of these sets. The demonstration uses measurements collected from a KTH testbed, and the predictions relate to end-to-end KPIs for network services. 

Place, publisher, year, edition, pages
Institute of Electrical and Electronics Engineers Inc. , 2021. p. 527-529
Series
International Conference on Network and Service Management, ISSN 2165-9605
Keywords [en]
Data-driven Engineering, Feature Selection, Machine Learning, Network Management, Forecasting, Information management, Iterative methods, Online systems, Space research, Data driven, Data-source, Features selection, Features sets, Low overhead, Machine-learning, Networks management, Number of datum, Online feature selection, Feature extraction
National Category
Computer Sciences
Identifiers
URN: urn:nbn:se:kth:diva-316390DOI: 10.23919/CNSM52442.2021.9615548ISI: 000836226700084Scopus ID: 2-s2.0-85123422408OAI: oai:DiVA.org:kth-316390DiVA, id: diva2:1687842
Conference
17th International Conference on Network and Service Management, CNSM 2021, Online/Virtual, 25-29 October 2021
Note

Part of proceedings: ISBN 978-3-903176-36-2

QC 20220816

Available from: 2022-08-16 Created: 2022-08-16 Last updated: 2024-06-10Bibliographically approved

Open Access in DiVA

No full text in DiVA

Other links

Publisher's full textScopus

Authority records

Wang, XiaoxuanSamani, Forough ShahabJohnsson, AndreasStadler, Rolf

Search in DiVA

By author/editor
Wang, XiaoxuanSamani, Forough ShahabJohnsson, AndreasStadler, Rolf
By organisation
Computer ScienceNetwork and Systems EngineeringElectronic and embedded systems
Computer Sciences

Search outside of DiVA

GoogleGoogle Scholar

doi
urn-nbn

Altmetric score

doi
urn-nbn
Total: 49 hits
CiteExportLink to record
Permanent link

Direct link
Cite
Citation style
  • apa
  • ieee
  • modern-language-association-8th-edition
  • vancouver
  • Other style
More styles
Language
  • de-DE
  • en-GB
  • en-US
  • fi-FI
  • nn-NO
  • nn-NB
  • sv-SE
  • Other locale
More languages
Output format
  • html
  • text
  • asciidoc
  • rtf