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

P. Alex Dow

dblp:06/5720 · DBLP profile ↗
← Back
5ranked-venue papers
3as first author
0since 2021 · last 2016
—ORCID · none

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

Artificial intelligence and machine learning · 2 · 2 first-authorDatabases, data management, data science and information retrieval · 2 · 1 first-authorGraphics, computer vision, multimedia, augmented reality and games · 2 · 2 first-authorHuman-computer interaction and ubiquitous computing · 2 · 1 first-authorApplied, interdisciplinary, general and emerging 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.

Human-computer interaction and pervasive computing
1 paper
Collaborative and social computing · 56% Usability and user experience research · 44%
Databases, data mining, and information retrieval
1 paper
Web and social media mining · 67% Data mining · 33%
Theoretical computer science
2 papers
Graph algorithms and graph theory · 62% Algorithms and data structures · 38%

Topics — the 10 heaviest of 11, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Collaborative and social computing › social media
social network sites
0.212016
Changes in Engagement Before and After Posting to Facebook · CHI 2016
Usability and user experience research
user engagement
0.212016
Changes in Engagement Before and After Posting to Facebook · CHI 2016
Web and social media mining
information diffusion
0.212014
Can cascades be predicted? · WWW 2014
Web and social media mining › information diffusion
information diffusion prediction
0.212014
Can cascades be predicted? · WWW 2014
Data mining
predictive modeling
0.212014
Can cascades be predicted? · WWW 2014
Graph algorithms and graph theory › graph theory › graph parameters › graph width parameters
treewidth
0.222009
Duplicate Avoidance in Depth-First Search with Applications to Treewidth · IJCAI 2009
Best-First Search for Treewidth · AAAI 2007
Algorithms and data structures › search algorithms › heuristic search
best-first search
0.112007
Best-First Search for Treewidth · AAAI 2007
Algorithms and data structures
search algorithms
0.112007
Best-First Search for Treewidth · AAAI 2007
Graph algorithms and graph theory › graph theory › graph parameters › graph width parameters › treewidth
treewidth computation
0.112007
Best-First Search for Treewidth · AAAI 2007
Knowledge, reasoning and agents › Planning, search and constraint satisfaction › tree search
depth-first search
0.012009
Duplicate Avoidance in Depth-First Search with Applications to Treewidth · IJCAI 2009

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

observational data analysis · 0.2hypothesis testing · 0.2structural analysis · 0.2feature-based prediction · 0.2best-first search · 0.1
YearPublicationVenuePosition
2016 Changes in Engagement Before and After Posting to Facebook
abstract
The asynchronous nature of communications on social network sites creates a unique opportunity for studying how posting content interacts with individuals' engagement. This study focuses on the behavioral changes occurring hours before and after contribution to better understand the changing needs and preferences of contributors. Using observational data analysis of individuals' activity on Facebook, we test hypotheses regarding the motivations for site visits, changes in the distribution of attention to content, and shifts in decisions to interact with others. We find that after posting content people are intrinsically motivated to visit the site more often, are more attentive to content from friends (but not others), and choose to interact more with friends (in large part due to reciprocity). In addition, contributors are more active on the site hours before posting and remain more active for less than a day afterwards. Our study identifies a unique pattern of engagement that accompanies contribution and can inform the design of social network sites to better support contributors.
Nir Grinberg, P. Alex Dow, Lada A. Adamic, Mor Naaman
CHI2
2014 Can cascades be predicted?
abstract
On many social networking web sites such as Facebook and Twitter, resharing or reposting functionality allows users to share others' content with their own friends or followers. As content is reshared from user to user, large cascades of reshares can form. While a growing body of research has focused on analyzing and characterizing such cascades, a recent, parallel line of work has argued that the future trajectory of a cascade may be inherently unpredictable. In this work, we develop a framework for addressing cascade prediction problems. On a large sample of photo reshare cascades on Facebook, we find strong performance in predicting whether a cascade will continue to grow in the future. We find that the relative growth of a cascade becomes more predictable as we observe more of its reshares, that temporal and structural features are key predictors of cascade size, and that initially, breadth, rather than depth in a cascade is a better indicator of larger cascades. This prediction performance is robust in the sense that multiple distinct classes of features all achieve similar performance. We also discover that temporal features are predictive of a cascade's eventual shape. Observing independent cascades of the same content, we find that while these cascades differ greatly in size, we are still able to predict which ends up the largest.
Justin Cheng, Lada A. Adamic, P. Alex Dow, Jon M. Kleinberg, Jure Leskovec
WWW3
2013 The Anatomy of Large Facebook Cascades
P. Alex Dow, Lada A. Adamic, Adrien Friggeri
ICWSM1
2009 Duplicate Avoidance in Depth-First Search with Applications to Treewidth
P. Alex Dow, Richard E. Korf
IJCAI1
2007 Best-First Search for Treewidth
P. Alex Dow, Richard E. Korf
AAAI1