12
views
0
recommends
+1 Recommend
1 collections
    0
    shares
      • Record: found
      • Abstract: found
      • Article: found
      Is Open Access

      Predicting Fundraising Performance in Medical Crowdfunding Campaigns Using Machine Learning

      , , ,
      Electronics
      MDPI AG

      Read this article at

      Bookmark
          There is no author summary for this article yet. Authors can add summaries to their articles on ScienceOpen to make them more accessible to a non-specialist audience.

          Abstract

          The coronavirus disease (COVID-19) pandemic has flooded public health organizations around the world, highlighting the significance and responsibility of medical crowdfunding in filling a series of gaps and shortcomings in the publicly funded health system and providing a new fundraising solution for people that addresses health-related needs. However, the fact remains that medical fundraising from crowdfunding sources is relatively low and only a few studies have been conducted regarding this issue. Therefore, the performance predictions and multi-model comparisons of medical crowdfunding have important guiding significance to improve the fundraising rate and promote the sustainable development of medical crowdfunding. Based on the data of 11,771 medical crowdfunding campaigns from a leading donation-based platform called Weibo Philanthropy, machine-learning algorithms were applied. The results demonstrate the potential of ensemble-based machine-learning algorithms in the prediction of medical crowdfunding project fundraising amounts and leave some insights that can be taken into consideration by new researchers and help to produce new management practices.

          Related collections

          Most cited references53

          • Record: found
          • Abstract: not found
          • Article: not found

          Greedy function approximation: A gradient boosting machine.

            Bookmark
            • Record: found
            • Abstract: found
            • Article: not found

            Adam: A Method for Stochastic Optimization

            We introduce Adam, an algorithm for first-order gradient-based optimization of stochastic objective functions, based on adaptive estimates of lower-order moments. The method is straightforward to implement, is computationally efficient, has little memory requirements, is invariant to diagonal rescaling of the gradients, and is well suited for problems that are large in terms of data and/or parameters. The method is also appropriate for non-stationary objectives and problems with very noisy and/or sparse gradients. The hyper-parameters have intuitive interpretations and typically require little tuning. Some connections to related algorithms, on which Adam was inspired, are discussed. We also analyze the theoretical convergence properties of the algorithm and provide a regret bound on the convergence rate that is comparable to the best known results under the online convex optimization framework. Empirical results demonstrate that Adam works well in practice and compares favorably to other stochastic optimization methods. Finally, we discuss AdaMax, a variant of Adam based on the infinity norm. Published as a conference paper at the 3rd International Conference for Learning Representations, San Diego, 2015
              Bookmark
              • Record: found
              • Abstract: not found
              • Article: not found

              Nearest neighbor pattern classification

                Bookmark

                Author and article information

                Contributors
                Journal
                ELECGJ
                Electronics
                Electronics
                MDPI AG
                2079-9292
                January 2021
                January 11 2021
                : 10
                : 2
                : 143
                Article
                10.3390/electronics10020143
                4aad1b50-7168-4b32-91b1-c9572ce1c430
                © 2021

                https://creativecommons.org/licenses/by/4.0/

                History

                Comments

                Comment on this article