{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T13:54:24Z","timestamp":1784555664016,"version":"3.55.0"},"reference-count":27,"publisher":"SAGE Publications","issue":"5","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IDA"],"published-print":{"date-parts":[[2020,9,30]]},"abstract":"<jats:p>Mining frequent simultaneous attribute co-variations in numerical databases is also called frequent gradual pattern problem. Few efficient algorithms for automatically extracting such patterns have been reported in the literature. Their main difference resides in the variation semantics used. However in applications with temporal order relations, those algorithms fail to generate correct frequent gradual patterns as they do not take this temporal constraint into account in the mining process. In this paper, we propose an approach for extracting frequent gradual patterns for which the ordering of supporting objects matches the temporal order. This approach considerably reduces the number of gradual patterns within an ordered data set. The experimental results show the benefits of our approach.<\/jats:p>","DOI":"10.3233\/ida-194644","type":"journal-article","created":{"date-parts":[[2020,10,2]],"date-time":"2020-10-02T13:34:33Z","timestamp":1601645673000},"page":"1029-1042","source":"Crossref","is-referenced-by-count":11,"title":["A novel algorithm for searching frequent gradual patterns from an ordered data set"],"prefix":"10.1177","volume":"24","author":[{"given":"Jerry","family":"Lonlac","sequence":"first","affiliation":[{"name":"University Clermont Auvergne, LIMOS, CNRS, UMR, France"},{"name":"Digital Science CERI, IMT Lille Douai, University of Lille, Douai, France"},{"name":"Department of Computer Engineering, ENSET, University of Douala, Cameroon"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Engelbert Mephu","family":"Nguifo","sequence":"additional","affiliation":[{"name":"University Clermont Auvergne, LIMOS, CNRS, UMR, France"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"179","reference":[{"key":"10.3233\/IDA-194644_ref1","first-page":"307","article-title":"Fast discovery of association rules","author":"Agrawal","year":"1996","journal-title":"Advances in Knowledge Discovery and Data Mining"},{"key":"10.3233\/IDA-194644_ref2","first-page":"267","article-title":"Mining closed gradual patterns","author":"Ayouni","year":"2010","journal-title":"ICAISC"},{"issue":"4","key":"10.3233\/IDA-194644_ref3","doi-asserted-by":"crossref","first-page":"633","DOI":"10.3233\/IDA-2009-0384","article-title":"A new generic basis of \u201cfactual\u201d and \u201cimplicative\u201d association rules","volume":"13","author":"Ben-Yahia","year":"2009","journal-title":"Intelligent Data Analysis"},{"issue":"1","key":"10.3233\/IDA-194644_ref4","doi-asserted-by":"crossref","first-page":"93","DOI":"10.1145\/1147234.1147248","article-title":"Frequent closed itemset based algorithms: a thorough structural and analytical survey","volume":"8","author":"Ben-Yahia","year":"2006","journal-title":"SIGKDD Explorations"},{"issue":"5","key":"10.3233\/IDA-194644_ref5","first-page":"559","article-title":"An alternative approach to discover gradual dependencies","volume":"15","author":"Berzal","year":"2007","journal-title":"IJUFKS"},{"issue":"3","key":"10.3233\/IDA-194644_ref6","doi-asserted-by":"crossref","first-page":"691","DOI":"10.1016\/j.tcs.2009.10.024","article-title":"Listing closed sets of strongly accessible set systems with application to data mining","volume":"411","author":"Boley","year":"2010","journal-title":"TCS"},{"key":"10.3233\/IDA-194644_ref7","doi-asserted-by":"crossref","first-page":"205","DOI":"10.1145\/1456223.1456268","article-title":"Fast extraction of gradual association rules: A heuristic based method","author":"Di-Jorio","year":"2008","journal-title":"CSTST"},{"key":"10.3233\/IDA-194644_ref8","first-page":"2009","article-title":"Mining frequent gradual itemsets from large databases","author":"Di-Jorio","journal-title":"Advances in Intelligent Data Analysis VIII. IDA"},{"key":"10.3233\/IDA-194644_ref9","first-page":"138","article-title":"PGLCM: efficient parallel mining of closed frequent gradual itemsets","author":"Do","year":"2010","journal-title":"ICDM"},{"issue":"3","key":"10.3233\/IDA-194644_ref10","first-page":"497","article-title":"PGLCM: efficient parallel mining of closed frequent gradual itemsets","volume":"43","author":"Do","year":"2015","journal-title":"KAIS"},{"key":"10.3233\/IDA-194644_ref11","doi-asserted-by":"crossref","unstructured":"B. Ganter and R. Wille, Formal Concept Analysis \u2013 Mathematical Foundations, Springer, 1999.","DOI":"10.1007\/978-3-642-59830-2"},{"key":"10.3233\/IDA-194644_ref12","first-page":"200","article-title":"Association rules for expressing gradual dependencies","author":"H\u00fcllermeier","year":"2002","journal-title":"PKDD"},{"key":"10.3233\/IDA-194644_ref13","first-page":"138","article-title":"Mining gradual itemsets using sequential pattern mining","author":"Jabbour","year":"2019","journal-title":"FUZZ-IEEE"},{"key":"10.3233\/IDA-194644_ref14","first-page":"382","article-title":"GRAANK: exploiting rank correlations for extracting gradual itemsets","author":"Laurent","year":"2009","journal-title":"FQAS"},{"key":"10.3233\/IDA-194644_ref15","doi-asserted-by":"crossref","unstructured":"A. Laurent, M. Lesot and M. Rifqi, Mining emerging gradual patterns, In Conference of the International Fuzzy Systems Association and the European Society for Fuzzy Logic and Technolog (IFSA-EUSFLAT), 2015.","DOI":"10.2991\/ifsa-eusflat-15.2015.234"},{"key":"10.3233\/IDA-194644_ref16","first-page":"78","article-title":"Pgp-mc: Towards a multicore parallel approach for mining gradual patterns","author":"Laurent","year":"2010","journal-title":"DASFAA"},{"key":"10.3233\/IDA-194644_ref17","first-page":"878","article-title":"An approach for extracting frequent (closed) gradual patterns under temporal constraint","author":"Lonlac","year":"2018","journal-title":"FUZZ-IEEE"},{"key":"10.3233\/IDA-194644_ref18","unstructured":"E. Mephu-Nguifo, Galois lattice: A framework for concept learning-design, evaluation and refinement, In Sixth International Conference on Tools with Artificial Intelligence, ICTAI \u201994, New Orleans, Louisiana, USA, 6\u20139 November 1994, pp. 461\u2013467."},{"key":"10.3233\/IDA-194644_ref19","doi-asserted-by":"crossref","unstructured":"E. Mephu-Nguifo and P. Njiwoua, Using lattice-based framework as a tool for feature extraction, In Machine Learning: ECML-98, 10th European Conference on Machine Learning, Chemnitz, Germany, 21\u201323 April 1998, Proceedings, 1998, pp.\u00a0304\u2013309.","DOI":"10.1007\/BFb0026700"},{"issue":"3","key":"10.3233\/IDA-194644_ref20","first-page":"593","article-title":"Paraminer: a generic pattern mining algorithm for multi-core architectures","volume":"28","author":"N\u00e9grevergne","year":"2014","journal-title":"DMKD"},{"key":"10.3233\/IDA-194644_ref21","first-page":"596","article-title":"Mining spatial gradual patterns: Application to measurement of potentially avoidable hospitalizations","author":"Ngo","year":"2018","journal-title":"SOFSEM: Theory and Practice of Computer Science"},{"issue":"3","key":"10.3233\/IDA-194644_ref22","doi-asserted-by":"crossref","first-page":"447","DOI":"10.1007\/s10844-009-0112-9","article-title":"Speed up gradual rule mining from stream data! A b-tree and owa-based approach","volume":"35","author":"Nin","year":"2010","journal-title":"J Intell Inf Syst"},{"key":"10.3233\/IDA-194644_ref23","first-page":"398","article-title":"Discovering frequent closed itemsets for association rules","author":"Pasquier","year":"1999","journal-title":"ICDT"},{"key":"10.3233\/IDA-194644_ref24","doi-asserted-by":"crossref","unstructured":"N. Phan, D. Ienco, D. Malerba, P. Poncelet and M. Teisseire, Mining multi-relational gradual patterns, In Proceedings of the 2015 SIAM International Conference on Data Mining, Vancouver, BC, Canada, 30 April\u20132 May 2015, pp. 846\u2013854.","DOI":"10.1137\/1.9781611974010.95"},{"key":"10.3233\/IDA-194644_ref25","doi-asserted-by":"crossref","unstructured":"T. Uno, M. Kiyomi and H. Arimura, LCM ver. 2: Efficient mining algorithms for frequent\/closed\/maximal itemsets, In FIMI, ICDM Workshop, 2004.","DOI":"10.1145\/1133905.1133916"},{"issue":"1","key":"10.3233\/IDA-194644_ref26","doi-asserted-by":"crossref","first-page":"183","DOI":"10.1109\/21.87068","article-title":"On ordered weighted averaging aggregation operators in multicriteria decisionmaking","volume":"18","author":"Yager","year":"1988","journal-title":"IEEE Trans. Systems, Man, and Cybernetics"},{"issue":"1","key":"10.3233\/IDA-194644_ref27","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1016\/0165-0114(93)90194-M","article-title":"Families of owa operators","volume":"59","author":"Yager","year":"1993","journal-title":"Fuzzy Sets and Systems"}],"container-title":["Intelligent Data Analysis"],"original-title":[],"link":[{"URL":"https:\/\/content.iospress.com\/download?id=10.3233\/IDA-194644","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,4,29]],"date-time":"2026-04-29T09:18:47Z","timestamp":1777454327000},"score":1,"resource":{"primary":{"URL":"https:\/\/journals.sagepub.com\/doi\/full\/10.3233\/IDA-194644"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,9,30]]},"references-count":27,"journal-issue":{"issue":"5"},"URL":"https:\/\/doi.org\/10.3233\/ida-194644","relation":{},"ISSN":["1088-467X","1571-4128"],"issn-type":[{"value":"1088-467X","type":"print"},{"value":"1571-4128","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020,9,30]]}}}