2011
DOI: 10.1016/j.ipl.2011.01.011
|View full text |Cite
|
Sign up to set email alerts
|

The regularized least squares algorithm and the problem of learning halfspaces

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2015
2015
2019
2019

Publication Types

Select...
3

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 30 publications
0
1
0
Order By: Relevance
“…where α i , β i and γ i are determined based on the leastsquare method that is usually used for forecast work [14]. With three crucial parameters α 1 , β 1 and γ 1 determined, we obtain the first sine function S 1 (t) as well as the first decomposed sequence (or say, the first yielded sequence) Y t1 .…”
Section: A Msfd Methodsmentioning
confidence: 99%
“…where α i , β i and γ i are determined based on the leastsquare method that is usually used for forecast work [14]. With three crucial parameters α 1 , β 1 and γ 1 determined, we obtain the first sine function S 1 (t) as well as the first decomposed sequence (or say, the first yielded sequence) Y t1 .…”
Section: A Msfd Methodsmentioning
confidence: 99%