Item Infomation


Title: Swarm Decision Table and Ensemble Search Methods in Fog Computing Environment: Case of Day-ahead Prediction of Building Energy Demands Using IoT Sensors
Authors: Li, Tengyue
Participants: Fong, Simon
Li, Xuqi
Lu, ZhiHui
Gandomi, Amir H.
Issue Date: 2020
Publisher: IEEE Xplore
Series/Report no.: IEEE Internet of Things Journal ( Volume: 7, Issue: 3, March 2020)
Abstract: Building energy demand prediction (BEDP) concerns sensing the environment using the Internet of Things (IoT), making seamless decisions and responding and controlling certain devices automatically, intelligently and quickly. Typically, BEDP application can be empowered by Fog computing where the sensed data are processed at the edge nodes rather than in a central Cloud. The challenge is that in this decentralized IoT environment, the machine learning algorithm implemented at the Fog node must learn a model from the incoming data accurately and fast. Which type of incremental learning algorithms, combined with traditional or swarm types of stochastic feature selection methods, are more suitable for BEDP? In this article this topic is investigated in detail by introducing a new incremental learning model, the Swarm Decision Table (SDT) in comparison with the classical decision tree. Simulation experiments using an empirical energy consumption dataset that represent a typical IoTconnected BEDP scenario are tested, and the SDT shows superior results in terms of accuracy and time, demonstrating it as a suitable machine learning candidate in a Fog computing environment.
URI: http://tailieuso.tlu.edu.vn/handle/DHTL/10468
Source: https://doi.org/10.1109/JIOT.2019.2958523
Appears in Collections:Tài liệu hỗ trợ nghiên cứu khoa học
ABSTRACTS VIEWS

42

VIEWS & DOWNLOAD

12

Files in This Item:
Thumbnail
  • D10468.pdf
      Restricted Access
    • Size : 3,22 MB

    • Format : Adobe PDF

  • Bạn đọc là cán bộ, giáo viên, sinh viên của Trường Đại học Thuỷ Lợi cần đăng nhập để Xem trực tuyến/Tải về



    Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.