{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T14:19:05Z","timestamp":1760710745387},"reference-count":91,"publisher":"Oxford University Press (OUP)","issue":"2","license":[{"start":{"date-parts":[[2021,11,2]],"date-time":"2021-11-02T00:00:00Z","timestamp":1635811200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/academic.oup.com\/journals\/pages\/open_access\/funder_policies\/chorus\/standard_publication_model"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,2,19]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>A number of text compression algorithms have been proposed in the past decades, which have been very effective and usually operate on conventional character\/word-based approaches. A novel data compression perspective of data mining is explored in this research and the paper focuses on novel frequent sequence\/pattern mining approach to text compression. This work attempts to make use of longer-range correlations between words in languages for achieving better text compression. We propose a novel and efficient method by making the compression of any word-level text in a universal manner for corpora across domains referred as Universal Huffman Tree-based encoding. The major contribution of this work is in terms of avoidance of code table communication to the decoder. Simulation results over benchmark datasets indicate that Universal Huffman encoding employing frequent sequence mining (achieves [20%, 89%] improvement in compression in reduced time. The paper also contributes a usable interface for Data compression that employs the proposed frequent sequent mining-based data compression algorithm. The interface supports features such as feedback, consistency, usability, navigation, visual appeal, performance and accessibility on par with existing compression softwares. The work results in an intelligent data compression software employing knowledge engineering perspective.<\/jats:p>","DOI":"10.1093\/comjnl\/bxab173","type":"journal-article","created":{"date-parts":[[2021,10,28]],"date-time":"2021-10-28T19:10:41Z","timestamp":1635448241000},"page":"463-478","source":"Crossref","is-referenced-by-count":7,"title":["Smart Multimedia Compressor\u2014Intelligent Algorithms for Text and Image Compression"],"prefix":"10.1093","volume":"66","author":[{"given":"C","family":"Oswald","sequence":"first","affiliation":[{"name":"Department of Computer Science and Engineering , Indian Institute of Information Technology, Design and Manufacturing Kancheepuram, Chennai, Tamil Nadu 600127, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"B","family":"Sivaselvan","sequence":"additional","affiliation":[{"name":"Department of Computer Science and Engineering , Indian Institute of Information Technology, Design and Manufacturing Kancheepuram, Chennai, Tamil Nadu 600127, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"286","published-online":{"date-parts":[[2021,11,2]]},"reference":[{"key":"2023022013492848200_","article-title":"Data Compression: The Complete Reference, second edition","author":"David","year":"2004"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1098","DOI":"10.1109\/JRPROC.1952.273898","article-title":"A method for the construction of minimum redundancy codes","volume":"40","author":"","year":"1952","journal-title":"proc. IRE"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"34","DOI":"10.1109\/2.781632","article-title":"Data mining: From serendipity to science - guest editors\u2019 introduction","volume":"32","author":"Ramakrishnan","year":"1999","journal-title":"IEEE Computer"},{"key":"2023022013492848200_","first-page":"487","article-title":"Fast algorithms for mining association rules in large databases","volume-title":"VLDB\u201994, Proceedings of 20th International Conference on Very Large Data Bases, September 12\u201315, 1994, Santiago de Chile, Chile","author":"Agarwal","year":"1994"},{"key":"2023022013492848200_","volume-title":"Data Mining: Concepts and Techniques","author":"Han","year":"2000"},{"key":"2023022013492848200_","first-page":"166","article-title":"Clospan: Mining closed sequential patterns in large datasets","volume-title":"In SDM","author":"Yan","year":"2003"},{"key":"2023022013492848200_","article-title":"Advances in Knowledge Discovery and Data Mining: 17th Pacific-Asia Conference","volume-title":"PAKDD, Gold Coast, Australia, April 14\u201317, Proceedings, Part I","author":"Gomariz","year":"2013"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","article-title":"Frequent pattern mining: current status and future directions","volume":"15","author":"Han","year":"2007","journal-title":"Data Mining and Knowledge Discovery"},{"key":"2023022013492848200_","first-page":"947","article-title":"Applications of pattern discovery using sequential data mining","volume-title":"Data Mining: Concepts, Methodologies, Tools, and Applications","author":"Gupta"},{"key":"2023022013492848200_","volume-title":"Mining of massive datasets","author":"Rajaraman","year":"2012"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","DOI":"10.1201\/b15410","volume-title":"Data clustering: algorithms and applications","author":"Aggarwal","year":"2013"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"371","DOI":"10.1007\/978-3-319-71928-3_35","article-title":"A graph-based frequent sequence mining approach to text compression","volume-title":"International Conference on Mining Intelligence and Knowledge Exploration","author":"Oswald","year":"2017"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"3","DOI":"10.1145\/584091.584093","article-title":"A mathematical theory of communication","volume":"5","author":"Shannon","year":"2001","journal-title":"ACM SIGMOBILE Mobile Computing and Communications Review"},{"key":"2023022013492848200_","first-page":"317","article-title":"Run-length encoding","volume":"12","author":"Pountain","year":"1987","journal-title":"Byte"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"520","DOI":"10.1145\/214762.214771","article-title":"Arithmetic coding for data compression","volume":"30","author":"Witten","year":"1987","journal-title":"Communications of the ACM"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"825","DOI":"10.1145\/31846.42227","article-title":"Design and analysis of dynamic huffman codes","volume":"34","author":"Vitter","year":"1987","journal-title":"Journal of the ACM (JACM)"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1917","DOI":"10.1109\/26.61469","article-title":"Implementing the ppm data compression scheme","volume":"38","author":"Moffat","year":"1990","journal-title":"Communications, IEEE Transactions on"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"541","DOI":"10.1093\/comjnl\/30.6.541","article-title":"Data compression using dynamic markov modelling","volume":"30","author":"Cormack","year":"1987","journal-title":"The Computer Journal"},{"key":"2023022013492848200_","article-title":"A block-sorting lossless data compression algorithm","volume-title":"Digital SRC Research Report","author":"Burrows","year":"1994"},{"key":"2023022013492848200_","article-title":"Synthesis of noiseless compression codes","volume-title":"Georgia Institute of Technology","author":"Tunstall","year":"1967"},{"key":"2023022013492848200_","volume-title":"Data communication with modified huffman coding","author":"Bledsoe","year":"1987"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"337","DOI":"10.1109\/TIT.1977.1055714","article-title":"A universal algorithm for sequential data compression","volume":"23","author":"Ziv","year":"1977","journal-title":"IEEE Transactions on information theory"},{"key":"2023022013492848200_","volume-title":"Universal lossless data compression algorithms","author":"Deorowicz","year":"2003"},{"key":"2023022013492848200_","first-page":"1","article-title":"Efficient modification of lzss compression algorithm","volume":"1","author":"Pylak","year":"2015","journal-title":"Annales UMCS Sectio AI Informatica"},{"key":"2023022013492848200_","volume-title":"Lzx compression algorithm","year":"1985"},{"key":"2023022013492848200_","volume-title":"Lzma compression algorithm","year":"2006"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"16","DOI":"10.1145\/322234.322237","article-title":"Linear algorithm for data compression via string matching","volume":"28","author":"Rodeh","year":"1981","journal-title":"Journal of the ACM (JACM)"},{"key":"2023022013492848200_","volume-title":"Deflate compression algorithm","year":"2003"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"530","DOI":"10.1109\/TIT.1978.1055934","article-title":"Compression of individual sequences via variable-rate coding","volume":"24","author":"Ziv","year":"1978","journal-title":"Information Theory, IEEE Transactions on"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/MC.1984.1659158","article-title":"A technique for high-performance data compression","volume":"17","author":"Welch","year":"1984","journal-title":"Computer"},{"key":"2023022013492848200_","first-page":"36","article-title":"Lzw data compression","volume":"27","author":"Phillips","year":"1992","journal-title":"The Computer Application Journal"},{"key":"2023022013492848200_","volume-title":"Rar compression algorithm","year":"2006"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/INDICON.2015.7443683","article-title":"Knowledge engineering perspective of text compression","volume-title":"2015 Annual IEEE India Conference (INDICON)","author":"Oswald","year":"2015"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"563","DOI":"10.1007\/978-3-319-26832-3_53","article-title":"An efficient text compression algorithm-data mining perspective","volume-title":"Mining Intelligence and Knowledge Exploration","author":"Oswald","year":"2015"},{"key":"2023022013492848200_","first-page":"3","article-title":"Mining sequential patterns","volume-title":"Data Engineering, 1995. Proceedings of the Eleventh International Conference on","author":"Agrawal","year":"1995"},{"key":"2023022013492848200_","first-page":"1","article-title":"Mining sequential patterns: Generalizations and performance improvements","volume-title":"International Conference on Extending Database Technology","author":"Srikant","year":"1996"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/TKDE.2004.77","article-title":"Mining sequential patterns by pattern-growth: The prefixspan approach","volume":"16","author":"Pei","year":"2004","journal-title":"IEEE Transactions on knowledge and data engineering"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1023\/A:1007652502315","article-title":"Spade: An efficient algorithm for mining frequent sequences","volume":"42","author":"Zaki","year":"2001","journal-title":"Machine learning"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"19","DOI":"10.1145\/2431211.2431218","article-title":"Sequential pattern mining\u2013approaches and algorithms","volume":"45","author":"Mooney","year":"2013","journal-title":"ACM Computing Surveys (CSUR)"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data mining and knowledge discovery"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"593","DOI":"10.1080\/07408170600897460","article-title":"H-mine: Fast and space-preserving frequent pattern mining in large databases","volume":"39","author":"Pei","year":"2007","journal-title":"IIE transactions"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/1133905.1133914","article-title":"Keeping things simple: Finding frequent item sets by recursive elimination","volume-title":"Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations","author":"Borgelt","year":"2005"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"66","DOI":"10.1145\/380995.381017","article-title":"Mining frequent patterns with counting inference","volume":"2","author":"Bastide","year":"2000","journal-title":"ACM SIGKDD Explorations Newsletter"},{"key":"2023022013492848200_","first-page":"255","article-title":"Dynamic itemset counting and implication rules for market basket data","volume-title":"ACM SIGMOD Record","author":"Brin","year":"1997"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1145\/1133905.1133916","article-title":"Lcm ver. 3: collaboration of array, bitmap and prefix tree for frequent itemset mining","volume-title":"Proceedings of the 1st international workshop on open source data mining: frequent pattern mining implementations","author":"Uno","year":"2005"},{"key":"2023022013492848200_","article-title":"Survey on frequent pattern mining. manuscript","author":"Goethals","year":"2003"},{"key":"2023022013492848200_","first-page":"437","article-title":"Frequent item set mining","volume":"2","author":"Borgelt","year":"2012","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"2023022013492848200_","first-page":"153","article-title":"The average word length dynamics as an indicator of cultural changes in society","volume":"14","author":"Bochkarev","year":"2015","journal-title":"Social Evolution & History"},{"key":"2023022013492848200_","article-title":"The global language monitor","year":"2015"},{"key":"2023022013492848200_","article-title":"Domain specific hierarchical huffman encoding","author":"Ilambharathi","year":"2013","journal-title":"CoRR"},{"key":"2023022013492848200_","volume-title":"Calgary compression corpus datasets"},{"key":"2023022013492848200_","volume-title":"Silesia dataset","year":"2013"},{"key":"2023022013492848200_","volume-title":"Uci machine learning repository","year":"1987"},{"key":"2023022013492848200_","volume-title":"Trec genomics track data"},{"key":"2023022013492848200_","volume-title":"Amazon reviews dataset"},{"key":"2023022013492848200_","volume-title":"Debruijn sequence data"},{"key":"2023022013492848200_","article-title":"Python and Tkinter Programming","author":"Grayson","year":"2000"},{"key":"2023022013492848200_","volume-title":"5 aspects of good user interface","year":"1990"},{"key":"2023022013492848200_","volume-title":"7-zip file archiver","year":"2014"},{"key":"2023022013492848200_","volume-title":"Usc-sipi image database","year":"1977"},{"issue":"4","key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1145\/103085.103089","article-title":"The jpeg still picture compression standard","volume":"34","author":"Wallace","year":"1991","journal-title":"Commun. ACM"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","DOI":"10.17487\/rfc2083","volume-title":"Png (portable network graphics) specification version 1.0","author":"Boutell","year":"1997"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"347","DOI":"10.1007\/978-981-10-3373-5_35","article-title":"Hierarchical clustering approach to text compression","volume-title":"Progress in Intelligent Computing Techniques: Theory, Practice, and Applications","author":"Oswald","year":"2018"},{"key":"2023022013492848200_","first-page":"29","article-title":"Lzw data compression. Dr","volume":"14","author":"Nelson","year":"1989","journal-title":"Dobb\u2019s Journal"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"8","DOI":"10.1109\/65.912716","article-title":"Survey and taxonomy of ip address lookup algorithms","volume":"15","author":"Ruizs\u00e1nchez","year":"2001","journal-title":"Network, IEEE"},{"key":"2023022013492848200_","first-page":"49","article-title":"Similarity measures for text document clustering","volume-title":"Proceedings of the sixth new zealand computer science research student conference (NZCSRSC2008), Christchurch, New Zealand","author":"Huang","year":"2008"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"166","DOI":"10.1145\/363958.363991","article-title":"Generating a canonical prefix encoding","volume":"7","author":"Sschwartz","year":"1964","journal-title":"Communications of the ACM"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"77","DOI":"10.1007\/978-1-4614-3223-4_4","article-title":"A survey of text clustering algorithms","volume-title":"Mining text data","author":"Aggarwal","year":"2012"},{"key":"2023022013492848200_","first-page":"35","article-title":"Modern information retrieval: A brief overview","volume":"24","author":"Singhal","year":"2001","journal-title":"IEEE Data Eng. Bull."},{"key":"2023022013492848200_","article-title":"Partitioning Around Medoids (Program PAM)","volume-title":"Finding Groups in Data","author":"Kaufman","year":"2008"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1003","DOI":"10.1109\/TKDE.2002.1033770","article-title":"Clarans: A method for clustering objects for spatial data mining","volume":"14","author":"Ng","year":"2002","journal-title":"IEEE transactions on knowledge and data engineering"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1523","DOI":"10.1109\/TIT.2005.844059","article-title":"Clustering by compression","volume":"51","author":"Cilibrasi","year":"2005","journal-title":"Information Theory, IEEE Transactions on"},{"key":"2023022013492848200_","first-page":"651","article-title":"Data clustering: 50 years beyond k-means","volume-title":"Pattern Recognition Letters","author":"Jain","year":"2010"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"103","DOI":"10.1145\/233269.233324","article-title":"Birch: An efficient data clustering method for very large databases","volume-title":"Proceedings of the 1996 ACM SIGMOD International Conference on Management of Data","author":"Zhang","year":"1996"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"175","DOI":"10.1145\/568271.223813","article-title":"An effective hash-based algorithm for mining association rules","volume":"24","author":"Park","year":"1995","journal-title":"Acm sigmod record"},{"key":"2023022013492848200_","volume-title":"An efficient algorithm for mining association rules in large databases","author":"Savasere","year":"1995"},{"key":"2023022013492848200_","first-page":"1","article-title":"Mining frequent patterns without candidate generation","author":"Han","year":"2000","journal-title":"SIGMOD Conference, pp."},{"key":"2023022013492848200_","first-page":"XX","article-title":"Hierarchical clustering approach to text compression","volume-title":"Advanced Computing, Networking, and Informatics","author":"Oswald C","year":"2016"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","article-title":"Mining frequent patterns without candidate generation: A frequent-pattern tree approach","volume":"8","author":"Han","year":"2004","journal-title":"Data Min. Knowl. Discov."},{"issue":"August","key":"2023022013492848200_","article-title":"New algorithms for fast discovery of association rules","author":"Zaki","year":"1997","journal-title":"3rd Intl. Conf. on Knowledge Discovery and Data Mining"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"372","DOI":"10.1109\/69.846291","article-title":"Scalable algorithms for association mining","volume":"12","author":"Zaki","year":"2000","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2023022013492848200_","first-page":"441","article-title":"H-mine: Hyper-structure mining of frequent patterns in large databases","volume-title":"Data Mining, 2001. ICDM 2001, Proceedings IEEE International Conference on","author":"Pei","year":"2001"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"326","DOI":"10.1145\/956750.956788","article-title":"Fast vertical mining using diffsets","volume-title":"Proceedings of the ninth ACM SIGKDD international conference on Knowledge discovery and data mining","author":"Zaki","year":"2003"},{"key":"2023022013492848200_","first-page":"134","article-title":"Sampling large databases for association rules","author":"Toivonen","year":"1996","journal-title":"VLDB, pp."},{"key":"2023022013492848200_","first-page":"968","article-title":"Sam: A split and merge algorithm for fuzzy frequent item set mining","volume-title":"IFSA\/EUSFLAT Conf","author":"Borgelt","year":"2009"},{"key":"2023022013492848200_","article-title":"Calgary compression corpus datasets","author":"Witten","year":"1989"},{"key":"2023022013492848200_","article-title":"Frequent itemset mining implementation(fimi) dataset","author":"Dataset"},{"key":"2023022013492848200_","author":"SURVEY, L"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"933","DOI":"10.1002\/j.1538-7305.1959.tb01583.x","article-title":"Variable-length binary encodings","volume":"38","author":"Gilbert","year":"1959","journal-title":"Bell System Technical Journal"},{"key":"2023022013492848200_","volume-title":"Calgary compression corpus datasets","year":"1989"},{"key":"2023022013492848200_","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1109\/INDICON.2016.7838977","article-title":"Lossy image compression-a frequent sequence mining perspective employing efficient clustering","volume-title":"2016 IEEE Annual India Conference (INDICON)","author":"Kadimisetty","year":"2016"}],"container-title":["The Computer Journal"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/2\/463\/49256491\/bxab173.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"syndication"},{"URL":"https:\/\/academic.oup.com\/comjnl\/article-pdf\/66\/2\/463\/49256491\/bxab173.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,11]],"date-time":"2023-11-11T22:07:45Z","timestamp":1699740465000},"score":1,"resource":{"primary":{"URL":"https:\/\/academic.oup.com\/comjnl\/article\/66\/2\/463\/6414805"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,11,2]]},"references-count":91,"journal-issue":{"issue":"2","published-online":{"date-parts":[[2021,11,2]]},"published-print":{"date-parts":[[2023,2,19]]}},"URL":"https:\/\/doi.org\/10.1093\/comjnl\/bxab173","relation":{},"ISSN":["0010-4620","1460-2067"],"issn-type":[{"value":"0010-4620","type":"print"},{"value":"1460-2067","type":"electronic"}],"subject":[],"published-other":{"date-parts":[[2023,2]]},"published":{"date-parts":[[2021,11,2]]}}}