Improving feature extraction performance of greedy network-growing algorithm by inverse euclidean distance

ISSN： 1360-0494

Source： Connection Science, Vol.16, Iss.2, 2004-06, pp. : 129-138

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

Greedy network-growing algorithm with Minkowski distances

By Kamimura Ryotaro

International Journal of General Systems, Vol. 36, Iss. 2, 2007-04 ,pp. : 157-177

Taylor & Francis Ltd

Access to resources Recommend Favorite

A Parallel Euclidean Distance Transformation Algorithm

By Embrechts H. Roose D.

Computer Vision and Image Understanding, Vol. 63, Iss. 1, 1996-01 ,pp. : 15-26

Academic Press

Access to resources Recommend Favorite

Information-Theoretic Competitive Learning with Inverse Euclidean Distance Output Units

By Kamimura Ryotaro

Neural Processing Letters, Vol. 18, Iss. 3, 2003-12 ,pp. : 163-204

Springer Publishing Company

Access to resources Recommend Favorite

Performance of classification using a hybrid distance measure with artificial bee colony algorithm for feature selection in keystroke dynamics

By Akila M.

International Journal of Computational Intelligence Studies, Vol. 2, Iss. 2, 2013-07 ,pp. : 187-197

Inderscience Publishers

Access to resources Recommend Favorite

Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm

By Stolyar Alexander

Queueing Systems, Vol. 50, Iss. 4, 2005-08 ,pp. : 401-457

Springer Publishing Company

Access to resources Recommend Favorite