# Finding the best fitted hyperplane

Printable View

• December 14th 2008, 03:21 PM
TriKri
Finding the best fitted hyperplane
Given a number of points in $\Bbb{R}^n$, how can you find (one of) the hyperplane(s) from which, according to the least square method, the points is closest located to? That is, minimizing the sum of the square distances from each point to the hyperplane.
All times are GMT -8. The time now is 04:13 AM.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 0, "mathjax_display_tex": 0, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 1, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "github"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "english_confidence": 0.9030493497848511, "perplexity_flag": "middle"}