Evidence map›Paper›PMID 36134927›Full record

ArticleBiomimetics (Basel, Switzerland)2022

Bio-inspired Machine Learning for Distributed Confidential Multi-Portfolio Selection Problem.

Ameer Tamoor Khan, Xinwei Cao, Bolin Liao, Adam Francis

Open access · goldAbstract read
In one paragraph

Article in Biomimetics (Basel, Switzerland), 2022. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 7 papers.

0numbers the graph read from it
0cells of the map it votes in
7citing papers in PubMed
3.4field-weighted citation impact, top 7% of its field
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

7 citing papers in PubMed, 25 citations in OpenAlex.

  1. Review
  2. Article
  3. Article
  4. Article
  5. Article
  6. Article
  7. Review
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 at 4 institutions in 3 countries.

Ameer Tamoor KhanDepartment of Computing, The Hong Kong Polytechnic University, Hong Kong 999077, China.
Xinwei CaoSchool of Business, Jiangnan University, Wuxi 213031, China.
Bolin LiaoCollege of Computer Science and Engineering, Jishou University, Jishou 409811, China.
Adam FrancisFaculty of Science and Engineering, Swansea University, Swansea SA1 8EN, UK.
Hong Kong Polytechnic University · HKJiangnan University · CNJishou University · CNSwansea University · GB

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

The recently emerging multi-portfolio selection problem lacks a proper framework to ensure that client privacy and database secrecy remain intact. Since privacy is of major concern these days, in this paper, we propose a variant of Beetle Antennae Search (BAS) known as Distributed Beetle Antennae Search (DBAS) to optimize multi-portfolio selection problems without violating the privacy of individual portfolios. DBAS is a swarm-based optimization algorithm that solely shares the gradients of portfolios among the swarm without sharing private data or portfolio stock information. DBAS is a hybrid framework, and it inherits the swarm-like nature of the Particle Swarm Optimization (PSO) algorithm with the BAS updating criteria. It ensures a robust and fast optimization of the multi-portfolio selection problem whilst keeping the privacy and secrecy of each portfolio intact. Since multi-portfolio selection problems are a recent direction for the field, no work has been done concerning the privacy of the database nor the privacy of stock information of individual portfolios. To test the robustness of DBAS, simulations were conducted consisting of

Indexed as

beetle antennae searchdistributed beetle antennae searchinvestmentmulti-portfoliooptimizationstochastic algorithmstocksswarm algorithm

Identifiers

PMID36134927
PMCPMC9496093
OpenAlexW4293527342

What OpenQuestion holds

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