{"id":"https://openalex.org/W4290927800","doi":"https://doi.org/10.1145/3534678.3539081","title":"A Stochastic Shortest Path Algorithm for Optimizing Spaced Repetition Scheduling","display_name":"A Stochastic Shortest Path Algorithm for Optimizing Spaced Repetition Scheduling","publication_year":2022,"publication_date":"2022-08-12","ids":{"openalex":"https://openalex.org/W4290927800","doi":"https://doi.org/10.1145/3534678.3539081"},"language":"en","primary_location":{"id":"doi:10.1145/3534678.3539081","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3534678.3539081","pdf_url":null,"source":{"id":"https://openalex.org/S4363608767","display_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"},"type":"article","indexed_in":["crossref"],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5069301218","display_name":"Junyao Ye","orcid":"https://orcid.org/0000-0001-7475-0718"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":true,"raw_author_name":"Junyao Ye","raw_affiliation_strings":["Harbin Institute of Technology, Shenzhen, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5069706913","display_name":"Jingyong Su","orcid":"https://orcid.org/0000-0003-3216-7027"},"institutions":[{"id":"https://openalex.org/I204983213","display_name":"Harbin Institute of Technology","ror":"https://ror.org/01yqg2h08","country_code":"CN","type":"education","lineage":["https://openalex.org/I204983213"]}],"countries":["CN"],"is_corresponding":false,"raw_author_name":"Jingyong Su","raw_affiliation_strings":["Harbin Institute of Technology, Shenzhen, Shenzhen, China"],"affiliations":[{"raw_affiliation_string":"Harbin Institute of Technology, Shenzhen, Shenzhen, China","institution_ids":["https://openalex.org/I204983213"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5101769796","display_name":"Yilong Cao","orcid":"https://orcid.org/0009-0006-5605-0092"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yilong Cao","raw_affiliation_strings":["MaiMemo Inc., Qingyuan, China"],"affiliations":[{"raw_affiliation_string":"MaiMemo Inc., Qingyuan, China","institution_ids":[]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5069301218"],"corresponding_institution_ids":["https://openalex.org/I204983213"],"apc_list":null,"apc_paid":null,"fwci":0.6587,"has_fulltext":false,"cited_by_count":13,"citation_normalized_percentile":{"value":0.78012775,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":94,"max":99},"biblio":{"volume":null,"issue":null,"first_page":"4381","last_page":"4390"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T11714","display_name":"Multimodal Machine Learning Applications","score":0.993399977684021,"subfield":{"id":"https://openalex.org/subfields/1707","display_name":"Computer Vision and Pattern Recognition"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10028","display_name":"Topic Modeling","score":0.991100013256073,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11902","display_name":"Intelligent Tutoring Systems and Adaptive Learning","score":0.9902999997138977,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/repetition","display_name":"Repetition (rhetorical device)","score":0.8005906343460083},{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.7791728973388672},{"id":"https://openalex.org/keywords/memorization","display_name":"Memorization","score":0.6799570322036743},{"id":"https://openalex.org/keywords/mnemonic","display_name":"Mnemonic","score":0.6462077498435974},{"id":"https://openalex.org/keywords/shortest-path-problem","display_name":"Shortest path problem","score":0.5679113268852234},{"id":"https://openalex.org/keywords/scheduling","display_name":"Scheduling (production processes)","score":0.5116062760353088},{"id":"https://openalex.org/keywords/markov-process","display_name":"Markov process","score":0.41650527715682983},{"id":"https://openalex.org/keywords/algorithm","display_name":"Algorithm","score":0.39818450808525085},{"id":"https://openalex.org/keywords/parallel-computing","display_name":"Parallel computing","score":0.320488303899765},{"id":"https://openalex.org/keywords/mathematical-optimization","display_name":"Mathematical optimization","score":0.26237887144088745},{"id":"https://openalex.org/keywords/theoretical-computer-science","display_name":"Theoretical computer science","score":0.2518218159675598},{"id":"https://openalex.org/keywords/mathematics","display_name":"Mathematics","score":0.08572623133659363}],"concepts":[{"id":"https://openalex.org/C2776141515","wikidata":"https://www.wikidata.org/wiki/Q1274479","display_name":"Repetition (rhetorical device)","level":2,"score":0.8005906343460083},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7791728973388672},{"id":"https://openalex.org/C30038468","wikidata":"https://www.wikidata.org/wiki/Q4354775","display_name":"Memorization","level":2,"score":0.6799570322036743},{"id":"https://openalex.org/C197792726","wikidata":"https://www.wikidata.org/wiki/Q191062","display_name":"Mnemonic","level":2,"score":0.6462077498435974},{"id":"https://openalex.org/C22590252","wikidata":"https://www.wikidata.org/wiki/Q1058754","display_name":"Shortest path problem","level":3,"score":0.5679113268852234},{"id":"https://openalex.org/C206729178","wikidata":"https://www.wikidata.org/wiki/Q2271896","display_name":"Scheduling (production processes)","level":2,"score":0.5116062760353088},{"id":"https://openalex.org/C159886148","wikidata":"https://www.wikidata.org/wiki/Q176645","display_name":"Markov process","level":2,"score":0.41650527715682983},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39818450808525085},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.320488303899765},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26237887144088745},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2518218159675598},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08572623133659363},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.0},{"id":"https://openalex.org/C138885662","wikidata":"https://www.wikidata.org/wiki/Q5891","display_name":"Philosophy","level":0,"score":0.0},{"id":"https://openalex.org/C180747234","wikidata":"https://www.wikidata.org/wiki/Q23373","display_name":"Cognitive psychology","level":1,"score":0.0},{"id":"https://openalex.org/C41895202","wikidata":"https://www.wikidata.org/wiki/Q8162","display_name":"Linguistics","level":1,"score":0.0},{"id":"https://openalex.org/C145420912","wikidata":"https://www.wikidata.org/wiki/Q853077","display_name":"Mathematics education","level":1,"score":0.0},{"id":"https://openalex.org/C15744967","wikidata":"https://www.wikidata.org/wiki/Q9418","display_name":"Psychology","level":0,"score":0.0},{"id":"https://openalex.org/C105795698","wikidata":"https://www.wikidata.org/wiki/Q12483","display_name":"Statistics","level":1,"score":0.0}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3534678.3539081","is_oa":false,"landing_page_url":"https://doi.org/10.1145/3534678.3539081","pdf_url":null,"source":{"id":"https://openalex.org/S4363608767","display_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 28th ACM SIGKDD Conference on Knowledge Discovery and Data Mining","raw_type":"proceedings-article"}],"best_oa_location":null,"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/4","score":0.5799999833106995,"display_name":"Quality Education"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":12,"referenced_works":["https://openalex.org/W2049260718","https://openalex.org/W2049428464","https://openalex.org/W2066268399","https://openalex.org/W2116707528","https://openalex.org/W2136518234","https://openalex.org/W2169419728","https://openalex.org/W2514897959","https://openalex.org/W2914319828","https://openalex.org/W3034715329","https://openalex.org/W4230399697","https://openalex.org/W4290961008","https://openalex.org/W4385726565"],"related_works":["https://openalex.org/W2595199024","https://openalex.org/W2755695","https://openalex.org/W637789116","https://openalex.org/W2334108484","https://openalex.org/W3204926555","https://openalex.org/W4296090313","https://openalex.org/W1968297770","https://openalex.org/W2006672806","https://openalex.org/W2155871502","https://openalex.org/W3207288731"],"abstract_inverted_index":{"Spaced":[0],"repetition":[1,22,63],"is":[2],"a":[3,49,61,72,81],"mnemonic":[4],"technique":[5],"where":[6],"long-term":[7,28],"memory":[8,29,41,50],"can":[9],"be":[10],"efficiently":[11],"formed":[12],"by":[13,71],"following":[14],"review":[15,33,69],"schedules.":[16],"For":[17],"greater":[18],"memorization":[19],"efficiency,":[20],"spaced":[21,62],"schedulers":[23],"need":[24],"to":[25,66,101],"model":[26,51],"students'":[27,40],"and":[30,47],"optimize":[31],"the":[32,57,68,86,96],"cost.":[34],"We":[35],"have":[36,79],"collected":[37],"220":[38],"million":[39],"behavior":[42],"logs":[43],"with":[44,52],"time-series":[45],"features":[46],"built":[48],"Markov":[53],"property.":[54],"Based":[55],"on":[56],"model,":[58],"we":[59],"design":[60],"scheduler":[64,90],"guaranteed":[65],"minimize":[67],"cost":[70],"stochastic":[73],"shortest":[74],"path":[75],"algorithm.":[76],"Experimental":[77],"results":[78],"shown":[80],"12.6%":[82],"performance":[83],"improvement":[84],"over":[85],"state-of-the-art":[87],"methods.":[88],"The":[89],"has":[91],"been":[92],"successfully":[93],"deployed":[94],"in":[95],"online":[97],"language-learning":[98],"app":[99],"MaiMemo":[100],"help":[102],"millions":[103],"of":[104],"students.":[105]},"counts_by_year":[{"year":2026,"cited_by_count":2},{"year":2025,"cited_by_count":5},{"year":2024,"cited_by_count":2},{"year":2023,"cited_by_count":4}],"updated_date":"2026-03-13T16:22:10.518609","created_date":"2025-10-10T00:00:00"}