Attributed subgraph matching is a powerful tool for explorative mining of large attributed
networks. In many applications (eg, network science of teams, intelligence analysis, finance …

How can we measure similarity between nodes quickly and accurately on large graphs?
Random walk with restart (RWR) provides a good measure, and has been used in various …

Searching for associations between entities is needed in many domains like national
security and bioinformatics. In recent years, it has been facilitated by the emergence of …

Labeled graphs provide a natural way of representing entities, relationships and structures
within real datasets such as knowledge graphs and protein interactions. Applications such …

Visitors to museums and other cultural heritage sites encounter a wealth of exhibits in a
variety of subject areas, but can explore only a small number of them. Moreover, there …

Traditionally, recommender systems are applied to recommending items to individual users.
However, there has been a proliferation of recommender systems that try to make …

Keyword search over databases, popularized by keyword search in WWW, allows ordinary
users to access database information without the knowledge of structured query languages …

We study the problem of extracting a selective connector for a given set of query vertices Q
subset of V in a graph G=(V, E). A selective connector is a subgraph of G which exhibits …

To improve the performance of recommender systems in a practical manner, several hybrid
approaches have been developed by considering item ratings and content information …

The increasing interest in social networks, knowledge graphs, protein-interaction, and many
other types of networks has raised the question how users can explore such large and …