Best-Fit Subspaces

Sven A. Wegner ()

Chapter Chapter 6 in Mathematical Introduction to Data Science, 2024, pp 81-87 from Springer

Abstract: Abstract Given an unlabeled dataset, we first define the notion of k-best fitting subspaces as the solution(s) of a minimization task. This is similar to the method of least squares from Chapter 2 , but this time all coordinates of the data points are considered (and not only those designated as labels). By reformulating the initial minimization problem into a maximization problem, we present the greedy algorithm for calculating a best-fit subspace.

Date: 2024
References: Add references at CitEc
Citations:

There are no downloads for this item, see the EconPapers FAQ for hints about obtaining it.

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:spr:sprchp:978-3-662-69426-8_6

Ordering information: This item can be ordered from
http://www.springer.com/9783662694268

DOI: 10.1007/978-3-662-69426-8_6

Access Statistics for this chapter

More chapters in Springer Books from Springer
Bibliographic data for series maintained by Sonal Shukla () and Springer Nature Abstracting and Indexing ().