Evidence map›Paper›PMID 36904604›Full record

ArticleSensors (Basel, Switzerland)2023

Discrete Geodesic Distribution-Based Graph Kernel for 3D Point Clouds.

Mehmet Ali Balcı, Ömer Akgüller, Larissa M Batrancea, Lucian Gaban

Full text read
In one paragraph

Article in Sensors (Basel, Switzerland), 2023. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 1 paper.

0numbers the graph read from it
0cells of the map it votes in
1citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

1 citing paper in PubMed.

  1. Observational
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Mehmet Ali BalcıDepartment of Mathematics, Faculty of Science, Muğla Sıtkı Koçman University, 48000 Muğla, Turkey.ORCID 0000-0003-1465-7153
Ömer AkgüllerDepartment of Mathematics, Faculty of Science, Muğla Sıtkı Koçman University, 48000 Muğla, Turkey.ORCID 0000-0002-7061-2534
Larissa M BatranceaDepartment of Business, Babeş-Bolyai University, 7 Horea Street, 400174 Cluj-Napoca, Romania.ORCID 0000-0001-6254-2970
Lucian GabanFaculty of Economics, "1 Decembrie 1918" University of Alba Iulia, 510009 Alba Iulia, Romania.ORCID 0000-0001-7317-4798

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

In the structural analysis of discrete geometric data, graph kernels have a great track record of performance. Using graph kernel functions provides two significant advantages. First, a graph kernel is capable of preserving the graph's topological structures by describing graph properties in a high-dimensional space. Second, graph kernels allow the application of machine learning methods to vector data that are rapidly evolving into graphs. In this paper, the unique kernel function for similarity determination procedures of point cloud data structures, which are crucial for several applications, is formulated. This function is determined by the proximity of the geodesic route distributions in graphs reflecting the discrete geometry underlying the point cloud. This research demonstrates the efficiency of this unique kernel for similarity measures and the categorization of point clouds.

Indexed as

Kullback–Leibler informationpoint cloud processingsimplicial complexWasserstein distance

Identifiers

PMID36904604
PMCPMC10007318

What OpenQuestion holds

Textfull text, public
LicenceCC BY
measurements read2
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.