{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,7]],"date-time":"2026-02-07T23:58:21Z","timestamp":1770508701597,"version":"3.49.0"},"reference-count":27,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2007,9,1]],"date-time":"2007-09-01T00:00:00Z","timestamp":1188604800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["J Comput Sci Technol"],"published-print":{"date-parts":[[2007,9]]},"DOI":"10.1007\/s11390-007-9084-9","type":"journal-article","created":{"date-parts":[[2007,9,18]],"date-time":"2007-09-18T00:53:36Z","timestamp":1190076816000},"page":"711-724","source":"Crossref","is-referenced-by-count":11,"title":["A Semi-Random Multiple Decision-Tree Algorithm for Mining Data Streams"],"prefix":"10.1007","volume":"22","author":[{"given":"Xue-Gang","family":"Hu","sequence":"first","affiliation":[]},{"given":"Pei-Pei","family":"Li","sequence":"additional","affiliation":[]},{"given":"Xin-Dong","family":"Wu","sequence":"additional","affiliation":[]},{"given":"Gong-Qing","family":"Wu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2007,9,25]]},"reference":[{"key":"9084_CR1","doi-asserted-by":"crossref","unstructured":"Pedro Domingos, Geoff Hulten. Mining high-speed data streams. In Proc. Knowledge Discovery and Data Mining, Boston, MA, USA, 2000, pp.71\u201380.","DOI":"10.1145\/347090.347107"},{"key":"9084_CR2","doi-asserted-by":"crossref","unstructured":"Gama J, Rocha R, Medas P. Accurate decision trees for mining high-speed data streams. In Proc. the 9th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining, Washington DC, USA, 2003, pp.523\u2013528.","DOI":"10.1145\/956750.956813"},{"key":"9084_CR3","doi-asserted-by":"crossref","unstructured":"Qiang Ding, Qin Ding, Perrizo W. Decision tree classification of spatial data streams using Peano count trees. In Proc. ACM Symposium on Applied Computing (SAC\u201902), Madrid, Spain, March 2002, pp.413\u2013417.","DOI":"10.1145\/508791.508870"},{"key":"9084_CR4","doi-asserted-by":"crossref","unstructured":"Guha S, Mishra N, Motwani R, O\u2019Callaghan L. Clustering data streams. In Proc. IEEE FOCS, 41st Annual Symposium on Foundations of Computer Science, Redondo Beach, CA, USA, 2000, pp.359\u2013366.","DOI":"10.1109\/SFCS.2000.892124"},{"key":"9084_CR5","doi-asserted-by":"crossref","unstructured":"Moses Charikar, Liadan O\u2019Callaghan, Rina Panigrahy. Better streaming algorithms for clustering problems. In Proc. the Thirty-Fifth Annual ACM Symposium on Theory of Computing, San Diego, CA, USA, 2003, pp.30\u201339.","DOI":"10.1145\/780547.780548"},{"key":"9084_CR6","unstructured":"L O\u2019Cllaghan, Nina Mishra, Adam Meyerson. Streaming-data algorithms for high-quality clustering. In Proc. ICDE\u201902, San Jose, CA, USA, 2002, pp.685\u2013694."},{"key":"9084_CR7","doi-asserted-by":"crossref","unstructured":"Ordonez C. Clustering binary data streams with K-means. In Proc. the 8th ACM SIGMOD Workshop on Research Issues in Data Mining and Knowledge Discovery, San Diego, CA, USA, 2003, pp.12\u201319.","DOI":"10.1145\/882082.882087"},{"key":"9084_CR8","doi-asserted-by":"crossref","unstructured":"Aggarwal C, Han J, Wang J, Yu P S. A framework for clustering evolving data streams. In Proc. the 29th VLDB Conference, Berlin, Germany, 2003, pp.81\u201392.","DOI":"10.1016\/B978-012722442-8\/50016-1"},{"issue":"5","key":"9084_CR9","doi-asserted-by":"crossref","first-page":"834","DOI":"10.1360\/crad20060510","volume":"43","author":"Xiaoyun Zhou","year":"2006","unstructured":"Xiaoyun Zhou, Zhihui Su, Baili Zhang, Yidong Yang. An efficient discovering and maintenance algorithm of subspace clustering over high dimensional data streams. Journal of Computer Research and Development, 2006, 43(5): 834\u2013840.","journal-title":"Journal of Computer Research and Development"},{"issue":"3","key":"9084_CR10","first-page":"502","volume":"40","author":"Jun Xuli","year":"2006","unstructured":"Xuli Jun, Xiekang Lin, Xu Hong. Discovering frequent itemsets over data streams. Journal of Shanghai Jiaotong University, 2006, 40(3): 502\u2013506.","journal-title":"Journal of Shanghai Jiaotong University"},{"key":"9084_CR11","doi-asserted-by":"crossref","unstructured":"Chang J H, Lee W S. Finding recent frequent itemsets adaptively over online data streams. In Proc. KDD-2003, 2003, Washington DC, USA, pp.487\u2013492.","DOI":"10.1145\/956750.956807"},{"issue":"3","key":"9084_CR12","first-page":"502","volume":"40","author":"Xu Lijun","year":"2006","unstructured":"Lijun Xu, Kanglin Xie, Hong Xu. Discovering frequent itemsets over data streams. Journal of Shanghai Jiaotong University, Washington DC, USA, 2006, 40(3): 502\u2013506.","journal-title":"Journal of Shanghai Jiaotong University, Washington DC, USA"},{"issue":"3","key":"9084_CR13","doi-asserted-by":"crossref","first-page":"251","DOI":"10.1177\/0165551506068179","volume":"33","author":"Mao Guojun","year":"2007","unstructured":"Guojun Mao, Xindong Wu, Xingquan Zhu, Gong Chen, Chunnian Liu. Mining maximal frequent itemsets from data streams. Journal of Information Science, 2007, 33(3): 251\u2013262.","journal-title":"Journal of Information Science"},{"key":"9084_CR14","doi-asserted-by":"crossref","unstructured":"Gong Chen, Xindong Wu, Xingquan Zhu. Sequential pattern mining in multiple streams. In Proc. ICDM\u201905, Houston, TX, USA, 2005, pp.585\u2013588.","DOI":"10.1109\/ICDM.2005.130"},{"issue":"1","key":"9084_CR15","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1007413323501","volume":"29","author":"P E Utgoff","year":"1997","unstructured":"Utgoff P E, Berkman N C, Clouse J A. Decision tree induction based on efficient tree restructuring. Machine Learning, 1997, 29(1): 5\u201344.","journal-title":"Machine Learning"},{"issue":"3","key":"9084_CR16","first-page":"231","volume":"24","author":"D Kalles","year":"1996","unstructured":"Kalles D, Morris T. Efficient incremental induction of decision trees. Machine Learning, 1996, 24(3): 231\u2013242.","journal-title":"Machine Learning"},{"key":"9084_CR17","doi-asserted-by":"crossref","unstructured":"Fan W, Wang H, Yu P S, Ma S. Is random model better? On its accuracy and efficiency. In Proc. ICDM\u201903, Melbourne, FL, USA, 2003, pp.51\u201358.","DOI":"10.1109\/ICDM.2003.1250902"},{"key":"9084_CR18","doi-asserted-by":"crossref","first-page":"13","DOI":"10.1080\/01621459.1963.10500830","volume":"58","author":"W Hoeffding","year":"1963","unstructured":"Hoeffding W. Probability inequalities for sums of bounded random variables. Journal of the American Statistical Association, 1963, 58: 13\u201330.","journal-title":"Journal of the American Statistical Association"},{"key":"9084_CR19","unstructured":"Maron O, Moore A. Hoeffding Races: Accelerating Model Selection Search for Classification and Function Approximation. Advances in Neural Information Processing Systems, Cowan J D, Tesauro G, Alspector J (eds.), San Mato: Morgan Kaufmann, CA, 1994."},{"issue":"7","key":"9084_CR20","doi-asserted-by":"crossref","first-page":"1545","DOI":"10.1162\/neco.1997.9.7.1545","volume":"9","author":"Y Amit","year":"1997","unstructured":"Amit Y, Geman D. Shape quantization and recognition with randomized trees. Neural Computation, 1997, 9(7): 1545\u20131588.","journal-title":"Neural Computation"},{"issue":"8","key":"9084_CR21","doi-asserted-by":"crossref","first-page":"832","DOI":"10.1109\/34.709601","volume":"20","author":"Ho Tin Kam","year":"1998","unstructured":"Tin Kam Ho. The random subspace method for constructing decision forests. IEEE Trans. Pattern Analysis and Machine Intelligence, Aug. 1998, 20(8): 832\u2013844.","journal-title":"IEEE Trans. Pattern Analysis and Machine Intelligence"},{"key":"9084_CR22","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1007\/3-540-45014-9_1","volume-title":"Ensemble Methods in Machine Learning. First International Workshop on Multiple Classifier Systems","author":"T G Dietterich","year":"2000","unstructured":"Dietterich T G. Ensemble Methods in Machine Learning. First International Workshop on Multiple Classifier Systems, Kittler J, Roli F (eds.), New York: Springer Verlag, 2000, pp.1\u201315."},{"issue":"2","key":"9084_CR23","doi-asserted-by":"crossref","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T G Dietterich","year":"2000","unstructured":"Dietterich T G. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 2000, 40(2): 139\u2013157.","journal-title":"Machine Learning"},{"issue":"1","key":"9084_CR24","doi-asserted-by":"crossref","first-page":"5","DOI":"10.1023\/A:1010933404324","volume":"45","author":"Leo Breiman","year":"2001","unstructured":"Leo Breiman. Random forests. Machine Learning, 2001, 45(1): 5\u201332.","journal-title":"Machine Learning"},{"key":"9084_CR25","doi-asserted-by":"crossref","unstructured":"Liu T F, Ting K M, Fan W. Maximizing tree diversity by building complete-random decision trees. In Proc. the Ninth Pacific-Asia Conference on Knowledge Discovery and Data Mining, Hanoi, Vietnam, May 2005, pp.605\u2013610.","DOI":"10.1007\/11430919_70"},{"key":"9084_CR26","unstructured":"http:\/\/kdd.ics.uci.edu\/databases\/kddcup99\/kddcup99.html ."},{"key":"9084_CR27","unstructured":"Blake C, Keogh E, Merz C. UCI repository of machine learning databases, 1998, http:\/\/www.ics.uci.edu\/~mlearn\/MLRepository.html ."}],"container-title":["Journal of Computer Science and Technology"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9084-9.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s11390-007-9084-9\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s11390-007-9084-9","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,21]],"date-time":"2025-01-21T01:15:41Z","timestamp":1737422141000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s11390-007-9084-9"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2007,9]]},"references-count":27,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2007,9]]}},"alternative-id":["9084"],"URL":"https:\/\/doi.org\/10.1007\/s11390-007-9084-9","relation":{},"ISSN":["1000-9000","1860-4749"],"issn-type":[{"value":"1000-9000","type":"print"},{"value":"1860-4749","type":"electronic"}],"subject":[],"published":{"date-parts":[[2007,9]]}}}