31 Result(s)

Article

A hidden challenge of link prediction: which pairs to check?

The traditional setup of link prediction in networks assumes that a test set of node pairs, which is usually balanced, is available over which to predict the presence of links. However, in practice, there is n...

Caleb Belth, Alican Büyükçakır, Danai Koutra in Knowledge and Information Systems (2022)

Chapter and Conference Paper

SpecGreedy: Unified Dense Subgraph Detection

How can we effectively detect fake reviews or fraudulent connections on a website? How can we spot communities that suddenly appear based on users’ interaction? And how can we efficiently find the minimum cut ...

Wenjie Feng, Shenghua Liu, Danai Koutra… in Machine Learning and Knowledge Discovery i… (2021)

Article

t-PINE: tensor-based predictable and interpretable node embeddings

Graph representations have increasingly grown in popularity during the last years. Existing representation learning approaches explicitly encode network structure. Despite their good performance in downstream ...

Saba Al-Sayouri, Ekta Gujral, Danai Koutra… in Social Network Analysis and Mining (2020)

Chapter and Conference Paper

node2bits: Compact Time- and Attribute-Aware Node Representations for User Stitching

Identity stitching, the task of identifying and matching various online references (e.g., sessions over different devices and timespans) to the same user in real-world web services, is crucial for personalizatio...

Di **, Mark Heimann, Ryan A. Rossi… in Machine Learning and Knowledge Discovery i… (2020)

Article

Fast network discovery on sequence data via time-aware hashing

Discovering and analyzing networks from non-network data is a task with applications in fields as diverse as neuroscience, genomics, climate science, economics, and more. In domains where networks are discover...

Tara Safavi, Chandra Sripada, Danai Koutra in Knowledge and Information Systems (2019)

Article

On effective and efficient graph edge labeling

Graphs, such as social, road and information networks, are ubiquitous as they naturally model entities and their relationships. Many query processing tasks on graphs are concerned about efficiently accessing n...

Oshini Goonetilleke, Danai Koutra, Kewen Liao… in Distributed and Parallel Databases (2019)

Article

Reducing large graphs to small supergraphs: a unified approach

Summarizing a large graph with a much smaller graph is critical for applications like speeding up intensive graph algorithms and interactive visualization. In this paper, we propose CONditional Diversified Net...

Yike Liu, Tara Safavi, Neil Shah, Danai Koutra in Social Network Analysis and Mining (2018)

Chapter

Introduction

Danai Koutra, Christos Faloutsos in Individual and Collective Graph Mining (2018)

Chapter

Conclusions and Further Research Problems

Graphs are very powerful representations of data and the relations among them. The Web, friendships and communications, collaborations and phone calls, traffic flow, or brain functions are only few examples of...

Danai Koutra, Christos Faloutsos in Individual and Collective Graph Mining (2018)

Chapter

Summarization of Static Graphs

One natural way to understand a graph and its underlying processes is to visualize and interact with it. However, for large datasets with several millions or billions of nodes and edges, such as the Facebook s...

Danai Koutra, Christos Faloutsos in Individual and Collective Graph Mining (2018)

Chapter

Summarization of Dynamic Graphs

In many applications, it is necessary or at least beneficial to explore multiple graphs collectively. These graphs can be temporal instances of the same set of objects (time-evolving graphs), or disparate netw...

Danai Koutra, Christos Faloutsos in Individual and Collective Graph Mining (2018)

Chapter

Graph Alignment

Can we spot the same people in two different social networks, such as LinkedIn and Facebook? How can we find similar people across different graphs? How can we effectively link an information network with a socia...

Danai Koutra, Christos Faloutsos in Individual and Collective Graph Mining (2018)