{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T19:56:01Z","timestamp":1771703761423,"version":"3.50.1"},"reference-count":48,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"2","license":[{"start":{"date-parts":[[2015,2,1]],"date-time":"2015-02-01T00:00:00Z","timestamp":1422748800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2015,2]]},"DOI":"10.1109\/tkde.2014.2298018","type":"journal-article","created":{"date-parts":[[2014,1,31]],"date-time":"2014-01-31T17:40:24Z","timestamp":1391190024000},"page":"461-474","source":"Crossref","is-referenced-by-count":45,"title":["E-Tree: An Efficient Indexing Structure for Ensemble Models on Data Streams"],"prefix":"10.1109","volume":"27","author":[{"given":"Peng","family":"Zhang","sequence":"first","affiliation":[]},{"given":"Chuan","family":"Zhou","sequence":"additional","affiliation":[]},{"given":"Peng","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Byron J.","family":"Gao","sequence":"additional","affiliation":[]},{"given":"Xingquan","family":"Zhu","sequence":"additional","affiliation":[]},{"given":"Li","family":"Guo","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"500","article-title":"Hilbert R-Tree: An Improved R-Tree Using Fractals","author":"kamel","year":"1994","journal-title":"Proc 20th Int l Conf Very Large Data Bases (VLDB)"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2011.63"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007702"},{"key":"ref32","article-title":"Speeding-Up Hoeffding-Based Regression Trees with Options","author":"ikonomovska","year":"2011","journal-title":"Proc 28th Int?l Conf Machine Learning (ICML)"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2001.989572"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1145\/347090.347107"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1007\/s10115-010-0342-8"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1145\/1376616.1376633"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.14778\/1453856.1453906"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.14778\/1687627.1687633"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557041"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1996.492202"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2010.125"},{"key":"ref12","first-page":"1","article-title":"Active Learning from Stream Data Using Optimal Weight Classifier Ensemble","volume":"40","author":"zhu","year":"2010","journal-title":"IEEE Trans System Man and Cybernetics Part B Cybernetics"},{"key":"ref13","author":"quinlan","year":"1993","journal-title":"C4 5 Programs for Machine Learning"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/1553374.1553462"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/BF01231602"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1145\/602259.602266"},{"key":"ref17","article-title":"The R <formula formulatype=\"inline\"><tex Notation=\"TeX\">$^\\ast$<\/tex><mathgraphic graphicformat=\"GIF\" fileref=\"peng-ieq446-2298018.gif\" \/> <\/formula>-Tree: An Efficient and Robust Access Method for Points and Rectangles","author":"sellis","year":"1990","journal-title":"Proc ACM SIGMOD Int?l Conf Management of Data (SIGMOD)"},{"key":"ref18","article-title":"The R <formula formulatype=\"inline\"><tex Notation=\"TeX\">$^+$<\/tex><mathgraphic graphicformat=\"GIF\" fileref=\"peng-ieq447-2298018.gif\" \/> <\/formula>-tree: A Dynamic Index for Multi-Dimensional Objects","author":"sellis","year":"1987","journal-title":"Proc 13th Int Conf Very Large Data Bases (VLDB)"},{"key":"ref19","article-title":"M-Tree: An Efficient Access Method for Similarity Search in Metric Spaces","author":"ciaccia","year":"1997","journal-title":"Proc 23rd Intl Conf on Very Large Data Bases (VLDB)"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.1999.754979"},{"key":"ref4","article-title":"Issues in Evaluation of Stream Learning Algorithms","author":"gao","year":"2009","journal-title":"Proc 15th ACM SIGKDD Int?l Conf Knowledge Discovery and Data Mining (KDD)"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1109\/69.842247"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.61"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1145\/502512.502568"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1145\/304182.304184"},{"key":"ref5","article-title":"Mining Concept-Drifting Data Streams Using Ensemble Classifiers","author":"fan","year":"2003","journal-title":"Proc Ninth ACM SIGKDD Int?l Conf Knowledge Discovery and Data Mining (KDD)"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1102351.1102408"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1016\/j.dss.2010.11.004"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/2020408.2020442"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/ICDM.2007.96"},{"key":"ref1","author":"aggarwal","year":"2006","journal-title":"Data Streams Models and Algorithms"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICCVW.2009.5457447"},{"key":"ref20","article-title":"Multi-Dimensional Access Methods: Trees have Grown Everywhere","author":"sellis","year":"1997","journal-title":"Proc 23rd Intl Conf on Very Large Data Bases (VLDB)"},{"key":"ref45","article-title":"New Options for Hoeffding Trees","author":"pfahringer","year":"2009","journal-title":"Proc Australian Joint Conf Artificial Intelligence"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611972757.29"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1007568.1007615"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1145\/1989323.1989398"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1007\/BF01585863"},{"key":"ref42","first-page":"1315","article-title":"Ensemble Pruning via Semi-Definite Programming","volume":"7","author":"zhang","year":"2006","journal-title":"J Machine Learning Research"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2004.13"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1145\/38714.38758"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/237661.237705"},{"key":"ref44","article-title":"Option Decision Trees with Majority Votes","author":"kohavi","year":"1997","journal-title":"Proc Int?l Conf Machine Learning (ICML)"},{"key":"ref26","year":"0"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1145\/1835804.1835914"},{"key":"ref25","year":"0"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/6998123\/06709813.pdf?arnumber=6709813","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T16:27:53Z","timestamp":1642004873000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6709813\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,2]]},"references-count":48,"journal-issue":{"issue":"2"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2298018","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2015,2]]}}}