{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,1]],"date-time":"2025-10-01T15:19:19Z","timestamp":1759331959397,"version":"3.40.5"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer Nature Switzerland","isbn-type":[{"value":"9783031927430","type":"print"},{"value":"9783031927447","type":"electronic"}],"license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"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":[[2025]]},"DOI":"10.1007\/978-3-031-92744-7_1","type":"book-chapter","created":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T11:52:08Z","timestamp":1747050728000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Comparison of\u00a0Complexity of\u00a0Regular and\u00a0Oblivious Decision Trees for\u00a0Decision Tables from\u00a0Closed Classes"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-5763-9751","authenticated-orcid":false,"given":"Azimkhon","family":"Ostonov","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-0085-9483","authenticated-orcid":false,"given":"Mikhail","family":"Moshkov","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2025,5,13]]},"reference":[{"key":"1_CR1","series-title":"Intelligent Systems Reference Library","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-91839-6","volume-title":"Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining","author":"H AbouEisha","year":"2019","unstructured":"AbouEisha, H., Amin, T., Chikalov, I., Hussain, S., Moshkov, M.: Extensions of Dynamic Programming for Combinatorial Optimization and Data Mining. ISRL, vol. 146. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-319-91839-6"},{"issue":"1","key":"1_CR2","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/S0166-218X(03)00186-0","volume":"137","author":"M Aigner","year":"2004","unstructured":"Aigner, M.: Variants of the majority problem. Discret. Appl. Math. 137(1), 3\u201325 (2004)","journal-title":"Discret. Appl. Math."},{"issue":"3\u20134","key":"1_CR3","doi-asserted-by":"publisher","first-page":"263","DOI":"10.3233\/FI-2019-1785","volume":"165","author":"JG Bazan","year":"2019","unstructured":"Bazan, J.G., et al.: A classifier based on a decision tree with temporal cuts. Fundam. Informaticae 165(3\u20134), 263\u2013281 (2019)","journal-title":"Fundam. Informaticae"},{"key":"1_CR4","doi-asserted-by":"publisher","first-page":"163","DOI":"10.1007\/BF02614316","volume":"79","author":"E Boros","year":"1997","unstructured":"Boros, E., Hammer, P.L., Ibaraki, T., Kogan, A.: Logical analysis of numerical data. Math. Program. 79, 163\u2013190 (1997)","journal-title":"Math. Program."},{"key":"1_CR5","unstructured":"Breiman, L., Friedman, J.H., Olshen, R.A., Stone, C.J.: Classification and Regression Trees. Wadsworth and Brooks (1984)"},{"key":"1_CR6","doi-asserted-by":"publisher","unstructured":"Chikalov, I., et al.: Three Approaches to Data Analysis - Test Theory, Rough Sets and Logical Analysis of Data, Intelligent Systems Reference Library, vol.\u00a041. Springer, Heidelberg (2013). https:\/\/doi.org\/10.1007\/978-3-642-28667-4","DOI":"10.1007\/978-3-642-28667-4"},{"key":"1_CR7","doi-asserted-by":"publisher","unstructured":"Durdymyradov, K., Moshkov, M., Ostonov, A.: Decision Trees Versus Systems of Decision Rules: A Rough Set Approach, Studies in Big Data, vol.\u00a0160. Springer, Cham (2024). https:\/\/doi.org\/10.1007\/978-3-031-71586-0","DOI":"10.1007\/978-3-031-71586-0"},{"key":"1_CR8","series-title":"Cognitive Technologies","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-75197-7","volume-title":"Foundations of Rule Learning","author":"J F\u00fcrnkranz","year":"2012","unstructured":"F\u00fcrnkranz, J., Gamberger, D., Lavrac, N.: Foundations of Rule Learning. Cognitive Technologies, Springer (2012). https:\/\/doi.org\/10.1007\/978-3-540-75197-7"},{"key":"1_CR9","volume-title":"Programs from Decision Tables, Computer Monographs","author":"E Humby","year":"1973","unstructured":"Humby, E.: Programs from Decision Tables, Computer Monographs, vol. 19. Macdonald, London and American Elsevier, New York (1973)"},{"key":"1_CR10","doi-asserted-by":"publisher","first-page":"173008","DOI":"10.1109\/ACCESS.2020.3022735","volume":"8","author":"A Iqbal","year":"2020","unstructured":"Iqbal, A., Raza, M.S., Ibrahim, M., Baz, A., Alhakami, H., Saeed, M.A.: An improved approach for finding rough set based dynamic reducts. IEEE Access 8, 173008\u2013173023 (2020). https:\/\/doi.org\/10.1109\/ACCESS.2020.3022735","journal-title":"IEEE Access"},{"key":"1_CR11","unstructured":"Kohavi, R., Li, C.: Oblivious decision trees, graphs, and top-down pruning. In: Proceedings of the Fourteenth International Joint Conference on Artificial Intelligence, IJCAI 95, Montr\u00e9al Qu\u00e9bec, Canada, 20-25 August 1995, vol. 2, pp. 1071\u20131079. Morgan Kaufmann (1995)"},{"key":"1_CR12","unstructured":"Langley, P., Sage, S.: Oblivious decision trees and abstract cases. In: Working Notes of the AAAI94 Workshop on Case-Based Reasoning, pp. 113\u2013117. AAAI Press (1994)"},{"key":"1_CR13","doi-asserted-by":"publisher","unstructured":"Moshkov, M.J.: Time complexity of decision trees. In: Peters, J.F., Skowron, A. (eds.) Transactions on Rough Sets III. LNCS, vol. 3400, pp. 244\u2013459. Springer, Heidelberg (2005). https:\/\/doi.org\/10.1007\/11427834_12","DOI":"10.1007\/11427834_12"},{"issue":"22","key":"1_CR14","doi-asserted-by":"publisher","first-page":"2837","DOI":"10.1016\/j.disc.2007.03.002","volume":"307","author":"M Moshkov","year":"2007","unstructured":"Moshkov, M.: On the class of restricted linear information systems. Discret. Math. 307(22), 2837\u20132844 (2007)","journal-title":"Discret. Math."},{"key":"1_CR15","doi-asserted-by":"publisher","unstructured":"Moshkov, M., Zielosko, B.: Combinatorial Machine Learning - A Rough Set Approach, Studies in Computational Intelligence, vol.\u00a0360. Springer, Heidelberg (2011). https:\/\/doi.org\/10.1007\/978-3-642-20995-6","DOI":"10.1007\/978-3-642-20995-6"},{"key":"1_CR16","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"354","DOI":"10.1007\/3-540-45554-X_43","volume-title":"Rough Sets and Current Trends in Computing","author":"NH Son","year":"2001","unstructured":"Son, N.H.: On efficient construction of decision trees from large databases. In: Ziarko, W., Yao, Y. (eds.) RSCTC 2000. LNCS (LNAI), vol. 2005, pp. 354\u2013361. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/3-540-45554-X_43"},{"issue":"6","key":"1_CR17","doi-asserted-by":"publisher","first-page":"519","DOI":"10.3390\/e26060519","volume":"26","author":"A Ostonov","year":"2024","unstructured":"Ostonov, A., Moshkov, M.: Comparative analysis of deterministic and nondeterministic decision trees for decision tables from closed classes. Entropy 26(6), 519 (2024)","journal-title":"Entropy"},{"issue":"3","key":"1_CR18","doi-asserted-by":"publisher","first-page":"205","DOI":"10.1016\/0306-4379(81)90023-5","volume":"6","author":"Z Pawlak","year":"1981","unstructured":"Pawlak, Z.: Information systems theoretical foundations. Inf. Syst. 6(3), 205\u2013218 (1981)","journal-title":"Inf. Syst."},{"key":"1_CR19","doi-asserted-by":"crossref","unstructured":"Pawlak, Z.: Rough Sets - Theoretical Aspects of Reasoning about Data, Theory and Decision Library: Series D, vol.\u00a09. Kluwer (1991)","DOI":"10.1007\/978-94-011-3534-4_7"},{"issue":"1","key":"1_CR20","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1016\/j.ins.2006.06.003","volume":"177","author":"Z Pawlak","year":"2007","unstructured":"Pawlak, Z., Skowron, A.: Rudiments of rough sets. Inf. Sci. 177(1), 3\u201327 (2007)","journal-title":"Inf. Sci."},{"key":"1_CR21","unstructured":"Pollack, S.L., Hicks, H.T., Harrison, W.J.: Decision Tables: Theory and Practice. Wiley (1971)"},{"key":"1_CR22","unstructured":"Popov, S., Morozov, S., Babenko, A.: Neural oblivious decision ensembles for deep learning on tabular data. CoRR abs\/1909.06312 (2019). http:\/\/arxiv.org\/abs\/1909.06312"},{"key":"1_CR23","unstructured":"Quinlan, J.R.: C4.5: Programs for Machine Learning. Morgan Kaufmann (1993)"},{"issue":"4","key":"1_CR24","doi-asserted-by":"publisher","first-page":"476","DOI":"10.1109\/TSMCC.2004.843247","volume":"35","author":"L Rokach","year":"2005","unstructured":"Rokach, L., Maimon, O.: Top-down induction of decision trees classifiers - A survey. IEEE Trans. Syst. Man Cybern. Part C 35(4), 476\u2013487 (2005)","journal-title":"IEEE Trans. Syst. Man Cybern. Part C"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Rokach, L., Maimon, O.: Data Mining with Decision Trees - Theory and Applications, Series in Machine Perception and Artificial Intelligence, vol.\u00a069. World Scientific (2007)","DOI":"10.1142\/9789812771728"},{"issue":"4","key":"1_CR26","first-page":"35","volume":"5","author":"S Sengupta","year":"2014","unstructured":"Sengupta, S., Das, A.K.: A study on rough set theory based dynamic reduct for classification system optimization. Int. J. Artif. Intell. Appl. 5(4), 35 (2014)","journal-title":"Int. J. Artif. Intell. Appl."},{"key":"1_CR27","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/978-3-662-43505-2_21","volume-title":"Springer Handbook of Computational Intelligence","author":"A Skowron","year":"2015","unstructured":"Skowron, A., Jankowski, A., Swiniarski, R.W.: Foundations of rough sets. In: Kacprzyk, J., Pedrycz, W. (eds.) Springer Handbook of Computational Intelligence, pp. 331\u2013348. Springer, Heidelberg (2015). https:\/\/doi.org\/10.1007\/978-3-662-43505-2_21"},{"key":"1_CR28","doi-asserted-by":"publisher","unstructured":"Skowron, A., Rauszer, C.: The discernibility matrices and functions in information systems. In: Slowinski, R. (ed.) Intelligent Decision Support - Handbook of Applications and Advances of the Rough Sets Theory, Theory and Decision Library, vol.\u00a011, pp. 331\u2013362. Springer, Dordrecht (1992). https:\/\/doi.org\/10.1007\/978-94-015-7975-9_21","DOI":"10.1007\/978-94-015-7975-9_21"},{"key":"1_CR29","doi-asserted-by":"publisher","unstructured":"Slezak, D., Chadzynska-Krasowska, A.: Approximate decision tree induction over approximately engineered data features. In: Bello, R., Miao, D., Falcon, R., Nakata, M., Rosete, A., Ciucci, D. (eds.) IJCRS 2020. LNCS (LNAI), vol. 12179, pp. 376\u2013384. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-52705-1_28","DOI":"10.1007\/978-3-030-52705-1_28"},{"key":"1_CR30","doi-asserted-by":"crossref","unstructured":"Tueno, A., Kerschbaum, F., Katzenbeisser, S.: Private evaluation of decision trees using sublinear cost. In: Proceedings on Privacy Enhancing Technologies (2019)","DOI":"10.2478\/popets-2019-0015"}],"container-title":["Lecture Notes in Computer Science","Rough Sets"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-92744-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,12]],"date-time":"2025-05-12T11:52:12Z","timestamp":1747050732000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-92744-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"ISBN":["9783031927430","9783031927447"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-92744-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]},"assertion":[{"value":"13 May 2025","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"IJCRS","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Joint Conference on Rough Sets","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Chongqing","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"China","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2025","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2025","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 May 2025","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ijcrs2025","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ijcrs2025.cqupt.edu.cn","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}