{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T06:10:18Z","timestamp":1742019018382,"version":"3.38.0"},"reference-count":26,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"6","license":[{"start":{"date-parts":[[2002,11,1]],"date-time":"2002-11-01T00:00:00Z","timestamp":1036108800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2002,11]]},"DOI":"10.1109\/tkde.2002.1047767","type":"journal-article","created":{"date-parts":[[2003,1,3]],"date-time":"2003-01-03T17:55:00Z","timestamp":1041616500000},"page":"1269-1279","source":"Crossref","is-referenced-by-count":2,"title":["Algorithms for finding attribute value group for binary segmentation of categorical databases"],"prefix":"10.1109","volume":"14","author":[{"given":"Y.","family":"Morimoto","sequence":"first","affiliation":[]},{"given":"T.","family":"Fukuda","sequence":"additional","affiliation":[]},{"given":"T.","family":"Tokuyama","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"article-title":"Topological Walk Revisited","volume-title":"Proc. Sixth CCCG","author":"Asano","key":"ref1"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/76359.76371"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1023\/A:1018054314350"},{"volume-title":"Classification and Regression Trees","year":"1984","author":"Breiman","key":"ref4"},{"year":"1992","key":"ref5","article-title":"Introduction to IND Version 2.1"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/12130.12174"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1997.1504"},{"key":"ref8","first-page":"146","article-title":"Constructing Efficient Decision Trees by Using Optimized Association Rules","volume-title":"Proc. 22nd VLDB Conf.","author":"Fukuda"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/233269.233313"},{"key":"ref10","first-page":"55","article-title":"Finding Optimal Intervals Using Computational Geometry","volume-title":"Proc. Int\u2019l Symp. Algorithm and Computing \u201996","author":"Fukuda"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237708"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1006\/jcss.1998.1595"},{"key":"ref13","first-page":"416","article-title":"RainForestA Framework for Fast Decision Tree Construction of Large Datasets","volume-title":"Proc. 24th Int\u2019l Conf. Very Large Data Bases","author":"Gehrke"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(94)00165-F"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF02187876"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/BFb0014141"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1023\/A:1009755828992"},{"key":"ref18","first-page":"166","article-title":"Efficient Construction of Regression Trees with Range and Region Splitting","author":"Morimoto","year":"1997","journal-title":"Proc. 23nd VLDB Conf."},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1016\/B978-1-55860-200-7.50040-4"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/219717.219791"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1098-6"},{"journal-title":"C4.5: Programs for Machine Learning","year":"1993","author":"Quinlan","key":"ref22"},{"key":"ref23","first-page":"725","article-title":"Bagging, Boosting, and C4.5","volume-title":"Proc. 13th Nat\u2019l Conf. Artificial Intelligence and the Eighth Innovative Applications of Artificial Intelligence Conf.","author":"Quinlan"},{"key":"ref24","first-page":"404","article-title":"PUBLIC: A Decision Tree Classifier that Integrates Building and Pruning","volume-title":"Proc. 24th Int\u2019l Conf. Very Large Data Bases","author":"Rastogi"},{"key":"ref25","first-page":"544","article-title":"SPRINT: A Scalable Parallel Classifier for Data Mining","volume-title":"Proc. 22nd Int\u2019l Conf. Very Large Data Bases","author":"Shafer"},{"key":"ref26","first-page":"96","article-title":"Computing Optimized Rectilinear Regions for Association Rules","volume-title":"Proc. KDD\u201997","author":"Yoda"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx5\/69\/22458\/01047767.pdf?arnumber=1047767","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,3,15]],"date-time":"2025-03-15T05:31:51Z","timestamp":1742016711000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/1047767\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2002,11]]},"references-count":26,"journal-issue":{"issue":"6","published-print":{"date-parts":[[2002,11]]}},"URL":"https:\/\/doi.org\/10.1109\/tkde.2002.1047767","relation":{},"ISSN":["1041-4347"],"issn-type":[{"type":"print","value":"1041-4347"}],"subject":[],"published":{"date-parts":[[2002,11]]}}}