Robust polynomial classifier using L ¹-norm minimization

ISSN： 0924-669X

Source： Applied Intelligence, Vol.33, Iss.3, 2010-12, pp. : 330-339

Disclaimer: Any content in publications that violate the sovereignty, the constitution or regulations of the PRC is not accepted or approved by CNPIEC.

Previous Menu Next

Abstract

Related content

On the (Non-)Existence of Polynomial Kernels for P _l-Free Edge Modification Problems

By Guillemot Sylvain Havet Frédéric Paul Christophe Perez Anthony

Algorithmica, Vol. 65, Iss. 4, 2013-04 ,pp. : 900-926

Springer Publishing Company

Access to resources Recommend Favorite

Robust D-decomposition under l _p-bounded parametric uncertainties

By Tremba A.

Automation and Remote Control, Vol. 67, Iss. 12, 2006-12 ,pp. : 1878-1892

MAIK Nauka/Interperiodica

Access to resources Recommend Favorite

A Class of Inverse Dominant Problems under Weighted l_∞ Norm and an Improved Complexity Bound for Radzik’s Algorithm

By Wang Qin Yang Xiaoguang Zhang Jianzhong

Journal of Global Optimization, Vol. 34, Iss. 4, 2006-04 ,pp. : 551-567

Springer Publishing Company

Access to resources Recommend Favorite

Optimal interpolation and l^p norm minimisation in colour indexing

By Finlayson Graham D. Montagna Roberto

Color and Imaging Conference, Vol. 2008, Iss. 1, 2008-01 ,pp. : 274-278

Society for Imaging Science and Technology

Access to resources Recommend Favorite

A Geometric Programming Framework for Univariate Cubic L ₁ Smoothing Splines

By Cheng Hao Fang Shu-Cherng Lavery John

Annals of Operations Research, Vol. 133, Iss. 1-4, 2005-01 ,pp. : 229-248

Springer Publishing Company

Access to resources Recommend Favorite