Stretchy binary classification.
In this article, we introduce an analytic formulation for compressive binary classification. The formulation seeks to solve the least ℓp-norm of the parameter vector subject to a classification error constraint. An analytic and stretchable estimation is conjectured where the estimation can be viewed as an extension of the pseudoinverse with left and right constructions. Our variance analysis indicates that the estimation based on the left pseudoinverse is unbiased and the estimation based on the right pseudoinverse is biased. Sparseness can be obtained for the biased estimation under certain mild conditions. The proposed estimation is investigated numerically using both synthetic and real-world data.
['Toh|Kar-Ann|KA|', 'Lin|Zhiping|Z|', 'Sun|Lei|L|', 'Li|Zhengguo|Z|']
D000465:Algorithms D017360:Arabidopsis D019985:Benchmarking D001943:Breast Neoplasms D002965:Classification D003198:Computer Simulation D044962:Data Compression D030541:Databases, Genetic D005260:Female D017143:Fuzzy Logic D015870:Gene Expression D006801:Humans D007938:Leukemia D016014:Linear Models D010363:Pattern Recognition, Automated D015203:Reproducibility of Results D014584:User-Computer Interface
Parameter learning Pattern classification Sparse estimation