{"id":{"repo_id":"queens","oai_identifier":"oai:queensu.scholaris.ca:1974/1321"},"canonical_url":"https://search.dev.ndltd.org/etd/queens/oai:queensu.scholaris.ca:1974/1321","repository":{"repo_id":"queens","name":"Queens University","base_url":"https://qspace.library.queensu.ca/server/oai/request"},"display":{"title":"Streaming Random Forests","abstract":"Recent research addresses the problem of data-stream mining to deal with applications that require processing huge amounts of data such as sensor data analysis and financial applications. Data-stream mining algorithms incorporate special provisions to meet the requirements of stream-management systems, that is stream algorithms must be online and incremental, processing each data record only once (or few times); adaptive to distribution changes; and fast enough to accommodate high arrival rates. We consider the problem of data-stream classification, introducing an online and incremental stream-classification ensemble algorithm, Streaming Random Forests, an extension of the Random Forests algorithm by Breiman, which is a standard classification algorithm. Our algorithm is designed to handle multi-class classification problems. It is able to deal with data streams having an evolving nature and a random arrival rate of training/test data records. The algorithm, in addition, automatically adjusts its parameters based on the data seen so far. Experimental results on real and synthetic data demonstrate that the algorithm gives a successful behavior. Without losing classification accuracy, our algorithm is able to handle multi-class problems for which the underlying class boundaries drift, and handle the case when blocks of training records are not big enough to build/update the classification model.","abstract_html":"Recent research addresses the problem of data-stream mining to deal with applications that require processing huge amounts of data such as sensor data analysis and financial applications. Data-stream mining algorithms incorporate special provisions to meet the requirements of stream-management systems, that is stream algorithms must be online and incremental, processing each data record only once (or few times); adaptive to distribution changes; and fast enough to accommodate high arrival rates. We consider the problem of data-stream classification, introducing an online and incremental stream-classification ensemble algorithm, Streaming Random Forests, an extension of the Random Forests algorithm by Breiman, which is a standard classification algorithm. Our algorithm is designed to handle multi-class classification problems. It is able to deal with data streams having an evolving nature and a random arrival rate of training/test data records. The algorithm, in addition, automatically adjusts its parameters based on the data seen so far. Experimental results on real and synthetic data demonstrate that the algorithm gives a successful behavior. Without losing classification accuracy, our algorithm is able to handle multi-class problems for which the underlying class boundaries drift, and handle the case when blocks of training records are not big enough to build/update the classification model.","abstract_has_math":false,"creators":["Abdulsalam, Hanady"],"institution":null,"degree_name":null,"degree_level":null,"degree_discipline":null,"degree_department":"Computing","school":null,"contributors":[],"advisors":["Martin, Patrick","Skillicorn, B. David"],"committee_chairs":[],"committee_members":[],"year":2008,"date_issued":"2008-07-16T17:14:17Z","date_published":"2008-07-16T17:14:17Z","updated_at":"2026-07-27T20:35:25Z","subjects":["Data mining","Streams","Classification algorithms","Streaming algorithms"],"languages":["eng"],"rights":[],"rights_urls":[],"identifier_entries":[]},"links":{"outbound_url":"http://hdl.handle.net/1974/1321","outbound_label":"Handle","outbound_source":"dc:identifier.uri"},"metadata_groups":[{"id":"people","label":"People","entries":[{"key":"dc:contributor.department","label":"Department","values":["Computing"]},{"key":"dc:contributor.supervisor","label":"Supervisor","values":["Martin, Patrick","Skillicorn, B. David"]},{"key":"dc:creator","label":"Author","values":["Abdulsalam, Hanady"]}]},{"id":"academic_context","label":"Academic Context","entries":[{"key":"dc:date","label":"Dc Date","values":["2008-07-15 16:12:33.221"]},{"key":"dc:date.accessioned","label":"Dc Date Accessioned","values":["2008-07-16T17:14:17Z"]},{"key":"dc:date.available","label":"Dc Date Available","values":["2008-07-16T17:14:17Z"]},{"key":"dc:date.issued","label":"Date","values":["2008-07-16T17:14:17Z"]},{"key":"dc:type","label":"Dc Type","values":["thesis"]}]},{"id":"subjects_keywords","label":"Subjects and Keywords","entries":[{"key":"dc:subject","label":"Dc Subject","values":["Data mining","Streams","Classification algorithms","Streaming algorithms"]}]},{"id":"language_rights","label":"Language and Rights","entries":[{"key":"dc:language.iso","label":"Language (ISO)","values":["eng"]}]},{"id":"identifiers","label":"Identifiers","entries":[{"key":"dc:identifier.uri","label":"Identifier URI","values":["http://hdl.handle.net/1974/1321"]}]},{"id":"additional","label":"Additional Metadata","entries":[{"key":"dc:description","label":"Description","values":["Thesis (Ph.D, Computing) -- Queen's University, 2008-07-15 16:12:33.221"]},{"key":"dc:description.abstract","label":"Abstract","values":["Recent research addresses the problem of data-stream mining to deal with applications that require processing huge amounts of data such as sensor data analysis and financial applications. Data-stream mining algorithms incorporate special provisions to meet the requirements of stream-management systems, that is stream algorithms must be online and incremental, processing each data record only once (or few times); adaptive to distribution changes; and fast enough to accommodate high arrival rates. We consider the problem of data-stream classification, introducing an online and incremental stream-classification ensemble algorithm, Streaming Random Forests, an extension of the Random Forests algorithm by Breiman, which is a standard classification algorithm. Our algorithm is designed to handle multi-class classification problems. It is able to deal with data streams having an evolving nature and a random arrival rate of training/test data records. The algorithm, in addition, automatically adjusts its parameters based on the data seen so far. Experimental results on real and synthetic data demonstrate that the algorithm gives a successful behavior. Without losing classification accuracy, our algorithm is able to handle multi-class problems for which the underlying class boundaries drift, and handle the case when blocks of training records are not big enough to build/update the classification model."]},{"key":"dc:description.degree","label":"Dc Description Degree","values":["PhD"]},{"key":"dc:format.mimetype","label":"Dc Format Mimetype","values":["application/pdf"]},{"key":"dc:title","label":"Title","values":["Streaming Random Forests"]}]}],"canonical_facts":{"dc:contributor.department":["Computing"],"dc:contributor.supervisor":["Martin, Patrick","Skillicorn, B. David"],"dc:creator":["Abdulsalam, Hanady"],"dc:date":["2008-07-15 16:12:33.221"],"dc:date.accessioned":["2008-07-16T17:14:17Z"],"dc:date.available":["2008-07-16T17:14:17Z"],"dc:date.issued":["2008-07-16T17:14:17Z"],"dc:description":["Thesis (Ph.D, Computing) -- Queen's University, 2008-07-15 16:12:33.221"],"dc:description.abstract":["Recent research addresses the problem of data-stream mining to deal with applications that require processing huge amounts of data such as sensor data analysis and financial applications. Data-stream mining algorithms incorporate special provisions to meet the requirements of stream-management systems, that is stream algorithms must be online and incremental, processing each data record only once (or few times); adaptive to distribution changes; and fast enough to accommodate high arrival rates. We consider the problem of data-stream classification, introducing an online and incremental stream-classification ensemble algorithm, Streaming Random Forests, an extension of the Random Forests algorithm by Breiman, which is a standard classification algorithm. Our algorithm is designed to handle multi-class classification problems. It is able to deal with data streams having an evolving nature and a random arrival rate of training/test data records. The algorithm, in addition, automatically adjusts its parameters based on the data seen so far. Experimental results on real and synthetic data demonstrate that the algorithm gives a successful behavior. Without losing classification accuracy, our algorithm is able to handle multi-class problems for which the underlying class boundaries drift, and handle the case when blocks of training records are not big enough to build/update the classification model."],"dc:description.degree":["PhD"],"dc:format.mimetype":["application/pdf"],"dc:identifier.uri":["http://hdl.handle.net/1974/1321"],"dc:language.iso":["eng"],"dc:subject":["Data mining","Streams","Classification algorithms","Streaming algorithms"],"dc:title":["Streaming Random Forests"],"dc:type":["thesis"]},"updated_at":"2026-07-27T20:35:25Z"}