Skip to main navigation Skip to search Skip to main content

Dynamic Graph Learning for Feature Selection

  • Lei Zhu*
  • , Jingjing Li
  • , Zheng Zhang
  • *Corresponding author for this work
  • Shandong Normal University
  • University of Electronic Science and Technology of China
  • Harbin Institute of Technology Shenzhen

Research output: Chapter in Book/Report/Conference proceedingChapterpeer-review

Abstract

In the era of big data, data presents multi-view, high-dimensional and complex characteristics. For one thing, with multi-view features, the data could be characterized more precisely and comprehensively from different perspectives. For another, high-dimensional multi-view features inevitably generate expensive computation costs and cause massive storage costs. Moreover, since raw data generally contains adverse noise, outlying entries, irrelevant and redundant features, the intrinsic dimension of the data may be much lower than the dimension of the raw data. The low-dimensional and robust data representation can effectively improve model efficiency as well as accuracy and thus is vital for downstream tasks in various fields.

Original languageEnglish
Title of host publicationSynthesis Lectures on Computer Science
PublisherSpringer Nature
Pages33-90
Number of pages58
DOIs
StatePublished - 2024
Externally publishedYes

Publication series

NameSynthesis Lectures on Computer Science
VolumePart F1448
ISSN (Print)1932-1228
ISSN (Electronic)1932-1686

Fingerprint

Dive into the research topics of 'Dynamic Graph Learning for Feature Selection'. Together they form a unique fingerprint.

Cite this