arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2607.08334stat.MEstat.COstat.ML
收藏

大数据分类的MADD可扩展版本

A scalable version of MADD for big-data classification

Indian Statistical Institute(印度统计研究所);UBS Business Solutions (India) Pvt. Ltd.(瑞银商业解决方案(印度)私人有限公司)

Annesha Ghosh, Adrija Saha, Soham Sarkar

AI总结:

针对大数据分类,提出MADD可扩展版本,通过选择代表性集及利用随机傅里叶特征思想降低计算复杂度,在保持性能的同时大幅减少计算时间,拓宽了MADD在大数据上的应用范围。

摘要:

基于距离的分类器很流行,欧几里得距离是常用度量之一。但基于欧氏距离的分类器在高维设置中常因距离集中、邻域结构破坏和枢纽存在等问题受影响。在高维低样本量(HDLSS)情况下,数据驱动的半度量MADD可规避这些问题。然而,MADD的计算复杂度随训练样本量二次增加,对大数据集应用有挑战。本文提出MADD的可扩展版本,通过在计算MADD时选择代表性集显著降低计算复杂度,利用随机傅里叶特征思想进一步加速,理论和数值上证明其性能与MADD相似但计算时间大幅减少,拓宽了MADD在大数据上的应用范围。

英文摘要:

Distance-based classifiers are very popular, and the Euclidean distance is one of the most commonly used metrics in distance-based classifiers. However, classifiers based on the Euclidean distance often suffer in high-dimensional setups due to issues such as distance concentration, violation of neighborhood structures, and the presence of hubs. In high-dimension, low-sample-size (HDLSS) situations, a data-driven semi-metric called the Mean Absolute Difference of Distances (MADD) is known to circumvent these issues. But one major problem with MADD is that its computational complexity increases quadratically with the training sample size. As a result, the application of MADD becomes computationally challenging for big datasets that have both a high dimension as well as a large number of observations. In this paper, we propose a scalable version of MADD that significantly reduces its computational complexity while retaining its advantages. This speed-up is achieved by selecting a representative set during the computation of MADD. Further speed-ups are achieved by using the idea of Random Fourier Features, particularly when the sample size is very large. We establish that our proposed methods achieve performances similar to MADD but only at a fraction of its computing time, both theoretically as well as numerically. Our approach broadens the scope of MADD, allowing its use to big-data with a very large number of observations.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑