{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,17]],"date-time":"2025-10-17T13:41:10Z","timestamp":1760708470848},"reference-count":30,"publisher":"Springer Science and Business Media LLC","issue":"1","license":[{"start":{"date-parts":[[2012,11,1]],"date-time":"2012-11-01T00:00:00Z","timestamp":1351728000000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Knowl Inf Syst"],"published-print":{"date-parts":[[2013,10]]},"DOI":"10.1007\/s10115-012-0581-y","type":"journal-article","created":{"date-parts":[[2012,10,31]],"date-time":"2012-10-31T07:26:45Z","timestamp":1351668405000},"page":"219-244","source":"Crossref","is-referenced-by-count":9,"title":["Hyper-structure mining of frequent patterns in uncertain data streams"],"prefix":"10.1007","volume":"37","author":[{"given":"Chandima","family":"HewaNadungodage","sequence":"first","affiliation":[]},{"given":"Yuni","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Jaehwan John","family":"Lee","sequence":"additional","affiliation":[]},{"given":"Yi-cheng","family":"Tu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2012,11,1]]},"reference":[{"key":"581_CR1","doi-asserted-by":"crossref","unstructured":"Aggarwal CC, Li Y, Wang J et al (2009) Frequent pattern mining with uncertain data. In: Proceedings of the ACM-SIGKDD international conference on knowledge discovery and data mining, pp 29\u201338","DOI":"10.1145\/1557019.1557030"},{"key":"581_CR2","unstructured":"Agrawal R, Srikant R (1994) Fast algorithms for mining association rules. In Proceedings of the international conference on very large data, Bases, pp 487\u2013499"},{"key":"581_CR3","doi-asserted-by":"crossref","unstructured":"Agrawal R, Srikant R (1995) Mining sequential patterns. Proceedings of the IEEE International Conference on data, engineering, pp 3\u201314","DOI":"10.1109\/ICDE.1995.380415"},{"key":"581_CR4","doi-asserted-by":"crossref","unstructured":"Bernecker T, Kriegel H-P, Renz M et al (2009) Probabilistic frequent itemset mining in uncertain databases. In: Proceedings of the ACM-SIGKDD international conference on knowledge discovery and data mining, pp 119\u2013128","DOI":"10.1145\/1557019.1557039"},{"key":"581_CR5","doi-asserted-by":"crossref","unstructured":"Beyer K, Ramakrishnan R (1999) Bottom-up computation of sparse and iceberg cubes. In: Proceedings of the ACM-SIGMOD international conference on management of data, pp 359\u2013370","DOI":"10.1145\/304181.304214"},{"key":"581_CR6","doi-asserted-by":"crossref","unstructured":"Brijs T, Swinnen G, Vanhoof K et al (1999) The use of association rules for productassortment decisions: a case study. In: Proceedings of the fifth international conference on knowledge discovery and data mining, pp 254\u2013260","DOI":"10.1145\/312129.312241"},{"issue":"1","key":"581_CR7","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-007-0092-4","volume":"16","author":"J Cheng","year":"2008","unstructured":"Cheng J, Ke Y, Ng W (2008) A survey on algorithms for mining frequent itemsets over data streams. Knowl Inf Syst 16(1):1\u201327","journal-title":"Knowl Inf Syst"},{"key":"581_CR8","doi-asserted-by":"crossref","unstructured":"Chui C-K, Kao B, Hung E (2007) Mining frequent itemsets from uncertain data. In: Proceedings of the Pacific-Asia conference advances in knowledge discovery and data mining, pp 47\u201358","DOI":"10.1007\/978-3-540-71701-0_8"},{"key":"581_CR9","doi-asserted-by":"crossref","unstructured":"Chui C-K, Kao B (2008) A decremental approach for mining frequent itemsets from uncertain data. In: Proceedings of the Pacific-Asia conference advances in knowledge discovery and data mining, pp 64\u201375","DOI":"10.1007\/978-3-540-68125-0_8"},{"key":"581_CR10","unstructured":"Giannella C, Han J, Pei J et al (2004) Mining frequent patterns in data streams at multiple time granularities. In: Kargupta H, Joshi A, Sivakumar K, Yesha Y (eds) Data mining: next generation challenges and future directions. AAAI\/MIT Press, Menlo park\/Cambridge, pp 105\u2013124"},{"key":"581_CR11","doi-asserted-by":"crossref","unstructured":"Han J, Pei J, Yin Y (2000) Mining frequent patterns without candidate generation. In: Proceedings of the ACM-SIGMOD international conference on management of data, pp 1\u201312","DOI":"10.1145\/335191.335372"},{"key":"581_CR12","doi-asserted-by":"crossref","unstructured":"Kuramochi M, Karypis G (2001) Frequent subgraph discovery. In: Proceedings of the international conference on data mining, pp 313\u2013320","DOI":"10.1109\/ICDM.2001.989534"},{"key":"581_CR13","doi-asserted-by":"crossref","unstructured":"Leung CK-S, Mateo MAF, Brajczuk DA (2008) A tree-based approach for frequent pattern mining from uncertain data. In: Proceedings of the Pacific-Asia conference on advances in knowledge discovery and data mining, pp 653\u2013661","DOI":"10.1007\/978-3-540-68125-0_61"},{"key":"581_CR14","unstructured":"Leung CK-S, Hao B (2009) Mining of frequent itemsets from streams of uncertain data. In: Proceedings of the IEEE international conference on data engineering, pp 1663\u20131670"},{"key":"581_CR15","doi-asserted-by":"crossref","unstructured":"Leung CK-S, Jiang F (2011a) Frequent itemset mining of uncertain data streams using the damped window model. In: Proceedings of the ACM symposium on applied computing, pp 950\u2013955","DOI":"10.1145\/1982185.1982393"},{"key":"581_CR16","doi-asserted-by":"crossref","unstructured":"Leung CK-S, Jiang F (2011b) Frequent pattern mining from time-fading streams of uncertain data. In: Proceedings of DaWaK\u201911, pp 252\u2013264","DOI":"10.1007\/978-3-642-23544-3_19"},{"key":"581_CR17","unstructured":"Leung CK-S, Jiang F, Hayduk Y (2011) A landmark-model based system for mining frequent patterns from uncertain data streams. In: Proceedings of IDEAS\u201911, pp 249\u2013250"},{"issue":"1","key":"581_CR18","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1007\/s10115-007-0112-4","volume":"17","author":"H-F Li","year":"2008","unstructured":"Li H-F, Shan M-K, Lee S-Y (2008) DSM-FI: an efficient algorithm for mining frequent itemsets in data streams. Knowl Inf Syst 17(1):79\u201397","journal-title":"Knowl Inf Syst"},{"key":"581_CR19","doi-asserted-by":"crossref","unstructured":"Lian W, Cheung DW, Yiu SM (2007) Maintenance of maximal frequent itemsets in large databases. In: Proceedings of the ACM symposium on applied computing, pp 388\u2013392","DOI":"10.1145\/1244002.1244094"},{"key":"581_CR20","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/s10115-009-0267-2","volume":"26","author":"H Liu","year":"2011","unstructured":"Liu H, Lin Y, Han J (2011) Methods for mining frequent items in data streams: an overview. Knowl Inf Syst 26:1\u201330","journal-title":"Knowl Inf Syst"},{"key":"581_CR21","doi-asserted-by":"crossref","unstructured":"Manku GS, Motwani R (2002) Approximate frequency counts over data streams. In: Proceedings of the International conference on very large data bases, pp 346\u2013357","DOI":"10.1016\/B978-155860869-6\/50038-X"},{"key":"581_CR22","doi-asserted-by":"crossref","unstructured":"Mozafari B, Thakkar H, Zaniolo C (2008) Verifying and mining frequent patterns from large windows over data streams. In: Proceedings of the IEEE 24th international conference on data engineering, pp 179\u2013188","DOI":"10.1109\/ICDE.2008.4497426"},{"key":"581_CR23","doi-asserted-by":"crossref","unstructured":"Ng W, Dash M (2008) Efficient approximate mining of frequent patterns over transactional data streams. In: Proceedings of the 10th international conference on data warehousing and knowledge discovery, pp 241\u2013250","DOI":"10.1007\/978-3-540-85836-2_23"},{"key":"581_CR24","unstructured":"Pei J, Han J, Lu H et al (2001) H-mine: hyper-structure mining of frequent patterns in large databases. In: Proceedings of the international conference on data mining, pp 441\u2013448"},{"issue":"3","key":"581_CR25","doi-asserted-by":"crossref","first-page":"451","DOI":"10.1007\/s10115-010-0309-9","volume":"27","author":"AY Rodr\u00edguez-Gonz\u00e1lez","year":"2011","unstructured":"Rodr\u00edguez-Gonz\u00e1lez AY, Mart\u00ednez-Trinidad JF, Carrasco-Ochoa JA et al (2011) RP-Miner: a relaxed prune algorithm for frequent similar pattern mining. Knowl Inf Syst 27(3):451\u2013471","journal-title":"Knowl Inf Syst"},{"issue":"1","key":"581_CR26","doi-asserted-by":"crossref","first-page":"57","DOI":"10.1007\/s10115-010-0363-3","volume":"30","author":"A Salam","year":"2012","unstructured":"Salam A, Khayal MSH (2012) Mining top-k frequent patterns without minimum support threshold. Knowl Inf Syst 30(1):57\u201386","journal-title":"Knowl Inf Syst"},{"key":"581_CR27","unstructured":"Yu JX, Chong Z, Lu H et al (2004) False positive or false negative: mining frequent itemsets from high speed transactional data streams. In: Proceedings of the international conference on very large data bases, pp 204\u2013215"},{"key":"581_CR28","doi-asserted-by":"crossref","unstructured":"Zhang Q, Li F, Yi K (2008) Finding frequent items in probabilistic data. In: Proceedings of the ACM-SIGMOD international conference on management of data, pp 819\u2013832","DOI":"10.1145\/1376616.1376698"},{"key":"581_CR29","doi-asserted-by":"crossref","unstructured":"Zhang X, Peng H (2009) A sliding-window approach for finding top-k frequent itemsets from uncertain streams. In: Proceedings of the joint international conference on advances in data and web management, pp 597\u2013603","DOI":"10.1007\/978-3-642-00672-2_57"},{"issue":"3","key":"581_CR30","doi-asserted-by":"crossref","first-page":"375","DOI":"10.1007\/s10115-008-0179-6","volume":"20","author":"X Zeng","year":"2009","unstructured":"Zeng X, Pei J, Wang K et al (2009) PADS: a simple yet effective pattern-aware dynamic search method for fast maximal frequent pattern mining. Knowl Inf Syst 20(3):375\u2013391","journal-title":"Knowl Inf Syst"}],"container-title":["Knowledge and Information Systems"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0581-y.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10115-012-0581-y\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10115-012-0581-y","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,7,4]],"date-time":"2019-07-04T23:59:32Z","timestamp":1562284772000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10115-012-0581-y"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2012,11,1]]},"references-count":30,"journal-issue":{"issue":"1","published-print":{"date-parts":[[2013,10]]}},"alternative-id":["581"],"URL":"https:\/\/doi.org\/10.1007\/s10115-012-0581-y","relation":{},"ISSN":["0219-1377","0219-3116"],"issn-type":[{"value":"0219-1377","type":"print"},{"value":"0219-3116","type":"electronic"}],"subject":[],"published":{"date-parts":[[2012,11,1]]}}}