English

Generalized partitioned local depth

Machine Learning 2024-02-01 v4 Machine Learning Social and Information Networks Physics and Society

Abstract

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. The work sheds light on the foundations of partitioned local depth, and extends the original ideas to enable probabilistic consideration of uncertain, variable and potentially conflicting information.

Cite

@article{arxiv.2303.10167,
  title  = {Generalized partitioned local depth},
  author = {Kenneth S. Berenhaut and John D. Foley and Liangdongsheng Lyu},
  journal= {arXiv preprint arXiv:2303.10167},
  year   = {2024}
}

Comments

Typos correct & clarifying comments, 19 pages, 6 figures

R2 v1 2026-06-28T09:21:58.194Z