{"id":38665568,"url":"https://github.com/lene/tavsiye","last_synced_at":"2026-01-17T09:47:27.362Z","repository":{"id":30064340,"uuid":"33613782","full_name":"lene/tavsiye","owner":"lene","description":"A very basic recommendation engine implemented in Python.","archived":false,"fork":false,"pushed_at":"2018-03-05T12:20:07.000Z","size":45,"stargazers_count":1,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"master","last_synced_at":"2025-03-21T22:02:58.163Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Python","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"gpl-3.0","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/lene.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null}},"created_at":"2015-04-08T14:59:46.000Z","updated_at":"2018-03-04T20:18:59.000Z","dependencies_parsed_at":"2022-08-28T18:05:36.865Z","dependency_job_id":null,"html_url":"https://github.com/lene/tavsiye","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/lene/tavsiye","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lene%2Ftavsiye","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lene%2Ftavsiye/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lene%2Ftavsiye/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lene%2Ftavsiye/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/lene","download_url":"https://codeload.github.com/lene/tavsiye/tar.gz/refs/heads/master","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/lene%2Ftavsiye/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":28505565,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-01-17T06:57:29.758Z","status":"ssl_error","status_checked_at":"2026-01-17T06:56:03.931Z","response_time":85,"last_error":"SSL_read: unexpected eof while reading","robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":false,"can_crawl_api":true,"host_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub","repositories_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories","repository_names_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repository_names","owners_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners"}},"keywords":[],"created_at":"2026-01-17T09:47:27.216Z","updated_at":"2026-01-17T09:47:27.328Z","avatar_url":"https://github.com/lene.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"A very basic recommendation engine implemented in Python.\n\nUsage:\n    `python recommender.py [-h|-f FILENAME|--user USER|--set-comparison SET_COMPARISON|--cutoff CUTOFF]`\n\nRunning test suite:\n    `python test_recommender.py \u0026\u0026 mypy . \u0026\u0026 flake8 --max-line-length=100`\n\nImplementation thoughts:\n- The entire recommendation algorithm can be found in compare_sets.py.\n- I found it useful to plug different algorithms for computing the similarity of sets into the\n recommendation engine. The other comparison algorithms can be found in alternative_methods.py.\n- In principle, nothing stops you from plugging custom objects as a similarity_matrix into\n the similar_users() and recommendations() functions. (I don't supply an example for this though.)\n You might want to do that because the similarity_matrix I calculate grows is O(N^2) in the number\n of users - in real world settings you'd want to optimize this.\n- You have to decide on a numeric value for the similarity of two sets of liked products to\n consider two users similar in taste. I plugged that value as parameter 'cutoff' into the relevant\n functions.\n- I am not sure the MinHash-algorithm I used is stable - I sort of whipped it up. It is hard to\n test stochastic algorithms, I considered this outside the scope of this exercise.\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flene%2Ftavsiye","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Flene%2Ftavsiye","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Flene%2Ftavsiye/lists"}