These tools will no longer be maintained as of December 31, 2024. Archived website can be found here. PubMed4Hh GitHub repository can be found here. Contact NLM Customer Service if you have questions.


BIOMARKERS

Molecular Biopsy of Human Tumors

- a resource for Precision Medicine *

220 related articles for article (PubMed ID: 32939100)

  • 1. Community-based rumor blocking maximization in social networks: Algorithms and analysis.
    Ni Q; Guo J; Huang C; Wu W
    Theor Comput Sci; 2020 Nov; 840():257-269. PubMed ID: 32939100
    [TBL] [Abstract][Full Text] [Related]  

  • 2. Containment of rumor spread by selecting immune nodes in social networks.
    Wu H; Zhang Z; Fang Y; Zhang S; Jiang Z; Huang J; Li P
    Math Biosci Eng; 2021 Mar; 18(3):2614-2631. PubMed ID: 33892563
    [TBL] [Abstract][Full Text] [Related]  

  • 3. Per-Round Knapsack-Constrained Linear Submodular Bandits.
    Yu B; Fang M; Tao D
    Neural Comput; 2016 Dec; 28(12):2757-2789. PubMed ID: 27626968
    [TBL] [Abstract][Full Text] [Related]  

  • 4. Polarity related influence maximization in signed social networks.
    Li D; Xu ZM; Chakraborty N; Gupta A; Sycara K; Li S
    PLoS One; 2014; 9(7):e102199. PubMed ID: 25061986
    [TBL] [Abstract][Full Text] [Related]  

  • 5. Ranking with submodular functions on a budget.
    Zhang G; Tatti N; Gionis A
    Data Min Knowl Discov; 2022; 36(3):1197-1218. PubMed ID: 35601821
    [TBL] [Abstract][Full Text] [Related]  

  • 6. Extended methods for influence maximization in dynamic networks.
    Murata T; Koga H
    Comput Soc Netw; 2018; 5(1):8. PubMed ID: 30370206
    [TBL] [Abstract][Full Text] [Related]  

  • 7. Maximizing multiple influences and fair seed allocation on multilayer social networks.
    Chen Y; Wang W; Feng J; Lu Y; Gong X
    PLoS One; 2020; 15(3):e0229201. PubMed ID: 32163423
    [TBL] [Abstract][Full Text] [Related]  

  • 8. Deep reinforcement learning-based approach for rumor influence minimization in social networks.
    Jiang J; Chen X; Huang Z; Li X; Du Y
    Appl Intell (Dordr); 2023 Apr; ():1-18. PubMed ID: 37363387
    [TBL] [Abstract][Full Text] [Related]  

  • 9. MATI: An efficient algorithm for influence maximization in social networks.
    Rossi MG; Shi B; Tziortziotis N; Malliaros FD; Giatsidis C; Vazirgiannis M
    PLoS One; 2018; 13(11):e0206318. PubMed ID: 30383770
    [TBL] [Abstract][Full Text] [Related]  

  • 10. The generalized influence blocking maximization problem.
    Erd FC; Vignatti AL; Silva MVGD
    Soc Netw Anal Min; 2021; 11(1):55. PubMed ID: 34149959
    [TBL] [Abstract][Full Text] [Related]  

  • 11. Target set selection in social networks with tiered influence and activation thresholds.
    Qiang Z; Pasiliao EL; Zheng QP
    J Comb Optim; 2023; 45(5):117. PubMed ID: 37304048
    [TBL] [Abstract][Full Text] [Related]  

  • 12. Submodular Memetic Approximation for Multiobjective Parallel Test Paper Generation.
    Nguyen ML; Hui SC; Fong ACM
    IEEE Trans Cybern; 2017 Jun; 47(6):1562-1575. PubMed ID: 27352402
    [TBL] [Abstract][Full Text] [Related]  

  • 13. Significant Geo-Social Group Discovery over Location-Based Social Network.
    Li W; Zlatanova S
    Sensors (Basel); 2021 Jul; 21(13):. PubMed ID: 34283106
    [TBL] [Abstract][Full Text] [Related]  

  • 14. Efficient Minimum Cost Seed Selection With Theoretical Guarantees for Competitive Influence Maximization.
    Hong W; Qian C; Tang K
    IEEE Trans Cybern; 2021 Dec; 51(12):6091-6104. PubMed ID: 32031962
    [TBL] [Abstract][Full Text] [Related]  

  • 15. Semi-streaming algorithms for submodular matroid intersection.
    Garg P; Jordan L; Svensson O
    Math Program; 2023; 197(2):967-990. PubMed ID: 36778060
    [TBL] [Abstract][Full Text] [Related]  

  • 16. Community-aware task allocation for social networked multiagent systems.
    Wang W; Jiang Y
    IEEE Trans Cybern; 2014 Sep; 44(9):1529-43. PubMed ID: 25137683
    [TBL] [Abstract][Full Text] [Related]  

  • 17. An Influence Maximization Algorithm for Dynamic Social Networks Based on Effective Links.
    Fu B; Zhang J; Bai H; Yang Y; He Y
    Entropy (Basel); 2022 Jun; 24(7):. PubMed ID: 35885127
    [TBL] [Abstract][Full Text] [Related]  

  • 18. Dynamic selection of clarification channels in rumor propagation containment.
    Wang Y; Zhong S; Wang G
    Math Biosci Eng; 2023 Jul; 20(8):14995-15017. PubMed ID: 37679169
    [TBL] [Abstract][Full Text] [Related]  

  • 19. Link-based influence maximization in networks of health promotion professionals.
    Oostenbroek MHW; van der Leij MJ; Meertens QA; Diks CGH; Wortelboer HM
    PLoS One; 2021; 16(8):e0256604. PubMed ID: 34432815
    [TBL] [Abstract][Full Text] [Related]  

  • 20. Multiobjective Evolutionary Algorithms Are Still Good: Maximizing Monotone Approximately Submodular Minus Modular Functions.
    Qian C
    Evol Comput; 2021 Dec; 29(4):463-490. PubMed ID: 33350888
    [TBL] [Abstract][Full Text] [Related]  

    [Next]    [New Search]
    of 11.