#### Filter Results:

- Full text PDF available (55)

#### Publication Year

1995

2019

- This year (7)
- Last 5 years (44)
- Last 10 years (85)

#### Publication Type

#### Co-author

#### Journals and Conferences

Learn More

Controlling the dissemination of an entity (e.g., meme, virus, etc) on a large graph is an interesting problem in many disciplines. Examples include epidemiology, computer security, marketing, etc.… (More)

- Keith Henderson, Brian Gallagher, +6 authors Lei Li
- KDD
- 2012

Given a network, intuitively two nodes belong to the same role if they have similar structural behavior. Roles should be automatically determined from the data, and could be, for example,… (More)

We focus on large graphs where nodes have attributes, such as a social network where the nodes are labelled with each person's job title. In such a setting, we want to find subgraphs that match a… (More)

- Keith Henderson, Brian Gallagher, +4 authors Christos Faloutsos
- KDD
- 2011

Given a graph, how can we extract good features for the nodes? For example, given two large graphs from the same domain, how can we use information in one to do classification in the other (i.e.,… (More)

We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical relational learning… (More)

- Hanghang Tong, B. Aditya Prakash, Charalampos E. Tsourakakis, Tina Eliassi-Rad, Christos Faloutsos, Duen Horng Chau
- IEEE International Conference on Data Mining
- 2010

Given a large graph, like a computer network, which k nodes should we immunize (or monitor, or remove), to make it as robust as possible against a computer virus attack? We need (a) a measure of the… (More)

- Keith Henderson, Tina Eliassi-Rad
- SAC
- 2009

This paper introduces LDA-G, a scalable Bayesian approach to finding latent group structures in large real-world graph data. Existing Bayesian approaches for group discovery (such as Infinite… (More)

- Michele Berlingerio, Danai Koutra, Tina Eliassi-Rad, Christos Faloutsos
- IEEE/ACM International Conference on Advances in…
- 2013

Given a set of k networks, possibly with different sizes and no overlaps in nodes or links, how can we quickly assess similarity between them? Analogously, are there a set of social theories which,… (More)

- Allison June-Barlow Chaney, David M. Blei, Tina Eliassi-Rad
- RecSys
- 2015

Preference-based recommendation systems have transformed how we consume media. By analyzing usage data, these methods uncover our latent preferences for items (such as articles or movies) and form… (More)