Relaxed triangle inequality ratio of the Sorensen-Dice and Tversky indexes

被引:11
作者
Gragera, Alonso [1 ,4 ]
Suppakitpaisarn, Vorapong [1 ,2 ,3 ]
机构
[1] Univ Tokyo, Grad Sch Informat Sci & Technol, Dept Comp Sci, Bunkyo Ku, 7-3-1 Hongo, Tokyo 1130033, Japan
[2] Natl Inst Informat, Global Res Ctr Big Data Math, Chiyoda Ku, 2-1-2 Hitotsubashi, Tokyo 1018430, Japan
[3] Japan Sci & Technol Agcy, ERATO Kawarabayashi Large Graph Project, Kawaguchi, Saitama, Japan
[4] Univ Granada, Int Sch Postgrad Studies, Granada, Spain
关键词
Distance; Metric; Near-metric; Approximate triangle inequality; Sorensen-Dice index; Tversky index; CLUSTERING PROBLEMS; K-MEANS; SIMILARITY; ASSOCIATION; PTAS;
D O I
10.1016/j.tcs.2017.01.004
中图分类号
TP301 [理论、方法];
学科分类号
081202 ;
摘要
In this work, we calculate a tight relaxed triangle inequality ratio for some of the most well-known indexes used in finding dissimilarities between two finite sets known as the Sorensen-Dice and Tversky indexes. This relaxed triangle inequality ratio affects efficiency and approximation ratios of recent algorithms for many combinatorial problems such as traveling salesman and nearest neighbor search. Because of that, there are many works providing ratios for several other indexes. In this work, we focus on the Tversky index, which is a generalization of many dissimilarity indexes commonly used in practice. We provide the tight ratio of the Tversky index in this paper. Because the Sorensen-Dice index is a special case of the Tversky index, we know from the results that the tight ratio for the Sorensen-Dice index is equal to 1.5. (C) 2017 Elsevier B.V. All rights reserved.
引用
收藏
页码:37 / 45
页数:9
相关论文
共 32 条
[1]   On the traveling salesman problem restricted to inputs satisfying a relaxed triangle inequality [J].
Andreae, T .
NETWORKS, 2001, 38 (02) :59-67
[2]  
[Anonymous], 2009, Encyclopedia of Distances, DOI DOI 10.1007/978-3-642-00234-21
[3]  
[Anonymous], 2000, WORKSHOP ARTIFICIAL
[4]  
Backman TWH, 2014, METHODS MOL BIOL, V1056, P145, DOI 10.1007/978-1-62703-592-7_15
[5]   Performance guarantees for the TSP with a parameterized triangle inequality [J].
Bender, MA ;
Chekuri, C .
INFORMATION PROCESSING LETTERS, 2000, 73 (1-2) :17-21
[6]  
Braverman V, 2011, PROCEEDINGS OF THE TWENTY-SECOND ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, P26
[7]  
Cesare S, 2012, SOFTWARE SIMILARITY, P63
[8]   NMR metabolic analysis of samples using fuzzy K-means clustering [J].
Cuperlovic-Culf, Miroslava ;
Belacel, Nabil ;
Cuif, Adrian S. ;
Chute, Ian C. ;
Ouellette, Rodney J. ;
Burton, Ian W. ;
Karakach, Tobias K. ;
Walter, John A. .
MAGNETIC RESONANCE IN CHEMISTRY, 2009, 47 :S96-S104
[9]   MEASURES OF THE AMOUNT OF ECOLOGIC ASSOCIATION BETWEEN SPECIES [J].
DICE, LR .
ECOLOGY, 1945, 26 (03) :297-302
[10]   A methodological approach for designing and sequencing product families in Reconfigurable Disassembly Systems [J].
Eguia, Ignacio ;
Lozano, Sebastian ;
Racero, Jesus ;
Guerrero, Fernando .
JOURNAL OF INDUSTRIAL ENGINEERING AND MANAGEMENT-JIEM, 2011, 4 (03) :418-435