{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,14]],"date-time":"2025-05-14T04:25:24Z","timestamp":1747196724131,"version":"3.40.5"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319131856"},{"type":"electronic","value":"9783319131863"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"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":[[2014]]},"DOI":"10.1007\/978-3-319-13186-3_41","type":"book-chapter","created":{"date-parts":[[2014,12,1]],"date-time":"2014-12-01T20:09:58Z","timestamp":1417464598000},"page":"457-469","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Three-way Indexing ZDDs for Large-Scale Sparse Datasets"],"prefix":"10.1007","author":[{"given":"Hiroshi","family":"Aoki","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Takahisa","family":"Toda","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shin-ichi","family":"Minato","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2014,11,26]]},"reference":[{"key":"41_CR1","unstructured":"Goethals, B.: Survey on frequent pattern mining. Technical report (2002)"},{"key":"41_CR2","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: DAC \u201993: Proceedings of the 30th International Design Automation Conference, pp. 272\u2013277. ACM, New York (1993)","DOI":"10.1145\/157485.164890"},{"key":"41_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"234","DOI":"10.1007\/978-3-540-68125-0_22","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S Minato","year":"2008","unstructured":"Minato, S., Uno, T., Arimura, H.: LCM over ZBDDs: fast generation of very large-scale frequent itemsets using a compact graph-based representation. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol. 5012, pp. 234\u2013246. Springer, Heidelberg (2008)"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Minato, S.: A fast algorithm for cofactor implication checking and its application for knowledge discovery. In: Proceedings of IEEE 8th International Conference on Computer and Information Technology, July 2008, pp. 53\u201358 (2008)","DOI":"10.1109\/CIT.2008.4594649"},{"key":"41_CR5","unstructured":"Minato, S.: Finding simple disjoint decompositions in frequent itemset data using zero-suppressed BDDs. In: Proceedings of IEEE ICDM 2005 Workshop on Computational Intelligence in Data Mining, November 2005, pp. 3\u201311 (2005)"},{"issue":"2","key":"41_CR6","doi-asserted-by":"publisher","first-page":"156","DOI":"10.1527\/tjsai.22.156","volume":"22","author":"S Minato","year":"2007","unstructured":"Minato, S., Ito, K.: Symmetric item set mining method using zero-suppressed BDDs and application to biological data. Trans. Jpn. Soc. Artif. Intell. 22(2), 156\u2013164 (2007)","journal-title":"Trans. Jpn. Soc. Artif. Intell."},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Coudert, O.: Solving graph optimization problems with ZBDDs. In: Proceedings of the 1997 European Conference on Design and Test, March 1997, pp. 224\u2013228 (1997)","DOI":"10.1109\/EDTC.1997.582363"},{"key":"41_CR8","doi-asserted-by":"crossref","unstructured":"Loekito, E., Bailey, J.: Fast mining of high dimensional expressive contrast patterns using zero-suppressed binary decision diagrams. In: Proceedings of the 12th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 307\u2013316. ACM (2006)","DOI":"10.1145\/1150402.1150438"},{"key":"41_CR9","doi-asserted-by":"crossref","unstructured":"Minato, S.: Techniques of BDD\/ZDD: brief history and recent activity. IEICE Trans. Inf. Syst. E96-D(7), 1419\u20131429 (2013)","DOI":"10.1587\/transinf.E96.D.1419"},{"key":"41_CR10","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"731","DOI":"10.1007\/978-3-642-40450-4_62","volume-title":"Algorithms \u2013 ESA 2013","author":"S-I Minato","year":"2013","unstructured":"Minato, S.-I.: Z-Skip-Links for fast traversal of ZDDs representing large-scale sparse datasets. In: Bodlaender, H.L., Italiano, G.F. (eds.) ESA 2013. LNCS, vol. 8125, pp. 731\u2013742. Springer, Heidelberg (2013)"},{"key":"41_CR11","unstructured":"Bentley, J.L., Sedgewick, R.: Fast algorithms for sorting and searching strings. In: Proceedings of 8th Annual ACM-SIAM Symposium on Discrete Algorithms (SODA \u201997), January 1997, pp. 360\u2013369 (1997)"},{"key":"41_CR12","volume-title":"The Art of Computer Programming","author":"DE Knuth","year":"2011","unstructured":"Knuth, D.E.: The Art of Computer Programming, vol. 4a. Addison-Wesley Professional, New Jersey (2011)"},{"issue":"2","key":"41_CR13","doi-asserted-by":"publisher","first-page":"36","DOI":"10.1145\/1008620.1008624","volume":"11","author":"JL Bentley","year":"1979","unstructured":"Bentley, J.L., Saxe, J.B.: Algorithms on vector sets. SIGACT News 11(2), 36\u201339 (1979)","journal-title":"SIGACT News"},{"key":"41_CR14","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1007\/978-3-642-40897-7_19","volume-title":"Discovery Science","author":"T Toda","year":"2013","unstructured":"Toda, T.: Fast compression of large-scale hypergraphs for solving combinatorial problems. In: F\u00fcrnkranz, J., H\u00fcllermeier, E., Higuchi, T. (eds.) DS 2013. LNCS, vol. 8140, pp. 281\u2013293. Springer, Heidelberg (2013)"}],"container-title":["Lecture Notes in Computer Science","Trends and Applications in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-13186-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,13]],"date-time":"2025-05-13T22:11:19Z","timestamp":1747174279000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-13186-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319131856","9783319131863"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-13186-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2014]]},"assertion":[{"value":"26 November 2014","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}