{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T19:44:57Z","timestamp":1782675897470,"version":"3.54.5"},"publisher-location":"Cham","reference-count":10,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783032299147","type":"print"},{"value":"9783032299154","type":"electronic"}],"license":[{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,1,1]],"date-time":"2026-01-01T00:00:00Z","timestamp":1767225600000},"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":[[2026]]},"DOI":"10.1007\/978-3-032-29915-4_26","type":"book-chapter","created":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T19:19:29Z","timestamp":1782674369000},"page":"304-311","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Greedy Algorithm for\u00a0Modeling Approximate Decision Trees for\u00a0Distributed Decision Tables"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5763-9751","authenticated-orcid":false,"given":"Azimkhon","family":"Ostonov","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0085-9483","authenticated-orcid":false,"given":"Mikhail","family":"Moshkov","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3788-1094","authenticated-orcid":false,"given":"Beata","family":"Zielosko","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,6,29]]},"reference":[{"issue":"1","key":"26_CR1","doi-asserted-by":"publisher","first-page":"21","DOI":"10.1016\/S0304-3975(01)00144-X","volume":"288","author":"H Buhrman","year":"2002","unstructured":"Buhrman, H., de Wolf, R.: Complexity measures and decision tree complexity: a survey. Theor. Comput. Sci. 288(1), 21\u201343 (2002)","journal-title":"Theor. Comput. Sci."},{"issue":"7","key":"26_CR2","doi-asserted-by":"publisher","first-page":"791","DOI":"10.1016\/j.engappai.2005.06.004","volume":"18","author":"JC da Silva","year":"2005","unstructured":"da Silva, J.C., Giannella, C., Bhargava, R., Kargupta, H., Klusch, M.: Distributed data mining and agents. Eng. Appl. Artif. Intell. 18(7), 791\u2013807 (2005)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"3","key":"26_CR3","doi-asserted-by":"publisher","first-page":"193","DOI":"10.1007\/s000370050010","volume":"7","author":"D Grigoriev","year":"1998","unstructured":"Grigoriev, D., Karpinski, M., Yao, A.C.: An exponential lower bound on the size of algebraic decision trees for Max. Comput. Complex. 7(3), 193\u2013203 (1998)","journal-title":"Comput. Complex."},{"key":"26_CR4","doi-asserted-by":"publisher","DOI":"10.1016\/j.knosys.2023.110832","volume":"277","author":"O Loyola-Gonz\u00e1lez","year":"2023","unstructured":"Loyola-Gonz\u00e1lez, O., Ram\u00edrez-S\u00e1yago, E., Medina-P\u00e9rez, M.A.: Towards improving decision tree induction by combining split evaluation measures. Knowl.-Based Syst. 277, 110832 (2023)","journal-title":"Knowl.-Based Syst."},{"key":"26_CR5","doi-asserted-by":"crossref","unstructured":"Moshkov, M.: Comparative Analysis of Deterministic and Nondeterministic Decision Trees, Intelligent Systems Reference Library, vol. 179. Springer, Cham (2020)","DOI":"10.1007\/978-3-030-41728-4"},{"issue":"1","key":"26_CR6","doi-asserted-by":"publisher","first-page":"45","DOI":"10.1007\/s10472-022-09814-1","volume":"91","author":"M Moshkov","year":"2023","unstructured":"Moshkov, M.: Time and space complexity of deterministic and nondeterministic decision trees. Ann. Math. Artif. Intell. 91(1), 45\u201374 (2023)","journal-title":"Ann. Math. Artif. Intell."},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach, Studies in Computational Intelligence, vol. 360. Springer, Cham (2011)","DOI":"10.1007\/978-3-642-20995-6"},{"issue":"3","key":"26_CR8","doi-asserted-by":"publisher","first-page":"291","DOI":"10.3233\/FUN-2000-44304","volume":"44","author":"D Slezak","year":"2000","unstructured":"Slezak, D.: Normalized decision functions and measures for inconsistent decision tables analysis. Fundam. Informaticae 44(3), 291\u2013319 (2000)","journal-title":"Fundam. Informaticae"},{"key":"26_CR9","doi-asserted-by":"crossref","unstructured":"Yao, A.C.: Decision tree complexity and Betti numbers. In: 26th Annual ACM Symposium on Theory of Computing, STOC 1994, pp. 615\u2013624 (1994)","DOI":"10.1145\/195058.195414"},{"key":"26_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.ins.2025.122466","volume":"719","author":"B Zielosko","year":"2025","unstructured":"Zielosko, B., Moshkov, M., Tetteh, E.T.: Optimization of inner and general rules. Inf. Sci. 719, 122466 (2025)","journal-title":"Inf. Sci."}],"container-title":["Lecture Notes in Computer Science","Computational Science \u2013 ICCS 2026 Workshops"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-032-29915-4_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,6,28]],"date-time":"2026-06-28T19:19:32Z","timestamp":1782674372000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-032-29915-4_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026]]},"ISBN":["9783032299147","9783032299154"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-032-29915-4_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026]]},"assertion":[{"value":"29 June 2026","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Science","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2026","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 June 2026","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 July 2026","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccs-computsci2026","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.iccs-meeting.org\/iccs2026\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}