{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T06:14:13Z","timestamp":1743056053106,"version":"3.40.3"},"publisher-location":"Cham","reference-count":19,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030573201"},{"type":"electronic","value":"9783030573218"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"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":[[2020]]},"DOI":"10.1007\/978-3-030-57321-8_13","type":"book-chapter","created":{"date-parts":[[2020,8,19]],"date-time":"2020-08-19T21:03:33Z","timestamp":1597871013000},"page":"227-247","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["An Efficient Method for Mining Informative Association Rules in Knowledge Extraction"],"prefix":"10.1007","author":[{"given":"Parfait","family":"Bemarisika","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Andr\u00e9","family":"Totohasina","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2020,8,18]]},"reference":[{"key":"13_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proceedings of 20th VLDB Conference, Santiago Chile, pp. 487\u2013499 (1994)"},{"key":"13_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"972","DOI":"10.1007\/3-540-44957-4_65","volume-title":"Computational Logic \u2014 CL 2000","author":"Y Bastide","year":"2000","unstructured":"Bastide, Y., Pasquier, N., Taouil, R., Stumme, G., Lakhal, L.: Mining minimal non-redundant association rules using frequent closed itemsets. In: Lloyd, J., et al. (eds.) CL 2000. LNCS (LNAI), vol. 1861, pp. 972\u2013986. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44957-4_65"},{"key":"13_CR3","unstructured":"Bemarisika, P.: Extraction de r\u00e8gles d\u2019association selon le couple support-$$M_{GK}$$: Graphes implicatifs et Applications en didactique des math\u00e9matiques. Ph.D. thesis, Universit\u00e9 d\u2019Antananarivo (Madagasar) (2016)"},{"key":"13_CR4","doi-asserted-by":"crossref","unstructured":"Bemarisika, P., Ramanantsoa, H., Totohasina, A.: An efficient approach for extraction positive and negative association rules from big data. In: Proceedings of International Cross Domain Conference for Machine Learning & Knowledge Extraction (CD-MAKE 2018), pp. 79\u201397 (2018)","DOI":"10.1007\/978-3-319-99740-7_6"},{"key":"13_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"357","DOI":"10.1007\/978-3-319-10160-6_32","volume-title":"Data Warehousing and Knowledge Discovery","author":"N Durand","year":"2014","unstructured":"Durand, N., Quafafou, M.: Approximation of frequent itemset border by computing approximate minimal hypergraph transversals. In: Bellatreche, L., Mohania, M.K. (eds.) DaWaK 2014. LNCS, vol. 8646, pp. 357\u2013368. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-10160-6_32"},{"key":"13_CR6","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"186","DOI":"10.1007\/978-3-540-78921-5_12","volume-title":"Concept Lattices and Their Applications","author":"J Diatta","year":"2008","unstructured":"Diatta, J., Feno, D.R., Totohasina, A.: Galois lattices and bases for M$$_{GK}$$-valid association rules. In: Yahia, S.B., Nguifo, E.M., Belohlavek, R. (eds.) CLA 2006. LNCS (LNAI), vol. 4923, pp. 186\u2013197. Springer, Heidelberg (2008). https:\/\/doi.org\/10.1007\/978-3-540-78921-5_12"},{"key":"13_CR7","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-59830-2","volume-title":"Formal Concept Analysis","author":"B Ganter","year":"1999","unstructured":"Ganter, B., Wille, R.: Formal Concept Analysis. Springer, Heidelberg (1999). https:\/\/doi.org\/10.1007\/978-3-642-59830-2"},{"key":"13_CR8","unstructured":"Giacomo, K., Alexandre B.: Average size of implicational bases. In: Ignatov, D.I., Nourine, L. (eds.) CLA 2018, pp. 37\u201345 (2018)"},{"key":"13_CR9","first-page":"5","volume":"95","author":"JL Guigues","year":"1986","unstructured":"Guigues, J.L., Duquenne, V.: Familles minimales d\u2019implications informatives r\u00e9sultant d\u2019un tableau de donn\u00e9s binaires. Maths et Sci. Humaines 95, 5\u201318 (1986)","journal-title":"Maths et Sci. Humaines"},{"key":"13_CR10","unstructured":"Guillaume, S.: Traitement des donn\u00e9es volumineuses. Mesures et algorithmes d\u2019extraction des r\u00e8gles d\u2019association et r\u00e8gles ordinales. Ph.D. thesis, Universt\u00e9 de Nantes (France) (2000)"},{"key":"13_CR11","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"92","DOI":"10.1007\/3-540-45728-3_8","volume-title":"Pattern Detection and Discovery","author":"M Kryszkiewicz","year":"2002","unstructured":"Kryszkiewicz, M.: Concise representations of association rules. In: Hand, D.J., Adams, N.M., Bolton, R.J. (eds.) Pattern Detection and Discovery. LNCS (LNAI), vol. 2447, pp. 92\u2013109. Springer, Heidelberg (2002). https:\/\/doi.org\/10.1007\/3-540-45728-3_8"},{"key":"13_CR12","doi-asserted-by":"publisher","first-page":"209","DOI":"10.1007\/s10844-011-0189-9","volume":"39","author":"C Latiri","year":"2012","unstructured":"Latiri, C., Haddad, H., Hamrouni, T.: Towards an effective automatic query expansion process using an association rule mining approach. J. Intell. Inf. Syst. 39, 209\u2013247 (2012). https:\/\/doi.org\/10.1007\/s10844-011-0189-9","journal-title":"J. Intell. Inf. Syst."},{"key":"13_CR13","unstructured":"Lerman, I.C.: Classification et analyse ordinale des donn\u00e9es. Dunod (1981)"},{"key":"13_CR14","doi-asserted-by":"publisher","first-page":"241","DOI":"10.1023\/A:1009796218281","volume":"1","author":"H Mannila","year":"1997","unstructured":"Mannila, H., Toivonen, H.: Levelwise search and borders of theories in knowledge discovery. Data Min. Knowl. Disc. 1, 241\u2013258 (1997)","journal-title":"Data Min. Knowl. Disc."},{"key":"13_CR15","unstructured":"Pasquier, N.: Extraction de Bases pour les R\u00e8gles d\u2019Association \u00e0 partir des Itemsets Ferm\u00e9s Fr\u00e9quents. CNRS (2000)"},{"key":"13_CR16","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":"13_CR17","unstructured":"Totohasina, A., Feno, D.R.: De la qualit\u00e9 de r\u00e8gles d\u2019association: Etude comparative des mesures $$M_{GK}$$ et Confiance. In: CARI (2008)"},{"key":"13_CR18","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."},{"key":"13_CR19","doi-asserted-by":"publisher","first-page":"223","DOI":"10.1023\/B:DAMI.0000040429.96086.c7","volume":"9","author":"MJ Zaki","year":"2004","unstructured":"Zaki, M.J.: Mining non-redundant association rules. Data Min. Knowl. Disc. 9, 223\u2013248 (2004). Proc. of KDDM","journal-title":"Data Min. Knowl. Disc."}],"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-030-57321-8_13","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,8,19]],"date-time":"2024-08-19T06:57:09Z","timestamp":1724050629000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-57321-8_13"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030573201","9783030573218"],"references-count":19,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-57321-8_13","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"18 August 2020","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":"Dublin","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Ireland","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":"25 August 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"28 August 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"4","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"cd-make2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/cd-make.net\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}