An efficient tree-based computation of a metric comparable to a natural diffusion distance

被引:3
|
作者
Goldberg, Maxim J. [1 ]
Kim, Seonja [2 ]
机构
[1] Ramapo Coll NJ, Mahwah, NJ 07430 USA
[2] Bloomsburg Univ PA, Dept Math CS & Stat, Bloomsburg, PA 17815 USA
关键词
Tree; Diffusion; Distance; Metric; KERNEL; MAPS;
D O I
10.1016/j.acha.2011.12.001
中图分类号
O29 [应用数学];
学科分类号
070104 ;
摘要
Using diffusion to define distances between points on a manifold (or a sampled data set) has been successfully employed in various applications such as data organization and approximately isometric embedding of high dimensional data in low dimensional Euclidean space. Recently, P. Jones has proposed a diffusion distance which is both intuitively appealing and scales appropriately with increasing time. In the first part of our paper, we present an efficient tree-based approach to computing an approximation to Jones's diffusion distance. We also show our approximation is comparable to Jones's distance. Neither Jones's distance, nor our approximation, satisfies the triangle inequality; in particular, in the case of heat flow on R-n, Jones's separation distance gives a scaled square of the Euclidean distance. In the second part of our paper, we present a general construction to obtain an "almost" metric from a general distance. We also discuss a numerical procedure to implement our construction. Additionally, we show that in the case of heat flow on R-n, we recover (scaled) Euclidean distance from Jones's distance. (C) 2011 Elsevier Inc. All rights reserved.
引用
收藏
页码:261 / 281
页数:21
相关论文
共 50 条
  • [1] Tree-Based Metric Learning for Distance Computation in Data Mining
    Yan, Ming
    Zhang, Yan
    Wang, Hongzhi
    WEB TECHNOLOGIES AND APPLICATIONS (APWEB 2015), 2015, 9313 : 377 - 388
  • [2] Efficient Computation of Attributes and Saliency Maps on Tree-Based Image Representations
    Xu, Yongchao
    Carlinet, Edwin
    Geraud, Thierry
    Najman, Laurent
    MATHEMATICAL MORPHOLOGY AND ITS APPLICATIONS TO SIGNAL AND IMAGE PROCESSING, 2015, 9082 : 693 - 704
  • [3] Efficient Computation of the Tree Edit Distance
    Pawlik, Mateusz
    Augsten, Nikolaus
    ACM TRANSACTIONS ON DATABASE SYSTEMS, 2015, 40 (01):
  • [4] Efficient and Accurate Hausdorff Distance Computation Based on Diffusion Search
    Zhang, Dejun
    Zou, Lu
    Chen, Yilin
    He, Fazhi
    IEEE ACCESS, 2018, 6 : 1350 - 1361
  • [5] Graph diffusion distance: Properties and efficient computation
    Scott, C. B.
    Mjolsness, Eric
    PLOS ONE, 2021, 16 (04):
  • [6] A TREE-BASED DISTANCE BETWEEN DISTRIBUTIONS: APPLICATION TO CLASSIFICATION OF NEURONS
    Lefort, Riwal
    Fleuret, Francois
    2012 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2012, : 2237 - 2240
  • [7] Tree-Based Representation and Generation of Natural and Mathematical Language
    Scarlatos, Alexander
    Lan, Andrew
    PROCEEDINGS OF THE 61ST ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS, ACL 2023, VOL 1, 2023, : 3714 - 3730
  • [8] Efficient and Effective Tree-based and Neural Learning to Rank
    Bruch, Sebastian
    Lucchese, Claudio
    Nardini, Franco Maria
    FOUNDATIONS AND TRENDS IN INFORMATION RETRIEVAL, 2023, 17 (01): : 1 - 123
  • [9] An Efficient Tree-based Fuzzy Data Mining Approach
    Lin, Chun-Wei
    Hong, Tzung-Pei
    Lu, Wen-Hsiang
    INTERNATIONAL JOURNAL OF FUZZY SYSTEMS, 2010, 12 (02) : 150 - 157
  • [10] A Tree-Based Approach for Efficient and Accurate Conjunction Analysis
    Mercurio, Michael
    Singla, Puneet
    CMES-COMPUTER MODELING IN ENGINEERING & SCIENCES, 2016, 111 (03): : 229 - 256