{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T15:28:29Z","timestamp":1743002909720,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319751719"},{"type":"electronic","value":"9783319751726"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-75172-6_17","type":"book-chapter","created":{"date-parts":[[2018,1,30]],"date-time":"2018-01-30T11:23:02Z","timestamp":1517311382000},"page":"195-206","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Boosting over Non-deterministic ZDDs"],"prefix":"10.1007","author":[{"given":"Takahiro","family":"Fujita","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Kohei","family":"Hatano","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Eiji","family":"Takimoto","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,1,31]]},"reference":[{"issue":"1","key":"17_CR1","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.E.: A decision-theoretic generalization of on-line learning and an application to boosting. J. Comput. Syst. Sci. 55(1), 119\u2013139 (1997)","journal-title":"J. Comput. Syst. Sci."},{"key":"17_CR2","doi-asserted-by":"publisher","first-page":"89","DOI":"10.1016\/j.jda.2012.07.006","volume":"18","author":"K Goto","year":"2013","unstructured":"Goto, K., Bannai, H., Inenaga, S., Takeda, M.: Fast q-gram mining on SLP compressed strings. J. Discrete Algorithms 18, 89\u201399 (2013)","journal-title":"J. Discrete Algorithms"},{"key":"17_CR3","doi-asserted-by":"crossref","DOI":"10.1561\/9781680831719","volume-title":"Introduction to Online Convex Optimization","author":"E Hazan","year":"2016","unstructured":"Hazan, E.: Introduction to Online Convex Optimization. Now Publishers Inc., Hanover (2016)"},{"key":"17_CR4","unstructured":"Hermelin, D., Landau, G.M., Landau, S., Weimann, O.: A unified algorithm for accelerating edit-distance computation via text-compression. In: 26th International Symposium on Theoretical Aspects of Computer Science (STACS 2009) (2009)"},{"issue":"1","key":"17_CR5","doi-asserted-by":"publisher","first-page":"102","DOI":"10.1109\/TSG.2013.2288976","volume":"5","author":"T Inoue","year":"2014","unstructured":"Inoue, T., Takano, K., Watanabe, T., Kawahara, J., Yoshinaka, R., Kishimoto, A., Tsuda, K., Minato, S., Hayashi, Y.: Distribution loss minimization with guaranteed error bound. IEEE Trans. Smart Grid 5(1), 102\u2013111 (2014)","journal-title":"IEEE Trans. Smart Grid"},{"issue":"6","key":"17_CR6","doi-asserted-by":"publisher","first-page":"1117","DOI":"10.1137\/0222067","volume":"22","author":"T Jiang","year":"1993","unstructured":"Jiang, T., Ravikumar, B.: Minimal NFA problems are hard. SIAM J. Comput. 22(6), 1117\u20131141 (1993)","journal-title":"SIAM J. Comput."},{"key":"17_CR7","series-title":"Fascicle 1, The: Bitwise Tricks & Techniques; Binary Decision Diagrams","volume-title":"Art of Computer Programming","author":"DE Knuth","year":"2009","unstructured":"Knuth, D.E.: Art of Computer Programming. Fascicle 1, The: Bitwise Tricks & Techniques; Binary Decision Diagrams, vol. 4. Addison-Wesley, Reading (2009)"},{"key":"17_CR8","doi-asserted-by":"crossref","unstructured":"Lifshits, Y.: Processing compressed texts: a tractability border. In: Proceedings of the 18th Annual Conference on Combinatorial Pattern Matching, CPM 2007, pp. 228\u2013240 (2007)","DOI":"10.1007\/978-3-540-73437-6_24"},{"issue":"1\u20132","key":"17_CR9","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/S0167-6377(98)00049-2","volume":"24","author":"OL Mangasarian","year":"1999","unstructured":"Mangasarian, O.L.: Arbitrary-norm separating plane. Oper. Res. Lett. 24(1\u20132), 15\u201323 (1999)","journal-title":"Oper. Res. Lett."},{"key":"17_CR10","doi-asserted-by":"crossref","unstructured":"Minato, S.: Zero-suppressed BDDs for set manipulation in combinatorial problems. In: Proceedings of the 30th International Conference on Design Automation, DAC 1993 (1993)","DOI":"10.1145\/157485.164890"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Minato, S., Uno, T.: Frequentness-transition queries for distinctive pattern mining from time-segmented databases. In: Proceedings of the 10th SIAM International Conference on Data Mining (SDM 2010), pp. 339\u2013349 (2010)","DOI":"10.1137\/1.9781611972801.30"},{"key":"17_CR12","doi-asserted-by":"crossref","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: Pacific-Asia Conference on Knowledge Discovery and Data Mining, pp. 234\u2013246 (2008)","DOI":"10.1007\/978-3-540-68125-0_22"},{"key":"17_CR13","unstructured":"Mohri, M.: General algebraic frameworks and algorithms for shortest-distance problems. Technical report, Technical Memorandum 981210\u201310TM, AT&T Labs- Research, 62 pages (1998)"},{"key":"17_CR14","doi-asserted-by":"crossref","unstructured":"Nishino, M., Yasuda, N., Minato, S., Nagata, M.: Accelerating graph adjacency matrix multiplications with adjacency forest. In: Proceedings of the 2014 SIAM International Conference on Data Mining (SDM 2014), pp. 1073\u20131081 (2014)","DOI":"10.1137\/1.9781611973440.122"},{"key":"17_CR15","unstructured":"R\u00e4tsch, G.: Robust boosting via convex optimization: theory and applications. Ph.D. thesis, University of Potsdam (2001)"},{"key":"17_CR16","first-page":"2131","volume":"6","author":"G R\u00e4tsch","year":"2005","unstructured":"R\u00e4tsch, G., Warmuth, M.K.: Efficient margin maximizing with boosting. J. Mach. Learn. Res. 6, 2131\u20132152 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"17_CR17","doi-asserted-by":"publisher","first-page":"181","DOI":"10.1016\/0304-3975(92)90142-3","volume":"92","author":"D Revuz","year":"1992","unstructured":"Revuz, D.: Minimisation of acyclic deterministic automata in linear time. Theor. Comput. Sci. 92, 181\u2013189 (1992)","journal-title":"Theor. Comput. Sci."},{"key":"17_CR18","doi-asserted-by":"crossref","unstructured":"Tabei, Y., Saigo, H., Yamanishi, Y., Puglisi, S.J.: Scalable partial least squares regression on grammar-compressed data matrices. In: Proceedings of the 22nd ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD 2016), pp. 1875\u20131884 (2016)","DOI":"10.1145\/2939672.2939864"},{"key":"17_CR19","first-page":"773","volume":"4","author":"E Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.: Path kernels and multiplicative updates. J. Mach. Learn. Res. 4, 773\u2013818 (2003)","journal-title":"J. Mach. Learn. Res."}],"container-title":["Lecture Notes in Computer Science","WALCOM: Algorithms and Computation"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-75172-6_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T15:40:33Z","timestamp":1710344433000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-75172-6_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319751719","9783319751726"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-75172-6_17","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"31 January 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"WALCOM","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Workshop on Algorithms and Computation","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Dhaka","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bangladesh","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 March 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5 March 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"12","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"walcom2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cse.buet.ac.bd\/walcom2018\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}