The Robustness of the p -Norm Algorithms

Author： Gentile Claudio  

Publisher： Springer Publishing Company

ISSN： 0885-6125

Source： Machine Learning, Vol.53, Iss.3, 2003-01, pp. : 265-299

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

Increasing the Robustness of Boosting Algorithms within the Linear-programming Framework

By Sun Yijun  

Journal of VLSI Signal Processing, Vol. 48, Iss. 1-2, 2007-08 ,pp. : 5-20

Springer Publishing Company

Access to resources Recommend Favorite

Improving Airline Network Robustness and Operational Reliability by Sequential Optimisation Algorithms

By Wu Cheng-Lung  

Networks and Spatial Economics, Vol. 6, Iss. 3-4, 2006-09 ,pp. : 235-251

Springer Publishing Company

Access to resources Recommend Favorite

Preconditioned Descent Algorithms for p-Laplacian

By Huang Y.   Li Ruo   Liu Wenbin  

Journal of Scientific Computing, Vol. 32, Iss. 2, 2007-08 ,pp. : 343-371

Springer Publishing Company

Access to resources Recommend Favorite

HEURISTIC ALGORITHMS FOR SURVIVABLE P2P MULTICASTING

By Walkowiak Krzysztof  

Applied Artificial Intelligence, Vol. 27, Iss. 4, 2013-04 ,pp. : 278-303

Taylor & Francis Ltd

Access to resources Recommend Favorite

Sparse p-norm Nonnegative Matrix Factorization for clustering gene expression data

By Liu Weixiang   Yuan Kehong  

International Journal of Data Mining and Bioinformatics, Vol. 2, Iss. 3, 2008-09 ,pp. : 236-249

Inderscience Publishers

Access to resources Recommend Favorite