{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:40:03Z","timestamp":1746088803110,"version":"3.40.4"},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783642539312"},{"type":"electronic","value":"9783642539329"}],"license":[{"start":{"date-parts":[[2013,1,1]],"date-time":"2013-01-01T00:00:00Z","timestamp":1356998400000},"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":[[2013]]},"DOI":"10.1007\/978-3-642-53932-9_48","type":"book-chapter","created":{"date-parts":[[2013,12,20]],"date-time":"2013-12-20T05:54:07Z","timestamp":1387518847000},"page":"488-498","source":"Crossref","is-referenced-by-count":0,"title":["Granular Sketch Based Uncertain Data Streams Pattern Mining"],"prefix":"10.1007","author":[{"given":"Jingyu","family":"Chen","sequence":"first","affiliation":[]},{"given":"Ping","family":"Chen","sequence":"additional","affiliation":[]},{"given":"Xian\u2019gang","family":"Sheng","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"48_CR1","doi-asserted-by":"crossref","unstructured":"Leung, C., Hao, B.: Mining of frequent items from streams of uncertain data. In: Proc. IEEE Computer Society, pp. 1663\u20131670 (2009)","DOI":"10.1109\/ICDE.2009.157"},{"key":"48_CR2","doi-asserted-by":"crossref","unstructured":"Han, J., Pei, J., Yin, Y.: Mining frequent patterns without candidate generation. In: Proceedings of the 2000 ACM SIGMOD, pp. 1\u201312 (2000)","DOI":"10.1145\/335191.335372"},{"key":"48_CR3","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules. In: Proc. 20th Int. Conf. VLDB, pp. 487\u2013499 (1994)"},{"key":"48_CR4","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"47","DOI":"10.1007\/978-3-540-71701-0_8","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C.-K. Chui","year":"2007","unstructured":"Chui, C.-K., Kao, B., Hung, E.: Mining frequent itemsets from uncertain data. In: Zhou, Z.-H., Li, H., Yang, Q. (eds.) PAKDD 2007. LNCS (LNAI), vol.\u00a04426, pp. 47\u201358. Springer, Heidelberg (2007)"},{"key":"48_CR5","doi-asserted-by":"crossref","unstructured":"Ackermann, M.R., Lammersen, C., Martens, M., Raupach, C., Swierkot, K., Sohler, C.: StreamKM++: A Clustering Algorithm for Data Streams. Journal of Experimental Algorithmics (JEA)\u00a017(1) (July 2012)","DOI":"10.1145\/2133803.2184450"},{"key":"48_CR6","doi-asserted-by":"crossref","unstructured":"Tran, T.T.-L., Peng, P., Li, B.D., Diao, Y., Liu, A.N.: PODS: a new model and processing algorithms for uncertain data streams. In: Proceedings of the 2010 International Conference on Management of Data, Indiana, USA, pp. 159\u2013170 (2010)","DOI":"10.1145\/1807167.1807187"},{"key":"48_CR7","unstructured":"Agrawal, R., Srikant, R.: Fast algorithms for mining association rules in large databases. In: Proc. of 20th ICDE, pp. 487\u2013499 (1997)"},{"key":"48_CR8","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"114","DOI":"10.1007\/11430919_15","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"F. Bonchi","year":"2005","unstructured":"Bonchi, F., Lucchese, C.: Pushing tougher constraints in frequent pattern mining. In: Ho, T.-B., Cheung, D., Liu, H. (eds.) PAKDD 2005. LNCS (LNAI), vol.\u00a03518, pp. 114\u2013124. Springer, Heidelberg (2005)"},{"key":"48_CR9","doi-asserted-by":"crossref","unstructured":"Cheung, W., Zaiane, R.: Incremental mining of frequent patterns without candidate generation or support constraint. In: Proc. IDEAS, pp. 111\u2013116 (2003)","DOI":"10.1109\/IDEAS.2003.1214917"},{"key":"48_CR10","series-title":"LNAI","doi-asserted-by":"publisher","first-page":"653","DOI":"10.1007\/978-3-540-68125-0_61","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"C.K.-S. Leung","year":"2008","unstructured":"Leung, C.K.-S., Mateo, M.A.F., Brajczuk, D.A.: A tree-based approach for frequent pattern mining from uncertain data. In: Washio, T., Suzuki, E., Ting, K.M., Inokuchi, A. (eds.) PAKDD 2008. LNCS (LNAI), vol.\u00a05012, pp. 653\u2013661. Springer, Heidelberg (2008)"},{"key":"48_CR11","doi-asserted-by":"crossref","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The Space Complexity of Approximating the Frequency Moments. In: ACM Symposium on Theory of Computing, pp. 20\u201329 (1996)","DOI":"10.1145\/237814.237823"},{"issue":"1","key":"48_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G. Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An Improved Data-Stream Summary: The Count-min Sketch and its Applications. Journal of Algorithms\u00a055(1), 58\u201375 (2005)","journal-title":"Journal of Algorithms"},{"key":"48_CR13","doi-asserted-by":"crossref","unstructured":"Cormode, G., Muthukrishnan, S.: What\u2019s hot and what\u2019s not: Tracking most frequent items dynamically. In: Proceedings of the 22nd ACM Symposium on Principles of Database Systems, pp. 296\u2013306 (2003)","DOI":"10.1145\/773153.773182"},{"key":"48_CR14","unstructured":"Manerikar, N., Palpanas, T.: Frequent items in streaming data: An experimental evaluation of the state-of-the-art. Technical Report DISI-08-017, University of Trento (March 2008)"},{"key":"48_CR15","doi-asserted-by":"crossref","unstructured":"Aggarwal, C.: A Framework for Clustering Massive-Domain Data Streams. In: IEEE 25th International Conference on Data Engineering (ICDE 2009), pp. 102\u2013113 (2009)","DOI":"10.1109\/ICDE.2009.13"},{"issue":"6","key":"48_CR16","doi-asserted-by":"publisher","first-page":"881","DOI":"10.1016\/j.ijar.2011.03.002","volume":"52","author":"K. Kaneiwa","year":"2011","unstructured":"Kaneiwa, K., Kudo, Y.: A sequential pattern mining algorithm using rough set theory. International Journal of Approximate Reasoning\u00a052(6), 881\u2013893 (2011)","journal-title":"International Journal of Approximate Reasoning"},{"key":"48_CR17","doi-asserted-by":"crossref","unstructured":"Liu, Y., Zhang, L., Guan, Y.: Sketch-based Streaming PCA Algorithm for Network-wide Traffic Anomaly Detection. In: Proc. of IEEE 30th International Conference on Distributed Computing Systems (ICDCS), pp. 807\u2013816 (2010)","DOI":"10.1109\/ICDCS.2010.45"},{"key":"48_CR18","doi-asserted-by":"crossref","unstructured":"Kanda, Y., Fukuda, K., Sugawara, T.: Evaluation of Anomaly Detection Based on Sketch and PCA. In: Proceedings of IEEE Global Telecommunications Conference (GLOBECOM), pp. 1\u20135 (2010)","DOI":"10.1109\/GLOCOM.2010.5683878"}],"container-title":["Communications in Computer and Information Science","Information Computing and Applications"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-642-53932-9_48","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,1]],"date-time":"2025-05-01T08:11:21Z","timestamp":1746087081000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-642-53932-9_48"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2013]]},"ISBN":["9783642539312","9783642539329"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/978-3-642-53932-9_48","relation":{},"ISSN":["1865-0929","1865-0937"],"issn-type":[{"type":"print","value":"1865-0929"},{"type":"electronic","value":"1865-0937"}],"subject":[],"published":{"date-parts":[[2013]]}}}