Density-Based Data Selection and Management for Edge Computing

被引:2
|
作者
Oikawa, Hiroki [1 ]
Kondo, Masaaki [1 ]
机构
[1] Univ Tokyo, Grad Sch Informat Sci & Technol, Tokyo, Japan
来源
2021 IEEE INTERNATIONAL CONFERENCE ON PERVASIVE COMPUTING AND COMMUNICATIONS (PERCOM) | 2021年
关键词
edge computing; data management; REPRESENTATIVE SUBSET; INTERNET; NETWORK;
D O I
10.1109/PERCOM50583.2021.9439127
中图分类号
TP [自动化技术、计算机技术];
学科分类号
0812 ;
摘要
Wide spread of IoT devices has made it possible to acquire enormous amounts of realtime sensor information. Due to the explosive increase in the sensing data volume, it becomes difficult to collect and process all the data in one central place. On one hand, storing and processing data on edge devices, so called edge computing, is becoming important. On the other hand, edge devices usually have only limited computing and memory resources, and hence it is not practical to process and save all the acquired data. There is a great demand of effectively selecting data to process on an edge device or to transfer it to a cloud server. In this paper, we propose an efficient density-based data selection and management method called O-D2M by which edge devices store the data representing inherent data distribution. We use a low cost graph algorithm to analyze input data trend and its density. We evaluate effectiveness of the proposed O-D2M comparing to other methods in terms of the accuracy of machine learning models trained by the selected data. Throughout the evaluation, we confirm that O-D2M obtains higher accuracy and lower computation cost while it can reduce the amount of data to be processed or transferred by up to 20 points.
引用
收藏
页数:11
相关论文
共 50 条
  • [32] A Blockchain-Based Trusted Data Management Scheme in Edge Computing
    Ma Zhaofeng
    Wang Xiaochang
    Jain, Deepak Kumar
    Khan, Haneef
    Gao Hongmin
    Wang Zhen
    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS, 2020, 16 (03) : 2013 - 2021
  • [33] DRE: density-based data selection with entropy for adversarial-robust deep learning models
    Yuejun Guo
    Qiang Hu
    Maxime Cordy
    Michail Papadakis
    Yves Le Traon
    Neural Computing and Applications, 2023, 35 : 4009 - 4026
  • [34] Feature selection using feature dissimilarity measure and density-based clustering: Application to biological data
    Debarka Sengupta
    Indranil Aich
    Sanghamitra Bandyopadhyay
    Journal of Biosciences, 2015, 40 : 721 - 730
  • [35] DRE: density-based data selection with entropy for adversarial-robust deep learning models
    Guo, Yuejun
    Hu, Qiang
    Cordy, Maxime
    Papadakis, Michail
    Le Traon, Yves
    NEURAL COMPUTING & APPLICATIONS, 2023, 35 (05): : 4009 - 4026
  • [36] Feature selection using feature dissimilarity measure and density-based clustering: Application to biological data
    Sengupta, Debarka
    Aich, Indranil
    Bandyopadhyay, Sanghamitra
    JOURNAL OF BIOSCIENCES, 2015, 40 (04) : 721 - 730
  • [37] Enhancing density-based data reduction using entropy
    Huang, D.
    Chow, Tommy W. S.
    NEURAL COMPUTATION, 2006, 18 (02) : 470 - 495
  • [38] Novel Density-Based Clustering Algorithms for Uncertain Data
    Zhang, Xianchao
    Liu, Han
    Zhang, Xiaotong
    Liu, Xinyue
    PROCEEDINGS OF THE TWENTY-EIGHTH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2014, : 2191 - 2197
  • [39] Density-Based Local Outlier Detection on Uncertain Data
    Cao, Keyan
    Shi, Lingxu
    Wang, Guoren
    Han, Donghong
    Bai, Mei
    WEB-AGE INFORMATION MANAGEMENT, WAIM 2014, 2014, 8485 : 67 - 71
  • [40] Efficient layered density-based clustering of categorical data
    Andreopoulos, Bill
    An, Aijun
    Wang, Xiaogang
    Labudde, Dirk
    JOURNAL OF BIOMEDICAL INFORMATICS, 2009, 42 (02) : 365 - 376