paper-with-me

홈 › Papers

Classifying histograms of medical data using information geometry of beta distributions

2020-06-03 · Alice Le Brigant, Nicolas Guigui, Sana Rebbah, Stéphane Puechmorel

In this paper, we use tools of information geometry to compare, average and classify histograms. Beta distributions are fitted to the histograms and the corresponding Fisher information geometry is used for comparison. We show that this geometry is negatively curved, which guarantees uniqueness of the notion of mean, and makes it suitable to classify histograms through the popular K-means algorithm. We illustrate the use of these geometric tools in supervised and unsupervised classification procedures of two medical data-sets, cardiac shape deformations for the detection of pulmonary hypertension and brain cortical thickness for the diagnosis of Alzheimer's disease.

📄 PDF Abstract BibTeX arXiv:2006.04511

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Automatic Histograms: Leveraging Language Models for Text Dataset Exploration

2024-02-21 · Emily Reif, Crystal Qian, James Wexler, Minsuk Kahng

Making sense of unstructured text datasets is perennially difficult, yet increasingly relevant with Large Language Models. Data workers often rely on dataset summaries, especially distributions of various derived feature…

Computing Kantorovich-Wasserstein Distances on d-dimensional histograms using (d+1)-partite graphs

2018-12-01 · NeurIPS 2018 12 · Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni

This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated min…

Computing Kantorovich-Wasserstein Distances on $d$-dimensional histograms using $(d+1)$-partite graphs

2018-05-18 · NeurIPS 2018 · Gennaro Auricchio, Federico Bassetti, Stefano Gualandi, Marco Veneroni

This paper presents a novel method to compute the exact Kantorovich-Wasserstein distance between a pair of $d$-dimensional histograms having $n$ bins each. We prove that this problem is equivalent to an uncapacitated min…

Classifying Nodes in Graphs without GNNs

2024-02-08 · Daniel Winter, Niv Cohen, Yedid Hoshen

Graph neural networks (GNNs) are the dominant paradigm for classifying nodes in a graph, but they have several undesirable attributes stemming from their message passing architecture. Recently, distillation methods succe…

Node Classification

Log-Euclidean Bag of Words for Human Action Recognition

2014-06-09 · Masoud Faraki, Maziar Palhang, Conrad Sanderson

Representing videos by densely extracted local space-time features has recently become a popular approach for analysing actions. In this paper, we tackle the problem of categorising human actions by devising Bag of Words…

Action RecognitionOptical Flow EstimationTemporal Action Localization