AI Chat Paper
Note: Please note that the following content is generated by AMiner AI. SciOpen does not take any responsibility related to this content.
{{lang === 'zh_CN' ? '文章概述' : 'Summary'}}
{{lang === 'en_US' ? '中' : 'Eng'}}
Chat more with AI
Powered by AMiner. Clicking this button will take you away from SciOpen.
Home Tsinghua Science and Technology Article
PDF (1.6 MB)
Cite
EndNote(RIS) BibTeX
Collect
Submit Manuscript AI Chat Paper
Show Outline
Outline
Show full outline
Hide outline
Outline
Show full outline
Hide outline
Open Access

An Efficient Multidimensional Fusion Algorithm for IoT Data Based on Partitioning

Jin Zhou, Liang Hu, Feng Wang, Huimin Lu, Kuo Zhao( )
College of Computer Science and Technology, Jilin University, Changchun 130012, China
College of Software, Changchun University of Technology, Changchun 130012, China.
Show Author Information

Abstract

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.

Keywords

Internet of Thingsdata fusionmultidimensional datapartitioningrough set theory

References

[1]
ITU Strategy and Policy Unit (SPU), ITU internet reports 2005: The internet of things. Geneva: International Telecommunication Union (ITU), 2005.
[2]
O. Vermesan, M. Harrison, H. Vogt, K. Kalaboukas, M. Tomasella, K. Wouters, S. Gusmeroli, and S. Haller, Internet of things strategic research roadmap. EPoSS: European Technology Platform on Smart Systems Integration, 2009.
[3]
P. Barnaghi, W. Wang, C. Henson, and K. Taylor, Semantics for the Internet of Things: Early progress and back to the future, International Journal on Semantic Web and Information Systems, vol. 8, no. 1, pp. 1-21, 2012.
Crossref Google Scholar
[4]
C. C. Aggarwal, The Internet of Things: A survey and form the date-centric perspective, in Managing and Mining Sensor Data. New York, USA: Springer, 2013, pp. 383-428.
Crossref
[5]
Z. Pawlak, Rough sets and intelligent data analysis, Information Sciences, vol. 147, no. 124, pp. 1-12, 2002.
Crossref Google Scholar
[6]
Z. Pawlak, Rough sets theory and its applications, Journal of Communications and Information Technology, no. 3, pp. 7-10, Mar. 2002.
Google Scholar
[7]
M. Krysikiewicz, Rough set approach to incomplete information system, Information Sciences, vol. 112, nos. 1-4, pp. 39-49, 1998.
Crossref Google Scholar
[8]
L. Wald, Some terms of reference in data fusion, IEEE Transactions on Geosciences and Remote Sensing, vol. 37, no. 3, pp. 1190-1193, 1999.
Crossref Google Scholar
[9]
E. F. Nakamura, A. A. F. Loureiro, and A. C. Frery, Information fusion for wireless sensor networks: Methods, models, and classifications, ACM Computing Surveys, vol. 39, no. 3, pp. 1-55, 2007.
Crossref Google Scholar
[10]
M. Compton, P. Barnaghi, L. Bermudez, R. Garc¨ªa-Castro, O. Corcho, S. Cox, J. Graybeal, M. Hauswirth, C. Henson, A. Herzog, V. Huang, K. Janowicz, W. D. Kelsey, D. Le Phuoc, L. Lefort, M. Leggieri, H. Neuhaus, A. Nikolov, K. Page, A. Passant, A. Sheth, and K. Taylor, The SSN ontology of the W3C semantic sensor network incubator group, Journal of Web Semantics, vol. 17, pp. 25-32, 2012.
Crossref Google Scholar
[11]
C. Henson, A. Sheth, and K. Thirunarayan, Semantic perception: Converting sensory observations to abstractions, IEEE Internet Computing, vol. 16, no. 2, pp. 26-34, 2012.
Crossref Google Scholar
[12]
H. Patni, C. Henson, and A. Sheth, Linked sensor data, in Proc. 2010 International Symposium on Collaborative Technologies and Systems (CTS 2010), Chicago, USA, 2010, pp. 1-9.
Crossref
[13]
M. Rinne, S. Torma, and E. Nuutila, SPARQL-based applications for RDF-encoded sensor data, in Proc. 5th International Workshop on Semantic Sensor Networks 2012 (SSN12), Boston, Massachusetts, USA, 2012, pp. 81-96.
[14]
A. K. Joshi, P. Jain, P. Hitzler, P. Z. Yeh, K. Verma, A. P. Sheth, and M. Damova, Alignment-based querying of linked open data, in Proc. on the Move to Meaningful Internet Systems: OTM 2012, Confederated International Conferences: CoopIS, DOA-SVI, and ODBASE 2012, Rome, Italy, 2012, pp. 1-18.
Crossref
[15]
A. Rajaraman, J. Leskovec, and J. D. Ullman, Mining of Massive Datasets. Cambridge University Press, 2010.
Crossref
[16]
N. Pham and R. Pagh, A near-linear time approximation algorithm for angle-based outlier detection in high-dimensional Data, in Proc. 18th ACM SIGKDD International Conference on Knowledge Discovery and Data Mining (KDD’12), Beijing, China, 2012, pp. 877-885.
Crossref
[17]
S. Kahramanli, M. Hacibeyoglu, and A. Arslan, Attribute reduction by partitioning the minimized discernibility function, International Journal of Innovative Computing, Information and Control, Computer Research and Development, vol. 7, no. 5, pp. 2167-2186, 2011.
Google Scholar
[18]
E. Oren, S. Kotoulas, G. Anadiotis, R. Srebes, A. ten Teiji, and F. van Harmelen, Marvin: Distributed reasoning over large-scale semantic web data, Journal of Web Semantics, vol.7, no. 4, pp. 305-316, 2009.
Crossref Google Scholar
[19]
K. Thangavel and A. Pethalakshmi, Dimensionality reduction based on rough set theory: A review, Applied Soft Computing, vol. 1, no. 9, pp. 1-12, 2009.
Crossref Google Scholar
[20]
Y. Qian, J. Liang, W. Pedrycz, and C. Dang, Positive approximation: An accelerator for attribute reduction in rough set theory, Artificial Intelligence, vol. 174, nos. 9-10, pp. 597-618, 2010.
Crossref Google Scholar
[21]
D. Cao, X. Qiao, G. Judith, X. Li, and L. Meng, Mining data correlation from multi-faceted sensor data in the Internet of Things, China Communications, vol. 8, no. 1, pp. 132-138, 2011.
Google Scholar
Tsinghua Science and Technology
Volume 18 Issue 4,
August 2013
Pages 369-378
DOI: 10.1109/TST.2013.6574675
Cite this article:
Zhou J, Hu L, Wang F, et al. An Efficient Multidimensional Fusion Algorithm for IoT Data Based on Partitioning. Tsinghua Science and Technology, 2013, 18(4): 369-378. https://doi.org/10.1109/TST.2013.6574675

676

Views

19

Downloads

45

Crossref

N/A

Web of Science

52

Scopus

0

CSCD

Altmetrics
Received: 25 June 2013
Accepted: 05 July 2013
Published: 05 August 2013
© The author(s) 2013
Return