{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:07:26Z","timestamp":1775912846708,"version":"3.50.1"},"publisher-location":"Cham","reference-count":14,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030276171","type":"print"},{"value":"9783030276188","type":"electronic"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","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":[[2019]]},"DOI":"10.1007\/978-3-030-27618-8_26","type":"book-chapter","created":{"date-parts":[[2019,8,18]],"date-time":"2019-08-18T23:02:41Z","timestamp":1566169361000},"page":"351-361","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":7,"title":["Discovering Partial Periodic High Utility Itemsets in Temporal Databases"],"prefix":"10.1007","author":[{"given":"T.","family":"Yashwanth Reddy","sequence":"first","affiliation":[]},{"given":"R. Uday","family":"Kiran","sequence":"additional","affiliation":[]},{"given":"Masashi","family":"Toyoda","sequence":"additional","affiliation":[]},{"given":"P.","family":"Krishna Reddy","sequence":"additional","affiliation":[]},{"given":"Masaru","family":"Kitsuregawa","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2019,8,6]]},"reference":[{"key":"26_CR1","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"64","DOI":"10.1007\/978-3-319-41561-1_6","volume-title":"Advances in Data Mining. Applications and Theoretical Aspects","author":"P Fournier-Viger","year":"2016","unstructured":"Fournier-Viger, P., Lin, J.C.-W., Duong, Q.-H., Dam, T.-L.: PHM: mining periodic high-utility itemsets. In: Perner, P. (ed.) ICDM 2016. LNCS (LNAI), vol. 9728, pp. 64\u201379. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-41561-1_6"},{"key":"26_CR2","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1007\/978-3-319-08326-1_9","volume-title":"Foundations of Intelligent Systems","author":"P Fournier-Viger","year":"2014","unstructured":"Fournier-Viger, P., Wu, C.-W., Zida, S., Tseng, V.S.: FHM: faster high-utility itemset mining using estimated utility co-occurrence pruning. In: Andreasen, T., Christiansen, H., Cubero, J.-C., Ra\u015b, Z.W. (eds.) ISMIS 2014. LNCS (LNAI), vol. 8502, pp. 83\u201392. Springer, Cham (2014). https:\/\/doi.org\/10.1007\/978-3-319-08326-1_9"},{"issue":"2","key":"26_CR3","first-page":"e1242","volume":"8","author":"Wensheng Gan","year":"2018","unstructured":"Gan, W., Lin, J.C., Fournier-Viger, P., Chao, H., Hong, T., Fujita, H.: A survey of incremental high-utility itemset mining. Wiley Interdiscip. Rev. Data Min. Knowl. Discov. 8(2), 1\u201323 (2018)","journal-title":"Wiley Interdisciplinary Reviews: Data Mining and Knowledge Discovery"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Gan, W., Lin, J.C.W., Fournier-Viger, P., Chao, H.C., Philip, S.Y.: HUOPM: high-utility occupancy pattern mining. IEEE Trans. Cybern. (2019)","DOI":"10.1109\/TCYB.2019.2896267"},{"key":"26_CR5","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1007\/978-3-030-16145-3_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"R Uday Kiran","year":"2019","unstructured":"Uday Kiran, R., Yashwanth Reddy, T., Fournier-Viger, P., Toyoda, M., Krishna Reddy, P., Kitsuregawa, M.: Efficiently finding high utility-frequent itemsets using cutoff and suffix utility. In: Yang, Q., Zhou, Z.-H., Gong, Z., Zhang, M.-L., Huang, S.-J. (eds.) PAKDD 2019. LNCS (LNAI), vol. 11440, pp. 191\u2013203. Springer, Cham (2019). https:\/\/doi.org\/10.1007\/978-3-030-16145-3_15"},{"key":"26_CR6","doi-asserted-by":"crossref","unstructured":"Kiran, R.U., Shang, H., Toyoda, M., Kitsuregawa, M.: Discovering partial periodic itemsets in temporal databases. In: Proceedings of the 29th SSDBM, p. 30. ACM (2017)","DOI":"10.1145\/3085504.3085535"},{"issue":"1","key":"26_CR7","first-page":"85","volume":"38","author":"GC Lan","year":"2014","unstructured":"Lan, G.C., Hong, T.P., Tseng, V.S.: An efficient projection-based indexing approach for mining high utility itemsets. KAIS 38(1), 85\u2013107 (2014)","journal-title":"KAIS"},{"key":"26_CR8","doi-asserted-by":"crossref","unstructured":"Liu, M., Qu, J.: Mining high utility itemsets without candidate generation. In: Proceedings of the 21st ACM CIKM, pp. 55\u201364. ACM (2012)","DOI":"10.1145\/2396761.2396773"},{"key":"26_CR9","doi-asserted-by":"publisher","first-page":"689","DOI":"10.1007\/11430919_79","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"Ying Liu","year":"2005","unstructured":"Liu, Y., Liao, W.k., Choudhary, A.: A two-phase algorithm for fast discovery of high utility itemsets. In: PAKDD, pp. 689\u2013695 (2005)"},{"key":"26_CR10","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"242","DOI":"10.1007\/978-3-642-01307-2_24","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"SK Tanbeer","year":"2009","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: Discovering periodic-frequent patterns in transactional databases. In: Theeramunkong, T., Kijsirikul, B., Cercone, N., Ho, T.-B. (eds.) PAKDD 2009. LNCS (LNAI), vol. 5476, pp. 242\u2013253. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-01307-2_24"},{"issue":"8","key":"26_CR11","first-page":"1772","volume":"25","author":"VS Tseng","year":"2013","unstructured":"Tseng, V.S., Shie, B.E., Wu, C.W., Yu, P.S.: Efficient algorithms for mining high utility itemsets from transactional databases. TKDE 25(8), 1772\u20131786 (2013)","journal-title":"TKDE"},{"key":"26_CR12","doi-asserted-by":"crossref","unstructured":"Yao, H., Hamilton, H.J., Butz, C.J.: A foundational approach to mining itemset utilities from databases. In: SIAM, pp. 482\u2013486 (2004)","DOI":"10.1137\/1.9781611972740.51"},{"issue":"2","key":"26_CR13","first-page":"595","volume":"51","author":"S Zida","year":"2017","unstructured":"Zida, S., Fournier-Viger, P., Lin, J.C.W., Wu, C.W., Tseng, V.S.: EFIM: a fast and memory efficient algorithm for high-utility itemset mining. KAIS 51(2), 595\u2013625 (2017)","journal-title":"KAIS"},{"key":"26_CR14","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"157","DOI":"10.1007\/978-3-319-21024-7_11","volume-title":"Machine Learning and Data Mining in Pattern Recognition","author":"S Zida","year":"2015","unstructured":"Zida, S., Fournier-Viger, P., Wu, C.-W., Lin, J.C.-W., Tseng, V.S.: Efficient mining of high-utility sequential rules. In: Perner, P. (ed.) MLDM 2015. LNCS (LNAI), vol. 9166, pp. 157\u2013171. Springer, Cham (2015). https:\/\/doi.org\/10.1007\/978-3-319-21024-7_11"}],"container-title":["Lecture Notes in Computer Science","Database and Expert Systems Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-27618-8_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,13]],"date-time":"2024-03-13T17:32:00Z","timestamp":1710351120000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-27618-8_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030276171","9783030276188"],"references-count":14,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-27618-8_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"6 August 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"DEXA","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Database and Expert Systems Applications","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Linz","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Austria","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 August 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 August 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"30","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"dexa2019a","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/www.dexa.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Mixed (Single-blind and Double-blind)","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ConfDriver","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"157","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":"32","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":"34","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":"20% - 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":"4-6","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-4","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)"}}]}}