{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,6]],"date-time":"2024-09-06T23:36:03Z","timestamp":1725665763465},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642278716"},{"type":"electronic","value":"9783642278723"}],"license":[{"start":{"date-parts":[[2012,1,1]],"date-time":"2012-01-01T00:00:00Z","timestamp":1325376000000},"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":[[2012]]},"DOI":"10.1007\/978-3-642-27872-3_18","type":"book-chapter","created":{"date-parts":[[2012,2,29]],"date-time":"2012-02-29T11:38:51Z","timestamp":1330515531000},"page":"117-124","source":"Crossref","is-referenced-by-count":0,"title":["Mining Single Pass Weighted Pattern Tree"],"prefix":"10.1007","author":[{"given":"Olivia","family":"Castelino","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Preetham","family":"Kumar","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Srivatsa","family":"Maddodi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"18_CR1","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"559","DOI":"10.1007\/3-540-44467-X_51","volume-title":"High Performance Computing - HiPC 2000","author":"V.S. Ananthanarayana","year":"2000","unstructured":"Ananthanarayana, V.S., Subramanian, D.K., Murty, M.N.: Scalable, Distributed and Dynamic Mining of Association Rules. In: Valero, M., Prasanna, V.K., Vajapeyam, S. (eds.) HiPC 2000. LNCS, vol.\u00a01970, pp. 559\u2013566. Springer, Heidelberg (2000)"},{"key":"18_CR2","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)"},{"key":"18_CR3","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":"18_CR4","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":"18_CR5","doi-asserted-by":"crossref","unstructured":"Kim, Y., Kim, W., Kim, U.: Mining Frequent Itemsets with Normalized Weight in Continuous Data Streams. Journal of Information Processing Systems\u00a06(1) (March 2010), doi:10.3745\/JIPS.2010.6.1.079","DOI":"10.3745\/JIPS.2010.6.1.079"},{"key":"18_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. Data Mining and Knowledge Discovery\u00a08, 53\u201387 (2004)","journal-title":"Data Mining and Knowledge Discovery"},{"key":"18_CR7","doi-asserted-by":"crossref","unstructured":"Kumar, P., Ananthanarayana, V.S.: Discovery of frequent itemsets using weighted tree approach. IJCSNS International Journal of Computer Science and Network Security\u00a08(8) (2008)","DOI":"10.1109\/ICCET.2009.194"},{"key":"18_CR8","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. ACM SIGMOD Record. In: Proceedings of the 2000 ACM SIGMOD International Conference on Management of Data, SIGMOD 22000, vol.\u00a029(2) (May 2000)","DOI":"10.1145\/335191.335372"},{"key":"18_CR9","doi-asserted-by":"crossref","unstructured":"Park, S., Chu, W.W., Yoon, J., Won, J.: Similarity search of time-warped subsequences Via a suffix tree (2002), doi: 10.1016\/S0306-4379(02)00102-3","DOI":"10.1016\/S0306-4379(02)00102-3"},{"key":"18_CR10","unstructured":"Geetha, M., D\u2019Souza, R.J.: Discovery of Frequent Closed Itemsets using Reduced Pattern Count Tree. In: Proceedings of the World Congress on Engineering, WCE 2008, London, U.K, July 2-4, vol.\u00a0I (2008)"}],"container-title":["Lecture Notes in Computer Science","Data Engineering and Management"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-27872-3_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,4,28]],"date-time":"2019-04-28T08:29:09Z","timestamp":1556440149000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-27872-3_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012]]},"ISBN":["9783642278716","9783642278723"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-27872-3_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2012]]}}}