A note on the triangle inequality for the Jaccard distance

S Kosub - Pattern Recognition Letters, 2019 - Elsevier
A note on the triangle inequality for the Jaccard distance - ScienceDirect Skip to main
contentSkip to article Elsevier logo Journals & Books Search RegisterSign in View PDF …

Submodular combinatorial information measures with applications in machine learning

R Iyer, N Khargoankar, J Bilmes… - Algorithmic Learning …, 2021 - proceedings.mlr.press
Abstract Information-theoretic quantities like entropy and mutual information have found
numerous uses in machine learning. It is well known that there is a strong connection …

Generalized submodular information measures: Theoretical properties, examples, optimization algorithms, and applications

R Iyer, N Khargonkar, J Bilmes… - IEEE Transactions on …, 2021 - ieeexplore.ieee.org
Information-theoretic quantities like entropy and mutual information have found numerous
uses in machine learning. It is well known that there is a strong connection between these …

A framework to design approximation algorithms for finding diverse solutions in combinatorial problems

T Hanaka, M Kiyomi, Y Kobayashi… - Proceedings of the …, 2023 - ojs.aaai.org
Finding a\emph {single} best solution is the most common objective in combinatorial
optimization problems. However, such a single solution may not be applicable to real-world …

Deep submodular functions

J Bilmes, W Bai - arXiv preprint arXiv:1701.08939, 2017 - arxiv.org
We start with an overview of a class of submodular functions called SCMMs (sums of
concave composed with non-negative modular functions plus a final arbitrary modular). We …

Maximization of minimum weighted Hamming distance between set pairs

T Matsuoka, S Ito - Asian Conference on Machine Learning, 2024 - proceedings.mlr.press
Abstract\emph {Finding diverse solutions} to combinatorial optimization problems is
beneficial for a deeper understanding of complicated real-world problems and for simpler …

Parametric local multiview hamming distance metric learning

D Zhai, X Liu, H Chang, Y Zhen, X Chen, M Guo… - Pattern Recognition, 2018 - Elsevier
Learning an appropriate distance metric is a crucial problem in pattern recognition. To
confront with the scalability issue of massive data, hamming distance on binary codes is …

Clustering with a reject option: Interactive clustering as bayesian prior elicitation

A Srivastava, J Zou, C Sutton - arXiv preprint arXiv:1602.06886, 2016 - arxiv.org
A good clustering can help a data analyst to explore and understand a data set, but what
constitutes a good clustering may depend on domain-specific and application-specific …

A convex surrogate operator for general non-modular loss functions

J Yu, M Blaschko - Artificial Intelligence and Statistics, 2016 - proceedings.mlr.press
Empirical risk minimization frequently employs convex surrogates to underlying discrete loss
functions in order to achieve computational tractability during optimization. However …

Group feedback protocols for UAV swarming applications

A Balasubramanian, N Mahalingam… - 2018 IEEE …, 2018 - ieeexplore.ieee.org
This paper presents group feedback protocols (group NACK (gNACK)/group ACK (gACK)),
whereby a swarm of Unmanned Aerial Vehicles (UAV) cooperate through their Sidelinks …