{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T06:13:54Z","timestamp":1654150434972},"reference-count":23,"publisher":"IGI Global","issue":"1","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014,1,1]]},"abstract":"<p>In many data mining applications such as the discovery of association rules, strong rules, and many other important discovery tasks, mining frequent item sets is a fundamental and essential problem. Methods have been implemented for mining frequent item sets using a prefix-tree structure, for storing compressed information GenMax is used for mining maximal frequent item sets. It uses a technique called progressive focusing to perform maximal checking, and differential set propagation to perform fast frequency computation. GenMax algorithm was not implemented for closed frequent item set. The proposal in this paper present an improved index based enhancement on Genmax algorithm for effective fast and less memory utilized pruning of maximal frequent item and closed frequent item sets. The extension induces a search tree on the set of frequent closed item sets thereby we can completely enumerate closed item sets without duplications. The memory use of mining the maximal frequent item set does not depend on the number of frequent closed item sets. The proposed model reduces the number of disk (Input and Outputs) I\/Os and make frequent item set mining scale to large transactional databases. Experimental results shows a comparison of improved index based GenMax and existing GenMax for efficient pruning of maximal frequent and closed frequent item sets in terms of item precision and fastness.<\/p>","DOI":"10.4018\/ijgc.2014010101","type":"journal-article","created":{"date-parts":[[2014,9,2]],"date-time":"2014-09-02T13:38:14Z","timestamp":1409665094000},"page":"1-11","source":"Crossref","is-referenced-by-count":0,"title":["Enhanced Index-Based GenMax for Frequent Item Set Mining"],"prefix":"10.4018","volume":"5","author":[{"given":"S.","family":"Asokkumar","sequence":"first","affiliation":[{"name":"Mahendra Engineering College, Salem, Tamil Nadu, India"}]},{"given":"S.","family":"Thangavel","sequence":"additional","affiliation":[{"name":"K.S.R. College of Technology, Tiruchengode, Tamil Nadu, India"}]}],"member":"2432","reference":[{"key":"ijgc.2014010101-0","doi-asserted-by":"publisher","DOI":"10.1016\/j.patrec.2007.09.001"},{"key":"ijgc.2014010101-1","doi-asserted-by":"publisher","DOI":"10.1504\/IJDATS.2009.024297"},{"key":"ijgc.2014010101-2","unstructured":"Baralis, E., & Cerquitelli, T. & Chiusano. (2005). Index support for frequent item set mining in a relational DBMS. In Proceedings of 21st International Conference on Data Engineering (ICDE) (pp. 375-381)."},{"key":"ijgc.2014010101-3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2008.180"},{"key":"ijgc.2014010101-4","first-page":"386","article-title":"n.d.). Speed-up iterative frequent item set mining with constraint changes.","author":"G. C.Bing Liu","journal-title":"Proceedings of 2nd International Conference"},{"key":"ijgc.2014010101-5","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-46145-0_1"},{"key":"ijgc.2014010101-6","unstructured":"Chaudhuri, S., Narasayya, V., & Sarawagi, S. (2009). Efficient evaluation of queries with mining predicates. In Proceedings of 2nd International Conference, organized by Microsoft Corporation and IIT Bombay (pp. 112-12)."},{"key":"ijgc.2014010101-7","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.152"},{"key":"ijgc.2014010101-8","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.120"},{"key":"ijgc.2014010101-9","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.161"},{"key":"ijgc.2014010101-10","unstructured":"Grahne, G., & Zhu, J. (n.d.). Efficiently using prefix-trees in mining frequent itemsets. In Proceedings of 7th International Conference, Concordia University Montreal, Canada, pp. 128-141."},{"key":"ijgc.2014010101-11","unstructured":"Leong Hou, U., Mamoulis, N., & Mouratidis, K. (2009). Efficient evaluation of multiple preference queries. In Proceedings of 2nd International Conference, Department of Computer Science, University of Hong Kong Pokfulam Road, Hong Kong, Singapore Management University (pp. 38-48)."},{"key":"ijgc.2014010101-12","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.149"},{"key":"ijgc.2014010101-13","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.24"},{"key":"ijgc.2014010101-14","unstructured":"Mozafari, B., & Zaniolo, C. (2008). Optimal load shedding with aggregates and mining queries. In Proceedings of 1st International Conference, Computer Science Department, University of California at Los Angeles, CA (pp. 183-188)."},{"key":"ijgc.2014010101-15","first-page":"412","article-title":"Integrating data mining with relational DBMS: A tightly-coupled approach.","author":"S.Nestorov","year":"2008","journal-title":"Proceedings of 4th International Conference"},{"key":"ijgc.2014010101-16","unstructured":"Pei, J., Han, J., & Lakshmanan, V. S. (2001). Pushing convertible constraints in frequent item set mining. In Proceedings of 2nd International Conference, University at Buffalo, The State University of New York (pp. 59-68)."},{"key":"ijgc.2014010101-17","unstructured":"Pietracaprina, A., & Zandolin, D. (n.d.). Mining frequent item sets using Patricia tries. In Proceedings of 9th International Conference, Department of Information Engineering University of Padova (pp. 271-278)."},{"key":"ijgc.2014010101-18","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.146"},{"key":"ijgc.2014010101-19","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2009.47"},{"key":"ijgc.2014010101-20","unstructured":"Tsur, S. (2008). LDL-A technology for the realization of tightly coupled xpertDatabase systems. In Proceedings of 2nd International Conference, Microelectronics and Computer Technology Corporation (pp. 167-172)."},{"key":"ijgc.2014010101-21","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"},{"key":"ijgc.2014010101-22","doi-asserted-by":"publisher","DOI":"10.1109\/69.846291"}],"container-title":["International Journal of Green Computing"],"original-title":[],"language":"ng","link":[{"URL":"https:\/\/www.igi-global.com\/viewtitle.aspx?TitleId=113747","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,6,2]],"date-time":"2022-06-02T05:41:39Z","timestamp":1654148499000},"score":1,"resource":{"primary":{"URL":"https:\/\/services.igi-global.com\/resolvedoi\/resolve.aspx?doi=10.4018\/ijgc.2014010101"}},"subtitle":[""],"short-title":[],"issued":{"date-parts":[[2014,1,1]]},"references-count":23,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2014,1]]}},"URL":"https:\/\/doi.org\/10.4018\/ijgc.2014010101","relation":{},"ISSN":["1948-5018","1948-5026"],"issn-type":[{"value":"1948-5018","type":"print"},{"value":"1948-5026","type":"electronic"}],"subject":[],"published":{"date-parts":[[2014,1,1]]}}}