Skip to main navigation Skip to search Skip to main content

Introduction

  • 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

We find ourselves immersed in an era defined by the exponential growth of data, encompassing images, videos, and documents. As the volume of data escalates, the extraction of numerous features becomes necessary, leading to the challenge known as the curse of dimensionality. Within this high-dimensional data lie redundant information and concealed correlations, surpassing the capabilities of traditional manual processing. In the domains of pattern recognition and data mining, dimension reduction and data clustering emerge as pivotal learning techniques. Dimension reduction seeks to project data from high-dimensional spaces into lower-dimensional spaces, yielding a more concise and compact representation. By reducing the complexity of data processing and facilitating the discovery of data structure information, dimension reduction enables enhanced visualization and accelerates data analysis.

Original languageEnglish
Title of host publicationSynthesis Lectures on Computer Science
PublisherSpringer Nature
Pages1-13
Number of pages13
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 'Introduction'. Together they form a unique fingerprint.

Cite this