{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,25]],"date-time":"2025-03-25T15:02:07Z","timestamp":1742914927111,"version":"3.40.3"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319268316"},{"type":"electronic","value":"9783319268323"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"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":[[2015]]},"DOI":"10.1007\/978-3-319-26832-3_53","type":"book-chapter","created":{"date-parts":[[2016,1,2]],"date-time":"2016-01-02T06:57:40Z","timestamp":1451717860000},"page":"563-575","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["An Efficient Text Compression Algorithm - Data Mining Perspective"],"prefix":"10.1007","author":[{"given":"C.","family":"Oswald","sequence":"first","affiliation":[]},{"given":"Anirban I.","family":"Ghosh","sequence":"additional","affiliation":[]},{"given":"B.","family":"Sivaselvan","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,1,3]]},"reference":[{"key":"53_CR1","volume-title":"Data Compression: The Complete Reference","author":"S David","year":"2004","unstructured":"David, S.: Data Compression: The Complete Reference, 2nd edn. Springer, New York (2004)","edition":"2"},{"issue":"9","key":"53_CR2","doi-asserted-by":"publisher","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","volume":"40","author":"DA Huffman","year":"1952","unstructured":"Huffman, D.A.: A method for the construction of minimum redundancy codes. Proc. IRE 40(9), 1098\u20131101 (1952)","journal-title":"Proc. IRE"},{"issue":"4","key":"53_CR3","doi-asserted-by":"publisher","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","volume":"38","author":"EN Gilbert","year":"1959","unstructured":"Gilbert, E.N., Moore, E.F.: Variable-length binary encodings. Bell Syst. Tech. J. 38(4), 933\u2013967 (1959)","journal-title":"Bell Syst. Tech. J."},{"key":"53_CR4","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2000","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann, San Francisco (2000)"},{"issue":"8","key":"53_CR5","doi-asserted-by":"publisher","first-page":"34","DOI":"10.1109\/2.781632","volume":"32","author":"N Ramakrishnan","year":"1999","unstructured":"Ramakrishnan, N., Grama, A.: Data mining: from serendipity to science - guest editors\u2019 introduction. IEEE Comput. 32(8), 34\u201337 (1999)","journal-title":"IEEE Comput."},{"key":"53_CR6","first-page":"487","volume-title":"VLDB 1994, Proceedings of 20th International Conference on Very Large Data Bases","author":"R Agarwal","year":"1994","unstructured":"Agarwal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Bocca, J.B., Jarke, M., Zaniolo, C. (eds.) VLDB 1994, Proceedings of 20th International Conference on Very Large Data Bases, pp. 487\u2013499. Santiago de Chile, Chile, Morgan Kaufmann (1994)"},{"issue":"1","key":"53_CR7","doi-asserted-by":"publisher","first-page":"3","DOI":"10.1145\/584091.584093","volume":"5","author":"CE Shannon","year":"2001","unstructured":"Shannon, C.E.: A mathematical theory of communication. ACM SIGMOBILE Mob. Comput. Commun. Rev. 5(1), 3\u201355 (2001)","journal-title":"ACM SIGMOBILE Mob. Comput. Commun. Rev."},{"issue":"6","key":"53_CR8","first-page":"317","volume":"12","author":"D Pountain","year":"1987","unstructured":"Pountain, D.: Run-length encoding. Byte 12(6), 317\u2013319 (1987)","journal-title":"Byte"},{"issue":"6","key":"53_CR9","doi-asserted-by":"publisher","first-page":"520","DOI":"10.1145\/214762.214771","volume":"30","author":"IH Witten","year":"1987","unstructured":"Witten, I.H., Neal, R.M., Cleary, J.G.: Arithmetic coding for data compression. Commun. ACM 30(6), 520\u2013540 (1987)","journal-title":"Commun. ACM"},{"issue":"4","key":"53_CR10","doi-asserted-by":"publisher","first-page":"825","DOI":"10.1145\/31846.42227","volume":"34","author":"JS Vitter","year":"1987","unstructured":"Vitter, J.S.: Design and analysis of dynamic huffman codes. J. ACM (JACM) 34(4), 825\u2013845 (1987)","journal-title":"J. ACM (JACM)"},{"issue":"11","key":"53_CR11","doi-asserted-by":"publisher","first-page":"1917","DOI":"10.1109\/26.61469","volume":"38","author":"A Moffat","year":"1990","unstructured":"Moffat, A.: Implementing the PPM data compression scheme. IEEE Trans. Commun. 38(11), 1917\u20131921 (1990)","journal-title":"IEEE Trans. Commun."},{"issue":"3","key":"53_CR12","doi-asserted-by":"publisher","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","volume":"23","author":"J Ziv","year":"1977","unstructured":"Ziv, J., Lempel, A.: A universal algorithm for sequential data compression. IEEE Trans. Inf. Theor. 23(3), 337\u2013343 (1977)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"53_CR13","unstructured":"Deorowicz, S.: Universal lossless data compression algorithms. Philosophy Dissertation Thesis, Gliwice (2003)"},{"issue":"5","key":"53_CR14","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","volume":"24","author":"J Ziv","year":"1978","unstructured":"Ziv, J., Lempel, A.: Compression of individual sequences via variable-rate coding. IEEE Trans. Inf. Theor. 24(5), 530\u2013536 (1978)","journal-title":"IEEE Trans. Inf. Theor."},{"issue":"1","key":"53_CR15","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53\u201387 (2004)","journal-title":"Data Min. Knowl. Discov."},{"key":"53_CR16","unstructured":"Goethals, B.: Survey on frequent pattern mining. manuscript (2003)"},{"key":"53_CR17","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Ullman, J.D., Tsur, S.: Dynamic itemset counting and implication rules for market basket data. In: ACM SIGMOD Record, vol. 26, pp. 255\u2013264. ACM (1997)","DOI":"10.1145\/253262.253325"},{"key":"53_CR18","doi-asserted-by":"publisher","first-page":"175","DOI":"10.1145\/568271.223813","volume":"24","author":"JS Park","year":"1995","unstructured":"Park, J.S., Chen, M.S., Yu, P.S.: An effective hash-based algorithm for mining association rules. ACM SIGMOD Rec. 24, 175\u2013186 (1995)","journal-title":"ACM SIGMOD Rec."},{"key":"53_CR19","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Gouda, K.: Fast vertical mining using diffsets. In: Proceedings of the Ninth ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 326\u2013335. ACM (2003)","DOI":"10.1145\/956750.956788"},{"issue":"2","key":"53_CR20","doi-asserted-by":"publisher","first-page":"66","DOI":"10.1145\/380995.381017","volume":"2","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: Mining frequent patterns with counting inference. ACM SIGKDD Explor. Newsl. 2(2), 66\u201375 (2000)","journal-title":"ACM SIGKDD Explor. Newsl."},{"issue":"1","key":"53_CR21","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Min. Knowl. Discov. 15(1), 55\u201386 (2007)","journal-title":"Data Min. Knowl. Discov."},{"key":"53_CR22","doi-asserted-by":"crossref","unstructured":"Borgelt, C.: Keeping things simple: finding frequent item sets by recursive elimination. In: Proceedings of the 1st International Workshop on Open Source Data Mining: Frequent Pattern Mining Implementations, pp. 66\u201370. ACM (2005)","DOI":"10.1145\/1133905.1133914"},{"key":"53_CR23","unstructured":"Savasere, A., Omicinski, E.R., Navathe, S.B.: An efficient algorithm for mining association rules in large databases. In: VLDB (1995)"},{"issue":"6","key":"53_CR24","first-page":"437","volume":"2","author":"C Borgelt","year":"2012","unstructured":"Borgelt, C.: Frequent item set mining. Wiley Interdisc. Rev.: Data Min. Knowl. Discov. 2(6), 437\u2013456 (2012)","journal-title":"Wiley Interdisc. Rev.: Data Min. Knowl. Discov."},{"key":"53_CR25","unstructured":"Calgary compression corpus datasets. corpus.canterbury.ac.nz\/descriptions\/ Accessed: 23 July 2015"},{"key":"53_CR26","unstructured":"Silesia dataset. \n                    http:\/\/sun.aei.polsl.pl\/sdeor\/index.php?page=silesia\n                    \n                   Accessed: 23 July 2015"}],"container-title":["Lecture Notes in Computer Science","Mining Intelligence and Knowledge Exploration"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-26832-3_53","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,6,1]],"date-time":"2019-06-01T03:49:43Z","timestamp":1559360983000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-26832-3_53"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319268316","9783319268323"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-26832-3_53","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]},"assertion":[{"value":"3 January 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}