Evidence map›Paper›PMID 37521128›Full record

ArticleEvolving systems2022

Deep recurrent Gaussian Nesterovs recommendation using multi-agent in social networks.

Vinita Tapaskar, Mallikarjun M Math

Abstract read
In one paragraph

Article in Evolving systems, 2022. 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. Article
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.

Vinita TapaskarVisvesvaraya Technological University, Research Center, Jnana Sangama, Machhe, Belagavi, 590018 Karnataka India.
Mallikarjun M MathDepartment of Computer Science and Engineering, KLS, Gogte Institute of Technology, Udyambag, Belagavi, 590008 Karnataka India.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

Due to increasing volume of big data the high volume of information in Social Network put a stop to users from acquiring serviceable information intelligently so many recommendation systems have emerged. Multi-agent Deep Learning gains rapid attraction, and the latest accomplishments address problems with real-world complexity. With big data precise recommendation has yet to be answered. In proposed work Deep Recurrent Gaussian Nesterov's Optimal Gradient (DR-GNOG) that combines deep learning with a multi-agent scenario for optimal and precise recommendation. The DR-GNOG is split into three layers, an input layer, two hidden layers and an output layer. The tweets obtained from the users are provided to the input layer by the Tweet Accumulator Agent. Then, in the first hidden layer, Tweet Classifier Agent performs optimized and relevant tweet classification by means of Gaussian Nesterov's Optimal Gradient model. In the second layer, a Deep Recurrent Predictive Recommendation model is designed to concentrate on the vanishing gradient issue arising due to updated tweets obtained from same user at different time instance. Finally, with the aid of hyperbolic activation function in the output layer, building block of the predictive recommendation is obtained. In the experimental study the proposed method is found better than existing GANCF and Bootstrapping method 13-21% in case of recommendation accuracy, 22-32% better in recommendation time and 15-22% better in recall rate.

Indexed as

Big dataDeep recurrentGaussian Nesterov’sGradientPredictiveRecommendationSocial network

Identifiers

PMID37521128
PMCPMC8994100

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.