Finding the Asymptotically Optimal Baire Distance for Multi-Channel Data

• 作者: Andreas Christian Braun Patrick Erik Bradley
• 来源期刊: 应用数学(英文)
• 学科: 数学
• 关键词: P-ADIC NUMBERS Ultrametrics Baire DISTANCE SUPPORT VECTOR MACHINE Classification
• 年，卷（期）: yysxyw_2015,（3）
• 页码范围: 484-495
• 页数: 12页
• 分类号: O1

摘要

A novel permutation-dependent Baire distance is introduced for multi-channel data. The optimal permutation is given by minimizing the sum of these pairwise distances. It is shown that for most practical cases the minimum is attained by a new gradient descent algorithm introduced in this article. It is of biquadratic time complexity: Both quadratic in number of channels and in size of data. The optimal permutation allows us to introduce a novel Baire-distance kernel Support Vector Machine (SVM). Applied to benchmark hyperspectral remote sensing data, this new SVM produces results which are comparable with the classical linear SVM, but with higher kernel target alignment.