Generalized partitioned local depth

03/17/2023
by   Kenneth S. Berenhaut, et al.
0

In this paper we provide a generalization of the concept of cohesion as introduced recently by Berenhaut, Moore and Melvin [Proceedings of the National Academy of Sciences, 119 (4) (2022)]. The formulation presented builds on the technique of partitioned local depth by distilling two key probabilistic concepts: local relevance and support division. Earlier results are extended within the new context, and examples of applications to revealing communities in data with uncertainty are included.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
03/09/2018

A local depth measure for general data

We herein introduce a general local depth measure for data in a Banach s...
research
08/19/2021

Partitioned K-nearest neighbor local depth for scalable comparison-based learning

A triplet comparison oracle on a set S takes an object x ∈ S and for any...
research
05/18/2023

Blockwise inversion and algorithms for inverting large partitioned matrices

Using the blockwise matrix inversion, inversions of large matrices with ...
research
02/25/2020

Well-partitioned chordal graphs: obstruction set and disjoint paths

We introduce a new subclass of chordal graphs that generalizes split gra...
research
07/03/2012

Info-Computationalism and Philosophical Aspects of Research in Information Sciences

The historical development has lead to the decay of Natural Philosophy w...
research
01/20/2022

Statistical Depth Functions for Ranking Distributions: Definitions, Statistical Learning and Applications

The concept of median/consensus has been widely investigated in order to...
research
02/24/2022

Partitioned Variational Inference: A Framework for Probabilistic Federated Learning

The proliferation of computing devices has brought about an opportunity ...

Please sign up or login with your details

Forgot password? Click here to reset