{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T07:26:09Z","timestamp":1787037969064,"version":"build-2736575974"},"reference-count":29,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T00:00:00Z","timestamp":1779062400000},"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":["New Gener. Comput."],"published-print":{"date-parts":[[2026,8]]},"DOI":"10.1007\/s00354-026-00324-w","type":"journal-article","created":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T13:45:25Z","timestamp":1779111925000},"update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Designing a Gradual Support Inference Graph to Improve the Performance of Frequent Gradual Pattern Extraction Algorithms"],"prefix":"10.1007","volume":"44","author":[{"given":"Edith Belise","family":"Kenmogne","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cl\u00e9mentin Tayou","family":"Djamegni","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Idriss","family":"Tetakouchom","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Laurent Cabrel Tabueu","family":"Fotso","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2026,5,18]]},"reference":[{"key":"324_CR1","unstructured":"Owuor, D.O., Laurent, A., Orero, J.O., Lobry, O.: Gradual pattern mining tool on cloud. Revue des Nouvelles Technologies de l\u2019Information RNTI-E-37, pp. 429\u2013436 (2021)"},{"key":"324_CR2","unstructured":"Di Jorio, L.: Recherche de motifs graduels et application aux donn\u00e9es m\u00e9dicales. PhD thesis, Montpellier 2 (2010)"},{"key":"324_CR3","unstructured":"Kenmogne, E.B., Roger, N., Calvin, T., Nguifo, E.M.: A parallel pattern-growth algorithm. In: CARI\u20192018, South Africa, pp. 245\u2013256. CARI (2018)"},{"key":"324_CR4","unstructured":"Laurent, A., Lesot, M.-J., Rifqi, M.: Extraction de motifs graduels par corr\u00e9lations d\u2019ordres induits. Rencontres sur la Logique Floue et ses Applications. LFA\u20192010 (2010)"},{"key":"324_CR5","unstructured":"Kenmogne, E.B.: Contribution to the sequential and parallel discovery of sequential patterns with an application to the design of e-learning recommenders. PhD thesis, University of Dschang (2018)"},{"key":"324_CR6","doi-asserted-by":"crossref","unstructured":"Lonlac, J., Doniec, A., Lujak, M., Lecoeuche, S.: Mining frequent seasonal gradual patterns. In: International Conference on Big Data Analytics and Knowledge Discovery, pp. 197\u2013207. Springer (2020)","DOI":"10.1007\/978-3-030-59065-9_16"},{"issue":"5","key":"324_CR7","doi-asserted-by":"publisher","first-page":"1029","DOI":"10.3233\/IDA-194644","volume":"24","author":"J Lonlac","year":"2020","unstructured":"Lonlac, J., Nguifo, E.M.: A novel algorithm for searching frequent gradual patterns from an ordered data set. Intell. Data Anal. 24(5), 1029\u20131042 (2020). https:\/\/doi.org\/10.3233\/IDA-194644","journal-title":"Intell. Data Anal."},{"key":"324_CR8","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2023.120356","volume":"228","author":"Y Qi","year":"2023","unstructured":"Qi, Y., Zhang, X., Chen, G., Gan, W.: Mining periodic trends via closed high utility patterns. Expert Syst. Appl. 228, 120356 (2023). https:\/\/doi.org\/10.1016\/j.eswa.2023.120356","journal-title":"Expert Syst. Appl."},{"key":"324_CR9","doi-asserted-by":"publisher","DOI":"10.1016\/j.eswa.2022.119156","volume":"214","author":"R Davashi","year":"2023","unstructured":"Davashi, R.: ITUFP: a fast method for interactive mining of top-k frequent patterns from uncertain data. Expert Syst. Appl. 214, 119156 (2023). https:\/\/doi.org\/10.1016\/j.eswa.2022.119156","journal-title":"Expert Syst. Appl."},{"key":"324_CR10","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106221","volume":"123","author":"L B\u00e1ntay","year":"2023","unstructured":"B\u00e1ntay, L., Abonyi, J.: Frequent pattern mining-based log file partition for process mining. Eng. Appl. Artif. Intell. 123, 106221 (2023). https:\/\/doi.org\/10.1016\/j.engappai.2023.106221","journal-title":"Eng. Appl. Artif. Intell."},{"key":"324_CR11","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.106182","volume":"123","author":"F Lai","year":"2023","unstructured":"Lai, F., Zhang, X., Chen, G., Gan, W.: Mining periodic high-utility itemsets with both positive and negative utilities. Eng. Appl. Artif. Intell. 123, 106182 (2023). https:\/\/doi.org\/10.1016\/j.engappai.2023.106182","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"1","key":"324_CR12","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1007\/S00354-019-00078-8","volume":"38","author":"I Yildirim","year":"2020","unstructured":"Yildirim, I., Celik, M.: Mining high-average utility itemsets with positive and negative external utilities. New Gener. Comput. 38(1), 153\u2013186 (2020). https:\/\/doi.org\/10.1007\/S00354-019-00078-8","journal-title":"New Gener. Comput."},{"issue":"2","key":"324_CR13","doi-asserted-by":"publisher","first-page":"115","DOI":"10.1007\/S00354-015-0202-X","volume":"33","author":"H Blockeel","year":"2015","unstructured":"Blockeel, H.: Data mining: from procedural to declarative approaches. New Gener. Comput. 33(2), 115\u2013135 (2015). https:\/\/doi.org\/10.1007\/S00354-015-0202-X","journal-title":"New Gener. Comput."},{"issue":"1","key":"324_CR14","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/S00354-008-0072-6","volume":"28","author":"C Lin","year":"2010","unstructured":"Lin, C., Hong, T., Lu, W.: Using the structure of prelarge trees to incrementally mine frequent itemsets. New Gener. Comput. 28(1), 5\u201320 (2010). https:\/\/doi.org\/10.1007\/S00354-008-0072-6","journal-title":"New Gener. Comput."},{"key":"324_CR15","unstructured":"Ayouni, S.: Etude et extraction de regles graduelles floues: d\u00e9finition d\u2019algorithmes efficaces. PhD thesis, Universit\u00e9 Montpellier (2012)"},{"key":"324_CR16","unstructured":"Kenmogne, E.B.: Algorithmes des motifs s\u00e9quentiels et temporels: etat de l\u2019art et \u00e9tude comparative. Master\u2019s thesis, Universit\u00e9 de Dschang (2011)"},{"key":"324_CR17","doi-asserted-by":"crossref","unstructured":"Di-Jorio, L., Laurent, A., Teisseire, M.: Mining frequent gradual itemsets from large databases. In: International Symposium on Intelligent Data Analysis, pp. 297\u2013308. Springer (2009)","DOI":"10.1007\/978-3-642-03915-7_26"},{"issue":"3","key":"324_CR18","doi-asserted-by":"publisher","first-page":"593","DOI":"10.1007\/s10618-013-0313-2","volume":"28","author":"B N\u00e9grevergne","year":"2014","unstructured":"N\u00e9grevergne, B., Termier, A., Rousset, M., M\u00e9haut, J.: Para miner: a generic pattern mining algorithm for multi-core architectures. Data Min. Knowl. Discov. 28(3), 593\u2013633 (2014). https:\/\/doi.org\/10.1007\/s10618-013-0313-2","journal-title":"Data Min. Knowl. Discov."},{"key":"324_CR19","doi-asserted-by":"publisher","DOI":"10.1016\/j.engappai.2023.105939","volume":"120","author":"EB Kenmogne","year":"2023","unstructured":"Kenmogne, E.B., Fotso, L.C.T., Djam\u00e9gni, C.T.: A novel algorithm for mining maximal frequent gradual patterns. Eng. Appl. Artif. Intell. 120, 105939 (2023)","journal-title":"Eng. Appl. Artif. Intell."},{"issue":"5","key":"324_CR20","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1142\/S021848850700487X","volume":"15","author":"F Berzal","year":"2007","unstructured":"Berzal, F., Cubero, J.C., S\u00e1nchez, D., Miranda, M.A.V., Serrano, J.: An alternative approach to discover gradual dependencies. Int. J. Uncertain. Fuzziness Knowl. Based Syst. 15(5), 559\u2013570 (2007). https:\/\/doi.org\/10.1142\/S021848850700487X","journal-title":"Int. J. Uncertain. Fuzziness Knowl. Based Syst."},{"key":"324_CR21","unstructured":"Oudni, A.: Fouille de donn\u00e9es par extraction de motifs graduels: contextualisation et enrichissement. PhD thesis, Universit\u00e9 Pierre et Marie Curie-Paris VI (2014)"},{"key":"324_CR22","doi-asserted-by":"publisher","DOI":"10.1016\/j.mlwa.2021.100068","volume":"5","author":"CT Djamegni","year":"2021","unstructured":"Djamegni, C.T., Fotso, L.C.T., Kenmogne, E.B.: A novel algorithm for extracting frequent gradual patterns. Mach. Learn. Appl. 5, 100068 (2021). https:\/\/doi.org\/10.1016\/j.mlwa.2021.100068","journal-title":"Mach. Learn. Appl."},{"key":"324_CR23","unstructured":"Owuor, D.O.: Capturing the temporal constraints of gradual patterns. PhD thesis, Universit\u00e9 Montpellier (2020)"},{"key":"324_CR24","doi-asserted-by":"crossref","unstructured":"Ngo, H.T., Georgescu, V., Laurent, A., Rouge, T.L., Mercier, G.: Mining spatial gradual patterns: Application to measurement of potentially avoidable hospitalizations. In: SOFSEM, pp. 596\u2013608. Edizioni della Normale, Cham (2018)","DOI":"10.1007\/978-3-319-73117-9_42"},{"key":"324_CR25","doi-asserted-by":"publisher","unstructured":"Owuor, D., Laurent, A., Orero, J.: Mining fuzzy-temporal gradual patterns. In: 2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), pp. 1\u20136 (2019). https:\/\/doi.org\/10.1109\/FUZZ-IEEE.2019.8858883. ISSN: 1558-4739","DOI":"10.1109\/FUZZ-IEEE.2019.8858883"},{"key":"324_CR26","doi-asserted-by":"crossref","unstructured":"Laurent, A., Negrevergne, B., Sicard, N., Termier, A.: PGP-MC: towards a multicore parallel approach for mining gradual patterns. In: International Conference on Database Systems for Advanced Applications, pp. 78\u201384. Springer (2010)","DOI":"10.1007\/978-3-642-12026-8_8"},{"key":"324_CR27","doi-asserted-by":"publisher","first-page":"523","DOI":"10.1016\/j.future.2019.10.004","volume":"111","author":"F Shah","year":"2020","unstructured":"Shah, F., Castelltort, A., Laurent, A.: Handling missing values for mining gradual patterns from NoSQL graph databases. Futur. Gener. Comput. Syst. 111, 523\u2013538 (2020). https:\/\/doi.org\/10.1016\/j.future.2019.10.004","journal-title":"Futur. Gener. Comput. Syst."},{"key":"324_CR28","doi-asserted-by":"crossref","unstructured":"Marsala, C., Laurent, A., Lesot, M.-J., Rifqi, M., Castelltort, A.: Discovering ordinal attributes through gradual patterns, morphological filters and rank discrimination measures. In: International Conference on Scalable Uncertainty Management, pp. 152\u2013163. Springer (2018)","DOI":"10.1007\/978-3-030-00461-3_11"},{"key":"324_CR29","doi-asserted-by":"crossref","unstructured":"Aryadinata, Y.S., Lin, Y., Barcellos, C., Laurent, A., Libourel, T.: Mining epidemiological dengue fever data from brazil: a gradual pattern based geographical information system. In: International Conference on Information Processing and Management of Uncertainty in Knowledge-Based Systems, pp. 414\u2013423. Springer (2014)","DOI":"10.1007\/978-3-319-08855-6_42"}],"container-title":["New Generation Computing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-026-00324-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00354-026-00324-w","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00354-026-00324-w.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,8,18]],"date-time":"2026-08-18T06:49:24Z","timestamp":1787035764000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00354-026-00324-w"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2026,5,18]]},"references-count":29,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2026,8]]}},"alternative-id":["324"],"URL":"https:\/\/doi.org\/10.1007\/s00354-026-00324-w","relation":{},"ISSN":["0288-3635","1882-7055"],"issn-type":[{"value":"0288-3635","type":"print"},{"value":"1882-7055","type":"electronic"}],"subject":[],"published":{"date-parts":[[2026,5,18]]},"assertion":[{"value":"14 May 2024","order":1,"name":"received","label":"Received","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"7 May 2026","order":2,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"18 May 2026","order":3,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"All authors declare there are no other relationships or activities that could appear to have influenced the submitted work. To the best of our knowledge, the named authors have no conflict of interest, financial or otherwise.","order":1,"name":"Ethics","label":"Conflict of interest","group":{"name":"EthicsHeading","label":"Declarations"}},{"value":"The data used in this study does not require informed consent or ethical approval as the data is open accessed and generated by others.","order":2,"name":"Ethics","label":"Ethical standard","group":{"name":"EthicsHeading","label":"Declarations"}}],"article-number":"19"}}