{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T07:32:12Z","timestamp":1725521532276},"publisher-location":"Berlin, Heidelberg","reference-count":23,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540893776"},{"type":"electronic","value":"9783540893783"}],"license":[{"start":{"date-parts":[[2008,1,1]],"date-time":"2008-01-01T00:00:00Z","timestamp":1199145600000},"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":[[2008]]},"DOI":"10.1007\/978-3-540-89378-3_41","type":"book-chapter","created":{"date-parts":[[2008,11,26]],"date-time":"2008-11-26T21:43:58Z","timestamp":1227735838000},"page":"404-415","source":"Crossref","is-referenced-by-count":0,"title":["Efficient Single-Pass Mining of Weighted Interesting Patterns"],"prefix":"10.1007","author":[{"given":"Chowdhury Farhan","family":"Ahmed","sequence":"first","affiliation":[]},{"given":"Syed Khairuzzaman","family":"Tanbeer","sequence":"additional","affiliation":[]},{"given":"Byeong-Soo","family":"Jeong","sequence":"additional","affiliation":[]},{"given":"Young-Koo","family":"Lee","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"41_CR1","doi-asserted-by":"crossref","unstructured":"Agrawal, R., Imielinski, T., Swami, A.: Mining association rules between sets of items in large databases. In: ACM SIGMOD, pp. 207\u2013216 (1993)","DOI":"10.1145\/170035.170072"},{"key":"41_CR2","unstructured":"Agrawal, R., Srikant, R.: Fast Algorithms for Mining Association Rules. In: 20th Int. Conf. on Very Large Data Bases (VLDB), pp. 487\u2013499 (1994)"},{"key":"41_CR3","doi-asserted-by":"crossref","unstructured":"Yun, U., Leggett, J.J.: WFIM: weighted frequent itemset mining with a weight range and a minimum weight. In: Fourth SIAM Int. Conf. on Data Mining, USA, pp. 636\u2013640 (2005)","DOI":"10.1137\/1.9781611972757.76"},{"key":"41_CR4","doi-asserted-by":"crossref","unstructured":"Yun, U., Leggett, J.J.: WLPMiner: Weighted frequent pattern mining with length decreasing support constraints. In: 9th Pacific-Asia Conf. on Knowledge Discovery and Data Mining (PAKDD), Vietnam, pp. 555\u2013567 (2005)","DOI":"10.1007\/11430919_65"},{"key":"41_CR5","doi-asserted-by":"publisher","first-page":"3477","DOI":"10.1016\/j.ins.2007.03.018","volume":"177","author":"U. Yun","year":"2007","unstructured":"Yun, U.: Efficient Mining of weighted interesting patterns with a strong weight and\/or support affinity. Information Sciences\u00a0177, 3477\u20133499 (2007)","journal-title":"Information Sciences"},{"key":"41_CR6","doi-asserted-by":"crossref","unstructured":"Cai, C.H., Fu, A.W., Cheng, C.H., Kwong, W.W.: Mining association rules with weighted items. In: Int. Database Engineering and Applications Symposium, IDEAS, pp. 68\u201377 (1998)","DOI":"10.1109\/IDEAS.1998.694360"},{"key":"41_CR7","doi-asserted-by":"crossref","unstructured":"Tao, F.: Weighted association rule mining using weighted support and significant framework. In: 9th ACM SIGKDD Int. Conf. on Knowledge Discovery and Data Mining, USA, pp. 661\u2013666 (2003)","DOI":"10.1145\/956750.956836"},{"key":"41_CR8","doi-asserted-by":"publisher","first-page":"203","DOI":"10.1007\/s10115-003-0108-7","volume":"6","author":"W. Wang","year":"2004","unstructured":"Wang, W., Yang, J., Yu, P.S.: WAR: weighted association rules for item intensities. Knowledge Information and Systems\u00a06, 203\u2013229 (2004)","journal-title":"Knowledge Information and Systems"},{"key":"41_CR9","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. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"10","key":"41_CR10","doi-asserted-by":"publisher","first-page":"1347","DOI":"10.1109\/TKDE.2005.166","volume":"17","author":"G. Grahne","year":"2005","unstructured":"Grahne, G., Zhu, J.: Fast Algorithms for frequent itemset mining using FP-Trees. IEEE Transactions on Knowledge and Data Engineering\u00a017(10), 1347\u20131362 (2005)","journal-title":"IEEE Transactions on Knowledge and Data Engineering"},{"key":"41_CR11","doi-asserted-by":"publisher","first-page":"55","DOI":"10.1007\/s10618-006-0059-1","volume":"15","author":"J. Han","year":"2007","unstructured":"Han, J., Cheng, H., Xin, D., Yan, X.: Frequent pattern mining: current status and future directions. Data Mining and Knowledge Discovery\u00a015, 55\u201386 (2007)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"41_CR12","doi-asserted-by":"publisher","first-page":"23","DOI":"10.1007\/s10844-006-0002-3","volume":"28","author":"C. Raissi","year":"2007","unstructured":"Raissi, C., Poncelet, P., Teisseire, M.: Towards a new approach for mining frequent itemsets on data stream. Journal of Intelligent Information Systems\u00a028, 23\u201336 (2007)","journal-title":"Journal of Intelligent Information Systems"},{"issue":"1","key":"41_CR13","doi-asserted-by":"publisher","first-page":"14","DOI":"10.1145\/1121995.1121998","volume":"35","author":"N. Jiang","year":"2006","unstructured":"Jiang, N., Gruenwald, L.: Research Issues in Data Stream Association Rule Mining. SIGMOD Record\u00a035(1), 14\u201319 (2006)","journal-title":"SIGMOD Record"},{"issue":"3","key":"41_CR14","doi-asserted-by":"publisher","first-page":"1095","DOI":"10.1145\/1166074.1166084","volume":"31","author":"A. Metwally","year":"2006","unstructured":"Metwally, A., Agrawal, D., Abbadi, A.E.: An Integrated Efficient Solution for Computing Frequent and Top-k Elements in Data Streams. ACM Transactions on Database Systems (TODS)\u00a031(3), 1095\u20131133 (2006)","journal-title":"ACM Transactions on Database Systems (TODS)"},{"key":"41_CR15","doi-asserted-by":"crossref","unstructured":"Leung, C.K.-S., Khan, Q.I.: DSTree: A Tree structure for the mining of frequent Sets from Data Streams. In: 6th IEEE Int. Conf. on Data Mining (ICDM), pp. 928\u2013932 (2006)","DOI":"10.1109\/ICDM.2006.62"},{"key":"41_CR16","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"417","DOI":"10.1007\/978-3-540-24571-1_38","volume-title":"Database Systems for Advanced Applications","author":"J.-L. Koh","year":"2004","unstructured":"Koh, J.-L., Shieh, S.-F.: An Efficient Approach for Maintaining Association Rules Based on Adjusting FP-tree Structures. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 417\u2013424. Springer, Heidelberg (2004)"},{"key":"41_CR17","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"56","DOI":"10.1007\/11811305_5","volume-title":"Advanced Data Mining and Applications","author":"X. Li","year":"2006","unstructured":"Li, X., Deng, Z.-H., Tang, S.: A fast algorithm for maintenance of association rules in incremental databases. In: Li, X., Za\u00efane, O.R., Li, Z. (eds.) ADMA 2006. LNCS (LNAI), vol.\u00a04093, pp. 56\u201363. Springer, Heidelberg (2006)"},{"key":"41_CR18","unstructured":"Frequent itemset mining dataset repository, http:\/\/fimi.cs.helsinki.fi\/data\/"},{"key":"41_CR19","unstructured":"UCI machine learning repository, http:\/\/kdd.ics.uci.edu\/"},{"key":"41_CR20","doi-asserted-by":"publisher","first-page":"219","DOI":"10.1007\/s10618-006-0043-9","volume":"13","author":"H. Xiong","year":"2006","unstructured":"Xiong, H., Tan, P.-N., Kumar, V.: Hyperclique Pattern Discovery. Data Mining and Knowledge Discovery\u00a013, 219\u2013242 (2006)","journal-title":"Data Mining and Knowledge Discovery"},{"issue":"3","key":"41_CR21","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1007\/s10115-006-0032-8","volume":"11","author":"C.K.-S. Leung","year":"2007","unstructured":"Leung, C.K.-S., Khan, Q.I., Li, Z., Hoque, T.: CanTree: a canonical-order tree for incremental frequent-pattern mining. Knowledge and Information Systems\u00a011(3), 287\u2013311 (2007)","journal-title":"Knowledge and Information Systems"},{"key":"41_CR22","doi-asserted-by":"publisher","first-page":"86","DOI":"10.1016\/j.knosys.2006.07.007","volume":"210","author":"U. Yun","year":"2007","unstructured":"Yun, U.: Mining lossless closed frequent patterns with weight constraints. Knowledge-Based Systems\u00a0210, 86\u201397 (2007)","journal-title":"Knowledge-Based Systems"},{"key":"41_CR23","series-title":"Lecture Notes in Artificial Intelligence","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)"}],"container-title":["Lecture Notes in Computer Science","AI 2008: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-89378-3_41","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,15]],"date-time":"2019-05-15T19:36:58Z","timestamp":1557949018000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-89378-3_41"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540893776","9783540893783"],"references-count":23,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-89378-3_41","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}