Evidence map›Paper›PMID 40382474›Full record

ArticleScientific reports2025

Reducing the clustering challenge in the IoT using two disjoint convex hulls.

Huxiong Li, Bahram Sadeghi Bigham, Mehdi Gheisari, Aminreza Karamoozian, Panjun Sun, Yi Wan

Abstract read
In one paragraph

Article in Scientific reports, 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

6 authors.

Huxiong LiInstitute of Artificial Intelligence, Shaoxing University, Zhejiang, China.
Bahram Sadeghi BighamDepartment of Computer Science, Faculty of Mathematical Sciences, Alzahra University, Tehran, Iran.
Mehdi GheisariInstitute of Artificial Intelligence, Shaoxing University, Zhejiang, China. mehdi.gheisari61@gmail.com.
Aminreza KaramoozianInstitute of Artificial Intelligence, Shaoxing University, Zhejiang, China. Aminreza.karamoozian@yahoo.com.
Panjun SunInstitute of Artificial Intelligence, Shaoxing University, Zhejiang, China.
Yi WanInstitute of Artificial Intelligence, Shaoxing University, Zhejiang, China.

Funding

Natural Science Foundation of Zhejiang Province LQZSZ24E050001
6 · The paper itself

Abstract

Accurate clustering of IoT devices is a promising challenge. We have observed that a few studies have been performed to address this challenge. However, they are expensive or do not shape accurate clustering. To fill this gap, in this study, we first solve a geometric version of a big challenge in pure mathematics: the NP-hard "Almost [Formula: see text]" problem. Then, we solve it in a polynomial time. To clarify the concept, we present it as the "Two Disjoint Convex Hulls" challenge. We solve this challenge using two algorithms: the first is "Naive" and the second is faster than the "Naive" one can solve it in polynomial order, [Formula: see text]. In addition to providing a mathematical proof of our solution, we demonstrate its superior performance within an IoT industrial ecosystem.

Indexed as

AlgorithmBinary sensor networkComputational geometryConvex hullSATSeparation axis theorem

Identifiers

PMID40382474
PMCPMC12085556

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
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.