Aurora Schmidt
Current Organizations / Institutes
The organizations/institutes from the scholar's latest article
Previous Organizations / Institutes
The organizations / institutes from the scholar's other articles in the past ten years
Aurora Schmidt has a total of 34 co-authors. Here are the top co-authors by number of shared publications:
- Christopher John Cameron
Cornell University
4 shared publications - Vladimir Barash
Graphika Technologies Inc
4 shared publications - Michael Macy
Department of Sociology, Cornell University
3 shared publications - Amruta J. Deshpande
Graphika Inc
2 shared publications - Clay Fink
Johns Hopkins University Applied Physics Laboratory (JHU/APL), Laurel, USA
2 shared publications - Alexander Perrone
Johns Hopkins University Applied Physics Laboratory (JHU/APL), Laurel, USA
1 shared publication
Latest Publications
- Open Access
- 11 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-4
MACAIF: Machine Learning Auditing for Clinical AI Fairness
- 11 July 2023
- Published by Association for Computing Machinery (ACM)
- p. 1-4
Open AccessMACAIF: Machine Learning Auditing for Clinical AI Fairness
- 30 May 2022
- Published by Springer Nature
- p. 19-56
Critical Mass and Data Integrity Diagnostics of a Twitter Social Contagion Monitor
- 30 May 2022
- Published by Springer Nature
- p. 19-56
Critical Mass and Data Integrity Diagnostics of a Twitter Social Contagion Monitor
- 10 January 2022
- Published by Springer Nature in Computational and Mathematical Organization Theory
- Vol. 29 (1) , 156-187
Searching for explanations: testing social scientific methods in synthetic ground-truthed worlds
- 10 January 2022
- Published by Springer Nature in Computational and Mathematical Organization Theory
- Vol. 29 (1) , 156-187
Searching for explanations: testing social scientific methods in synthetic ground-truthed worlds
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Using Spectral Clustering of Hashtag Adoptions to Find Interest-Based Communities
We investigate the use of spectral clustering of hashtag adoptions in Nigerian Twitter users between October 2013 and November 2014. This period is of interest due to the online campaign centered around the #BringBackOurGirls (BBOG) hashtag, which relates to the kidnapping of 276 Nigerian schoolgirls. We examine the adoption of hashtags during the six months before, the month after, and the six months following the kidnapping to test the informational value of behavior-based clusters discovered with unsupervised methods for predicting future hashtag usage behaviors. We demonstrate an efficient spectral clustering approach, that leverages power iteration on symmetric adjacency matrices, to group users based on hashtag adoptions prior to the kidnapping. Unlike follow networkbased clusters, these adoption-based clusters reveal groups of users with similar interests and prove to be more predictive of interest in future topics. We compare this unsupervised spectral clustering to spectral clustering based on symmetrized follow network relations as well as clusters induced by latent Dirichlet allocation (LDA) topics. We find that hashtag adoptionbased clusters perform similarly to the more computationally expensive LDA approach at identifying interest groups that are more likely to adopt future topical tags. We also benchmark the spectral clustering approach against the popular Louvain clustering approach on a synthetic dataset, finding the faster spectral clustering algorithm produces more balanced clusters with a higher similarity to the true interest groupings used to synthesize adoption data.
- 1 May 2018
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- p. 1-7
Using Spectral Clustering of Hashtag Adoptions to Find Interest-Based Communities
We investigate the use of spectral clustering of hashtag adoptions in Nigerian Twitter users between October 2013 and November 2014. This period is of interest due to the online campaign centered around the #BringBackOurGirls (BBOG) hashtag, which relates to the kidnapping of 276 Nigerian schoolgirls. We examine the adoption of hashtags during the six months before, the month after, and the six months following the kidnapping to test the informational value of behavior-based clusters discovered with unsupervised methods for predicting future hashtag usage behaviors. We demonstrate an efficient spectral clustering approach, that leverages power iteration on symmetric adjacency matrices, to group users based on hashtag adoptions prior to the kidnapping. Unlike follow networkbased clusters, these adoption-based clusters reveal groups of users with similar interests and prove to be more predictive of interest in future topics. We compare this unsupervised spectral clustering to spectral clustering based on symmetrized follow network relations as well as clusters induced by latent Dirichlet allocation (LDA) topics. We find that hashtag adoptionbased clusters perform similarly to the more computationally expensive LDA approach at identifying interest groups that are more likely to adopt future topical tags. We also benchmark the spectral clustering approach against the popular Louvain clustering approach on a synthetic dataset, finding the faster spectral clustering algorithm produces more balanced clusters with a higher similarity to the true interest groupings used to synthesize adoption data.
- 26 December 2015
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 6 (1) , 1-19
Complex contagions and the diffusion of popular Twitter hashtags in Nigeria
- 26 December 2015
- Published by Springer Nature in Social Network Analysis and Mining
- Vol. 6 (1) , 1-19
Complex contagions and the diffusion of popular Twitter hashtags in Nigeria
- 1 March 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 2673-2676
Distributed field reconstruction with model-robust basis pursuit
We study the use of distributed average consensus and compressed sensing to perform decentralized estimation of a field measured by networked sensors. We examine field reconstruction of multiple acoustic sources from isotropic magnitude measurements. Compressed projections of global network observations are spread throughout the network using consensus, after which all nodes may invert the source field using ℓ 1 recovery methods. To approximate the problem as a discrete linear system, the space of source locations is quantized, introducing model error. We propose a model-robust adaptation to basis pursuit to control for the error arising from the spatial quantization. We show conditions for stability of the robust estimator, providing bounds on the reconstruction error based on perturbation constants, source magnitudes, and mutual coherence. Experiments show that the two types of robust estimators successfully address infeasibility and consistency issues that arise in basis pursuit for spatially quantized acoustic sources.
- 1 March 2012
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 15206149,p. 2673-2676
Distributed field reconstruction with model-robust basis pursuit
We study the use of distributed average consensus and compressed sensing to perform decentralized estimation of a field measured by networked sensors. We examine field reconstruction of multiple acoustic sources from isotropic magnitude measurements. Compressed projections of global network observations are spread throughout the network using consensus, after which all nodes may invert the source field using ℓ 1 recovery methods. To approximate the problem as a discrete linear system, the space of source locations is quantized, introducing model error. We propose a model-robust adaptation to basis pursuit to control for the error arising from the spatial quantization. We show conditions for stability of the robust estimator, providing bounds on the reconstruction error based on perturbation constants, source magnitudes, and mutual coherence. Experiments show that the two types of robust estimators successfully address infeasibility and consistency issues that arise in basis pursuit for spatially quantized acoustic sources.