{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,28]],"date-time":"2025-03-28T10:26:42Z","timestamp":1743157602616,"version":"3.40.3"},"publisher-location":"Cham","reference-count":43,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031360060"},{"type":"electronic","value":"9783031360077"}],"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-36007-7_12","type":"book-chapter","created":{"date-parts":[[2023,6,24]],"date-time":"2023-06-24T16:02:10Z","timestamp":1687622530000},"page":"161-174","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Exploring Kolmogorov Complexity Approximations for Data Analysis: Insights and Applications"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-6601-7513","authenticated-orcid":false,"given":"Jorge Miguel","family":"Silva","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1176-552X","authenticated-orcid":false,"given":"Diogo","family":"Pratas","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1941-3983","authenticated-orcid":false,"given":"S\u00e9rgio","family":"Matos","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2023,6,25]]},"reference":[{"key":"12_CR1","doi-asserted-by":"publisher","first-page":"2519","DOI":"10.4249\/scholarpedia.2519","volume":"2","author":"M Hutter","year":"2007","unstructured":"Hutter, M.: Algorithmic information theory. Scholarpedia 2, 2519 (2007)","journal-title":"Scholarpedia"},{"issue":"1","key":"12_CR2","doi-asserted-by":"publisher","first-page":"34","DOI":"10.3390\/e12010034","volume":"12","author":"\u00d6 Nalbantoglu","year":"2009","unstructured":"Nalbantoglu, \u00d6., Russell, D., Sayood, K.: Data compression concepts and algorithms and their applications to bioinformatics. Entropy 12(1), 34\u201352 (2009). https:\/\/doi.org\/10.3390\/e12010034","journal-title":"Entropy"},{"issue":"11","key":"12_CR3","doi-asserted-by":"publisher","first-page":"giaa119","DOI":"10.1093\/gigascience\/giaa119","volume":"9","author":"M Silva","year":"2020","unstructured":"Silva, M., Pratas, D., Pinho, A.J.: Efficient DNA sequence compression with neural networks. GigaScience 9(11), giaa119 (2020). https:\/\/doi.org\/10.1093\/gigascience\/giaa119","journal-title":"GigaScience"},{"key":"12_CR4","unstructured":"MacKay, D.J.C., Mac Kay, D.J.C.: Information theory, inference and learning algorithms. Cambridge University Press, Cambridge (2003)"},{"issue":"8","key":"12_CR5","doi-asserted-by":"publisher","first-page":"1386","DOI":"10.1109\/TPAMI.2008.162","volume":"31","author":"AR Cohen","year":"2009","unstructured":"Cohen, A.R., Bjornsson, C.S., Temple, S., Banker, G., Roysam, B.: Automatic summarization of changes in biological image sequences using algorithmic information theory. IEEE Trans. Pattern Anal. Mach. Intell. 31(8), 1386\u20131403 (2009). https:\/\/doi.org\/10.1109\/TPAMI.2008.162","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/3-540-48405-1_4","volume-title":"Advances in Cryptology \u2014 CRYPTO\u2019 99","author":"U Maurer","year":"1999","unstructured":"Maurer, U.: Information-theoretic cryptography. In: Wiener, M. (ed.) Advances in Cryptology \u2014 CRYPTO\u2019 99. LNCS, vol. 1666, pp. 47\u201365. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/3-540-48405-1_4"},{"key":"12_CR7","doi-asserted-by":"crossref","unstructured":"Yeboah-Ofori, A., Agbodza, C.K., Opoku-Boateng, F.A., Darvishi, I., Sbai, F.: Applied cryptography in network systems security for cyberattack prevention. In: 2021 International Conference on Cyber Security and Internet of Things (ICSIoT), pp. 43\u201348 (2021)","DOI":"10.1109\/ICSIoT55070.2021.00017"},{"key":"12_CR8","doi-asserted-by":"crossref","unstructured":"Tenreiro Machado, J., Lopes, A.M.: Artistic painting: a fractional calculus perspective. Appl. Math. Model. 65, 614\u2013626 (2019)","DOI":"10.1016\/j.apm.2018.09.009"},{"key":"12_CR9","series-title":"Texts in Computer Science","doi-asserted-by":"publisher","DOI":"10.1007\/978-0-387-49820-1","volume-title":"An Introduction to Kolmogorov Complexity and its Applications","author":"M Li","year":"2008","unstructured":"Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and its Applications. TCS, Springer, New York (2008). https:\/\/doi.org\/10.1007\/978-0-387-49820-1"},{"issue":"25","key":"12_CR10","doi-asserted-by":"publisher","first-page":"3805","DOI":"10.1103\/PhysRevLett.68.3805","volume":"68","author":"RF Voss","year":"1992","unstructured":"Voss, R.F.: Evolution of long-range fractal correlations and 1\/f noise in DNA base sequences. Phys. Rev. Lett. 68(25), 3805\u20133808 (1992). https:\/\/doi.org\/10.1103\/PhysRevLett.68.3805","journal-title":"Phys. Rev. Lett."},{"issue":"34","key":"12_CR11","doi-asserted-by":"publisher","first-page":"13591","DOI":"10.1073\/pnas.0705396104","volume":"104","author":"S Ciliberti","year":"2007","unstructured":"Ciliberti, S., Martin, O.C., Wagner, A.: Innovation and robustness in complex regulatory gene networks. Proc. Natl. Acad. Sci. 104(34), 13591\u201313596 (2007). https:\/\/doi.org\/10.1073\/pnas.0705396104","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"9","key":"12_CR12","doi-asserted-by":"publisher","first-page":"4463","DOI":"10.1073\/pnas.97.9.4463","volume":"97","author":"C Adami","year":"2000","unstructured":"Adami, C., Ofria, C., Collier, T.C.: Evolution of biological complexity. Proc. Natl. Acad. Sci. 97(9), 4463\u20134468 (2000). https:\/\/doi.org\/10.1073\/pnas.97.9.4463","journal-title":"Proc. Natl. Acad. Sci."},{"issue":"5","key":"12_CR13","doi-asserted-by":"publisher","first-page":"465","DOI":"10.1016\/0005-1098(78)90005-5","volume":"14","author":"J Rissanen","year":"1978","unstructured":"Rissanen, J.: Modeling by shortest data description. Automatica 14(5), 465\u2013471 (1978)","journal-title":"Automatica"},{"issue":"3","key":"12_CR14","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1016\/0890-5401(89)90010-2","volume":"80","author":"J RossQuinlan","year":"1989","unstructured":"RossQuinlan, J., Rivest, R.L.: Inferring decision trees using the minimum description length principle. Inf. Comput. 80(3), 227\u2013248 (1989). https:\/\/doi.org\/10.1016\/0890-5401(89)90010-2","journal-title":"Inf. Comput."},{"issue":"2","key":"12_CR15","doi-asserted-by":"publisher","first-page":"224","DOI":"10.1109\/TPAMI.1979.4766909","volume":"PAMI-1","author":"DL Davies","year":"1979","unstructured":"Davies, D.L., Bouldin, D.W.: A cluster separation measure. IEEE Trans. Pattern Anal. Mach. Intell. PAMI-1(2), 224\u2013227 (1979). https:\/\/doi.org\/10.1109\/TPAMI.1979.4766909","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"12_CR16","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1007\/978-3-540-24676-3_31","volume-title":"Advances in Cryptology - EUROCRYPT 2004","author":"Y Dodis","year":"2004","unstructured":"Dodis, Y., Reyzin, L., Smith, A.: Fuzzy extractors: how to generate strong keys from biometrics and other noisy data. In: Cachin, C., Camenisch, J.L. (eds.) Advances in Cryptology - EUROCRYPT 2004. LNCS, vol. 3027, pp. 523\u2013540. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-24676-3_31"},{"key":"12_CR17","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: Algorithmic information theory. IBM J. Res. Dev. 21(4), 350\u2013359 (1977)","DOI":"10.1147\/rd.214.0350"},{"key":"12_CR18","unstructured":"Bruce, S.: Applied cryptography: Protocols, Algorthms, and Source Code in c.-2nd (1996)"},{"key":"12_CR19","unstructured":"Kolmogorov, A.N.: Three approaches to the quantitative definition of information. Probl. Inf. Trans. 1(1), 1\u20137 (1965)"},{"key":"12_CR20","doi-asserted-by":"crossref","unstructured":"Chaitin, G.J.: On the length of programs for computing finite binary sequences: statistical considerations. J. ACM (JACM). 16(1), 145\u2013159 (1969)","DOI":"10.1145\/321495.321506"},{"key":"12_CR21","doi-asserted-by":"publisher","unstructured":"Calude, C.S.: Information and Randomness: An Algorithmic Perspective. Springer Science & Business Media, Heidelberg (2002). https:\/\/doi.org\/10.1007\/978-3-662-03049-3","DOI":"10.1007\/978-3-662-03049-3"},{"key":"12_CR22","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1016\/B978-0-12-809474-7.00001-X","volume-title":"Introduction to data compression","author":"K Sayood","year":"2018","unstructured":"Sayood, K.: Introduction. In: Introduction to data compression, pp. 1\u201310. Elsevier (2018). https:\/\/doi.org\/10.1016\/B978-0-12-809474-7.00001-X"},{"issue":"2","key":"12_CR23","doi-asserted-by":"publisher","first-page":"185","DOI":"10.1002\/spe.4380190207","volume":"19","author":"A Moffat","year":"1989","unstructured":"Moffat, A.: Word-based text compression. Softw. Pract. Exp. 19(2), 185\u2013198 (1989). https:\/\/doi.org\/10.1002\/spe.4380190207","journal-title":"Softw. Pract. Exp."},{"key":"12_CR24","doi-asserted-by":"crossref","unstructured":"Knoll, B., de Freitas, N.: A machine learning perspective on predictive coding with PAQ8. In: 2012 Data Compression Conference, pp. 377\u2013386. IEEE (2012)","DOI":"10.1109\/DCC.2012.44"},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1007\/3-540-58473-0_144","volume-title":"Grammatical Inference and Applications","author":"RC Carrasco","year":"1994","unstructured":"Carrasco, R.C., Oncina, J.: Learning stochastic regular grammars by means of a state merging method. In: Carrasco, R.C., Oncina, J. (eds.) Grammatical Inference and Applications. LNCS, vol. 862, pp. 139\u2013152. Springer, Heidelberg (1994). https:\/\/doi.org\/10.1007\/3-540-58473-0_144"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1093\/gigascience\/giac079","volume":"11","author":"JM Silva","year":"2022","unstructured":"Silva, J.M., Pratas, D., Caetano, T., Matos, S.: The complexity landscape of viral genomes. GigaScience 11, 1\u201316 (2022). https:\/\/doi.org\/10.1093\/gigascience\/giac079","journal-title":"GigaScience"},{"key":"12_CR27","doi-asserted-by":"publisher","first-page":"107864","DOI":"10.1016\/j.patcog.2021.107864","volume":"114","author":"JM Silva","year":"2021","unstructured":"Silva, J.M., Pratas, D., Antunes, R., Matos, S., Pinho, A.J.: Automatic analysis of artistic paintings using information-based measures. Pattern Recogn. 114, 107864 (2021). https:\/\/doi.org\/10.1016\/j.patcog.2021.107864","journal-title":"Pattern Recogn."},{"issue":"4","key":"12_CR28","doi-asserted-by":"publisher","first-page":"270","DOI":"10.1093\/comjnl\/42.4.270","volume":"42","author":"CS Wallace","year":"1999","unstructured":"Wallace, C.S.: Minimum message length and kolmogorov complexity. Comput. J. 42(4), 270\u2013283 (1999). https:\/\/doi.org\/10.1093\/comjnl\/42.4.270","journal-title":"Comput. J."},{"key":"12_CR29","doi-asserted-by":"publisher","first-page":"227","DOI":"10.1007\/978-3-540-68677-4_8","volume-title":"Artificial general intelligence","author":"M Hutter","year":"2007","unstructured":"Hutter, M.: Universal algorithmic intelligence: a mathematical top\u2192down approach. In: Goertzel, B., Pennachin, C. (eds.) Artificial general intelligence, pp. 227\u2013290. Springer Berlin Heidelberg, Heidelberg (2007). https:\/\/doi.org\/10.1007\/978-3-540-68677-4_8"},{"key":"12_CR30","doi-asserted-by":"crossref","unstructured":"Silva, J.M., Almeida, J.R.: The value of compression for taxonomic identification. In: 2022 IEEE 35th International Symposium on Computer-Based Medical Systems (CBMS), pp. 276\u2013281. IEEE (2022)","DOI":"10.1109\/CBMS55023.2022.00055"},{"issue":"3","key":"12_CR31","doi-asserted-by":"publisher","first-page":"431","DOI":"10.1111\/j.1467-6419.2010.00666.x","volume":"25","author":"H Zenil","year":"2011","unstructured":"Zenil, H., Delahaye, J.-P.: An algorithmic information theoretic approach to the behaviour of financial markets. J. Econ. Surv. 25(3), 431\u2013463 (2011)","journal-title":"J. Econ. Surv."},{"key":"12_CR32","doi-asserted-by":"publisher","first-page":"309","DOI":"10.1007\/978-3-031-04881-4_25","volume-title":"Pattern Recognition and Image Analysis","author":"JM Silva","year":"2022","unstructured":"Silva, J.M., Pratas, D., Caetano, T., Matos, S.: Feature-based classification of archaeal sequences using compression-based methods. In: Pinho, A.J., Georgieva, P., Teixeira, L.F., S\u00e1nchez, J.A. (eds.) Pattern Recognition and Image Analysis, pp. 309\u2013320. Springer International Publishing, Cham (2022). https:\/\/doi.org\/10.1007\/978-3-031-04881-4_25"},{"key":"12_CR33","unstructured":"jorgeMFS. Complexity ANalysis VirAl Sequences (C.A.N.V.A.S.) Repository (2021). https:\/\/github.com\/jorgeMFS\/canvas"},{"key":"12_CR34","unstructured":"jorgeMFS. Classification and identification of Archaea (ARCHAEA2) Repository (2021). https:\/\/github.com\/jorgeMFS\/Archaea2"},{"key":"12_CR35","unstructured":"bioinformatics ua. COMPressor tAxonomic ClassificaTion (C.O.M.P.A.C.T.) Repository (2021). https:\/\/github.com\/bioinformatics-ua\/COMPACT"},{"key":"12_CR36","unstructured":"CANVAS Website. CANVAS Website (2021). https:\/\/asilab.github.io\/canvas\/"},{"key":"12_CR37","unstructured":"asilab. Measuring probabilistic-algorithmic information of artistic paintings (PANTHER) Repository (2021). https:\/\/github.com\/asilab\/panther"},{"key":"12_CR38","unstructured":"PANTHER Website. PANTHER Website (2021). http:\/\/panther.web.ua.pt\/"},{"key":"12_CR39","doi-asserted-by":"crossref","unstructured":"Silva, J.M., Pinho, E., Matos, S., Pratas, D.: Statistical complexity analysis of turing machine tapes with fixed algorithmic complexity using the best-order Markov model. Entropy. 22(1), 105 (2020)","DOI":"10.3390\/e22010105"},{"key":"12_CR40","unstructured":"asilab. TMCompression Repository (2021). https:\/\/github.com\/asilab\/TMCompression"},{"key":"12_CR41","unstructured":"jorgeMFS.Turing Machine Recreator (TMRecreator) (2021). https:\/\/github.com\/jorgeMFS\/TMRecreator"},{"key":"12_CR42","unstructured":"jorgeMFS. SPTTM (2021). https:\/\/github.com\/jorgeMFS\/spttm"},{"key":"12_CR43","unstructured":"bioinformatics ua. TM Neural Finder (2021). https:\/\/github.com\/bioinformatics-ua\/TM-Neural-Finder"}],"container-title":["IFIP Advances in Information and Communication Technology","Technological Innovation for Connected Cyber Physical Spaces"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-36007-7_12","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,6,28]],"date-time":"2023-06-28T23:13:16Z","timestamp":1687993996000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-36007-7_12"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023]]},"ISBN":["9783031360060","9783031360077"],"references-count":43,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-36007-7_12","relation":{},"ISSN":["1868-4238","1868-422X"],"issn-type":[{"type":"print","value":"1868-4238"},{"type":"electronic","value":"1868-422X"}],"subject":[],"published":{"date-parts":[[2023]]},"assertion":[{"value":"25 June 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DoCEIS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Doctoral Conference on Computing, Electrical and Industrial Systems","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Monte Da Caparica","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Portugal","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":"5 July 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"7 July 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"doceis2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/doceis.dee.fct.unl.pt\/","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":"easychair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"47","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":"22","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":"47% - 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","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":"3","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":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}