Stream Mining for Network Sensor Data Using Classification and Metaheuristic Techniques

Author(s):  
Hanin F. Kadham ◽  
Mehdi E. Manaa
2018 ◽  
Vol 9 (2) ◽  
pp. 69-79 ◽  
Author(s):  
Klemen Kenda ◽  
Dunja Mladenić

Abstract Background: Internet of Things (IoT), earth observation and big scientific experiments are sources of extensive amounts of sensor big data today. We are faced with large amounts of data with low measurement costs. A standard approach in such cases is a stream mining approach, implying that we look at a particular measurement only once during the real-time processing. This requires the methods to be completely autonomous. In the past, very little attention was given to the most time-consuming part of the data mining process, i.e. data pre-processing. Objectives: In this paper we propose an algorithm for data cleaning, which can be applied to real-world streaming big data. Methods/Approach: We use the short-term prediction method based on the Kalman filter to detect admissible intervals for future measurements. The model can be adapted to the concept drift and is useful for detecting random additive outliers in a sensor data stream. Results: For datasets with low noise, our method has proven to perform better than the method currently commonly used in batch processing scenarios. Our results on higher noise datasets are comparable. Conclusions: We have demonstrated a successful application of the proposed method in real-world scenarios including the groundwater level, server load and smart-grid data


2016 ◽  
Vol 5 (1) ◽  
pp. 8 ◽  
Author(s):  
Sajad Homayoun ◽  
Marzieh Ahmadzadeh

<p>Stream data is usually in vast volume, changing dynamically, possibly infinite, and containing multi-dimensional features. The attention towards data stream mining is increasing as regards to its presence in wide range of real-world applications, such as e-commerce, banking, sensor data and telecommunication records. Similar to data mining, data stream mining includes classification, clustering, frequent pattern mining etc. techniques; the special focus of this paper is on classification methods invented to handle data streams. Early methods of data stream classification needed all instances to be labeled for creating classifier models, but there are some methods (Semi-Supervised Learning and Active Learning) in which unlabeled data is employed as well as labeled data. In this paper, by focusing on ensemble methods, semi-supervised and active learning, a review on some state of the art researches is given.</p>


2015 ◽  
Vol 2015 ◽  
pp. 1-16 ◽  
Author(s):  
Simon Fong ◽  
Justin Liang ◽  
Iztok Fister ◽  
Iztok Fister ◽  
Sabah Mohammed

Human motion sensing technology gains tremendous popularity nowadays with practical applications such as video surveillance for security, hand signing, and smart-home and gaming. These applications capture human motions in real-time from video sensors, the data patterns are nonstationary and ever changing. While the hardware technology of such motion sensing devices as well as their data collection process become relatively mature, the computational challenge lies in the real-time analysis of these live feeds. In this paper we argue that traditional data mining methods run short of accurately analyzing the human activity patterns from the sensor data stream. The shortcoming is due to the algorithmic design which is not adaptive to the dynamic changes in the dynamic gesture motions. The successor of these algorithms which is known as data stream mining is evaluated versus traditional data mining, through a case of gesture recognition over motion data by using Microsoft Kinect sensors. Three different subjects were asked to read three comic strips and to tell the stories in front of the sensor. The data stream contains coordinates of articulation points and various positions of the parts of the human body corresponding to the actions that the user performs. In particular, a novel technique of feature selection using swarm search and accelerated PSO is proposed for enabling fast preprocessing for inducing an improved classification model in real-time. Superior result is shown in the experiment that runs on this empirical data stream. The contribution of this paper is on a comparative study between using traditional and data stream mining algorithms and incorporation of the novel improved feature selection technique with a scenario where different gesture patterns are to be recognized from streaming sensor data.


2009 ◽  
Author(s):  
Bradley M. Davis ◽  
Woodrow W. Winchester ◽  
Jason D. Zedlitz
Keyword(s):  

2018 ◽  
Vol 18 (1) ◽  
pp. 20-32 ◽  
Author(s):  
Jong-Min Kim ◽  
Jaiwook Baik

2020 ◽  
Vol 20 (4) ◽  
pp. 332-342
Author(s):  
Hyung Jun Park ◽  
Seong Hee Cho ◽  
Kyung-Hwan Jang ◽  
Jin-Woon Seol ◽  
Byung-Gi Kwon ◽  
...  

2020 ◽  
Vol 2020 (1) ◽  
pp. 91-95
Author(s):  
Philipp Backes ◽  
Jan Fröhlich

Non-regular sampling is a well-known method to avoid aliasing in digital images. However, the vast majority of single sensor cameras use regular organized color filter arrays (CFAs), that require an optical-lowpass filter (OLPF) and sophisticated demosaicing algorithms to suppress sampling errors. In this paper a variety of non-regular sampling patterns are evaluated, and a new universal demosaicing algorithm based on the frequency selective reconstruction is presented. By simulating such sensors it is shown that images acquired with non-regular CFAs and no OLPF can lead to a similar image quality compared to their filtered and regular sampled counterparts. The MATLAB source code and results are available at: http://github. com/PhilippBackes/dFSR


Sign in / Sign up

Export Citation Format

Share Document