{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,9,25]],"date-time":"2025-09-25T15:36:20Z","timestamp":1758814580510,"version":"3.40.3"},"publisher-location":"Cham","reference-count":30,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030936198"},{"type":"electronic","value":"9783030936204"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-93620-4_23","type":"book-chapter","created":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T05:30:01Z","timestamp":1641015001000},"page":"322-340","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["An Efficient Distributed Coverage Pattern Mining Algorithm"],"prefix":"10.1007","author":[{"given":"Preetham","family":"Sathineni","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"A. Srinivas","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"P. Krishna","family":"Reddy","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Anirban","family":"Mondal","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2021,12,18]]},"reference":[{"key":"23_CR1","unstructured":"ADA. http:\/\/hpc.iiit.ac.in\/wiki\/index.php\/Ada_User_Guide. Accessed Sept 2021"},{"key":"23_CR2","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imieli\u0144ski, T., Swami, A.: Mining association rules between sets of items in large databases. In: Proceedings ACM SIGMOD, vol. 22, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"issue":"2","key":"23_CR3","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1007\/s41060-018-0165-3","volume":"8","author":"A Budhiraja","year":"2018","unstructured":"Budhiraja, A., Ralla, A., Reddy, P.K.: Coverage pattern based framework to improve search engine advertising. Int. J. Data Sci. Analytics 8(2), 199\u2013211 (2018). https:\/\/doi.org\/10.1007\/s41060-018-0165-3","journal-title":"Int. J. Data Sci. Analytics"},{"key":"23_CR4","doi-asserted-by":"crossref","unstructured":"Budhiraja, A., Reddy, P.K.: An approach to cover more advertisers in Adwords. In: Proceedings DSAA, pp. 1\u201310 (2015)","DOI":"10.1109\/DSAA.2015.7344802"},{"key":"23_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"169","DOI":"10.1007\/978-3-319-55699-4_11","volume-title":"Database Systems for Advanced Applications","author":"A Budhiraja","year":"2017","unstructured":"Budhiraja, A., Reddy, P.K.: An improved approach for long tail advertising in sponsored search. In: Candan, S., Chen, L., Pedersen, T.B., Chang, L., Hua, W. (eds.) DASFAA 2017. LNCS, vol. 10178, pp. 169\u2013184. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-55699-4_11"},{"key":"23_CR6","doi-asserted-by":"crossref","unstructured":"Chavan, K., Kulkarni, P., Ghodekar, P., Patil, S.: Frequent itemset mining for big data. In: International Conference on Green Computing and Internet of Things (ICGCIoT), pp. 1365\u20131368 (2015)","DOI":"10.1109\/ICGCIoT.2015.7380679"},{"issue":"3","key":"23_CR7","doi-asserted-by":"publisher","first-page":"1507","DOI":"10.1007\/s10586-018-1812-0","volume":"21","author":"K-W Chon","year":"2018","unstructured":"Chon, K.-W., Kim, M.-S.: BIGMiner: a fast and scalable distributed frequent pattern miner for big data. Clust. Comput. 21(3), 1507\u20131520 (2018). https:\/\/doi.org\/10.1007\/s10586-018-1812-0","journal-title":"Clust. Comput."},{"key":"23_CR8","unstructured":"Dua, D., Graff, C.: UCI machine learning repository. http:\/\/archive.ics.uci.edu\/ml. Accessed Sept. 2021"},{"issue":"5","key":"23_CR9","doi-asserted-by":"publisher","first-page":"1393","DOI":"10.1007\/s10618-019-00641-3","volume":"33","author":"L Gangumalla","year":"2019","unstructured":"Gangumalla, L., Reddy, P.K., Mondal, A.: Multi-location visibility query processing using portion-based transactional modeling and pattern mining. Data Min. Knowl. Disc. 33(5), 1393\u20131416 (2019). https:\/\/doi.org\/10.1007\/s10618-019-00641-3","journal-title":"Data Min. Knowl. Disc."},{"key":"23_CR10","unstructured":"Goethals, B., Zaki, M.: Frequent itemset mining implementations repository (2012). http:\/\/fimi.cs.helsinki.fi"},{"key":"23_CR11","doi-asserted-by":"crossref","unstructured":"Gui, F., et al.: A distributed frequent itemset mining algorithm based on spark. In: International Conference on Computer Supported Cooperative Work in Design, pp. 271\u2013275 (2015)","DOI":"10.1109\/CSCWD.2015.7230970"},{"key":"23_CR12","doi-asserted-by":"crossref","unstructured":"Guo, J., Ren, Y.G.: Research on improved A Priori algorithm based on coding and MapReduce. In: Web Information System and Application Conference, pp. 294\u2013299 (2013)","DOI":"10.1109\/WISA.2013.62"},{"key":"23_CR13","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"152","DOI":"10.1007\/978-3-319-38791-8_9","volume-title":"Web Engineering","author":"VNS Kavya","year":"2016","unstructured":"Kavya, V.N.S., Reddy, P.K.: Coverage patterns-based approach to allocate advertisement slots for display advertising. In: Bozzon, A., Cudre-Maroux, P., Pautasso, C. (eds.) ICWE 2016. LNCS, vol. 9671, pp. 152\u2013169. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-38791-8_9"},{"key":"23_CR14","doi-asserted-by":"crossref","unstructured":"Lin, J.C.W., Ahmed, U., Srivastava, G., Wu, J.M.T., Hong, T.P., Djenouri, Y.: Linguistic frequent pattern mining using a compressed structure. Appl. Intell. 51(7), 4806\u20134823 (2021)","DOI":"10.1007\/s10489-020-02080-w"},{"key":"23_CR15","doi-asserted-by":"crossref","unstructured":"Liu, B., Hsu, W., Ma, Y.: Mining association rules with multiple minimum supports. In: Proceedings ACM SIGKDD, pp. 337\u2013341 (1999)","DOI":"10.1145\/312129.312274"},{"key":"23_CR16","unstructured":"Ogihara, Z.P., Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: Proceedings KDD, pp. 283\u2013286 (1997)"},{"key":"23_CR17","doi-asserted-by":"crossref","unstructured":"Qiu, H., Gu, R., Yuan, C., Huang, Y.: YAFIM: a parallel frequent itemset mining algorithm with spark. In: IEEE International Parallel Distributed Processing Symposium Workshops, pp. 1664\u20131671 (2014)","DOI":"10.1109\/IPDPSW.2014.185"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Qiufeng, H., Qiang, L., Shiya, H., Yingcong, C.: Research on distributed parallel Eclat optimization algorithm. In: Proceedings International Conference on Artificial Intelligence and Big Data, pp. 149\u2013154 (2020)","DOI":"10.1109\/ICAIBD49809.2020.9137455"},{"key":"23_CR19","doi-asserted-by":"crossref","unstructured":"Ralla, A., Siddiqie, S., Reddy, P.K., Mondal, A.: Coverage pattern mining based on MapReduce. In: Proceedings ACM IKDD CoDS-COMAD, pp. 209\u2013213 (2020)","DOI":"10.1145\/3371158.3371188"},{"issue":"1","key":"23_CR20","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1186\/s40537-018-0112-0","volume":"5","author":"S Rathee","year":"2018","unstructured":"Rathee, S., Kashyap, A.: Adaptive-miner: an efficient distributed association rule mining algorithm on spark. J. Big Data 5(1), 1\u201317 (2018)","journal-title":"J. Big Data"},{"key":"23_CR21","doi-asserted-by":"crossref","unstructured":"Rathee, S., Kaul, M., Kashyap, A.: R-Apriori: an efficient Apriori based algorithm on spark. In: Proceedings of the Workshop on Ph.D. Workshop in Information and Knowledge Management, pp. 27\u201334 (2015)","DOI":"10.1145\/2809890.2809893"},{"issue":"8","key":"23_CR22","doi-asserted-by":"publisher","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":"23_CR23","doi-asserted-by":"crossref","unstructured":"Singh, P., Singh, S., Mishra, P.K., Garg, R.: RDD-Eclat: approaches to parallelize Eclat algorithm on spark RDD framework. In: Proceedings International Conference on Computer Networks and Communication Technologies, pp. 755\u2013768 (2020)","DOI":"10.1007\/978-3-030-37051-0_85"},{"key":"23_CR24","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"133","DOI":"10.1007\/978-3-642-30220-6_12","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"PG Srinivas","year":"2012","unstructured":"Srinivas, P.G., Reddy, P.K., Bhargav, S., Kiran, R.U., Kumar, D.S.: Discovering coverage patterns for banner advertisement placement. In: Tan, P.-N., Chawla, S., Ho, C.K., Bailey, J. (eds.) PAKDD 2012. LNCS (LNAI), vol. 7302, pp. 133\u2013144. Springer, Heidelberg (2012). https:\/\/doi.org\/10.1007\/978-3-642-30220-6_12"},{"issue":"3","key":"23_CR25","doi-asserted-by":"publisher","first-page":"423","DOI":"10.1007\/s10844-014-0318-3","volume":"45","author":"P Gowtham Srinivas","year":"2014","unstructured":"Gowtham Srinivas, P., Krishna Reddy, P., Trinath, A.V., Bhargav, S., Uday Kiran, R.: Mining coverage patterns from transactional databases. J. Intell. Inf. Syst. 45(3), 423\u2013439 (2014). https:\/\/doi.org\/10.1007\/s10844-014-0318-3","journal-title":"J. Intell. Inf. Syst."},{"key":"23_CR26","doi-asserted-by":"publisher","first-page":"31","DOI":"10.1016\/j.ins.2020.12.004","volume":"553","author":"JMT Wu","year":"2021","unstructured":"Wu, J.M.T., Srivastava, G., Wei, M., Yun, U., Lin, J.C.W.: Fuzzy high-utility pattern mining in parallel and distributed Hadoop framework. Inf. Sci. 553, 31\u201348 (2021)","journal-title":"Inf. Sci."},{"key":"23_CR27","first-page":"59","volume":"12","author":"O Yahya","year":"2012","unstructured":"Yahya, O., Hegazy, O., Ezat, E.: An efficient implementation of Apriori algorithm based on Hadoop-MapReduce model. Int. J. Rev. Comput. 12, 59\u201367 (2012)","journal-title":"Int. J. Rev. Comput."},{"key":"23_CR28","doi-asserted-by":"crossref","unstructured":"Yang, S., Xu, G., Wang, Z., Zhou, F.: The parallel improved Apriori algorithm research based on spark. In: International Conference on Frontier of Computer Science and Technology, pp. 354\u2013359 (2015)","DOI":"10.1109\/FCST.2015.28"},{"issue":"11","key":"23_CR29","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1145\/2934664","volume":"59","author":"M Zaharia","year":"2016","unstructured":"Zaharia, M., et al.: Apache Spark: a unified engine for big data processing. Commun. ACM 59(11), 56\u201365 (2016)","journal-title":"Commun. ACM"},{"key":"23_CR30","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Ji, G., Tang, M.: MREclat: an algorithm for parallel mining frequent itemsets. In: 2013 International Conference on Advanced Cloud and Big Data, pp. 177\u2013180 (2013)","DOI":"10.1109\/CBD.2013.22"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-93620-4_23","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T11:23:12Z","timestamp":1710328992000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-93620-4_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030936198","9783030936204"],"references-count":30,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-93620-4_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"18 December 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"BDA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"15 December 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"18 December 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"9","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"bigda2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.bda2021.org\/index.html","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 (provided by the conference organizers)"}},{"value":"CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"16","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39% - 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 (provided by the conference organizers)"}},{"value":"2.5","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3.3","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}