{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/knowledge-tracing-machines-factorization","title":"Knowledge Tracing Machines: Factorization Machines for Knowledge Tracing","arxiv_id":"1811.03388","date":"2018-11-08","proceeding":null,"authors":["Jill-Jênn Vie","Hisashi Kashima"],"abstract":"Knowledge tracing is a sequence prediction problem where the goal is to\npredict the outcomes of students over questions as they are interacting with a\nlearning platform. By tracking the evolution of the knowledge of some student,\none can optimize instruction. Existing methods are either based on temporal\nlatent variable models, or factor analysis with temporal features. We here show\nthat factorization machines (FMs), a model for regression or classification,\nencompasses several existing models in the educational literature as special\ncases, notably additive factor model, performance factor model, and\nmultidimensional item response theory. We show, using several real datasets of\ntens of thousands of users and items, that FMs can estimate student knowledge\naccurately and fast even when student data is sparsely observed, and handle\nside information such as multiple knowledge components and number of attempts\nat item or skill level. Our approach allows to fit student models of higher\ndimension than existing models, and provides a testbed to try new combinations\nof features in order to improve existing models.","url_abs":"http://arxiv.org/abs/1811.03388v2","url_pdf":"http://arxiv.org/pdf/1811.03388v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"knowledge-tracing-machines-factorization","repo_url":"https://github.com/jilljenn/ktm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"knowledge-tracing-machines-factorization","repo_url":"https://github.com/jilljenn/slam2018","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}}],"tasks":[{"task_slug":"knowledge-tracing","task_name":"Knowledge Tracing"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1811.03388","atlas_url":"https://app.syntology.ai/?focus=1811.03388","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1811.03388"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1811.03388\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1811.03388"},"call":"get_concepts_for_paper(arxiv_id=\"1811.03388\")"}],"by_repo":[{"repo":"jilljenn/ktm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1905.06873"],"harvested_for_calls":[{"arxiv_id":"1905.06873","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1905.06873"},"call":"get_harvested_code_for_paper(arxiv_id=\"1905.06873\")"}]},{"repo":"jilljenn/slam2018","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"21c6c0562b82863fdc9b60f0d9adc59528233f344abde068a7bf058f15bfecc1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}