Nicholas J. Foti
University of Washington
Network
Latest external collaboration on country level. Dive into details by clicking on the dots.
Publication
Featured researches published by Nicholas J. Foti.
Proceedings of the National Academy of Sciences of the United States of America | 2012
James M. Hughes; Nicholas J. Foti; David C. Krakauer; Daniel N. Rockmore
Literature is a form of expression whose temporal structure, both in content and style, provides a historical record of the evolution of culture. In this work we take on a quantitative analysis of literary style and conduct the first large-scale temporal stylometric study of literature by using the vast holdings in the Project Gutenberg Digital Library corpus. We find temporal stylistic localization among authors through the analysis of the similarity structure in feature vectors derived from content-free word usage, nonhomogeneous decay rates of stylistic influence, and an accelerating rate of decay of influence among modern authors. Within a given time period we also find evidence for stylistic coherence with a given literary topic, such that writers in different fields adopt different literary styles. This study gives quantitative support to the notion of a literary “style of a time” with a strong trend toward increasingly contemporaneous stylistic influence.
PLOS ONE | 2011
Nicholas J. Foti; James M. Hughes; Daniel N. Rockmore
Many real-world networks tend to be very dense. Particular examples of interest arise in the construction of networks that represent pairwise similarities between objects. In these cases, the networks under consideration are weighted, generally with positive weights between any two nodes. Visualization and analysis of such networks, especially when the number of nodes is large, can pose significant challenges which are often met by reducing the edge set. Any effective “sparsification” must retain and reflect the important structure in the network. A common method is to simply apply a hard threshold, keeping only those edges whose weight exceeds some predetermined value. A more principled approach is to extract the multiscale “backbone” of a network by retaining statistically significant edges through hypothesis testing on a specific null model, or by appropriately transforming the original weight matrix before applying some sort of threshold. Unfortunately, approaches such as these can fail to capture multiscale structure in which there can be small but locally statistically significant similarity between nodes. In this paper, we introduce a new method for backbone extraction that does not rely on any particular null model, but instead uses the empirical distribution of similarity weight to determine and then retain statistically significant edges. We show that our method adapts to the heterogeneity of local edge weight distributions in several paradigmatic real world networks, and in doing so retains their multiscale structure with relatively insignificant additional computational costs. We anticipate that this simple approach will be of great use in the analysis of massive, highly connected weighted networks.
IEEE Transactions on Pattern Analysis and Machine Intelligence | 2015
Nicholas J. Foti; Sinead A. Williamson
Dependent nonparametric processes extend distributions over measures, such as the Dirichlet process and the beta process, to give distributions over collections of measures, typically indexed by values in some covariate space. Such models are appropriate priors when exchangeability assumptions do not hold, and instead we want our model to vary fluidly with some set of covariates. Since the concept of dependent nonparametric processes was formalized by MacEachern, there have been a number of models proposed and used in the statistics and machine learning literatures. Many of these models exhibit underlying similarities, an understanding of which, we hope, will help in selecting an appropriate prior, developing new models, and leveraging inference techniques.
Journal of the Association for Information Science and Technology | 2018
Daniel N. Rockmore; Chen Fang; Nicholas J. Foti; Tom Ginsburg; David C. Krakauer
We explore how ideas from infectious disease and genetics can be used to uncover patterns of cultural inheritance and innovation in a corpus of 591 national constitutions spanning 1789–2008. Legal “ideas” are encoded as “topics”—words statistically linked in documents—derived from topic modeling the corpus of constitutions. Using these topics we derive a diffusion network for borrowing from ancestral constitutions back to the US Constitution of 1789 and reveal that constitutions are complex cultural recombinants. We find systematic variation in patterns of borrowing from ancestral texts and “biological”‐like behavior in patterns of inheritance, with the distribution of “offspring” arising through a bounded preferential‐attachment process. This process leads to a small number of highly innovative (influential) constitutions some of which have yet to have been identified as so in the current literature. Our findings thus shed new light on the critical nodes of the constitution‐making network. The constitutional network structure reflects periods of intense constitution creation, and systematic patterns of variation in constitutional lifespan and temporal influence.
Journal of the American Statistical Association | 2017
Nicholas J. Foti
——— (2008), “Multiplicative Latent Factor Models for Description and Prediction of Social Networks,” Computational and Mathematical Organization Theory, 15, 261. [1537] Hoff, P. D., Raftery, A. E., and Handcock, M. S. (2002), “Latent Space Approaches to Social Network Analysis,” Journal of the American Statistical Association, 97, 1090–1098. [1537] Krivitsky, P.N.,Handcock,M. S., Raftery, A. E., andHoff, P.D. (2009), “Representing Degree Distributions, Clustering, and Homophily in Social Networks With Latent Cluster Random Effects Models,” Social Networks, 31, 204–213. [1538] Minhas, S., Hoff, P. D., andWard, M. D. (2016), “Inferential Approaches for Network Analyses: AMEN for Latent Factor Models,” ArXiv e-prints. [1538] Rényi, A., and Erdős, P. (1959), “On Random Graphs, I,” Publicationes Mathematicae Debrecen, 6, 290–291. [1538]
Journal of Economic Dynamics and Control | 2013
Nicholas J. Foti; Scott D. Pauls; Daniel N. Rockmore
neural information processing systems | 2014
Nicholas J. Foti; Jason Xu; Dillon Laird
Journal of Machine Learning Research | 2015
Alex Tank; Nicholas J. Foti
neural information processing systems | 2017
Andrew C. Miller; Nicholas J. Foti; Ryan P. Adams
international conference on machine learning | 2017
Andrew C. Miller; Nicholas J. Foti; Ryan P. Adams