{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,4]],"date-time":"2026-04-04T22:32:02Z","timestamp":1775341922722,"version":"3.50.1"},"publisher-location":"Singapore","reference-count":24,"publisher":"Springer Singapore","isbn-type":[{"value":"9789811572043","type":"print"},{"value":"9789811572050","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-981-15-7205-0_2","type":"book-chapter","created":{"date-parts":[[2020,7,10]],"date-time":"2020-07-10T23:16:43Z","timestamp":1594423003000},"page":"14-25","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["RPP Algorithm: A Method for Discovering Interesting Rare Itemsets"],"prefix":"10.1007","author":[{"given":"Sadeq","family":"Darrab","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"David","family":"Broneske","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Gunter","family":"Saake","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,7,11]]},"reference":[{"key":"2_CR1","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1007\/11430919_13","volume-title":"Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD)","author":"YS Koh","year":"2005","unstructured":"Koh, Y.S., Rountree, N.: Finding sporadic rules using Apriori-inverse. In: Ho, T.B., Cheung, D., Liu, H. (eds.) Pacific-Asia Conference on Knowledge Discovery and Data Mining (PAKDD), pp. 97\u2013106. Springer, Heidelberg (2005). \n                https:\/\/doi.org\/10.1007\/11430919_13"},{"key":"2_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proceedings of 20th International Conference on Very Large Data Bases (VLDB), VLDB, pp. 487\u2013499 (1994)"},{"key":"2_CR3","doi-asserted-by":"crossref","unstructured":"Szathmary L., Napoli A., Petko V.: Towards rare itemset mining. In: 19th International Conference on Tools with Artificial Intelligence (ICTAI), IEEE, pp. 305\u2013312 (2007)","DOI":"10.1109\/ICTAI.2007.30"},{"key":"2_CR4","doi-asserted-by":"crossref","unstructured":"Adda, M., Wu L., Feng, Y.: Rare itemset mining. In: Sixth International Conference on Machine Learning and Applications (ICMLA), IEEE, pp. 73\u201380 (2007)","DOI":"10.1109\/ICMLA.2007.106"},{"key":"2_CR5","doi-asserted-by":"crossref","unstructured":"Troiano, L., Scibelli, G., Birtolo, C.: A fast algorithm for mining rare itemsets. In: Proceedings of 9th International Conference on Intelligent Systems Design and Applications, IEEE Computer Society Press, pp. 1149\u20131155 (2009)","DOI":"10.1109\/ISDA.2009.55"},{"key":"2_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"277","DOI":"10.1007\/978-3-642-23544-3_21","volume-title":"Data Warehousing and Knowledge Discovery (DaWaK)","author":"S Tsang","year":"2011","unstructured":"Tsang, S., Koh, Y.S., Dobbie, G.: RP-Tree: rare pattern tree mining. In: Cuzzocrea, A., Dayal, U. (eds.) Data Warehousing and Knowledge Discovery (DaWaK). Lecture Notes in Computer Science, pp. 277\u2013288. Springer, Heidelberg (2011). \n                https:\/\/doi.org\/10.1007\/978-3-642-23544-3_21"},{"key":"2_CR7","unstructured":"Frequent Itemset Mining Dataset Repository. \n                http:\/\/fimi.uantwerpen.be\/data\/"},{"key":"2_CR8","doi-asserted-by":"crossref","unstructured":"Bhatt, U.Y., Patel P.A.: An effective approach to mine rare items using Maximum Constraint. In: Intelligent Systems and Control (ISCO), IEEE, pp. 1\u20136 (2015)","DOI":"10.1109\/ISCO.2015.7282234"},{"key":"2_CR9","doi-asserted-by":"crossref","unstructured":"Weiss, G.M.: Mining with rarity: a unifying framework. In: ACM SIGKDD Explorations Newsletter, pp. 7\u201319 (2004)","DOI":"10.1145\/1007730.1007734"},{"key":"2_CR10","unstructured":"Szathmary, L., Valtchev, P., Napoli, A., Godin, R.: Efficient vertical mining of minimal rare itemsets. In: Proceedings of 9th International Conference Concept Lattices and Their Applications (CLA), pp. 269\u2013280 (2012)"},{"key":"2_CR11","doi-asserted-by":"publisher","first-page":"510","DOI":"10.1007\/3-540-45372-5_59","volume-title":"European Conference on Principles of Data Mining and Knowledge Discovery","author":"C-L Lui","year":"2000","unstructured":"Lui, C.-L., Chung, F.-L.: Discovery of generalized association rules with multiple minimum supports. In: Zighed, D.A., Komorowski, J., Zytkow, J. (eds.) European Conference on Principles of Data Mining and Knowledge Discovery, pp. 510\u2013515. Springer, Heidelberg (2000). \n                https:\/\/doi.org\/10.1007\/3-540-45372-5_59"},{"key":"2_CR12","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the International Conference on Management of Data (ACM SIGMOD), pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"2_CR13","doi-asserted-by":"publisher","first-page":"2008","DOI":"10.1007\/s11432-012-4638-z","volume":"55","author":"Z Deng","year":"2012","unstructured":"Deng, Z., Wang, Z., Jiang, J.: A new algorithm for fast mining frequent itemsets using N-lists. Sci. China Inf. Sci. 55, 2008\u20132030 (2012)","journal-title":"Sci. China Inf. Sci."},{"key":"2_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s40747-018-0085-9","volume":"5","author":"A Borah","year":"2019","unstructured":"Borah, A., Nath, B.: Rare pattern mining: challenges and future perspectives. Complex Intell. Syst. 5, 1\u201323 (2019)","journal-title":"Complex Intell. Syst."},{"key":"2_CR15","doi-asserted-by":"publisher","first-page":"721","DOI":"10.1109\/TKDE.2012.28","volume":"25","author":"Y Ji","year":"2012","unstructured":"Ji, Y., Ying, H., Tran, J., Dews, P., Mansour, A., Massanari, R.M.: A method for mining infrequent causal associations and its application in finding adverse drug reaction signal Pairs. IEEE Trans. Knowl. Data Eng. 25, 721\u2013733 (2012)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"2_CR16","doi-asserted-by":"crossref","unstructured":"Xu, T., Dong, X.: Mining frequent patterns with multiple minimum supports using basic Apriori. In: Natural Computation (ICNC), IEEE, pp. 957\u2013961 (2013)","DOI":"10.1109\/ICNC.2013.6818114"},{"key":"2_CR17","unstructured":"Kiran, R.U., Re, P.K.: An improved multiple minimum support based approach to mine rare association rules. In: Computational Intelligence and Data Mining (CIDM), IEEE, pp. 340\u2013347 (2009)"},{"key":"2_CR18","doi-asserted-by":"publisher","first-page":"44","DOI":"10.1016\/j.ijar.2004.11.006","volume":"40","author":"YC Lee","year":"2005","unstructured":"Lee, Y.C., Hong, T.P., Lin, W.Y.: Mining association rules with multiple minimum supports using maximum constraints. Int. J. Approximate Reason. 40, 44\u201354 (2005)","journal-title":"Int. J. Approximate Reason."},{"key":"2_CR19","unstructured":"Darrab, S, David, B., Gunter, S.: Modern application and challenges for rare itemset mining. In: 8th International Conference on Knowledge Discovery (2019)"},{"key":"2_CR20","unstructured":"Fournier-Viger, P., Gomariz, A., Gueniche, T., Soltani A., Wu. C., Tseng V.S.: SPMF: a java open-source pattern mining library. J. Mach. Learn. Res. (JMLR), 15, 3389\u20133393 (2014)"},{"key":"2_CR21","unstructured":"Darrab, S., Ergen\u00e7, B.: Frequent pattern mining under multiple support thresholds. In: The International Conference on Applied Computer Science (ACS), Wseas Transactions on Computer Research, pp. 1\u201310 (2016)"},{"key":"2_CR22","doi-asserted-by":"crossref","unstructured":"Darrab, S., Ergen\u00e7, B.: Vertical pattern mining algorithm for multiple support thresholds. In: International Conference on Knowledge Based and Intelligent Information and Engineering (KES), Procedia Computer Science, vol. 112, pp. 417\u2013426 (2017)","DOI":"10.1016\/j.procs.2017.08.051"},{"key":"2_CR23","doi-asserted-by":"crossref","unstructured":"Hu, Y.H., Chen, Y.L.: Mining association rules with multiple minimum supports: a new mining algorithm and a support tuning mechanism, Decision Support Systems, pp. 1\u201324 (2006)","DOI":"10.1016\/j.dss.2004.09.007"},{"key":"2_CR24","doi-asserted-by":"crossref","unstructured":"Kiran, R.U., Reddy, P.K.: Novel techniques to reduce search space in multiple minimum supports-based frequent pattern mining algorithms. In: Proceedings of the International Conference on Extending Database Technology(EDBT), pp. 11\u201320 (2011)","DOI":"10.1145\/1951365.1951370"}],"container-title":["Communications in Computer and Information Science","Data Mining and Big Data"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-981-15-7205-0_2","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,7,11]],"date-time":"2020-07-11T05:06:05Z","timestamp":1594443965000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-981-15-7205-0_2"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9789811572043","9789811572050"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-981-15-7205-0_2","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"value":"1865-0929","type":"print"},{"value":"1865-0937","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 July 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DMBD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Data Mining and Big Data","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Belgrade","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Serbia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 July 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 July 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"5","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dmbd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/dmbd2020.ic-si.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"39","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":"7","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":"18% - 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":"3.1","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":"2","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)"}},{"value":"Due to the COVID-19 pandemic the conference was held in a fully virtual format.","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}