{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,27]],"date-time":"2026-06-27T00:09:32Z","timestamp":1782518972742,"version":"3.54.5"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030232030","type":"print"},{"value":"9783030232047","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2019]]},"DOI":"10.1007\/978-3-030-23204-7_40","type":"book-chapter","created":{"date-parts":[[2019,6,20]],"date-time":"2019-06-20T21:05:01Z","timestamp":1561064701000},"page":"482-493","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":10,"title":["Uniform Adaptive Testing Using Maximum Clique Algorithm"],"prefix":"10.1007","author":[{"given":"Maomi","family":"Ueno","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Yoshimitsu","family":"Miyazawa","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2019,6,21]]},"reference":[{"issue":"4","key":"40_CR1","doi-asserted-by":"publisher","first-page":"359","DOI":"10.1207\/s15324818ame0204_6","volume":"2","author":"GG Kingsbury","year":"1989","unstructured":"Kingsbury, G.G., Zara, A.R.: Procedures for selecting items for computerized adaptive tests. Appl. Measur. Educ. 2(4), 359\u2013375 (1989)","journal-title":"Appl. Measur. Educ."},{"issue":"3","key":"40_CR2","doi-asserted-by":"publisher","first-page":"259","DOI":"10.1177\/01466216980223006","volume":"22","author":"WJ van der Linden","year":"1998","unstructured":"van der Linden, W.J., Reese, L.: A model for optimal constrained adaptive testing. Appl. Psychol. Measur. 22(3), 259\u2013270 (1998)","journal-title":"Appl. Psychol. Measur."},{"issue":"3","key":"40_CR3","doi-asserted-by":"publisher","first-page":"273","DOI":"10.3102\/10769986029003273","volume":"29","author":"WJ van der Linden","year":"2004","unstructured":"van der Linden, W.J., Veldkamp, B.: Constraining item exposure in computerized adaptive testing with shadow tests. J. Educ. Behav. Stat. 29(3), 273\u2013291 (2004)","journal-title":"J. Educ. Behav. Stat."},{"issue":"7","key":"40_CR4","doi-asserted-by":"publisher","first-page":"469","DOI":"10.1177\/0146621616654597","volume":"40","author":"SW Choi","year":"2016","unstructured":"Choi, S.W., Moellering, K.T., Li, J., van der Linden, W.J.: Optimal reassembly of shadow tests in CAT. Appl. Psychol. Measur. 40(7), 469\u2013485 (2016)","journal-title":"Appl. Psychol. Measur."},{"issue":"3","key":"40_CR5","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1109\/TLT.2010.29","volume":"4","author":"P Songmuang","year":"2011","unstructured":"Songmuang, P., Ueno, M.: Bees algorithm for construction of multiple test forms in e-testing. IEEE Trans. Learn. Technol. 4(3), 209\u2013221 (2011)","journal-title":"IEEE Trans. Learn. Technol."},{"key":"40_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"451","DOI":"10.1007\/978-3-642-39112-5_46","volume-title":"Artificial Intelligence in Education","author":"T Ishii","year":"2013","unstructured":"Ishii, T., Songmuang, P., Ueno, M.: Maximum clique algorithm for uniform test forms assembly. In: Lane, H.C., Yacef, K., Mostow, J., Pavlik, P. (eds.) AIED 2013. LNCS (LNAI), vol. 7926, pp. 451\u2013462. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39112-5_46"},{"issue":"1","key":"40_CR7","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1109\/TLT.2013.2297694","volume":"7","author":"T Ishii","year":"2014","unstructured":"Ishii, T., Songmuang, P., Ueno, M.: Maximum clique algorithm and its approximation for uniform test form assembly. IEEE Trans. Learn. Technol. 7(1), 83\u201395 (2014)","journal-title":"IEEE Trans. Learn. Technol."},{"key":"40_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"638","DOI":"10.1007\/978-3-319-19773-9_80","volume-title":"Artificial Intelligence in Education","author":"T Ishii","year":"2015","unstructured":"Ishii, T., Ueno, M.: Clique algorithm to minimize item exposure for uniform test forms assembly. In: Conati, C., Heffernan, N., Mitrovic, A., Verdejo, M.F. (eds.) AIED 2015. LNCS (LNAI), vol. 9112, pp. 638\u2013641. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19773-9_80"},{"key":"40_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1007\/978-3-319-61425-0_9","volume-title":"Artificial Intelligence in Education","author":"T Ishii","year":"2017","unstructured":"Ishii, T., Ueno, M.: Algorithm for uniform test assembly using a maximum clique problem and integer programming. In: Andr\u00e9, E., Baker, R., Hu, X., Rodrigo, M.M.T., du Boulay, B. (eds.) AIED 2017. LNCS (LNAI), vol. 10331, pp. 102\u2013112. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-61425-0_9"},{"key":"40_CR10","volume-title":"Statistical Theories of Mental Test Scores","author":"F Lord","year":"1968","unstructured":"Lord, F., Novick, M.R.: Statistical Theories of Mental Test Scores. Addison-Wesley, M.R. (1968)"},{"issue":"2","key":"40_CR11","doi-asserted-by":"publisher","first-page":"141","DOI":"10.1080\/08957340801926151","volume":"21","author":"KT Sun","year":"2008","unstructured":"Sun, K.T., Chen, Y.J., Tsai, S.Y., Cheng, C.F.: Creating IRT-based parallel test forms using the genetic algorithm method. Appl. Measur. Educ. 21(2), 141\u2013161 (2008)","journal-title":"Appl. Measur. Educ."},{"issue":"2","key":"40_CR12","doi-asserted-by":"publisher","first-page":"319","DOI":"10.1007\/s10589-005-3058-z","volume":"33","author":"DI Belov","year":"2006","unstructured":"Belov, D.I., Armstrong, R.D.: A constraint programming approach to extract the maximum number of non-overlapping test forms. Comput. Optim. Appl. 33(2), 319\u2013332 (2006)","journal-title":"Comput. Optim. Appl."},{"key":"40_CR13","doi-asserted-by":"publisher","DOI":"10.1007\/0-387-29054-0","volume-title":"Linear Models for Optimal Test Design","author":"WJ van der Linden","year":"2005","unstructured":"van der Linden, W.J.: Linear Models for Optimal Test Design. Springer, New York (2005). https:\/\/doi.org\/10.1007\/0-387-29054-0"},{"key":"40_CR14","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-85461-8","volume-title":"Elements of Adaptive Testing","author":"WJ van der Linden","year":"2010","unstructured":"van der Linden, W.J., Glas, C.A.W.: Elements of Adaptive Testing. Springer, New York (2010). https:\/\/doi.org\/10.1007\/978-0-387-85461-8"},{"key":"40_CR15","unstructured":"Recruit, Synthetic Personality Inventory (SPI) (2014). http:\/\/www.spi.recruit.co.jp\/"},{"issue":"1","key":"40_CR16","doi-asserted-by":"publisher","first-page":"59","DOI":"10.2333\/bhmk.29.59","volume":"29","author":"M Ueno","year":"2002","unstructured":"Ueno, M.: An extension of the IRT to a network model. Behaviormetrika 29(1), 59\u201379 (2002)","journal-title":"Behaviormetrika"},{"key":"40_CR17","doi-asserted-by":"crossref","unstructured":"Ueno, M. and Songmuang, P.: Computerized adaptive testing based on decision tree. In: The Tenth IEEE International Conference on Advanced Learning Technologies (ICALT), pp. 191\u2013193 (2010)","DOI":"10.1109\/ICALT.2010.58"},{"key":"40_CR18","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"712","DOI":"10.1007\/978-3-642-39112-5_95","volume-title":"Artificial Intelligence in Education","author":"M Ueno","year":"2013","unstructured":"Ueno, M.: Adaptive testing based on bayesian decision theory. In: Lane, H.C., Yacef, K., Mostow, J., Pavlik, P. (eds.) AIED 2013. LNCS (LNAI), vol. 7926, pp. 712\u2013716. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-39112-5_95"},{"key":"40_CR19","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"492","DOI":"10.1007\/978-3-319-19773-9_49","volume-title":"Artificial Intelligence in Education","author":"M Ueno","year":"2015","unstructured":"Ueno, M., Miyasawa, Y.: Probability based scaffolding system with fading. In: Conati, C., Heffernan, N., Mitrovic, A., Verdejo, M.F. (eds.) AIED 2015. LNCS (LNAI), vol. 9112, pp. 492\u2013503. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-19773-9_49"},{"issue":"4","key":"40_CR20","doi-asserted-by":"publisher","first-page":"415","DOI":"10.1109\/TLT.2017.2741960","volume":"11","author":"M Ueno","year":"2018","unstructured":"Ueno, M., Miyazawa, Y.: IRT-based adaptive hints to scaffold learning in programming. IEEE Trans. Learn. Technol. 11(4), 415\u2013428 (2018)","journal-title":"IEEE Trans. Learn. Technol."}],"container-title":["Lecture Notes in Computer Science","Artificial Intelligence in Education"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-23204-7_40","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T14:02:53Z","timestamp":1709820173000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-23204-7_40"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030232030","9783030232047"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-23204-7_40","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"21 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"AIED","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Artificial Intelligence in Education","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chicago, IL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25 June 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"aied2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/caed-lab.com\/aied2019\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}