Use my Search Websuite to scan PubMed, PMCentral, Journal Hosts and Journal Archives, FullText.
Kick-your-searchterm to multiple Engines kick-your-query now !>
A dictionary by aggregated review articles of nephrology, medicine and the life sciences
Your one-stop-run pathway from word to the immediate pdf of peer-reviewed on-topic knowledge.

suck abstract from ncbi


10.1016/j.future.2020.10.003

http://scihub22266oqcxt.onion/10.1016/j.future.2020.10.003
suck pdf from google scholar
33041408!7534853!33041408
unlimited free pdf from europmc33041408    free
PDF from PMC    free
html from PMC    free

suck abstract from ncbi


Deprecated: Implicit conversion from float 213.6 to int loses precision in C:\Inetpub\vhosts\kidney.de\httpdocs\pget.php on line 534
pmid33041408      Future+Gener+Comput+Syst 2021 ; 115 (ä): 531-541
Nephropedia Template TP

gab.com Text

Twit Text FOAVip

Twit Text #

English Wikipedia


  • Susceptible user search for defending opinion manipulation #MMPMID33041408
  • Tang W; Tian L; Zheng X; Luo G; He Z
  • Future Gener Comput Syst 2021[Feb]; 115 (ä): 531-541 PMID33041408show ga
  • The development of cyberspace offers unprecedentedly convenient access to online communication, thus inducing malicious individuals to subtly manipulate user opinions for benefits. Such malicious manipulations usually target those influential and susceptible users to mislead and control public opinion, posing a bunch of threats to public security. Therefore, an intelligent and efficient searching strategy for targeted users is one prominent and critical approach to defend malicious manipulations. However, the major body of current studies either provide solutions under ideal scenarios or offer inefficient solutions without guaranteed performance. As a result, this work adopts the combination of unsupervised learning and heuristic search to discover susceptible and key users for defense. We first propose a greedy algorithm fully considering the susceptibilities of different users, then adopt unsupervised learning and utilize the community property to design an accelerated algorithm. Moreover, the approximation guarantees of both greedy and community-based algorithms are systematically analyzed for some practical circumstances. Extensive experiments on real-world datasets demonstrate that our algorithms significantly outperform the state-of-the-art algorithm.
  • ä


  • DeepDyve
  • Pubget Overpricing
  • suck abstract from ncbi

    Linkout box