TE
科技回声
首页24小时热榜最新最佳问答展示工作
GitHubTwitter
首页

科技回声

基于 Next.js 构建的科技新闻平台,提供全球科技新闻和讨论内容。

GitHubTwitter

首页

首页最新最佳问答展示工作

资源链接

HackerNews API原版 HackerNewsNext.js

© 2025 科技回声. 版权所有。

Show HN: My implementation of Google's bug prediction algorithm

5 点作者 d0vs超过 13 年前
Hi, everyone!<p>I'm a high-school student. I saw that blog post about bug prediction on Google Engineering Tools blog (&#60;http://google-engtools.blogspot.com/2011/12/bug-prediction-at-google.html&#62;), and today I decided to implement it in Python, just for fun.<p>It's buggy on some repos due to issues with GitPython.<p>&#60;http://pypi.python.org/pypi/bugspots&#62;<p>Anyway, what do you think?<p><i>I know, weird title: character limiting.</i>

1 comment

jnazario超过 13 年前
had a look at the code (specifically version 1.0). a couple of comments.<p>first it's not bad! much better code than when i was your age.<p>second, you have a huge assumption, i think, at line 73 where your code has "repo_age = int(time.time()) - first_commit_time". this assumes that the repository has seen edits recently, but think about a repository that has been dormant for a few months. the score of any bugfix will go down but there's no reason for it to: did bugs get fixed - and less "hot" - when the repo was dormant? no. what you need to do is to find the total timespan of the repository, looking at the min and max times of the commits, then base your scores on that.<p>keep up the good work!
评论 #3409887 未加载