Most previously proposed frequent graph mining algorithms are intended to find the complete set of all frequent, closed subgraphs. However, in many cases only a subset of the freq...
Inspired by our past manual aspect mining experiences, this paper describes a random walk model to approximate how crosscutting concerns can be discovered in the absence of domain...
Abstract. API error-handling specifications are often not documented, necessitating automated specification mining. Automated mining of error-handling specifications is challenging...
The mining of frequent patterns in databases has been studied for several years. However, the real-world data tends to be dirty and frequent pattern mining which extracts patterns...
Social navigation is the alternative way of looking upon navigation in the virtual world: e g instead of navigating the web by maps and hierarchies and search engines, you would n...