{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T14:52:51Z","timestamp":1743000771486,"version":"3.40.3"},"publisher-location":"Cham","reference-count":20,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319065687"},{"type":"electronic","value":"9783319065694"}],"license":[{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2014,1,1]],"date-time":"2014-01-01T00:00:00Z","timestamp":1388534400000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2014]]},"DOI":"10.1007\/978-3-319-06569-4_17","type":"book-chapter","created":{"date-parts":[[2014,4,11]],"date-time":"2014-04-11T20:16:15Z","timestamp":1397247375000},"page":"229-242","source":"Crossref","is-referenced-by-count":0,"title":["Novel Operations for FP-Tree Data Structure and Their Applications"],"prefix":"10.1007","author":[{"given":"Tri-Thanh","family":"Nguyen","sequence":"first","affiliation":[]},{"given":"Quang-Thuy","family":"Ha","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"17_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.N.: Mining Association Rules between Sets of Items in Large Databases. In: Proc. of SIGMOD Conference 1993, pp. 207\u2013216 (1993)","DOI":"10.1145\/170036.170072"},{"key":"17_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. Research Report RJ 9839, IBM Almaden Research Center (1994)"},{"key":"17_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules in Large Databases. In: VLDB 1994, pp. 487\u2013499 (1994)"},{"key":"17_CR4","unstructured":"Agrawal, R., Aggarwal, C., Prasad, V.V.V.: Depth-first generation of large item-sets for association rules. IBM Tech. Report RC21538 (July 1999)"},{"key":"17_CR5","doi-asserted-by":"crossref","unstructured":"Bernecker, T., Kriegel, H.-P., Renz, M., Verhein, F., Z\u00fcfle, A.: Probabilistic Frequent Pattern Growth for Itemset Mining in Uncertain Databases (Technical Report). CoRR abs\/1008.2300 (2010)","DOI":"10.1145\/1557019.1557039"},{"key":"17_CR6","doi-asserted-by":"crossref","unstructured":"Brin, S., Motwani, R., Silverstein, C.: Beyond Market Baskets: Generalizing Association Rules to Correlations. In: Proc. of SIGMOD Conference 1997, pp. 265\u2013276 (1997)","DOI":"10.1145\/253262.253327"},{"key":"17_CR7","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining Frequent Patterns without Candidate Generation. In: Proc. of SIGMOD Conference 2000, pp. 1\u201312 (2000)","DOI":"10.1145\/342009.335372"},{"issue":"6","key":"17_CR8","first-page":"400","volume":"1","author":"B.S. Kumar","year":"2010","unstructured":"Kumar, B.S., Rukmani, K.V.: Implementation of Web Usage Mining Using APRIORI and FP-Growth Algorithms. Int. J. of Advanced Networking and Applications\u00a01(6), 400\u2013404 (2010)","journal-title":"Int. J. of Advanced Networking and Applications"},{"key":"17_CR9","doi-asserted-by":"crossref","unstructured":"Li, H., Wang, Y., Zhang, D., Zhang, M., Chang, E.Y.: Pfp: parallel fp-growth for query recommendation. In: Proc. of RecSys 2008, pp. 107\u2013114 (2008)","DOI":"10.1145\/1454008.1454027"},{"issue":"3","key":"17_CR10","doi-asserted-by":"publisher","first-page":"231","DOI":"10.1504\/IJBIDM.2010.033360","volume":"5","author":"W.-Y. Lin","year":"2010","unstructured":"Lin, W.-Y., Huang, K.-W., Wu, C.-A.: MCFPTree: An FP-tree-based algo-rithm for multi-constraint patterns discovery. IJBIDM\u00a05(3), 231\u2013246 (2010)","journal-title":"IJBIDM"},{"key":"17_CR11","doi-asserted-by":"crossref","unstructured":"Lin, C.-Y., Chen, Y.-A., Tseng, Y.-C., Wang, L.-C.: A flexible analysis and prediction framework on resource usage in public clouds. In: Proc. of CloudCom 2012, pp. 309\u2013316 (2012)","DOI":"10.1109\/CloudCom.2012.6427543"},{"issue":"3","key":"17_CR12","first-page":"446","volume":"9","author":"S.N. Patro","year":"2012","unstructured":"Patro, S.N., Mishra, S., Khuntia, P., Bhagabati, C.: Construction of FP Tree using Huffman Coding. International Journal of Computer Science Issues\u00a09(3), 446\u2013469 (2012)","journal-title":"International Journal of Computer Science Issues"},{"key":"17_CR13","doi-asserted-by":"crossref","unstructured":"Shrivastava, V.K., Kumar, P., Pardasani, K.R.: FP-tree and COFI Based Approach for Mining of Multiple Level Association Rules in Large Data-bases. CoRR abs\/1003.1821 (2010)","DOI":"10.3850\/978-981-08-7300-4_0634"},{"key":"17_CR14","unstructured":"Silverstein, C., Brin, S., Motwani, R., Ullman, J.D.: Scalable Techniques for Mining Causal Structures. In: Proc. of VLDB 1998, pp. 594\u2013605 (1998)"},{"issue":"1","key":"17_CR15","first-page":"14","volume":"1","author":"M. Singh","year":"2010","unstructured":"Singh, M., Ahirwar, R., Kher, N.: FP-Tree Improve Efficiency & Increase Scalability by Applying Parallel Projected. Binary Journal of Data Mining & Networking\u00a01(1), 14\u201316 (2010)","journal-title":"Binary Journal of Data Mining & Networking"},{"issue":"1","key":"17_CR16","first-page":"114","volume":"2","author":"M. Suman","year":"2012","unstructured":"Suman, M., Anuradha, T., Gowtham, K., Ramakrishna, A.: A Frequent Pattern Mining Algorithm Based On Fp-Tree Structure Andapriori Algorithm. International Journal of Engineering Research and Applications\u00a02(1), 114\u2013116 (2012)","journal-title":"International Journal of Engineering Research and Applications"},{"issue":"5","key":"17_CR17","doi-asserted-by":"publisher","first-page":"652","DOI":"10.1109\/TKDE.2005.81","volume":"17","author":"J. Wang","year":"2005","unstructured":"Wang, J., Han, J., Lu, Y., Tzvetkov, P.: TFP: An Efficient Algorithm for Mining Top-K Frequent Closed Itemsets. IEEE Trans. Knowl. Data Eng.\u00a017(5), 652\u2013664 (2005)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"17_CR18","doi-asserted-by":"publisher","first-page":"25","DOI":"10.5815\/ijem.2011.04.04","volume":"4","author":"A.-P. Xu","year":"2011","unstructured":"Xu, A.-P., Tang, Y., Wang, Q., Qiao, M.-Q., Zhang, H.-Y., Wei, S.: Mining Associated Factors about Emotional Disease Bases on FP-Tree Growing Algorithm. International Journal of Engineering and Manufacturing\u00a04, 25\u201331 (2011)","journal-title":"International Journal of Engineering and Manufacturing"},{"issue":"1","key":"17_CR19","first-page":"177","volume":"28","author":"S.-J. Yen","year":"2012","unstructured":"Yen, S.-J., Wang, C.-K., Ouyang, L.-Y.: A Search Space Reduced Algorithm for Mining Frequent Patterns. J. Inf. Sci. Eng.\u00a028(1), 177\u2013191 (2012)","journal-title":"J. Inf. Sci. Eng."},{"key":"17_CR20","doi-asserted-by":"crossref","unstructured":"Zaki, M.J., Parthasarathy, S., Ogihara, M., Li, W.: New Algorithms for Fast Discovery of Association Rules. In: Proc. of KDD\u00a01997, pp. 283\u2013286 (1997)","DOI":"10.1007\/978-1-4615-5669-5_1"}],"container-title":["Advances in Intelligent Systems and Computing","Advanced Computational Methods for Knowledge Engineering"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-06569-4_17","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,31]],"date-time":"2023-01-31T00:28:02Z","timestamp":1675124882000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-06569-4_17"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014]]},"ISBN":["9783319065687","9783319065694"],"references-count":20,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-06569-4_17","relation":{},"ISSN":["2194-5357","2194-5365"],"issn-type":[{"type":"print","value":"2194-5357"},{"type":"electronic","value":"2194-5365"}],"subject":[],"published":{"date-parts":[[2014]]}}}