{"id":31427438,"url":"https://github.com/maimemo/SSP-MMC-Plus","last_synced_at":"2025-09-30T07:03:02.716Z","repository":{"id":79676106,"uuid":"512372470","full_name":"maimemo/SSP-MMC-Plus","owner":"maimemo","description":"Optimizing Spaced Repetition Schedule by Capturing the Dynamics of Memory","archived":false,"fork":false,"pushed_at":"2024-03-14T11:42:48.000Z","size":45,"stargazers_count":58,"open_issues_count":0,"forks_count":5,"subscribers_count":3,"default_branch":"main","last_synced_at":"2025-09-19T01:54:10.593Z","etag":null,"topics":["paper","reproducibility","spaced-repetition-algorithm"],"latest_commit_sha":null,"homepage":"https://doi.org/10.1109/TKDE.2023.3251721","language":"Python","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/maimemo.png","metadata":{"files":{"readme":"README.md","changelog":null,"contributing":null,"funding":null,"license":"LICENSE","code_of_conduct":null,"threat_model":null,"audit":null,"citation":"CITATION.cff","codeowners":null,"security":null,"support":null,"governance":null,"roadmap":null,"authors":null,"dei":null,"publiccode":null,"codemeta":null,"zenodo":null}},"created_at":"2022-07-10T07:29:28.000Z","updated_at":"2025-07-23T07:35:45.000Z","dependencies_parsed_at":"2025-04-12T05:07:53.252Z","dependency_job_id":"32566df1-aba8-4ed5-b4c6-b7452f0a6c3b","html_url":"https://github.com/maimemo/SSP-MMC-Plus","commit_stats":null,"previous_names":[],"tags_count":0,"template":false,"template_full_name":null,"purl":"pkg:github/maimemo/SSP-MMC-Plus","repository_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maimemo%2FSSP-MMC-Plus","tags_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maimemo%2FSSP-MMC-Plus/tags","releases_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maimemo%2FSSP-MMC-Plus/releases","manifests_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maimemo%2FSSP-MMC-Plus/manifests","owner_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/owners/maimemo","download_url":"https://codeload.github.com/maimemo/SSP-MMC-Plus/tar.gz/refs/heads/main","sbom_url":"https://repos.ecosyste.ms/api/v1/hosts/GitHub/repositories/maimemo%2FSSP-MMC-Plus/sbom","scorecard":null,"host":{"name":"GitHub","url":"https://github.com","kind":"github","repositories_count":277644033,"owners_count":25852787,"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-30T02:00:09.208Z","response_time":75,"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":["paper","reproducibility","spaced-repetition-algorithm"],"created_at":"2025-09-30T07:01:04.272Z","updated_at":"2025-09-30T07:03:02.712Z","avatar_url":"https://github.com/maimemo.png","language":"Python","funding_links":[],"categories":["Related"],"sub_categories":["Algorithm"],"readme":"# SSP-MMC-Plus\n\nCopyright (c) 2023 [MaiMemo](https://www.maimemo.com/), Inc. MIT License.\n\nSSP-MMC-Plus is the extended version of [SSP-MMC](https://github.com/maimemo/SSP-MMC), a spaced repetition scheduling algorithm used to help learners remember more words in MaiMemo, a language learning application in China.\n\nThis repository contains a public release of the data and code used for several experiments in the following paper (which introduces SSP-MMC-Plus):\n\n\u003e J. Su, J. Ye, L. Nie, Y. Cao and Y. Chen, \"Optimizing Spaced Repetition Schedule by Capturing the Dynamics of Memory,\" in IEEE Transactions on Knowledge and Data Engineering, doi: 10.1109/TKDE.2023.3251721.\n\nThe paper is a substantial extension of our previous conference paper [A Stochastic Shortest Path Algorithm for Optimizing Spaced Repetition Scheduling](https://www.maimemo.com/paper/) (free access).\n\nWhen using this dataset and/or code, please cite this publication. A BibTeX record is:\n\n```\n@ARTICLE{10059206,\n  author={Su, Jingyong and Ye, Junyao and Nie, Liqiang and Cao, Yilong and Chen, Yongyong},\n  journal={IEEE Transactions on Knowledge and Data Engineering}, \n  title={Optimizing Spaced Repetition Schedule by Capturing the Dynamics of Memory}, \n  year={2023},\n  volume={35},\n  number={10},\n  pages={10085-10097},\n  doi={10.1109/TKDE.2023.3251721}}\n```\n\n## Dataset and Format\n\nThe dataset is available on [Dataverse](https://doi.org/10.7910/DVN/VAGUL0) (1.6 GB). This is a 7zipped TSV file containing our experiments' 220 million MaiMemo student memory behavior logs.\n\nThe columns are as follows:\n\nu - student user ID who reviewed the word (anonymized)\n\nw - spelling of the word\n\ni - total times the user has reviewed the word\n\nd - difficulty of the word\n\nt_history - interval sequence of the historic reviews\n\nr_history - recall sequence of the historic reviews\n\ndelta_t - time elapsed from the last review\n\nr - result of the review\n\np_recall - probability of recall\n\ntotal_cnt - number of users who did the same memory behavior\n","project_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaimemo%2FSSP-MMC-Plus","html_url":"https://awesome.ecosyste.ms/projects/github.com%2Fmaimemo%2FSSP-MMC-Plus","lists_url":"https://awesome.ecosyste.ms/api/v1/projects/github.com%2Fmaimemo%2FSSP-MMC-Plus/lists"}