{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:33:34Z","timestamp":1766306014486,"version":"3.48.0"},"reference-count":9,"publisher":"Elsevier BV","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/legal\/tdmrep-license"},{"start":{"date-parts":[[2025,9,19]],"date-time":"2025-09-19T00:00:00Z","timestamp":1758240000000},"content-version":"vor","delay-in-days":261,"URL":"http:\/\/creativecommons.org\/licenses\/by-nc-nd\/4.0\/"}],"content-domain":{"domain":["elsevier.com","sciencedirect.com"],"crossmark-restriction":true},"short-container-title":["Procedia Computer Science"],"published-print":{"date-parts":[[2025]]},"DOI":"10.1016\/j.procs.2025.09.200","type":"journal-article","created":{"date-parts":[[2025,11,6]],"date-time":"2025-11-06T22:13:21Z","timestamp":1762467201000},"page":"802-811","update-policy":"https:\/\/doi.org\/10.1016\/elsevier_cm_policy","source":"Crossref","is-referenced-by-count":0,"special_numbering":"C","title":["The reduction of false positives in Sparse Factorization Machines"],"prefix":"10.1016","volume":"270","author":[{"given":"Takuya","family":"Matsuzawa","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Taiki","family":"Ito","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sumika","family":"Arima","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"78","reference":[{"issue":"3","key":"10.1016\/j.procs.2025.09.200_bib1","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1109\/TSM.2019.2917521","article-title":"Fault detection and diagnosis using self-attentive convolutional neural networks for variable-length sensor data in semiconductor manufacturing","volume":"32","author":"Kim","year":"2019","journal-title":"IEEE Transactions on Semiconductor Manufacturing"},{"year":"2010","series-title":"Factorization machines. In 2010 IEEE International conference on data mining (pp. 995-1000)","author":"Rendle","key":"10.1016\/j.procs.2025.09.200_bib2"},{"issue":"153","key":"10.1016\/j.procs.2025.09.200_bib3","first-page":"1","article-title":"Factorization machines with regularization for sparse feature interactions","volume":"22","author":"Atarashi","year":"2021","journal-title":"Journal of Machine Learning Research"},{"key":"10.1016\/j.procs.2025.09.200_bib4","doi-asserted-by":"crossref","first-page":"4055","DOI":"10.1016\/j.procs.2023.10.401","article-title":"Interaction modelling of high dimensional production data","volume":"225","author":"Hoshino","year":"2023","journal-title":"Procedia computer science"},{"key":"10.1016\/j.procs.2025.09.200_bib5","doi-asserted-by":"crossref","first-page":"2964","DOI":"10.1016\/j.procs.2024.09.706","article-title":"Interaction Modeling for High-Dimensional Mixed Data with Numerical and Categorical Features","volume":"246","author":"Hoshino","year":"2024","journal-title":"Procedia Computer Science"},{"key":"10.1016\/j.procs.2025.09.200_bib6","unstructured":"Takeuchi, I., Nakagawa, K., & Tsuda, K. (2016). Machine learning algorithms for high-order interaction modeling [arXiv preprint arXiv:1602.04548]. arXiv. https:\/\/arxiv.org\/abs\/1602.04548"},{"key":"10.1016\/j.procs.2025.09.200_bib7","doi-asserted-by":"crossref","unstructured":"Tibshirani, R. (1996). Regression shrinkage and selection via the lasso. Journal of the Royal Statistical Society Series B: Statistical Methodology, 58(1), 267-288..","DOI":"10.1111\/j.2517-6161.1996.tb02080.x"},{"key":"10.1016\/j.procs.2025.09.200_bib8","unstructured":"Das, A., & Kempe, D. (2011). Submodular meets spectral: Greedy algorithms for subset selection, sparse approximation and dictionary selection. arXiv preprint arXiv:1102.3975."},{"key":"10.1016\/j.procs.2025.09.200_bib9","unstructured":"Nagata, T. (2020). Interaction modeling of high-dimensional data for identifying improvement events affecting product quality."}],"container-title":["Procedia Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925028704?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:S1877050925028704?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2025,12,21]],"date-time":"2025-12-21T08:29:57Z","timestamp":1766305797000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/S1877050925028704"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":9,"alternative-id":["S1877050925028704"],"URL":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.200","relation":{},"ISSN":["1877-0509"],"issn-type":[{"type":"print","value":"1877-0509"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"Elsevier","name":"publisher","label":"This article is maintained by"},{"value":"The reduction of false positives in Sparse Factorization Machines","name":"articletitle","label":"Article Title"},{"value":"Procedia Computer Science","name":"journaltitle","label":"Journal Title"},{"value":"https:\/\/doi.org\/10.1016\/j.procs.2025.09.200","name":"articlelink","label":"CrossRef DOI link to publisher maintained version"},{"value":"article","name":"content_type","label":"Content Type"},{"value":"\u00a9 2025 The Author(s). Published by Elsevier B.V.","name":"copyright","label":"Copyright"}]}}