{"id":19052908,"url":"https://github.com/juanmbraga/linear-classifier-with-computational-geometry","last_synced_at":"2026-04-30T12:33:06.892Z","repository":{"id":203015852,"uuid":"708580762","full_name":"juanmbraga/linear-classifier-with-computational-geometry","owner":"juanmbraga","description":"A 2D linear classifier that wraps each group of points in a tight shape and then draws a separating line","archived":false,"fork":false,"pushed_at":"2024-06-01T14:05:53.000Z","size":1694,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":1,"default_branch":"main","last_synced_at":"2025-11-12T12:22:18.420Z","etag":null,"topics":["closest-pair-of-points","linear-classifier","python","sweep-line-algorithm"],"latest_commit_sha":null,"homepage":"","language":"Jupyter Notebook","has_issues":true,"has_wiki":null,"has_pages":null,"mirror_url":null,"source_name":null,"license":"mit","status":null,"scm":"git","pull_requests_enabled":true,"icon_url":"https://github.com/juanmbraga.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,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null}},"created_at":"2023-10-23T00:21:35.000Z","updated_at":"2024-06-01T14:05:56.000Z","dependencies_parsed_at":null,"dependency_job_id":"b4a0cef4-bb31-4b23-b68e-963d81f75ff0","html_url":"https://github.com/juanmbraga/linear-classifier-with-computational-geometry","commit_stats":null,"previous_names":["juanmbraga/linear-classifier-with-computational-geometry"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/juanmbraga/linear-classifier-with-computational-geometry","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/juanmbraga%2Flinear-classifier-with-computational-geometry","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/juanmbraga%2Flinear-classifier-with-computational-geometry/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/juanmbraga%2Flinear-classifier-with-computational-geometry/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/juanmbraga%2Flinear-classifier-with-computational-geometry/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/juanmbraga","download_url":"https://codeload.github.com/juanmbraga/linear-classifier-with-computational-geometry/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/juanmbraga%2Flinear-classifier-with-computational-geometry/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":286080680,"owners_count":32465009,"icon_url":"https://github.com/github.png","version":null,"created_at":"2022-05-30T11:31:42.601Z","updated_at":"2026-04-29T22:27:22.272Z","status":"online","status_checked_at":"2026-04-30T02:00:05.929Z","response_time":57,"last_error":null,"robots_txt_status":"success","robots_txt_updated_at":"2025-07-24T06:49:26.215Z","robots_txt_url":"https://github.com/robots.txt","online":true,"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":["closest-pair-of-points","linear-classifier","python","sweep-line-algorithm"],"created_at":"2024-11-08T23:28:24.276Z","updated_at":"2026-04-30T12:33:06.874Z","avatar_url":"https://github.com/juanmbraga.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"Practical Project 01 | DCC207 - Algorithms 2 | October 2023, Federal University of Minas Gerais\n\n# Doing Linear Classification with Computational Geometry\nThis project aims to use `computational geometry` algorithms to create a `linear classification` model, which uses a straight line to classify data points into two categories.\n\n## Implementation objectives\n- A Convex Hull algorithm\n- A Sweep-Line Segment Intersection algorithm\n- A Closest Pair of Points algorithm\n- Find the classification line\n- Evaluate with metrics 10 datasets from online databases\n\n**Steps:** Starting from a training dataset, the algorithm must find an envelope (boundary) that delimits a classification region for a dataset (points in the Cartesian plane). From two of these envelopes, it will be possible to determine if there is separability (or if they have overlapping areas) and then determine a line that separates the two datasets.\n\n---\n**Students:**\n[Juan Braga](https://github.com/juanmbraga), [Lucas Almeida](https://github.com/zzzluquinhas), e [Luiz Romanhol](https://github.com/LuizRomanhol)\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuanmbraga%2Flinear-classifier-with-computational-geometry","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fjuanmbraga%2Flinear-classifier-with-computational-geometry","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fjuanmbraga%2Flinear-classifier-with-computational-geometry/lists"}