{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,2]],"date-time":"2026-04-02T22:09:15Z","timestamp":1775167755708,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783642013065","type":"print"},{"value":"9783642013072","type":"electronic"}],"license":[{"start":{"date-parts":[[2009,1,1]],"date-time":"2009-01-01T00:00:00Z","timestamp":1230768000000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2009]]},"DOI":"10.1007\/978-3-642-01307-2_24","type":"book-chapter","created":{"date-parts":[[2009,4,18]],"date-time":"2009-04-18T09:47:58Z","timestamp":1240048078000},"page":"242-253","source":"Crossref","is-referenced-by-count":134,"title":["Discovering Periodic-Frequent Patterns in Transactional Databases"],"prefix":"10.1007","author":[{"given":"Syed Khairuzzaman","family":"Tanbeer","sequence":"first","affiliation":[]},{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules Between Sets of Items in Large Databases. In: ACM SIGMOD Int. Conf. on Management of Data, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"24_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: ACM SIGMOD Int. Conf. on Management of Data, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"4","key":"24_CR3","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1109\/TKDE.2005.60","volume":"17","author":"M.J. Zaki","year":"2005","unstructured":"Zaki, M.J., Hsiao, C.-J.: Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure. IEEE Trans. on Knowl. and Data Eng.\u00a017(4), 462\u2013478 (2005)","journal-title":"IEEE Trans. on Knowl. and Data Eng."},{"key":"24_CR4","doi-asserted-by":"crossref","unstructured":"Zhi-Jun, X., Hong, C., Li, C.: An Efficient Algorithm for Frequent Itemset Mining on Data Streams. In: Int. Conf. on Management of Data, pp. 474\u2013491 (2006)","DOI":"10.1007\/11790853_37"},{"key":"24_CR5","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"620","DOI":"10.1007\/11875581_75","volume-title":"Intelligent Data Engineering and Automated Learning \u2013 IDEAL 2006","author":"Q.T. Minh","year":"2006","unstructured":"Minh, Q.T., Oyanagi, S., Yamazaki, K.: Mining the K-Most Interesting Frequent Patterns Sequentially. In: Corchado, E., Yin, H., Botti, V., Fyfe, C. (eds.) IDEAL 2006. LNCS, vol.\u00a04224, pp. 620\u2013628. Springer, Heidelberg (2006)"},{"key":"24_CR6","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"1022","DOI":"10.1007\/978-3-540-68125-0_108","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"S.K. Tanbeer","year":"2008","unstructured":"Tanbeer, S.K., Ahmed, C.F., Jeong, B.-S., Lee, Y.-K.: CP-tree: A Tree Structure for Single-Pass Frequent Pattern Mining. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 1022\u20131027. Springer, Heidelberg (2008)"},{"key":"24_CR7","doi-asserted-by":"crossref","unstructured":"Tatavarty, G., Bhatnagar, R., Young, B.: Discovery of Temporal Dependencies between Frequent Patterns in Multivariate Time Series. In: The 2007 IEEE Symposium on Computational Intelligence and Data Mining, pp. 688\u2013696 (2007)","DOI":"10.1109\/CIDM.2007.368943"},{"issue":"8A","key":"24_CR8","first-page":"174","volume":"6","author":"F. Maqbool","year":"2006","unstructured":"Maqbool, F., Bashir, S., Baig, A.R.: E-MAP: Efficiently Mining Asynchronous Periodic Patterns. Int. J. of Comp. Sc. and Net. Security\u00a06(8A), 174\u2013179 (2006)","journal-title":"Int. J. of Comp. Sc. and Net. Security"},{"key":"24_CR9","doi-asserted-by":"publisher","first-page":"69","DOI":"10.1016\/j.ins.2007.08.006","volume":"178","author":"T. Hu","year":"2008","unstructured":"Hu, T., Sung, S.Y., Xiong, H., Fu, Q.: Discovery of Maximum Length Frequent Itemsets. Information Sciences\u00a0178, 69\u201387 (2008)","journal-title":"Information Sciences"},{"key":"24_CR10","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1007\/s10115-004-0170-9","volume":"8","author":"H. Wang","year":"2005","unstructured":"Wang, H., Perng, C.-S., Ma, S., Yu, P.S.: Demand-driven Frequent Itemset Mining Using Pattern Structures. Knowledge and Information Systems\u00a08, 82\u2013102 (2005)","journal-title":"Knowledge and Information Systems"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-01307-2_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,7]],"date-time":"2019-03-07T15:42:26Z","timestamp":1551973346000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-01307-2_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642013065","9783642013072"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-01307-2_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2009]]}}}