2018 IEEE Second International Conference on Data Stream Mining &Amp; Processing (DSMP) 2018
DOI: 10.1109/dsmp.2018.8478584
|View full text |Cite
|
Sign up to set email alerts
|

Finite Generalization of the Offline Spectral Learning

Abstract: We study the problem of offline learning discrete functions on polynomial threshold units over specified set of polynomial. Our approach is based on the generalization of the classical "Relaxation" method of solving linear inequalities. We give theoretical reason justifying heuristic modification improving the performance of spectral learning algorithm. We demonstrate that if the normalizing factor satisfies sufficient conditions, then the learning procedure is finite and stops after some steps, producing the … Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2019
2019
2021
2021

Publication Types

Select...
6

Relationship

0
6

Authors

Journals

citations
Cited by 17 publications
(1 citation statement)
references
References 6 publications
0
1
0
Order By: Relevance
“…The zoom level is defined by the number of items which can be displayed on the view without scrolling. The software developed can be used during various data mining tasks [1,3,14,15,19].…”
Section: Principal Component Analysismentioning
confidence: 99%
“…The zoom level is defined by the number of items which can be displayed on the view without scrolling. The software developed can be used during various data mining tasks [1,3,14,15,19].…”
Section: Principal Component Analysismentioning
confidence: 99%