{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T04:49:17Z","timestamp":1725598157434},"publisher-location":"Berlin, Heidelberg","reference-count":13,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642228865"},{"type":"electronic","value":"9783642228872"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2011]]},"DOI":"10.1007\/978-3-642-22887-2_47","type":"book-chapter","created":{"date-parts":[[2011,7,29]],"date-time":"2011-07-29T04:00:46Z","timestamp":1311912046000},"page":"382-387","source":"Crossref","is-referenced-by-count":5,"title":["Towards Heuristic Algorithmic Memory"],"prefix":"10.1007","author":[{"given":"Eray","family":"\u00d6zkural","sequence":"first","affiliation":[]}],"member":"297","reference":[{"key":"47_CR1","unstructured":"Solomonoff, R.J.: Progress in incremental machine learning. NIPS Workshop on Universal Learning Algorithms and Optimal Search (2002)"},{"key":"47_CR2","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/B:MACH.0000015880.99707.b2","volume":"54","author":"J. Schmidhuber","year":"2004","unstructured":"Schmidhuber, J.: Optimal ordered problem solver. Machine Learning\u00a054, 211\u2013256 (2004)","journal-title":"Machine Learning"},{"key":"47_CR3","unstructured":"Solomonoff, R.J.: A system for incremental learning based on algorithmic probability. In: Proceedings of the Sixth Israeli Conference on Artificial Intelligence, Tel Aviv, Israel, pp. 515\u2013527 (1989)"},{"issue":"3","key":"47_CR4","first-page":"256","volume":"9","author":"L. Levin","year":"1973","unstructured":"Levin, L.: Universal problems of full search. Problems of Information Transmission\u00a09(3), 256\u2013266 (1973)","journal-title":"Problems of Information Transmission"},{"key":"47_CR5","unstructured":"Solomonoff, R.J.: Optimum sequential search. Technical report, Oxbridge Research (1984)"},{"key":"47_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/978-0-387-84816-7_1","volume-title":"Information Theory and Statistical Learning","author":"R.J. Solomonoff","year":"2009","unstructured":"Solomonoff, R.J.: Algorithmic probability: Theory and applications. In: Dehmer, M., Emmert-Streib, F. (eds.) Information Theory and Statistical Learning, pp. 1\u201323. Springer Science+Business Media, N.Y (2009)"},{"key":"47_CR7","unstructured":"\u00d6zkural, E.: Teraflop-scale incremental machine learning. CoRR abs\/1103.1003 (2011), \n                    \n                      http:\/\/arxiv.org\/abs\/1103.1003"},{"key":"47_CR8","unstructured":"\u00d6zkural, E.: Gigamachine: incremental machine learning on desktop computers. Draft (2009), \n                    \n                      http:\/\/examachine.net\/papers\/gigamachine-draft.pdf"},{"key":"47_CR9","volume-title":"Introduction to Automata Theory, Languages, and Computation","author":"J.E. Hopcroft","year":"2001","unstructured":"Hopcroft, J.E., Rajeev Motwani, J.U.: Introduction to Automata Theory, Languages, and Computation, 2nd edn. Addison Wesley, Reading (2001)","edition":"2"},{"key":"47_CR10","first-page":"155","volume":"20","author":"B. Merialdo","year":"1993","unstructured":"Merialdo, B.: Tagging english text with a probabilistic model. Computational Linguistics\u00a020, 155\u2013171 (1993)","journal-title":"Computational Linguistics"},{"key":"47_CR11","doi-asserted-by":"publisher","first-page":"71","DOI":"10.1145\/775047.775058","volume-title":"Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. KDD 2002","author":"M.J. Zaki","year":"2002","unstructured":"Zaki, M.J.: Efficiently mining frequent trees in a forest. In: Proceedings of the eighth ACM SIGKDD international conference on Knowledge discovery and data mining. KDD 2002, pp. 71\u201380. ACM Press, New York (2002)"},{"key":"47_CR12","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Algorithmic probability, heuristic programming and agi. In: Third Conference on Artificial General Intelligence, pp. 251\u2013157 (2010)","DOI":"10.2991\/agi.2010.13"},{"issue":"5","key":"47_CR13","doi-asserted-by":"publisher","first-page":"566","DOI":"10.1093\/comjnl\/bxm120","volume":"51","author":"R.J. Solomonoff","year":"2008","unstructured":"Solomonoff, R.J.: Three kinds of probabilistic induction: Universal distributions and convergence theorems. The Computer Journal\u00a051(5), 566\u2013570 (2008)","journal-title":"The Computer Journal"}],"container-title":["Lecture Notes in Computer Science","Artificial General Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-22887-2_47.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T11:38:40Z","timestamp":1620041920000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-22887-2_47"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2011]]},"ISBN":["9783642228865","9783642228872"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-22887-2_47","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2011]]}}}