arXivDaily arXiv每日学术速递 周一至周五更新
arXiv周末暂无论文更新,休息一下吧,周末愉快~~
arXiv 1612.04875stat.ML
收藏

基于图相似度条件分位数的鲁棒局部尺度变换

Robust Local Scaling using Conditional Quantiles of Graph Similarities

Jayaraman J. Thiagarajan, Prasanna Sattigeri, Karthikeyan Natesan Ramamurthy, Bhavya Kailkhura

摘要:

邻域图的谱分析是用于探索性数据分析的最广泛使用的技术之一,其应用范围从机器学习到社会科学。在这样的应用中,通常首先使用适当的相似性函数对数据样本之间的关系进行编码。流行的邻域构造技术,如k-最近邻(k-NN)图是已知的是非常敏感的参数的选择,更重要的是易受噪声和不同的密度。在本文中,我们提出了使用分位数分析,以获得局部规模估计的邻域图的建设。为此,我们建立了一个自动编码的神经网络方法来推断条件分位数的相似性函数,随后用于获得强大的估计的局部尺度。除了对噪声或离群数据具有很强的弹性外,所提出的方法不需要像现有的几种方法那样进行广泛的参数调整。使用谱聚类和单示例标签传播中的应用,我们表明,建议的邻域图优于现有的局部缩放图的构造方法。

英文摘要:

Spectral analysis of neighborhood graphs is one of the most widely used techniques for exploratory data analysis, with applications ranging from machine learning to social sciences. In such applications, it is typical to first encode relationships between the data samples using an appropriate similarity function. Popular neighborhood construction techniques such as k-nearest neighbor (k-NN) graphs are known to be very sensitive to the choice of parameters, and more importantly susceptible to noise and varying densities. In this paper, we propose the use of quantile analysis to obtain local scale estimates for neighborhood graph construction. To this end, we build an auto-encoding neural network approach for inferring conditional quantiles of a similarity function, which are subsequently used to obtain robust estimates of the local scales. In addition to being highly resilient to noise or outlying data, the proposed approach does not require extensive parameter tuning unlike several existing methods. Using applications in spectral clustering and single-example label propagation, we show that the proposed neighborhood graphs outperform existing locally scaled graph construction approaches.

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

↑