Piecewise Linear Regression Based on Plane Clustering
| Autor: | Qiaolin Ye, Li Zhang, Hongxin Yang, Fuquan Zhang, Xijian Fan, Liyong Fu, Xubing Yang |
|---|---|
| Jazyk: | angličtina |
| Rok vydání: | 2019 |
| Předmět: |
General Computer Science
General Engineering Linearity 020206 networking & telecommunications closed-form solution 02 engineering and technology minimum square error Piecewise linear function Data point Piecewise linear regression Linear regression 0202 electrical engineering electronic engineering information engineering Piecewise Applied mathematics 020201 artificial intelligence & image processing General Materials Science lcsh:Electrical engineering. Electronics. Nuclear engineering Segmented regression Cluster analysis optimization lcsh:TK1-9971 Eigenvalues and eigenvectors Mathematics |
| Zdroj: | IEEE Access, Vol 7, Pp 29845-29855 (2019) |
| ISSN: | 2169-3536 |
| Popis: | Piecewise linear regressions have shown many successful applications in image denoising, signal process, and data mining fields. In essence, they attempt to seek multiple linear functions (piecewise/stepwise function) to fit the given scatter data points by various methodologies, typically point-centered clustering methods, such as ${k}$ -means or fuzzy c means. Obviously, it is reasonable that plane-centered clustering is more suitable for capturing the linearities in data. In this paper, we propose an efficient piecewise linear regression method based on ${k}$ -plane clustering, termed as PlrPC. The proposed method first partitions the data into multiple plane-centered clusters and then analytically compute corresponding piecewise linear functions. Compared with the state-to-the-art linear regressors, the advantages of the PlrPC lie in fourfold: 1) it is generated from plane clustering, which is truly coincident with geometrical intuition; 2) to fuse the linear characteristics into plane clustering, a new implicit regression method is proposed; 3) a new plane jump method is proposed to detect the number of clusters, and; 4) the leading problem can be solved by ordinary eigenvalue problems. The experimental results will show the aforesaid characters on some artificial and some benchmark datasets. |
| Databáze: | OpenAIRE |
| Externí odkaz: |
|