TE
TechEcho
Home24h TopNewestBestAskShowJobs
GitHubTwitter
Home

TechEcho

A tech news platform built with Next.js, providing global tech news and discussions.

GitHubTwitter

Home

HomeNewestBestAskShowJobs

Resources

HackerNews APIOriginal HackerNewsNext.js

© 2025 TechEcho. All rights reserved.

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

5 pointsby d0vsover 13 years ago
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

jnazarioover 13 years ago
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 未加载