Every programmer has a characteristic style, ranging from preferences about identifier
naming to preferences about object relationships and design patterns. Coding conventions …

We present the first method for automatically mining code idioms from a corpus of previously
written, idiomatic software projects. We take the view that a code idiom is a syntactic …

The use of approximate graph matching for frequent subgraph mining has been identified in
different applications as a need. To meet this need, several algorithms have been …

Graphs, also known as networks, are an expressive data representation used in many
domains. Numerous algorithms have been designed to find interesting patterns in graphs …

Graphs are a popular data type found in many domains. Numerous techniques have been
proposed to find interesting patterns in graphs to help understand the data and support …

Discovering regularities in source code is of great interest to software engineers, both in
academia and in industry, as regularities can provide useful information to help in a variety …

We present an approach that shows all relevant subspaces of categorical data condensed in
a single picture. We model the categorical values of the attributes as co-occurrences with …

The problem of mining collections of trees to identify common patterns, called frequent
subtrees (FSTs), arises often when trying to interpret the results of phylogenetic analysis …

Research on source code mining has been explored to discover interesting structural
regularities, API usage patterns, refactoring opportunities, bugs, crosscutting concerns, code …

Given a large graph representing relations between entities, searching for complex
relationships (called semantic associations, or SAs for short) between a set of entities is a …