Recommending random walks

11 years 5 months ago
Recommending random walks
We improve on previous recommender systems by taking advantage of the layered structure of software. We use a random-walk approach, mimicking the more focused behavior of a developer, who browses the caller-callee links in the callgraph of a large program, seeking routines that are likely to be related to a function of interest. Inspired by Kleinberg's work[10], we approximate the steady-state of an infinite random walk on a subset of a callgraph in order to rank the functions by their steady-state probabilities. Surprisingly, this purely structural approach works quite well. Our approach, like that of Robillard's"Suade"algorithm[15], and earlier data mining approaches [13] relies solely on the always available current state of the code, rather than other sources such as comments, documentation or revision information. Using the Apache API documentation as an oracle, we perform a quantitative evaluation of our method, finding that our algorithm dramatically improve...
Zachary M. Saul, Vladimir Filkov, Premkumar T. Dev
Added 20 Nov 2009
Updated 20 Nov 2009
Type Conference
Year 2007
Authors Zachary M. Saul, Vladimir Filkov, Premkumar T. Devanbu, Christian Bird
Comments (0)