{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T19:40:13Z","timestamp":1725565213540},"publisher-location":"Berlin, Heidelberg","reference-count":5,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540220640"},{"type":"electronic","value":"9783540247753"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2004]]},"DOI":"10.1007\/978-3-540-24775-3_14","type":"book-chapter","created":{"date-parts":[[2010,9,10]],"date-time":"2010-09-10T23:48:20Z","timestamp":1284162500000},"page":"116-120","source":"Crossref","is-referenced-by-count":4,"title":["An Efficient Algorithm for Dense Regions Discovery from Large-Scale Data Streams"],"prefix":"10.1007","author":[{"given":"Andy M.","family":"Yip","sequence":"first","affiliation":[]},{"given":"Edmond H.","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Michael K.","family":"Ng","sequence":"additional","affiliation":[]},{"given":"Tony F.","family":"Chan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"14_CR1","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"48","DOI":"10.1007\/3-540-45640-6_3","volume-title":"WEBKDD 2001 - Mining Web Log Data Across All Customers Touch Points","author":"J. Huang","year":"2002","unstructured":"Huang, J., Ng, M., Ching, W., Ng, J., Cheung, D.: A cube model and cluster analysis for web access sessions. In: Kohavi, R., Masand, B., Spiliopoulou, M., Srivastava, J. (eds.) WebKDD 2001. LNCS (LNAI), vol.\u00a02356, p. 48. Springer, Heidelberg (2002)"},{"key":"14_CR2","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"352","DOI":"10.1007\/978-3-540-24571-1_32","volume-title":"Database Systems for Advanced Applications","author":"E.H. Wu","year":"2004","unstructured":"Wu, E.H., Ng, M.K., Huang, J.Z.: On improving website connectivity by using web-log data streams. In: Lee, Y., Li, J., Whang, K.-Y., Lee, D. (eds.) DASFAA 2004. LNCS, vol.\u00a02973, pp. 352\u2013364. Springer, Heidelberg (2004)"},{"key":"14_CR3","doi-asserted-by":"crossref","unstructured":"Wu, E.H., Ng, M.K.: A graph-based optimization algorithm for Website topology using interesting association rules. In: Proc. of PAKDD 2003, Seoul, Korea (2003)","DOI":"10.1007\/3-540-36175-8_18"},{"key":"14_CR4","doi-asserted-by":"crossref","unstructured":"Yang, C., Fayyad, U., Bradley, P.S.: Efficient discovery of error-tolerant frequent itemsets in high dimensions. In: Proc. of ACM SIGKDD Intl. Conf. on Knowledge Discovery and Data Mining: San Francisco, California, pp. 194\u2013203 (2001)","DOI":"10.1145\/502512.502539"},{"key":"14_CR5","unstructured":"Yip, A.M., Wu, E.H., Ng, M.K., Chan, T.F.: An efficient algorithm for dense regions discovery from large-scale data streams (extended version), UCLA CAM Reports 03-76, Math. Dept., University of California, Los Angeles, CA (2003)"}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-24775-3_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2021,5,3]],"date-time":"2021-05-03T03:09:28Z","timestamp":1620011368000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-24775-3_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2004]]},"ISBN":["9783540220640","9783540247753"],"references-count":5,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-24775-3_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2004]]}}}