Evidence map›Paper›PMID 41368156›Full record

ArticleJournal of applied statistics2025

IMCKDE algorithm: an improvement in a clustering technique based on kernel density estimation.

Paulo Muraro Ferreira, Mariana Kleina

Abstract read
In one paragraph

Article in Journal of applied statistics, 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing 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

0 citing papers in PubMed.

No citing paper in PubMed yet.

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

2 authors.

Paulo Muraro FerreiraFederal University of Paraná, Curitiba, Brazil.ORCID https://orcid.org/0009-0003-8088-5290
Mariana KleinaFederal University of Paraná, Curitiba, Brazil.ORCID https://orcid.org/0000-0001-8108-8793

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Given the increasing volume of data available, much of which lacks established categories, the development of algorithms capable of finding patterns in raw, unclassified data is becoming increasingly important. One type of clustering algorithm is the MulticlusterKDE, which is based on the search for centroids by maximizing the kernel density estimation function, which assumes local maxima at points of highest data density. The aim of this work is to propose a clustering algorithm based on improvements to the MulticlusterKDE algorithm, named IMCKDE. These improvements occur both in terms of response quality and computational time. Furthermore, it was observed that the MulticlusterKDE algorithm has prohibitively long computation times for large datasets, highlighting the relevance of IMCKDE.

Indexed as

62H3062R07Clusteringdata miningdata patternsimproved multiclusterKDEkernel density estimation

Identifiers

PMID41368156
PMCPMC12683736

What OpenQuestion holds

Textmetadata
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.