{"push_id":669432738,"size":1,"distinct_size":1,"ref":"refs/heads/master","head":"2dd886a3d56970d3a785d94b943be38e3fd57130","before":"f91dc8b0b89d30dfde5eb929b2e62d5b2b78b206","commits":[{"sha":"2dd886a3d56970d3a785d94b943be38e3fd57130","author":{"email":"0d864c6a05ee63c8183224cd5edb5c9c6d9e3b72@gmail.com","name":"Doha Basem"},"message":"Apriori algorithm for computing frequent itemsets","distinct":true,"url":"https://api.github.com/repos/ReemHA/ftc_documentclustering/commits/2dd886a3d56970d3a785d94b943be38e3fd57130"}]}