{"id":13411552,"url":"https://github.com/seiflotfy/count-min-log","last_synced_at":"2025-04-14T22:55:30.213Z","repository":{"id":36539320,"uuid":"40845144","full_name":"seiflotfy/count-min-log","owner":"seiflotfy","description":"Go implementation of Count-Min-Log","archived":false,"fork":false,"pushed_at":"2025-03-04T03:04:48.000Z","size":44,"stargazers_count":67,"open_issues_count":1,"forks_count":6,"subscribers_count":3,"default_branch":"master","last_synced_at":"2025-04-14T22:55:16.619Z","etag":null,"topics":[],"latest_commit_sha":null,"homepage":"","language":"Go","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/seiflotfy.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-08-16T22:31:36.000Z","updated_at":"2025-03-28T14:30:01.000Z","dependencies_parsed_at":"2022-08-29T01:31:48.963Z","dependency_job_id":null,"html_url":"https://github.com/seiflotfy/count-min-log","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/seiflotfy%2Fcount-min-log","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seiflotfy%2Fcount-min-log/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seiflotfy%2Fcount-min-log/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/seiflotfy%2Fcount-min-log/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/seiflotfy","download_url":"https://codeload.github.com/seiflotfy/count-min-log/tar.gz/refs/heads/master","host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":248975330,"owners_count":21192208,"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-07-30T20:01:14.471Z","updated_at":"2025-04-14T22:55:30.200Z","avatar_url":"https://github.com/seiflotfy.png","language":"Go","funding_links":[],"categories":["Data Structures","Data Structures and Algorithms","数据结构与算法","数据结构","Data Integration Frameworks","數據結構","数据结构`go语言实现的数据结构与算法`","Uncategorized","\u003cspan id=\"数据结构-data-structures\"\u003e数据结构 Data Structures\u003c/span\u003e","Generators"],"sub_categories":["Advanced Console UIs","Standard CLI","Miscellaneous Data Structures and Algorithms","杂项数据结构和算法","高级控制台界面","高級控制台界面","标准 CLI","\u003cspan id=\"高级控制台用户界面-advanced-console-uis\"\u003e高级控制台用户界面 Advanced Console UIs\u003c/span\u003e"],"readme":"# Count-Min-Log\n[![GoDoc](https://godoc.org/github.com/seiflotfy/count-min-log?status.svg)](https://godoc.org/github.com/seiflotfy/count-min-log)\n\n[Count-Min-Log sketch: Approximately counting with approximate counters - Guillaume Pitel \u0026 Geoffroy Fouquier](http://iswag-symposium.org/2015/pdfs/shortpaper1.pdf)\n\n\u003cb\u003eTL;DR:\u003c/b\u003e Count-Min-Log Sketch for improved Average Relative Error on low frequency events\n\nCount-Min Sketch is a widely adopted algorithm for approximate event counting in large scale processing. However, the original version of the Count-Min-Sketch (CMS) suffers of some deficiences, especially if one is interested in the low-frequency items, such as in text- mining related tasks. Several variants of CMS have been proposed to compensate for the high relative error for low-frequency events, but the proposed solutions tend to correct the errors instead of preventing them. In this paper, we propose the Count-Min-Log sketch, which uses logarithm-based, approximate counters instead of linear counters to improve the average relative error of CMS at constant memory footprint.\n\n\n## Example Usage\n\n```go\nimport cml\n\n...\nsk, err := cml.NewDefaultSketch()\nsk.IncreaseCount([]byte(\"scott pilgrim\"))\n...\n\nsk.Frequency([]byte(\"scott pilgrim\")) // ==\u003e 1\n\n```\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fseiflotfy%2Fcount-min-log","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fseiflotfy%2Fcount-min-log","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fseiflotfy%2Fcount-min-log/lists"}