{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T14:10:10Z","timestamp":1751811010385,"version":"3.41.0"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319997391"},{"type":"electronic","value":"9783319997407"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-319-99740-7_6","type":"book-chapter","created":{"date-parts":[[2018,8,23]],"date-time":"2018-08-23T09:44:08Z","timestamp":1535017448000},"page":"79-97","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":3,"title":["An Efficient Approach for Extraction Positive and Negative Association Rules from Big Data"],"prefix":"10.1007","author":[{"given":"Bemarisika","family":"Parfait","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ramanantsoa","family":"Harrimann","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Totohasina","family":"Andr\u00e9","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2018,8,24]]},"reference":[{"key":"6_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining association rules between sets of items in large databases. In: Proceedings of ACM SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"6_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th VLDB Conference, Santiago Chile, pp. 487\u2013499 (1994)"},{"key":"6_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"27","DOI":"10.1007\/978-3-540-30116-5_6","volume-title":"Knowledge Discovery in Databases: PKDD 2004","author":"M-L Antonie","year":"2004","unstructured":"Antonie, M.-L., Za\u00efane, O.R.: Mining positive and negative association rules: an approach for confined rules. In: Boulicaut, J.-F., Esposito, F., Giannotti, F., Pedreschi, D. (eds.) PKDD 2004. LNCS (LNAI), vol. 3202, pp. 27\u201338. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-30116-5_6"},{"key":"6_CR4","first-page":"65","volume":"21","author":"Y Bastide","year":"2002","unstructured":"Bastide, Y., Taouil, R., Pasquier, N., Stumme, G., Lakhal, L.: PASCAL: un algorithme d\u2019extraction des motifs fr\u00e9quents. Tech. Sces. Info. 21, 65\u201395 (2002)","journal-title":"Tech. Sces. Info."},{"key":"6_CR5","unstructured":"Bemarisika, P., Totohasina, A.: Eomf, un algorithme d\u2019extraction optimis\u00e9e des motifs fr\u00e9quents. In: Proceedings of AAFD & SFC, Marrakech Maroc, pp. 198\u2013203 (2016)"},{"key":"6_CR6","unstructured":"Bemarisika, P.: Extraction de r\u00e8gles d\u2019association selon le couple support-$$M_{GK}$$: Graphes implicatifs et Application en didactique des math\u00e9matiques. Universit\u00e9 d\u2019Antananarivo, Madagascar (2016)"},{"key":"6_CR7","unstructured":"Bemarisika, P., Totohasina, A.: Optimisation de l\u2019extraction des r\u00e8gles d\u2019association positives et n\u00e9gatives. In: Actes des 24\u00e8mes Rencontres de la Soci\u00e9t\u00e9 Francophone de Classification, Lyon 1, France, pp. 25\u201328 (2017)"},{"key":"6_CR8","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"424","DOI":"10.1007\/978-3-319-64283-3_31","volume-title":"Big Data Analytics and Knowledge Discovery","author":"P Bemarisika","year":"2017","unstructured":"Bemarisika, P., Totohasina, A.: Optimized mining of potential positive and negative association rules. In: Bellatreche, L., Chakravarthy, S. (eds.) DaWaK 2017. LNCS, vol. 10440, pp. 424\u2013432. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-64283-3_31"},{"key":"6_CR9","series-title":"Advances in Soft Computing","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-7908-1834-5_39","volume-title":"Flexible Query Answering Systems","author":"J-F Boulicaut","year":"2001","unstructured":"Boulicaut, J.-F., Bykowski, A., Jeud, B.: Towards the tractable discovery of association rules with negations. In: Larsen, H.L., Andreasen, T., Christiansen, H., Kacprzyk, J., Zadro\u017cny, S. (eds.) FQAS 2000. Advances in Soft Computing, vol. 7. Springer, Heidelberg (2001). https:\/\/doi.org\/10.1007\/978-3-7908-1834-5_39"},{"key":"6_CR10","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Bayond market baskets: generalizing association rules to correlation. In: Proceedings of the ACM SIGMOD, pp. 265\u2013276 (1997)","DOI":"10.1145\/253262.253327"},{"key":"6_CR11","doi-asserted-by":"crossref","unstructured":"Cornelis, C., Yan, P., Zhang, X., Chen, G.: Mining positive and negative association rules from large databases. Proc. IEEE, 613\u2013618 (2006)","DOI":"10.1109\/ICCIS.2006.252251"},{"key":"6_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis: Mathematical Foundations","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis: Mathematical Foundations. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"6_CR13","unstructured":"Guillaume, S.: Traitement de donn\u00e9es volumineuses: Mesure et algorithmes d\u2019extraction de r\u00e8gles d\u2019association. Ph.D. thesis, Universit\u00e9 de Nantes (2000)"},{"key":"6_CR14","unstructured":"Guillaume, S., Papon, P.-A.: Extraction optimis\u00e9e de r\u00e8gles d\u2019association positives et n\u00e9gatives (RAPN). In: Actes de la 13e Conference International Franco. EGC, pp. 157\u2013168 (2013)"},{"key":"6_CR15","doi-asserted-by":"crossref","unstructured":"Savasere, A., Omiecinski, E., Navathe, S.: Mining for strong negative associations in a large database of customer transactions. In: Proceedings of ICDE, pp. 494\u2013502 (1998)","DOI":"10.1109\/ICDE.1998.655812"},{"key":"6_CR16","doi-asserted-by":"publisher","first-page":"158","DOI":"10.1007\/s10115-003-0142-5","volume":"7","author":"W-G Teng","year":"2005","unstructured":"Teng, W.-G., Hsieh, M.-J., Chen, M.-S.: A statistical framework for mining substitution rules. Knowl. Inf. Syst. 7, 158\u2013178 (2005)","journal-title":"Knowl. Inf. Syst."},{"key":"6_CR17","unstructured":"Totohasina, A., Ralambondrainy H.: ION, a pertinent new measure for mining information from many types of data. In: IEEE, SITIS, pp. 202\u2013207 (2005)"},{"key":"6_CR18","doi-asserted-by":"publisher","first-page":"383","DOI":"10.1007\/s10115-011-0432-2","volume":"32","author":"W H\u00e4m\u00e4l\u00e4inen","year":"2012","unstructured":"H\u00e4m\u00e4l\u00e4inen, W.: Kingfisher: an efficient algorithm for searching for both positive and negative dependence rules with statistical significance measures. Knowl. Inf. Syst. 32, 383\u2013414 (2012)","journal-title":"Knowl. Inf. Syst."},{"key":"6_CR19","doi-asserted-by":"publisher","first-page":"381","DOI":"10.1145\/1010614.1010616","volume":"3","author":"X Wu","year":"2004","unstructured":"Wu, X., Zhang, C., Zhang, S.: Efficient mining of both positive and negative association rules. ACM Trans. Inf. Syst. 3, 381\u2013405 (2004)","journal-title":"ACM Trans. Inf. Syst."}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Extraction"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-99740-7_6","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,6]],"date-time":"2025-07-06T13:58:32Z","timestamp":1751810312000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-99740-7_6"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783319997391","9783319997407"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-99740-7_6","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"24 August 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"CD-MAKE","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Cross-Domain Conference for Machine Learning and Knowledge Extraction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Hamburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27 August 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30 August 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cd-make2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cd-make.net\/about\/","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":"45","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":"25","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":"0","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":"56% - 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","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}