14 citations · 14 across the 5 of their papers we have counts for
4 papers · 1 filter
Parallel Motif-Based Community Detection
Tianyi Chen, Charalampos E. Tsourakakis
Community detection is a central task in graph analytics. Given the substantial growth in graph size, scalability in community detection continues to be an unresolved challenge. Re…
Q-DISCO: Query-Centric Densest Subgraphs in Networks with Opinion Information
Tianyi Chen, Atsushi Miyauchi, Charalampos E. Tsourakakis
Given a network , where each node is associated with a vector representing its opinion about different topics, how can we uncov…
Densest Diverse Subgraphs: How to Plan a Successful Cocktail Party with Diversity
Atsushi Miyauchi, Tianyi Chen, Konstantinos Sotiropoulos +1
Dense subgraph discovery methods are routinely used in a variety of applications including the identification of a team of skilled individuals for collaboration from a social netwo…
AntiBenford Subgraphs: Unsupervised Anomaly Detection in Financial Networks
Tianyi Chen, Charalampos E. Tsourakakis
Benford's law describes the distribution of the first digit of numbers appearing in a wide variety of numerical data, including tax records, and election outcomes, and has been use…