skip to main content

Attention:

The NSF Public Access Repository (NSF-PAR) system and access will be unavailable from 11:00 PM ET on Friday, September 13 until 2:00 AM ET on Saturday, September 14 due to maintenance. We apologize for the inconvenience.


Search for: All records

Award ID contains: 1920920

Note: When clicking on a Digital Object Identifier (DOI) number, you will be taken to an external site maintained by the publisher. Some full text articles may not yet be available without a charge during the embargo (administrative interval).
What is a DOI Number?

Some links on this page may take you to non-federal websites. Their policies may differ from this site.

  1. Abstract

    A mob is an event that is organized via social media, email, SMS, or other forms of digital communication technologies in which a group of people (who might have an agenda) get together online or offline to collectively conduct an act and then disperse (quickly or over a long period). In recent years, these events are increasingly happening worldwide due to the anonymity of the internet, affordability of social media, boredom, etc. Studying such a phenomenon is difficult due to a lack of data, theoretical underpinning, and resources. In this research, we use the Agent-Based Modeling (ABM) technique to model the mobbers and the Monte Carlo method to assign random values to the factors extracted from the theory of Collective Action and conduct many simulations. We also leverage our previous research on Deviant Cyber Flash Mobs to implement various scenarios the mobber could face when they decide to act in a mob or not. This resulted in a model that can simulate mobs, estimate the mob success rate, and the needed powerful actors (e.g., mob organizers) for a mob to succeed. We finally evaluate our model using real-world mob data collected from the Meetup social media platform. This research is one step toward fully understanding mob formation and the motivations of its participants and organizers.

     
    more » « less
  2. Abstract Objective

    This study aims to establish an informative dynamic prediction model of treatment outcomes using follow-up records of tuberculosis (TB) patients, which can timely detect cases when the current treatment plan may not be effective.

    Materials and Methods

    We used 122 267 follow-up records from 17 958 new cases of pulmonary TB in the Republic of Moldova. A dynamic prediction framework integrating landmark modeling and machine learning algorithms was designed to predict patient outcomes during the course of treatment. Sensitivity and positive predictive value (PPV) were calculated to evaluate performance of the model at critical time points. New measures were defined to determine when follow-up laboratory tests should be conducted to obtain most informative results.

    Results

    The random-forest algorithm performed better than support vector machine and penalized multinomial logistic regression models for predicting TB treatment outcomes. For all 3 outcome classes (ie, cured, not cured, and died after 24 months following treatment initiation), sensitivity and PPV of prediction models improved as more follow-up information was collected. Specifically, sensitivity and PPV increased from 0.55 to 0.84 and from 0.32 to 0.88, respectively, for the not cured class.

    Conclusion

    The dynamic prediction framework utilizes longitudinal laboratory test results to predict patient outcomes at various landmarks. Sputum culture and smear results are among the important variables for prediction; however, the most recent sputum result is not always the most informative one. This framework can potentially facilitate a more effective treatment monitoring program and provide insights for policymakers toward improved guidelines on follow-up tests.

     
    more » « less
  3. Abstract

    Over the past several years, a multitude of methods to measure the fairness of a machine learning model have been proposed. However, despite the growing number of publications and implementations, there is still a critical lack of literature that explains the interplay of fair machine learning with the social sciences of philosophy, sociology, and law. We hope to remedy this issue by accumulating and expounding upon the thoughts and discussions of fair machine learning produced by both social and formal (i.e., machine learning and statistics) sciences in this field guide. Specifically, in addition to giving the mathematical and algorithmic backgrounds of several popular statistics-based fair machine learning metrics used in fair machine learning, we explain the underlying philosophical and legal thoughts that support them. Furthermore, we explore several criticisms of the current approaches to fair machine learning from sociological, philosophical, and legal viewpoints. It is our hope that this field guide helps machine learning practitioners identify and remediate cases where algorithms violate human rights and values.

     
    more » « less
  4. Free, publicly-accessible full text available December 1, 2025
  5. Adjeroh, Donald A ; Zhou, Xiaobo ; Derevyanchuk, Ekaterina G ; Shkurat, Tatiana P ; Martinez, Ivan ; Lipovich, Leonard (Ed.)

    This is a mini-review capturing the views and opinions of selected participants at the 2021 IEEE BIBM 3rd Annual LncRNA Workshop, held in Dubai, UAE. The views and opinions are expressed on five broad themes related to problems in lncRNA, namely, challenges in the computational analysis of lncRNAs, lncRNAs and cancer, lncRNAs in sports, lncRNAs and COVID-19, and lncRNAs in human brain activity.

     
    more » « less
    Free, publicly-accessible full text available August 1, 2025
  6. Free, publicly-accessible full text available May 27, 2025
  7. Free, publicly-accessible full text available May 13, 2025
  8. Free, publicly-accessible full text available December 15, 2024
  9. Free, publicly-accessible full text available December 15, 2024
  10. Free, publicly-accessible full text available December 5, 2024