## Abstract We extend the notion of a framed net, introduced by D. Jungnickel, V. C. Mavron, and T. P. McDonough, J Combinatorial Theory A, 96 (2001), 376โ387, to that of a __d__โframed net of type โ, where __d__โโฅโ2 and 1โโคโโโโคโ__d__โ1, and we establish a correspondence between __d__โframed nets o
The geometry of linear separability in data sets
โ Scribed by Adi Ben-Israel; Yuri Levin
- Publisher
- Elsevier Science
- Year
- 2006
- Tongue
- English
- Weight
- 158 KB
- Volume
- 416
- Category
- Article
- ISSN
- 0024-3795
No coin nor oath required. For personal study only.
โฆ Synopsis
We study the geometry of datasets, using an extension of the Fisher linear discriminant to the case of singular covariance, and a new regularization procedure. A dataset is called linearly separable if its different clusters can be reliably separated by a linear hyperplane. We propose a measure of linear separability, easily computed as an angle that arises naturally in our analysis. This angle of separability assumes values between 0 and ฯ/2, with high [resp. low] values corresponding to datasets that are linearly separable, resp. inseparable.
๐ SIMILAR VOLUMES
The di โ erent characteristics between frequency domain and time domain analysis techniques are detailed for their application to in vivo MRS data sets. With the aim of quantitative analysis of MRS signals, i.e. estimation of parameters in the physical model function that describes the MRS experiment