{"id":16978549,"url":"https://github.com/faultaddr/travel-recommendation","last_synced_at":"2025-04-12T01:41:35.617Z","repository":{"id":105828455,"uuid":"83873674","full_name":"faultaddr/Travel-recommendation","owner":"faultaddr","description":"爬取携程网站北京地区图片和地点以及相关的数据库操作","archived":false,"fork":false,"pushed_at":"2017-03-04T12:14:11.000Z","size":41,"stargazers_count":6,"open_issues_count":0,"forks_count":0,"subscribers_count":2,"default_branch":"master","last_synced_at":"2025-03-25T21:22:07.540Z","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":null,"status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/faultaddr.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":null,"code_of_conduct":null,"threat_model":null,"audit":null,"citation":null,"codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2017-03-04T07:05:45.000Z","updated_at":"2023-09-05T06:21:42.000Z","dependencies_parsed_at":"2023-06-14T07:30:33.379Z","dependency_job_id":null,"html_url":"https://github.com/faultaddr/Travel-recommendation","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faultaddr%2FTravel-recommendation","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faultaddr%2FTravel-recommendation/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faultaddr%2FTravel-recommendation/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/faultaddr%2FTravel-recommendation/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/faultaddr","download_url":"https://codeload.github.com/faultaddr/Travel-recommendation/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248505752,"owners_count":21115352,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2022-07-04T15:15:14.044Z","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":"2024-10-14T01:43:41.980Z","updated_at":"2025-04-12T01:41:35.608Z","avatar_url":"https://github.com/faultaddr.png","language":"Python","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Travel-recommendation\n   这是一个用于CUFE_TRIP  app的一套背包客旅行推荐系统，用Python搭建。\n   思路：\n   \n - 首先划定出行范围，通过定位目标位置附近 能够在1个小时内到达的景点作为待选点。\n - 根据待选点进行 聚类，根据用户的出行需求（比如要玩三天 五天 等），来进行聚类，把待选点分成对应数量的集合。\n - 通过对集合中的点进行遍历，因为是哈密顿图，也就是联通图，要遍历所有的点需要找到最短路径。是一个NP问题，还好要求处理的点的个数比较少，所以N！也可以忍受。\n\n### 里面还附有从携程抓下来的图片，基本上都有水印，所以基本上就是自己写的小东西可以用一下，大规模的企业应用最好还是自己爬。\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaultaddr%2Ftravel-recommendation","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ffaultaddr%2Ftravel-recommendation","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ffaultaddr%2Ftravel-recommendation/lists"}