A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2017; you can also visit the original URL.
The file type is application/pdf
.
Recommending random walks
2007
Proceedings of the the 6th joint meeting of the European software engineering conference and the ACM SIGSOFT symposium on The foundations of software engineering - ESEC-FSE '07
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
doi:10.1145/1287624.1287629
dblp:conf/sigsoft/SaulFDB07
fatcat:arcutyhhy5ebbooug2c7syd4le