Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Nazanin Alipourfard

dblp:200/0178 · DBLP profile ↗
← Back
5ranked-venue papers
2as first author
1since 2021 · last 2026
0000-0001-9971-2179ORCID · reported

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 4 · 2 first-author · 1 since 2021Applied, interdisciplinary, general and emerging computing · 3 · 1 first-author · 1 since 2021Artificial intelligence and machine learning · 2 · 1 first-authorHuman-computer interaction and ubiquitous computing · 2 · 1 first-author

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
2 papers
Web and social media mining · 77% Data mining · 23%
Interdisciplinary, comprehensive, and emerging computing
2 papers
Computational social science and digital humanities · 100%
Artificial intelligence
1 paper
Graph learning · 77% Learning paradigms · 23%

Topics — the 7 heaviest of 9, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Computational social science and digital humanities
science of science
1.012026
Emergence of Structural Disparities in the Web of Scientific Citations · WWW 2026
Web and social media mining
citation network analysis
1.012026
Emergence of Structural Disparities in the Web of Scientific Citations · WWW 2026
Machine learning › Graph learning › graph neural network
graph convolutional network
0.412019
MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing · ICML 2019
Machine learning › Graph learning
graph neural network
0.412019
MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing · ICML 2019
Machine learning › Learning paradigms › semi-supervised learning
graph-based semi-supervised learning
0.112019
MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing · ICML 2019
Machine learning › Learning paradigms
semi-supervised learning
0.112019
MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing · ICML 2019
Web and social media mining
user behavior analysis
0.112018
Can you Trust the Trend?: Discovering Simpson's Paradoxes in Social Data · WSDM 2018

Methods — techniques the papers use, named apart from their topics

preferential attachment · 2.0network growth model · 2.0homophily · 2.0statistical trend comparison · 0.7disaggregation analysis · 0.7sparsity regularization · 0.4
YearPublicationVenuePosition
2026 Emergence of Structural Disparities in the Web of Scientific Citations
abstract
Scientific attention is unevenly distributed, creating inequities in recognition and distorting access to opportunities. Using citations as a proxy, we quantify disparities in attention by gender and institutional prestige. We find that women receive systematically fewer citations than men, and that attention is increasingly concentrated among authors from elite institutions -- patterns not fully explained by underrepresentation alone. To explain these dynamics, we introduce a model of citation network growth that incorporates homophily (tendency to cite similar authors), preferential attachment (favoring highly cited authors) and group size (underrepresentation). The model shows that disparities arise not only from group size imbalances but also from cumulative advantage amplifying biased citation preferences. Importantly, increasing representation alone is often insufficient to reduce disparities. Effective strategies should also include reducing homophily, amplifying the visibility of underrepresented groups, and supporting equitable integration of newcomers. Our findings highlight the challenges of mitigating inequities in asymmetric networks like citations, where recognition flows in one direction. By making visible the mechanisms through which attention is distributed, we contribute to efforts toward a more responsible web of science that is fairer, more transparent, and more inclusive, and that better sustains innovation and knowledge production.
Buddhika Nettasinghe, Nazanin Alipourfard, Vikram Krishnamurthy, Kristina Lerman
WWW2
2019 MixHop: Higher-Order Graph Convolutional Architectures via Sparsified Neighborhood Mixing
abstract
Existing popular methods for semi-supervised learning with Graph Neural Networks (such as the Graph Convolutional Network) provably cannot learn a general class of neighborhood mixing relationships. To address this weakness, we propose a new model, MixHop, that can learn these relationships, including difference operators, by repeatedly mixing feature representations of neighbors at various distances. MixHop requires no additional memory or computational complexity, and outperforms on challenging baselines. In addition, we propose sparsity regularization that allows us to visualize how the network prioritizes neighborhood information across different graph datasets. Our analysis of the learned architectures reveals that neighborhood mixing varies per datasets.
Sami Abu-El-Haija, Bryan Perozzi, Amol Kapoor, Nazanin Alipourfard, Kristina Lerman, Hrayr Harutyunyan, Greg Ver Steeg, Aram Galstyan
ICML4
2018 Using Simpson's Paradox to Discover Interesting Patterns in Behavioral Data
Nazanin Alipourfard, Peter G. Fennell, Kristina Lerman
ICWSM1
2018 Can you Trust the Trend?: Discovering Simpson's Paradoxes in Social Data
abstract
We investigate how Simpson»s paradox affects analysis of trends in social data. According to the paradox, the trends observed in data that has been aggregated over an entire population may be different from, and even opposite to, those of the underlying subgroups. Failure to take this effect into account can lead analysis to wrong conclusions. We present a statistical method to automatically identify Simpson»s paradox in data by comparing statistical trends in the aggregate data to those in the disaggregated subgroups. We apply the approach to data from Stack Exchange, a popular question-answering platform, to analyze factors affecting answerer performance, specifically, the likelihood that an answer written by a user will be accepted by the asker as the best answer to his or her question. Our analysis confirms a known Simpson»s paradox and identifies several new instances. These paradoxes provide novel insights into user behavior on Stack Exchange.
Nazanin Alipourfard, Peter G. Fennell, Kristina Lerman
WSDM1
2017 Dynamics of Content Quality in Collaborative Knowledge Production
Emilio Ferrara, Nazanin Alipourfard, Keith Burghardt, Chiranth Gopal, Kristina Lerman
ICWSM2