Duplication Removal for a Search-based Recommendation System (bibtex)
by Hidehiko Masuhara, Naoya Murakami and Takuya Watanabe
Abstract:
A search-based recommendation system looks, in the code repository, for programs that are relevant to the program being edited. Storing a large amount of open source programs into the repository will make the search results better, but also causes the code clone problem; i.e., recommending a set of program fragments that are almost idential. To tackle this problem, we propose a novel approach that ranks recommended programs by taking their "freshness" count into account. This short paper discusses the background of the problem, and illustrates the proposed algorithm.
Reference:
Duplication Removal for a Search-based Recommendation System (Hidehiko Masuhara, Naoya Murakami and Takuya Watanabe), In Proceedings of the 4th International Workshop on Search-driven development: Users, Infrastructure, Tools and Evaluation (SUITE'12), 2012.
Bibtex Entry:
@inproceedings{masuhara2012suite,
  pdf = {suite2012.pdf},
  author = {Hidehiko Masuhara and Naoya Murakami and Takuya Watanabe},
  title = {Duplication Removal for a Search-based Recommendation System},
  pages = {31--34},
  date = {2012-06-05},
  location = {Zurich, Swizerland},
  doi = {10.1109/SUITE.2012.6225477},
  booktitle = {Proceedings of the 4th International Workshop on Search-driven development: Users, Infrastructure, Tools and Evaluation (SUITE'12)},
  year = 2012,
  keywords = {Selene},
  month = jun,
  abstract = {A search-based recommendation system looks, in the code repository, for programs that are relevant to the program being edited. Storing a large amount of open source programs into the repository will make the search results better, but also causes the code clone problem; i.e., recommending a set of program fragments that are almost idential. To tackle this problem, we propose a novel approach that ranks recommended programs by taking their ``freshness'' count into account. This short paper discusses the background of the problem, and illustrates the proposed algorithm.}
}
Powered by bibtexbrowser