4.6 Article

An Efficient Multidimensional Fusion Algorithm for IoT Data Based on Partitioning

期刊

TSINGHUA SCIENCE AND TECHNOLOGY
卷 18, 期 4, 页码 369-378

出版社

TSINGHUA UNIV PRESS
DOI: 10.1109/TST.2013.6574675

关键词

Internet of Things; data fusion; multidimensional data; partitioning; rough set theory

资金

  1. National High-Tech Research and Development (863) Program of China [2011AA010101]
  2. National Natural Science Foundation of China [61103197, 61073009, 61240029]
  3. Science and Technology Key Project of Jilin Province [2011ZDGG007]
  4. Youth Foundation of Jilin Province of China [201101035]
  5. Fundamental Research Funds for the Central Universities of China [200903179]
  6. China Postdoctoral Science Foundation [2011M500611]
  7. Industrial Technology Research and Development Special Project of Jilin Province [2011006-9]
  8. National College Students' Innovative Training Program of China
  9. European Union Framework Program: MONICA Project [PIRSES-GA-2011-295222]

向作者/读者索取更多资源

The Internet of Things (IoT) implies a worldwide network of interconnected objects uniquely addressable, via standard communication protocols. The prevalence of IoT is bound to generate large amounts of multisource, heterogeneous, dynamic, and sparse data. However, IoT offers inconsequential practical benefits without the ability to integrate, fuse, and glean useful information from such massive amounts of data. Accordingly, preparing us for the imminent invasion of things, a tool called data fusion can be used to manipulate and manage such data in order to improve process efficiency and provide advanced intelligence. In order to determine an acceptable quality of intelligence, diverse and voluminous data have to be combined and fused. Therefore, it is imperative to improve the computational efficiency for fusing and mining multidimensional data. In this paper, we propose an efficient multidimensional fusion algorithm for IoT data based on partitioning. The basic concept involves the partitioning of dimensions (attributes), i.e., a big data set with higher dimensions can be transformed into certain number of relatively smaller data subsets that can be easily processed. Then, based on the partitioning of dimensions, the discernible matrixes of all data subsets in rough set theory are computed to obtain their core attribute sets. Furthermore, a global core attribute set can be determined. Finally, the attribute reduction and rule extraction methods are used to obtain the fusion results. By means of proving a few theorems and simulation, the correctness and effectiveness of this algorithm is illustrated.

作者

我是这篇论文的作者
点击您的名字以认领此论文并将其添加到您的个人资料中。

评论

主要评分

4.6
评分不足

次要评分

新颖性
-
重要性
-
科学严谨性
-
评价这篇论文

推荐

暂无数据
暂无数据