{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,6]],"date-time":"2025-12-06T04:54:24Z","timestamp":1764996864349},"publisher-location":"Berlin, Heidelberg","reference-count":12,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642037290"},{"type":"electronic","value":"9783642037306"}],"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-03730-6_11","type":"book-chapter","created":{"date-parts":[[2009,8,27]],"date-time":"2009-08-27T06:41:58Z","timestamp":1251355318000},"page":"125-137","source":"Crossref","is-referenced-by-count":9,"title":["TidFP: Mining Frequent Patterns in Different Databases with Transaction ID"],"prefix":"10.1007","author":[{"given":"C. I.","family":"Ezeife","sequence":"first","affiliation":[]},{"given":"Dan","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"11_CR1","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: Proceedings of the 20th International Conference on very Large Databases Santiago, Chile, pp. 487\u2013499 (1994)"},{"key":"11_CR2","doi-asserted-by":"crossref","unstructured":"Ayres, J., Flannick, J., Gehrke, J., Yiu, T.: Sequential Pattern Mining using A Bitmap Representation. In: Proceedings of the ACM SIKDD conference, Edmonton, Alberta, Canada, pp. 429\u2013435 (2002)","DOI":"10.1145\/775047.775109"},{"issue":"6","key":"11_CR3","doi-asserted-by":"publisher","first-page":"911","DOI":"10.1109\/69.553158","volume":"8","author":"D.W.-L. Cheung","year":"1996","unstructured":"Cheung, D.W.-L., Ng, V., Fu, A.W.-C., Fu, Y.: Efficient Mining of Association Rules in Distributed Databases. Transactions on Knowledge and Data Engineering\u00a08(6), 911\u2013922 (1996)","journal-title":"Transactions on Knowledge and Data Engineering"},{"key":"11_CR4","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1007\/s10618-005-0248-3","volume":"10","author":"C.I. Ezeife","year":"2005","unstructured":"Ezeife, C.I., Lu, Y.: Mining Web Log sequential Patterns with Position Coded Pre-Order Linked WAP-tree. The International Journal of Data Mining and Knowledge Discovery (DMKD)\u00a010, 5\u201338 (2005)","journal-title":"The International Journal of Data Mining and Knowledge Discovery (DMKD)"},{"key":"11_CR5","volume-title":"Data Mining: Concepts and Techniques","author":"J. Han","year":"2001","unstructured":"Han, J., Kamber, M.: Data Mining: Concepts and Techniques. Morgan Kaufmann Publishers, New York (2001)"},{"issue":"1","key":"11_CR6","doi-asserted-by":"publisher","first-page":"53","DOI":"10.1023\/B:DAMI.0000005258.31418.83","volume":"8","author":"J. Han","year":"2004","unstructured":"Han, J., Pei, J., Yin, Y., Mao, R.: Mining Frequent Patterns without Candidate Generation: A Frequent-Pattern Tree approach. International Journal of Data Mining and Knowledge Discovery\u00a08(1), 53\u201387 (2004)","journal-title":"International Journal of Data Mining and Knowledge Discovery"},{"key":"11_CR7","doi-asserted-by":"crossref","unstructured":"Imielinski, T., Swami, A., Agarwal, R.: Mining association rules between sets of items in large databases. In: Proceeding of the ACM SIGMOD conference on management of data, Washington D.C., May 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"11_CR8","unstructured":"Kantarcioglu, M., Clifton, C.: Privacy-preserving Distributed Mining of Association Rules on Horizontally Partitioned Data. In: The proceedings of the ACM SIGMOD Workshop on Research Issues on Data Mining and Knowledge Discovery, DMKD 2002, pp. 24\u201331 (2002)"},{"key":"11_CR9","doi-asserted-by":"crossref","unstructured":"Pei, J., Han, J., Mortazavi-asi, B., Zhu, H.: Mining Access Patterns Efficiently from web logs. In: Proceedings, Pacific-Asia conference on Knowledge Discovery and data Mining, Kyoto, Japan, pp. 396\u2013407 (2000)","DOI":"10.1007\/3-540-45571-X_47"},{"key":"11_CR10","unstructured":"Pei, J., Han, J., Mortazavi-Asl, B., Pinto, H., Chen, Q., Dayal, U., Hsu, M.C.: PrefixSpan: Mining Sequential Patterns Efficiently by Prefix-Projected Pattern Growth. In: Proceedings of the 2001 International Conference on Data Engineering (ICDE 2001), Heidelberg, Germany, pp. 215\u2013224 (2001)"},{"key":"11_CR11","unstructured":"Srikanth, R., Aggrawal, R.: Mining Sequential Patterns: generalizations and performance improvements, Research Report, IBM Almaden Research Center 650 Harry Road, San Jose, CA 95120, 1\u201315 (1996)"},{"key":"11_CR12","doi-asserted-by":"publisher","first-page":"32","DOI":"10.1023\/A:1007652502315","volume":"42","author":"M.J. Zaki","year":"2001","unstructured":"Zaki, M.J.: SPADE: An Efficient Algorithm for Mining Frequent Sequences. Machine learning\u00a042, 32\u201360 (2001)","journal-title":"Machine learning"}],"container-title":["Lecture Notes in Computer Science","Data Warehousing and Knowledge Discovery"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-03730-6_11","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,22]],"date-time":"2019-05-22T06:12:52Z","timestamp":1558505572000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-03730-6_11"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009]]},"ISBN":["9783642037290","9783642037306"],"references-count":12,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-03730-6_11","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2009]]}}}