{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:54:02Z","timestamp":1740099242690,"version":"3.37.3"},"publisher-location":"Cham","reference-count":31,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030053659"},{"type":"electronic","value":"9783030053666"}],"license":[{"start":{"date-parts":[[2018,12,11]],"date-time":"2018-12-11T00:00:00Z","timestamp":1544486400000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-05366-6_9","type":"book-chapter","created":{"date-parts":[[2018,12,10]],"date-time":"2018-12-10T10:04:48Z","timestamp":1544436288000},"page":"108-124","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":8,"title":["Parallel High Average-Utility Itemset Mining Using Better Search Space Division Approach"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0001-9199-1345","authenticated-orcid":false,"given":"Krishan Kumar","family":"Sethi","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0003-3338-6520","authenticated-orcid":false,"given":"Dharavath","family":"Ramesh","sequence":"additional","affiliation":[]},{"given":"M.","family":"Sreenu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,12,11]]},"reference":[{"key":"9_CR1","doi-asserted-by":"crossref","first-page":"207","DOI":"10.1145\/170036.170072","volume":"22","author":"R Agrawal","year":"1993","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. ACM SIGMOD Rec. 22, 207\u2013216 (1993)","journal-title":"ACM SIGMOD Rec."},{"key":"9_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of the 20th International Conference on Very Large Data Bases, VLDB, vol. 1215, pp. 487\u2013499 (1994)"},{"key":"9_CR3","unstructured":"Chan, R., Yang, Q., Shen, Y.-D.: Mining high utility itemsets. In: 2003 Third IEEE international conference on Data mining, ICDM 2003, pp. 19\u201326. IEEE (2003)"},{"key":"9_CR4","doi-asserted-by":"crossref","first-page":"314","DOI":"10.1016\/j.ins.2014.01.015","volume":"275","author":"CLP Chen","year":"2014","unstructured":"Chen, C.L.P., Zhang, C.-Y.: Data-intensive applications, challenges, techniques and technologies: a survey on big data. Inf. Sci. 275, 314\u2013347 (2014)","journal-title":"Inf. Sci."},{"key":"9_CR5","doi-asserted-by":"crossref","first-page":"26","DOI":"10.1016\/j.bdr.2016.07.001","volume":"6","author":"Y Chen","year":"2016","unstructured":"Chen, Y., An, A.: Approximate parallel high utility itemset mining. Big Data Res. 6, 26\u201342 (2016)","journal-title":"Big Data Res."},{"issue":"1","key":"9_CR6","first-page":"3389","volume":"15","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani, A., Cheng-Wei, W., Tseng, V.S.: SPMF: a Java open-source pattern mining library. J. Mach. Learn. Res. 15(1), 3389\u20133393 (2014)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"9_CR7","first-page":"54","volume":"1","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Kiran, R.U., Koh, Y.S., Thomas, R.: A survey of sequential pattern mining. Data Sci. Pattern Recognit. 1(1), 54\u201377 (2017)","journal-title":"Data Sci. Pattern Recognit."},{"issue":"4","key":"9_CR8","first-page":"e1207","volume":"7","author":"P Fournier-Viger","year":"2017","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Vo, B., Chi, T.T., Zhang, J., Le, H.B.: A survey of itemset mining. Wiley Interdisc. Rev.: Data Mining Knowl. Discov. 7(4), e1207 (2017)","journal-title":"Wiley Interdisc. Rev.: Data Mining Knowl. Discov."},{"key":"9_CR9","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83\u201392. Springer, Cham (2014). \nhttps:\/\/doi.org\/10.1007\/978-3-319-08326-1_9"},{"key":"9_CR10","volume-title":"Data Mining: Concepts and Techniques","author":"J Han","year":"2011","unstructured":"Han, J., Pei, J., Kamber, M.: Data Mining: Concepts and Techniques. Elsevier, Amsterdam (2011)"},{"key":"9_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1145\/335191.335372","volume":"29","author":"J Han","year":"2000","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Rec. 29, 1\u201312 (2000)","journal-title":"ACM SIGMOD Rec."},{"issue":"7","key":"9_CR12","doi-asserted-by":"crossref","first-page":"8259","DOI":"10.1016\/j.eswa.2011.01.006","volume":"38","author":"T-P Hong","year":"2011","unstructured":"Hong, T.-P., Lee, C.-H., Wang, S.-L.: Effective utility mining with the measure of average utility. Expert Syst. Appl. 38(7), 8259\u20138265 (2011)","journal-title":"Expert Syst. Appl."},{"issue":"5","key":"9_CR13","doi-asserted-by":"crossref","first-page":"2371","DOI":"10.1016\/j.eswa.2014.11.001","volume":"42","author":"S Krishnamoorthy","year":"2015","unstructured":"Krishnamoorthy, S.: Pruning strategies for mining high utility itemsets. Expert Syst. Appl. 42(5), 2371\u20132381 (2015)","journal-title":"Expert Syst. Appl."},{"key":"9_CR14","doi-asserted-by":"crossref","first-page":"168","DOI":"10.1016\/j.eswa.2017.08.028","volume":"90","author":"S Krishnamoorthy","year":"2017","unstructured":"Krishnamoorthy, S.: HMiner: efficiently mining high utility itemsets. Expert Syst. Appl. 90, 168\u2013183 (2017)","journal-title":"Expert Syst. Appl."},{"issue":"05","key":"9_CR15","doi-asserted-by":"crossref","first-page":"1009","DOI":"10.1142\/S0219622012500307","volume":"11","author":"G-C Lan","year":"2012","unstructured":"Lan, G.-C., Hong, T.-P., Tseng, V.S.: Efficiently mining high average-utility itemsets with an improved upper-bound strategy. Int. J. Inf. Technol. Decis. Making 11(05), 1009\u20131030 (2012)","journal-title":"Int. J. Inf. Technol. Decis. Making"},{"issue":"1","key":"9_CR16","first-page":"193","volume":"28","author":"G-C Lan","year":"2012","unstructured":"Lan, G.-C., Hong, T.-P., Tseng, V.S., et al.: A projection-based approach for discovering high average-utility itemsets. J. Inf. Sci. Eng. 28(1), 193\u2013209 (2012)","journal-title":"J. Inf. Sci. Eng."},{"issue":"1","key":"9_CR17","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1016\/j.datak.2007.06.009","volume":"64","author":"Y-C Li","year":"2008","unstructured":"Li, Y.-C., Yeh, J.-S., Chang, C.-C.: Isolated items discarding strategy for discovering high utility itemsets. Data Knowl. Eng. 64(1), 198\u2013217 (2008)","journal-title":"Data Knowl. Eng."},{"issue":"2","key":"9_CR18","doi-asserted-by":"crossref","first-page":"233","DOI":"10.1016\/j.aei.2016.04.002","volume":"30","author":"JC-W Lin","year":"2016","unstructured":"Lin, J.C.-W., Li, T., Fournier-Viger, P., Hong, T.-P., Zhan, J., Voznak, M.: An efficient algorithm to mine high average-utility itemsets. Adv. Eng. Inform. 30(2), 233\u2013243 (2016)","journal-title":"Adv. Eng. Inform."},{"key":"9_CR19","doi-asserted-by":"crossref","first-page":"7593","DOI":"10.1109\/ACCESS.2018.2801261","volume":"6","author":"JC-W Lin","year":"2018","unstructured":"Lin, J.C.-W., Ren, S., Fournier-Viger, P.: MEMU: more efficient algorithm to mine high average-utility patterns with multiple minimum average-utility thresholds. IEEE Access 6, 7593\u20137609 (2018)","journal-title":"IEEE Access"},{"key":"9_CR20","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"649","DOI":"10.1007\/978-3-319-18032-8_51","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"YC Lin","year":"2015","unstructured":"Lin, Y.C., Wu, C.-W., Tseng, V.S.: Mining high utility itemsets in big data. In: Cao, T., Lim, E.-P., Zhou, Z.-H., Ho, T.-B., Cheung, D., Motoda, H. (eds.) PAKDD 2015. LNCS (LNAI), vol. 9078, pp. 649\u2013661. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-18032-8_51"},{"key":"9_CR21","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM International Conference on Information and Knowledge Management, pp. 55\u201364. ACM (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"9_CR22","doi-asserted-by":"crossref","unstructured":"Liu, Y., Liao, W., Choudhary, A.: A fast high utility itemsets mining algorithm. In: Proceedings of the 1st International Workshop on Utility-Based Data Mining, pp. 90\u201399. ACM (2005)","DOI":"10.1145\/1089827.1089839"},{"key":"9_CR23","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Y Liu","year":"2005","unstructured":"Liu, Y., Liao, W., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: Ho, T.B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol. 3518, pp. 689\u2013695. Springer, Heidelberg (2005). \nhttps:\/\/doi.org\/10.1007\/11430919_79"},{"issue":"8","key":"9_CR24","doi-asserted-by":"crossref","first-page":"3652","DOI":"10.1007\/s11227-017-1963-4","volume":"73","author":"KK Sethi","year":"2017","unstructured":"Sethi, K.K., Ramesh, D.: HFIM: a Spark-based hybrid frequent itemset mining algorithm for big data processing. J. Supercomput. 73(8), 3652\u20133668 (2017)","journal-title":"J. Supercomput."},{"key":"9_CR25","doi-asserted-by":"crossref","first-page":"918","DOI":"10.1016\/j.procs.2018.05.107","volume":"132","author":"KK Sethi","year":"2018","unstructured":"Sethi, K.K., Ramesh, D., Edla, D.R.: P-FHM+: parallel high utility itemset mining algorithm for big data processing. Procedia Comput. Sci. 132, 918\u2013927 (2018). International Conference on Computational Intelligence and Data Science","journal-title":"Procedia Comput. Sci."},{"key":"9_CR26","doi-asserted-by":"crossref","unstructured":"Tseng, V.S., Wu, C.-W., Shie, B.-E., Yu, P.S.: Up-growth: an efficient algorithm for high utility itemset mining. In: Proceedings of the 16th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, pp. 253\u2013262. ACM (2010)","DOI":"10.1145\/1835804.1835839"},{"key":"9_CR27","volume-title":"Hadoop: The Definitive Guide","author":"T White","year":"2012","unstructured":"White, T.: Hadoop: The Definitive Guide. O\u2019Reilly Media, Inc., Newton (2012)"},{"key":"9_CR28","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: Proceedings of the 2004 SIAM International Conference on Data Mining, pp. 482\u2013486. SIAM (2004)","DOI":"10.1137\/1.9781611972740.51"},{"key":"9_CR29","doi-asserted-by":"crossref","first-page":"346","DOI":"10.1016\/j.future.2016.10.027","volume":"68","author":"U Yun","year":"2017","unstructured":"Yun, U., Kim, D.: Mining of high average-utility itemsets using novel list structure and pruning strategy. Future Gener. Comput. Syst. 68, 346\u2013360 (2017)","journal-title":"Future Gener. Comput. Syst."},{"key":"9_CR30","unstructured":"Zaharia, M., et al.: Resilient distributed datasets: a fault-tolerant abstraction for in-memory cluster computing. In: Proceedings of the 9th USENIX Conference on Networked Systems Design and Implementation, pp. 2. USENIX Association (2012)"},{"key":"9_CR31","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"530","DOI":"10.1007\/978-3-319-27060-9_44","volume-title":"Advances in Artificial Intelligence and Soft Computing","author":"S Zida","year":"2015","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.-W., Wu, C.-W., Tseng, V.S.: EFIM: a highly efficient algorithm for high-utility itemset mining. In: Sidorov, G., Galicia-Haro, S.N. (eds.) MICAI 2015. LNCS (LNAI), vol. 9413, pp. 530\u2013546. Springer, Cham (2015). \nhttps:\/\/doi.org\/10.1007\/978-3-319-27060-9_44"}],"container-title":["Lecture Notes in Computer Science","Distributed Computing and Internet Technology"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-05366-6_9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2018,12,10]],"date-time":"2018-12-10T10:09:29Z","timestamp":1544436569000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-05366-6_9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,12,11]]},"ISBN":["9783030053659","9783030053666"],"references-count":31,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-05366-6_9","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018,12,11]]},"assertion":[{"value":"ICDCIT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Distributed Computing and Internet Technology","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bhubaneswar","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"India","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"10 January 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 January 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"icdcit2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.icdcit.ac.in\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"115","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"17","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"13","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"15% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"4","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"8.85","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}},{"value":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information"}}]}}