{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,1,21]],"date-time":"2026-01-21T15:04:18Z","timestamp":1769007858432,"version":"3.49.0"},"publisher-location":"Cham","reference-count":21,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030954079","type":"print"},{"value":"9783030954086","type":"electronic"}],"license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":[[2022]]},"DOI":"10.1007\/978-3-030-95408-6_3","type":"book-chapter","created":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:04:07Z","timestamp":1643587447000},"page":"29-41","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["OPECUR: An Enhanced Clustering-Based Model for Discovering Unexpected Rules"],"prefix":"10.1007","author":[{"given":"Sadeq","family":"Darrab","sequence":"first","affiliation":[]},{"given":"Priyamvada","family":"Bhardwaj","sequence":"additional","affiliation":[]},{"given":"David","family":"Broneske","sequence":"additional","affiliation":[]},{"given":"Gunter","family":"Saake","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2022,1,31]]},"reference":[{"key":"3_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: VLDB, pp. 487\u2013499. Morgan Kaufmann Publishers Inc. (1994)"},{"issue":"10","key":"3_CR2","doi-asserted-by":"publisher","first-page":"5041","DOI":"10.1007\/s11227-018-2376-8","volume":"74","author":"M Ahmed","year":"2018","unstructured":"Ahmed, M., Barkat Ullah, A.S.S.M.: Infrequent pattern mining in smart healthcare environment using data summarization. J. Supercomput. 74(10), 5041\u20135059 (2018). https:\/\/doi.org\/10.1007\/s11227-018-2376-8","journal-title":"J. Supercomput."},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"313","DOI":"10.1007\/s10462-016-9483-9","volume":"47","author":"W Altaf","year":"2016","unstructured":"Altaf, W., Shahbaz, M., Guergachi, A.: Applications of association rule mining in health informatics: a survey. Artif. Intell. Rev. 47(3), 313\u2013340 (2016). https:\/\/doi.org\/10.1007\/s10462-016-9483-9","journal-title":"Artif. Intell. Rev."},{"issue":"2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"49","DOI":"10.1145\/304181.304187","volume":"28","author":"M Ankerst","year":"1999","unstructured":"Ankerst, M., Breunig, M.M., Kriegel, H.P., Sander, J.: Optics: ordering points to identify the clustering structure. SIGMOD Rec. 28(2), 49\u201360 (1999). https:\/\/doi.org\/10.1145\/304181.304187","journal-title":"SIGMOD Rec."},{"issue":"6","key":"3_CR5","doi-asserted-by":"publisher","first-page":"1943","DOI":"10.1007\/s10489-020-01651-1","volume":"50","author":"D Bui-Thi","year":"2020","unstructured":"Bui-Thi, D., Meysman, P., Laukens, K.: Clustering association rules to build beliefs and discover unexpected patterns. Appl. Intell. 50(6), 1943\u20131954 (2020). https:\/\/doi.org\/10.1007\/s10489-020-01651-1","journal-title":"Appl. Intell."},{"key":"3_CR6","doi-asserted-by":"publisher","unstructured":"Dahbi, A., Mouhir, M., Balouki, Y., Gadi, T.: Classification of association rules based on K-means algorithm. In: CiST, pp. 300\u2013305. IEEE (2016). https:\/\/doi.org\/10.1109\/CIST.2016.7805061","DOI":"10.1109\/CIST.2016.7805061"},{"key":"3_CR7","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1007\/978-981-15-7205-0_2","volume-title":"Data Mining and Big Data","author":"S Darrab","year":"2020","unstructured":"Darrab, S., Broneske, D., Saake, G.: RPP algorithm: a method for discovering interesting rare itemsets. In: Tan, Y., Shi, Y., Tuba, M. (eds.) DMBD 2020. CCIS, vol. 1234, pp. 14\u201325. Springer, Singapore (2020). https:\/\/doi.org\/10.1007\/978-981-15-7205-0_2"},{"key":"3_CR8","doi-asserted-by":"publisher","unstructured":"Darrab, S., Broneske, D., Saake, G.: Modern applications and challenges for rare itemset mining. IJMLC 11(3), 208\u2013218 (2021). https:\/\/doi.org\/10.18178\/ijmlc.2021.11.3.1037","DOI":"10.18178\/ijmlc.2021.11.3.1037"},{"key":"3_CR9","unstructured":"Dua, D., Graff, C.: UCI machine learning repository (2017). http:\/\/archive.ics.uci.edu\/ml"},{"key":"3_CR10","first-page":"759","volume":"9","author":"GK Gupta","year":"1999","unstructured":"Gupta, G.K., Strehl, A., Ghosh, J.: Distance based clustering of association rules. Intell. Eng. Syst. Artif. Neural Networks 9, 759\u2013764 (1999)","journal-title":"Intell. Eng. Syst. Artif. Neural Networks"},{"issue":"1","key":"3_CR11","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining frequent patterns without candidate generation: a frequent-pattern tree approach. Data Min. Knowl. Discov. 8(1), 53\u201387 (2004). https:\/\/doi.org\/10.1023\/B:DAMI.0000005258.31418.83","journal-title":"Data Min. Knowl. Discov."},{"key":"3_CR12","doi-asserted-by":"crossref","unstructured":"Jeni, L.A., Cohn, J.F., De La Torre, F.: Facing imbalanced data-recommendations for the use of performance metrics. In: International Conference Affect Computing Intelligence Interact Workshops, pp. 245\u2013251 (2013)","DOI":"10.1109\/ACII.2013.47"},{"key":"3_CR13","series-title":"Communications in Computer and Information Science","doi-asserted-by":"publisher","first-page":"605","DOI":"10.1007\/978-3-030-63119-2_49","volume-title":"Advances in Computational Collective Intelligence","author":"S Joshi","year":"2020","unstructured":"Joshi, S., et al.: Pattern mining predictor system for road accidents. In: Hernes, M., Wojtkiewicz, K., Szczerbicki, E. (eds.) ICCCI 2020. CCIS, vol. 1287, pp. 605\u2013615. Springer, Cham (2020). https:\/\/doi.org\/10.1007\/978-3-030-63119-2_49"},{"key":"3_CR14","doi-asserted-by":"publisher","unstructured":"Kamepalli, S., Bandaru, S.: Weighted based frequent and infrequent pattern mining model for real-time e-commerce databases. Adv. Model. Anal. B 62(2\u20134), 53\u201360 (2019). https:\/\/doi.org\/10.18280\/ama_b.622-404","DOI":"10.18280\/ama_b.622-404"},{"key":"3_CR15","doi-asserted-by":"publisher","unstructured":"Lent, B., Swami, A., Widom, J.: Clustering association rules. In: ICDE, pp. 220\u2013231 (1997). https:\/\/doi.org\/10.1109\/icde.1997.581756","DOI":"10.1109\/icde.1997.581756"},{"key":"3_CR16","unstructured":"Padmanabhan, B.: A belief-driven method for discovering unexpected patterns. In: KDD, pp. 94\u2013100. AAAI Press (1998)"},{"key":"3_CR17","first-page":"2825","volume":"12","author":"F Pedregosa","year":"2011","unstructured":"Pedregosa, F., Varoquaux, G., Gramfort, A., Michel, V., Thirion, B., Grisel, O., et al.: Scikit-learn: machine learning in Python. JMLR 12, 2825\u20132830 (2011)","journal-title":"JMLR"},{"key":"3_CR18","doi-asserted-by":"publisher","unstructured":"Singh, A.K., Kumar, A., Maurya, A.K.: An empirical analysis and comparison of apriori and FP-growth algorithm for frequent pattern mining. ICACCCT, pp. 1599\u20131602 (2015). https:\/\/doi.org\/10.1109\/ICACCCT.2014.7019377","DOI":"10.1109\/ICACCCT.2014.7019377"},{"key":"3_CR19","unstructured":"Toivonen, H., Klemettinen, M., Ronkainen, P., H\u00e4t\u00f6nen, K., Mannila, H.: Pruning and Grouping Discovered Association Rules. In: Workshop on Statistics, Machine Learning, and Knowledge Discovery in Databases, pp. 47\u201352 (1995)"},{"key":"3_CR20","doi-asserted-by":"publisher","unstructured":"Zaki, M.J.: Generating non-redundant association rules. In: SIGKDD, pp. 34\u201343. Association for Computing Machinery (2000). https:\/\/doi.org\/10.1145\/347090.347101","DOI":"10.1145\/347090.347101"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New algorithms for fast discovery of association rules. In: KDD. AAAI Press (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Lecture Notes in Computer Science","Advanced Data Mining and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-95408-6_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,31]],"date-time":"2022-01-31T00:06:51Z","timestamp":1643587611000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-95408-6_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"ISBN":["9783030954079","9783030954086"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-95408-6_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]},"assertion":[{"value":"31 January 2022","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADMA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Advanced Data Mining and Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Sydney, NSW","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2022","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2 February 2022","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4 February 2022","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adma2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/adma2021.net\/","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":"CMT3","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"116","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":"26","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":"35","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":"22% - 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":"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","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)"}}]}}