DIMENSIONALITY REDUCTION AND FITTING METHOD FOR HIGH-DIMENSIONAL DATA BASED ON SVD AND LEAST SQUARES—A CASE STUDY OF MINE DATA PROCESSING

In the digital era, the explosive growth of high-dimensional data poses significant challenges to storage, transmission, and computational efficiency. Mine data, characterized by its multi-source heterogeneity, high dynamism, and high dimensionality, presents particularly acute challenges. This paper proposes a novel method for dimensionality reduction and fitting of high-dimensional data by combining Singular Value Decomposition (SVD) with least squares, and demonstrates its first application in mine data processing. The method achieves efficient data compression and precise fitting by extracting principal singular values and vectors via SVD, projecting high-dimensional data into a low-dimensional space, and solving for optimal weight vectors using least squares. A pseudo-inverse is constructed to avoid numerical instability, ultimately completing the fitting of the target dataset. Experimental results show that the method performs exceptionally well in terms of residual distribution, model bias, data noise, and fitting adequacy: residuals approximate a normal distribution, confirming that errors primarily stem from data noise. This study provides a reliable technical pathway for processing high-dimensional mine data, with future optimizations possible through the introduction of noise reduction modules.

Institutions

Publication Details

Journal
World Journal of Information Technology 
Published
2025-08-27
DOI
https://doi.org/10.61784/wjit3052
Primary Topic
Geochemistry and Geologic Mapping
Type
article
Field-Weighted Citation Impact
0.00
Controls
|||
ALL TIME
JAN
FEB
MAR
APR
MAY
JUN
JUL
AUG
SEP
OCT
article

DIMENSIONALITY REDUCTION AND FITTING METHOD FOR HIGH-DIMENSIONAL DATA BASED ON SVD AND LEAST SQUARES—A CASE STUDY OF MINE DATA PROCESSING

World Journal of Information Technology 
Geochemistry and Geologic Mapping
article

DIMENSIONALITY REDUCTION AND FITTING METHOD FOR HIGH-DIMENSIONAL DATA BASED ON SVD AND LEAST SQUARES—A CASE STUDY OF MINE DATA PROCESSING

article en

Abstract

In the digital era, the explosive growth of high-dimensional data poses significant challenges to storage, transmission, and computational efficiency. Mine data, characterized by its multi-source heterogeneity, high dynamism, and high dimensionality, presents particularly acute challenges. This paper proposes a novel method for dimensionality reduction and fitting of high-dimensional data by combining Singular Value Decomposition (SVD) with least squares, and demonstrates its first application in mine data processing. The method achieves efficient data compression and precise fitting by extracting principal singular values and vectors via SVD, projecting high-dimensional data into a low-dimensional space, and solving for optimal weight vectors using least squares. A pseudo-inverse is constructed to avoid numerical instability, ultimately completing the fitting of the target dataset. Experimental results show that the method performs exceptionally well in terms of residual distribution, model bias, data noise, and fitting adequacy: residuals approximate a normal distribution, confirming that errors primarily stem from data noise. This study provides a reliable technical pathway for processing high-dimensional mine data, with future optimizations possible through the introduction of noise reduction modules.

World Journal of Information Technology Vol. 3(4)
Southwestern University of Finance and Economics (CN)
Openalex Percentile: Top 64%
Geochemistry and Geologic Mapping
AI Navigator

Ask Laika to Summarize, Analyze, and Connect papers live on the map.

Summarize Papers & Methodologies

Extract key findings, datasets, and comparative methods across publications.

Benchmark Rankings & Visual Analytics

Rank top research institutions, authors, funders, topics, and journals by Field-Weighted Citation Impact (FWCI) and paper volume with instant charts.

Connect Distant Disciplines

Bridge topological clusters on the map to find hidden collaborative intersections.