{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,19]],"date-time":"2026-02-19T08:13:34Z","timestamp":1771488814185,"version":"3.50.1"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031434174","type":"print"},{"value":"9783031434181","type":"electronic"}],"license":[{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,1,1]],"date-time":"2023-01-01T00:00:00Z","timestamp":1672531200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023]]},"DOI":"10.1007\/978-3-031-43418-1_17","type":"book-chapter","created":{"date-parts":[[2023,9,16]],"date-time":"2023-09-16T09:02:26Z","timestamp":1694854946000},"page":"277-292","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":4,"title":["Construction and\u00a0Training of\u00a0Multi-Associative Graph Networks"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9001-4198","authenticated-orcid":false,"given":"Adrian","family":"Horzyk","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9518-4815","authenticated-orcid":false,"given":"Daniel","family":"Bulanda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2678-5515","authenticated-orcid":false,"given":"Janusz A.","family":"Starzyk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,9,17]]},"reference":[{"key":"17_CR1","unstructured":"Adelson-Velskii, G.M., Landis, E.M.: An algorithm for organization of information. In: Doklady Akademii Nauk, vol. 146, pp. 263\u2013266. Russian Academy of Sciences (1962)"},{"key":"17_CR2","volume-title":"Cognition, Brain, and Consciousness: Introduction to Cognitive Neuroscience","author":"BJ Baars","year":"2010","unstructured":"Baars, B.J., Gage, N.M.: Cognition, Brain, and Consciousness: Introduction to Cognitive Neuroscience. Academic Press, Cambridge (2010)"},{"issue":"11","key":"17_CR3","doi-asserted-by":"publisher","first-page":"3505","DOI":"10.1109\/TNNLS.2019.2927106","volume":"30","author":"JA Starzyk","year":"2019","unstructured":"Starzyk, J.A., Horzyk, A.: Episodic memory in minicolumn associative knowledge graphs. IEEE Trans. Neural Netw. Learn. Syst. 30(11), 3505\u20133516 (2019)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"issue":"4","key":"17_CR4","doi-asserted-by":"publisher","first-page":"290","DOI":"10.1007\/BF00289509","volume":"1","author":"R Bayer","year":"1972","unstructured":"Bayer, R.: Symmetric binary b-trees: data structure and maintenance algorithms. Acta Informatica 1(4), 290\u2013306 (1972)","journal-title":"Acta Informatica"},{"issue":"2","key":"17_CR5","doi-asserted-by":"publisher","first-page":"201","DOI":"10.1037\/0033-295X.113.2.201","volume":"113","author":"MM Botvinick","year":"2006","unstructured":"Botvinick, M.M., Plaut, D.C.: Short-term memory for serial order: a recurrent neural network model. Psychol. Rev. 113(2), 201 (2006)","journal-title":"Psychol. Rev."},{"issue":"9","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1616","DOI":"10.1109\/TKDE.2018.2807452","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"issue":"03","key":"17_CR7","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1142\/S0129054196000178","volume":"7","author":"L Chen","year":"1996","unstructured":"Chen, L., Schott, R.: Optimal operations on red-black trees. Int. J. Found. Comput. Sci. 7(03), 227\u2013239 (1996)","journal-title":"Int. J. Found. Comput. Sci."},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Fu, T.J., Li, P.H., Ma, W.Y.: Graphrel: modeling text as relational graphs for joint entity and relation extraction. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics, pp. 1409\u20131418 (2019)","DOI":"10.18653\/v1\/P19-1136"},{"issue":"8","key":"17_CR9","doi-asserted-by":"publisher","first-page":"3549","DOI":"10.1109\/TKDE.2020.3028705","volume":"34","author":"QEA Guo","year":"2022","unstructured":"Guo, Q.E.A.: A survey on knowledge graph-based recommender systems. IEEE Trans. Knowl. Data Eng. 34(8), 3549\u20133568 (2022)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Horzyk, A.: Associative graph data structures with an efficient access via avb+ trees. In: 2018 11th International Conference on Human System Interaction (HSI), pp. 169\u2013175. IEEE (2018)","DOI":"10.1109\/HSI.2018.8430973"},{"key":"17_CR11","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-030-15640-4_13","volume-title":"Knowledge Discovery, Knowledge Engineering and Knowledge Management","author":"A Horzyk","year":"2019","unstructured":"Horzyk, A.: Associative representation and processing of databases using DASNG and AVB+trees for efficient data access. In: Fred, A., et al. (eds.) IC3K 2017. CCIS, vol. 976, pp. 242\u2013267. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-15640-4_13"},{"issue":"4","key":"17_CR12","doi-asserted-by":"publisher","first-page":"717","DOI":"10.34768\/amcs-2020-0053","volume":"30","author":"A Horzyk","year":"2020","unstructured":"Horzyk, A., Bulanda, D., Starzyk, J.A.: Asa-graphs for efficient data representation and processing. Int. J. Appl. Math. Comput. Sci. 30(4), 717\u2013731 (2020)","journal-title":"Int. J. Appl. Math. Comput. Sci."},{"issue":"12","key":"17_CR13","doi-asserted-by":"publisher","first-page":"3084","DOI":"10.1109\/TNNLS.2017.2728203","volume":"28","author":"A Horzyk","year":"2017","unstructured":"Horzyk, A., Starzyk, J.A., Graham, J.: Integration of semantic and episodic memories. IEEE Trans. Neural Netw. Learn. Syst. 28(12), 3084\u20133095 (2017)","journal-title":"IEEE Trans. Neural Netw. Learn. Syst."},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Jensen, C.S., Lin, D., Ooi, B.C.: Query and update efficient b+-tree based indexing of moving objects. In: Proceedings of the Thirtieth International Conference on Very Large Data Bases, vol. 30, pp. 768\u2013779 (2004)","DOI":"10.1016\/B978-012088469-8\/50068-1"},{"issue":"1","key":"17_CR15","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3129263","volume":"14","author":"WH Kim","year":"2018","unstructured":"Kim, W.H., Seo, J., Kim, J., Nam, B.: clfb-tree: cacheline friendly persistent b-tree for nvram. ACM Trans. Storage (TOS) 14(1), 1\u201317 (2018)","journal-title":"ACM Trans. Storage (TOS)"},{"issue":"1","key":"17_CR16","doi-asserted-by":"publisher","first-page":"63","DOI":"10.1145\/128762.128764","volume":"24","author":"P Mishra","year":"1992","unstructured":"Mishra, P., Eich, M.H.: Join processing in relational databases. ACM Comput. Surv. (CSUR) 24(1), 63\u2013113 (1992)","journal-title":"ACM Comput. Surv. (CSUR)"},{"key":"17_CR17","doi-asserted-by":"crossref","unstructured":"Romano, J.D., et al.: Pmlb v1.0: an open-source dataset collection for benchmarking machine learning methods. arXiv preprint arXiv:2012.00058 (2020)","DOI":"10.1093\/bioinformatics\/btab727"},{"issue":"2","key":"17_CR18","first-page":"19","volume":"3","author":"M Vijaymeena","year":"2016","unstructured":"Vijaymeena, M., Kavitha, K.: A survey on similarity measures in text mining. Mach. Learn. Appl. Int. J. 3(2), 19\u201328 (2016)","journal-title":"Mach. Learn. Appl. Int. J."},{"issue":"12","key":"17_CR19","doi-asserted-by":"publisher","first-page":"2724","DOI":"10.1109\/TKDE.2017.2754499","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: a survey of approaches and applications. IEEE Trans. Knowl. Data Eng. 29(12), 2724\u20132743 (2017)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 28 (2014)","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"17_CR21","doi-asserted-by":"publisher","first-page":"75729","DOI":"10.1109\/ACCESS.2022.3191784","volume":"10","author":"Z Ye","year":"2022","unstructured":"Ye, Z., Kumar, Y.J., Sing, G.O., Song, F., Wang, J.: A comprehensive survey of graph neural networks for knowledge graphs. IEEE Access 10, 75729\u201375741 (2022)","journal-title":"IEEE Access"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases: Research Track"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-43418-1_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,6,26]],"date-time":"2024-06-26T13:07:10Z","timestamp":1719407230000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-43418-1_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031434174","9783031434181"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-43418-1_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"17 September 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"Our proposed algorithms do not raise any ethical concerns, and the experiments shown used publicly available benchmark datasets.","order":1,"name":"Ethics","group":{"name":"EthicsHeading","label":"Ethical Issues"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Turin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 September 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22 September 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"23","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/2023.ecmlpkdd.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"829","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"196","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"24% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.63","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"4.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Applied Data Science Track: 239 submissions, 58 accepted papers; Demo Track: 31 submissions, 16 accepted papers.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}