{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,20]],"date-time":"2026-07-20T13:54:23Z","timestamp":1784555663582,"version":"3.55.0"},"publisher-location":"Cham","reference-count":12,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030590642","type":"print"},{"value":"9783030590659","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-59065-9_16","type":"book-chapter","created":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:22:15Z","timestamp":1599722535000},"page":"197-207","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":11,"title":["Mining Frequent Seasonal Gradual Patterns"],"prefix":"10.1007","author":[{"given":"Jerry","family":"Lonlac","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Arnaud","family":"Doniec","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Marin","family":"Lujak","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Stephane","family":"Lecoeuche","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,9,11]]},"reference":[{"issue":"3","key":"16_CR1","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/s10878-006-9029-1","volume":"13","author":"H Arimura","year":"2007","unstructured":"Arimura, H., Uno, T.: An efficient polynomial space and polynomial delay algorithm for enumeration of maximal motifs in a sequence. J. Comb. Optim. 13(3), 243\u2013262 (2007)","journal-title":"J. Comb. Optim."},{"key":"16_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"297","DOI":"10.1007\/978-3-642-03915-7_26","volume-title":"Advances in Intelligent Data Analysis VIII","author":"L Di-Jorio","year":"2009","unstructured":"Di-Jorio, L., Laurent, A., Teisseire, M.: Mining frequent gradual itemsets from large databases. In: Adams, N.M., Robardet, C., Siebes, A., Boulicaut, J.-F. (eds.) IDA 2009. LNCS, vol. 5772, pp. 297\u2013308. Springer, Heidelberg (2009). \nhttps:\/\/doi.org\/10.1007\/978-3-642-03915-7_26"},{"issue":"3","key":"16_CR3","doi-asserted-by":"publisher","first-page":"497","DOI":"10.1007\/s10115-014-0749-8","volume":"43","author":"TDT Do","year":"2014","unstructured":"Do, T.D.T., Termier, A., Laurent, A., Negrevergne, B., Omidvar-Tehrani, B., Amer-Yahia, S.: PGLCM: efficient parallel mining of closed frequent gradual itemsets. Knowl. Inf. Syst. 43(3), 497\u2013527 (2014). \nhttps:\/\/doi.org\/10.1007\/s10115-014-0749-8","journal-title":"Knowl. Inf. Syst."},{"key":"16_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"293","DOI":"10.1007\/978-3-540-74553-2_27","volume-title":"Data Warehousing and Knowledge Discovery","author":"G Gasmi","year":"2007","unstructured":"Gasmi, G., Yahia, S.B., Nguifo, E.M., Bouker, S.: Extraction of association rules based on literalsets. In: Song, I.Y., Eder, J., Nguyen, T.M. (eds.) DaWaK 2007. LNCS, vol. 4654, pp. 293\u2013302. Springer, Heidelberg (2007). \nhttps:\/\/doi.org\/10.1007\/978-3-540-74553-2_27"},{"key":"16_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"200","DOI":"10.1007\/3-540-45681-3_17","volume-title":"Principles of Data Mining and Knowledge Discovery","author":"E H\u00fcllermeier","year":"2002","unstructured":"H\u00fcllermeier, E.: Association rules for expressing gradual dependencies. In: Elomaa, T., Mannila, H., Toivonen, H. (eds.) PKDD 2002. LNCS, vol. 2431, pp. 200\u2013211. Springer, Heidelberg (2002). \nhttps:\/\/doi.org\/10.1007\/3-540-45681-3_17"},{"key":"16_CR6","doi-asserted-by":"crossref","unstructured":"Jabbour, S., Lonlac, J., Sa\u00efs, L.: Mining gradual itemsets using sequential pattern mining. In: FUZZ-IEEE, pp. 138\u2013143 (2019)","DOI":"10.1109\/FUZZ-IEEE.2019.8858864"},{"key":"16_CR7","doi-asserted-by":"crossref","unstructured":"Kaytoue, M., Kuznetsov, S.O., Napoli, A.: Revisiting numerical pattern mining with formal concept analysis. In: IJCAI, pp. 1342\u20131347 (2011)","DOI":"10.1007\/978-3-642-20514-9_12"},{"key":"16_CR8","doi-asserted-by":"crossref","unstructured":"Lonlac, J., Miras, Y., Beauger, A., Mazenod, V., Peiry, J.L., Mephu, E.: An approach for extracting frequent (closed) gradual patterns under temporal constraint. In: FUZZ-IEEE, pp. 878\u2013885 (2018)","DOI":"10.1109\/FUZZ-IEEE.2018.8491665"},{"key":"16_CR9","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"596","DOI":"10.1007\/978-3-319-73117-9_42","volume-title":"SOFSEM 2018: Theory and Practice of Computer Science","author":"T Ngo","year":"2018","unstructured":"Ngo, T., Georgescu, V., Laurent, A., Libourel, T., Mercier, G.: Mining spatial gradual patterns: application to measurement of potentially avoidable hospitalizations. In: Tjoa, A.M., Bellatreche, L., Biffl, S., van Leeuwen, J., Wiedermann, J. (eds.) SOFSEM 2018. LNCS, vol. 10706, pp. 596\u2013608. Springer, Cham (2018). \nhttps:\/\/doi.org\/10.1007\/978-3-319-73117-9_42"},{"key":"16_CR10","doi-asserted-by":"crossref","unstructured":"Phan, N., Ienco, D., Malerba, D., Poncelet, P., Teisseire, M.: Mining multi-relational gradual patterns. In: SDM, pp. 846\u2013854 (2015)","DOI":"10.1137\/1.9781611974010.95"},{"issue":"1","key":"16_CR11","doi-asserted-by":"publisher","first-page":"40","DOI":"10.1109\/TCBB.2005.5","volume":"2","author":"N Pisanti","year":"2005","unstructured":"Pisanti, N., Crochemore, M., Grossi, R., Sagot, M.: Bases of motifs for generating repeated patterns with wild cards. IEEE\/ACM Trans. Comput. Biol. Bioinform. 2(1), 40\u201350 (2005)","journal-title":"IEEE\/ACM Trans. Comput. Biol. Bioinform."},{"key":"16_CR12","unstructured":"Salleb-Aouissi, A., Vrain, C., Nortet, C.: Quantminer: a genetic algorithm for mining quantitative association rules. In: IJCAI, pp. 1035\u20131040 (2007)"}],"container-title":["Lecture Notes in Computer Science","Big Data Analytics and Knowledge Discovery"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-59065-9_16","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,9,10]],"date-time":"2020-09-10T07:25:56Z","timestamp":1599722756000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-59065-9_16"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030590642","9783030590659"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-59065-9_16","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"11 September 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DaWaK","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Big Data Analytics and Knowledge Discovery","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bratislava","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Slovakia","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":"14 September 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"17 September 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"22","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dawak2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/dawak2020","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"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":"77","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":"15","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":"14","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":"19% - 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-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":"2-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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}