{"id":29556460,"url":"https://github.com/theveryhim/graph-analysis","last_synced_at":"2025-09-02T17:07:22.898Z","repository":{"id":302875241,"uuid":"1013785611","full_name":"theveryhim/Graph-analysis","owner":"theveryhim","description":"Network analysis using graph traversal algorithms!","archived":false,"fork":false,"pushed_at":"2025-07-04T22:20:18.000Z","size":2732,"stargazers_count":0,"open_issues_count":0,"forks_count":0,"subscribers_count":0,"default_branch":"main","last_synced_at":"2025-07-18T12:12:01.976Z","etag":null,"topics":["big-data","graph","hits-algorithm","network-analysis","page-rank","pixie","pyspark","spam-detection"],"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/theveryhim.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,"zenodo":null}},"created_at":"2025-07-04T13:10:56.000Z","updated_at":"2025-07-04T22:20:22.000Z","dependencies_parsed_at":"2025-07-04T23:23:38.763Z","dependency_job_id":"5f88c0a6-f88d-4327-b303-7a0a7e17c0a4","html_url":"https://github.com/theveryhim/Graph-analysis","commit_stats":null,"previous_names":["theveryhim/pagerank-hits","theveryhim/graph-analysis"],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/theveryhim/Graph-analysis","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theveryhim%2FGraph-analysis","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theveryhim%2FGraph-analysis/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theveryhim%2FGraph-analysis/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theveryhim%2FGraph-analysis/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/theveryhim","download_url":"https://codeload.github.com/theveryhim/Graph-analysis/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/theveryhim%2FGraph-analysis/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":273317749,"owners_count":25084037,"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","status":"online","status_checked_at":"2025-09-02T02:00:09.530Z","response_time":77,"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":["big-data","graph","hits-algorithm","network-analysis","page-rank","pixie","pyspark","spam-detection"],"created_at":"2025-07-18T10:11:34.425Z","updated_at":"2025-09-02T17:07:22.870Z","avatar_url":"https://github.com/theveryhim.png","language":"Jupyter Notebook","funding_links":[],"categories":[],"sub_categories":[],"readme":"# Graph analysis\n\n## PageRank-HITS(*Graph_Links*) \n\n- Determining dead-ends of a Graph data-set \n\u003cp align=\"center\"\u003e\n    \u003cimg src=\"1.png\" alt=\"Descriptive Alt Text\" class=\"fit-width-image\"\u003e\n\u003c/p\u003e\n\n- Implementing PageRank/HITS algorithm in pyspark framework.  \n```markdown\nFinal PageRank Values:\nNode 336: 0.0021227393017690947\nNode 408: 0.001825388389825673\nNode 200: 0.001732312450658645\nNode 368: 0.001026613470545319\n...\n```\n```markdown\nFinal HITS Values:\nNode 12: Hub = 0.27278320630152186, Authority = 0.30765685495417094\nNode 24: Hub = 0.07940933739439572, Authority = 0.7048000262044748\nNode 36: Hub = 0.4725510985034841, Authority = 0.5267444326313117\nNode 48: Hub = 0.17918427547367194, Authority = 0.321584176099179\n...\n```\n## Pixie-TrustRank: Persian tweeter data set(*dataset*)\n- Both task description and implementation can be found at *Task2*\n- Using the Pixie algorithm,create a graph of users and their interactions.\n\u003cp align=\"center\"\u003e\n    \u003cimg src=\"2.png\" alt=\"Descriptive Alt Text\" class=\"fit-width-image\"\u003e\n\u003c/p\u003e\n\n```markdown\nPixie Similarity Results (based on random walks starting from 'Armanjasoor'):\nUser: adam_hesabi, Visits: 19\nPixie Similarity Results (based on random walks starting from 'Armanjasoor'):\nUser: Ivar_lathbrug2, Visits: 15\nPixie Similarity Results (based on random walks starting from 'Armanjasoor'):\nUser: _Mahdiyar313, Visits: 14\nPixie Similarity Results (based on random walks starting from 'Armanjasoor'):\n...\n```\n- Using the TrustRank algorithm and calculating Spam Mass, design and implement an algorithm that can detect spam tweets.\n\n```markdown\n+--------------------+------------------+\n|                text|        spam_value|\n+--------------------+------------------+\n|دوستانی که ریموت ...|2.3017633100286403|\n|به عنوان پزشک، دا...| 6.385299525535547|\n|بنا به نظر #وزیر_...|11920.432214382174|\n|ظاهراً سازمان اطل...| 3126.438134169463|\n|اگر صحبت‌های آ.عج...|  797.080963052442|\n...\n```\n\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheveryhim%2Fgraph-analysis","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Ftheveryhim%2Fgraph-analysis","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Ftheveryhim%2Fgraph-analysis/lists"}