Regularly Frequent Patterns Mining from Sensor Data Stream

Author(s):  
Md. Mamunur Rashid ◽  
Iqbal Gondal ◽  
Joarder Kamruzzaman
2010 ◽  
Vol 36 (5) ◽  
pp. 674-684 ◽  
Author(s):  
Feng WU ◽  
Yan ZHONG ◽  
Quan-Yuan WU

2013 ◽  
Vol 284-287 ◽  
pp. 3507-3511 ◽  
Author(s):  
Edgar Chia Han Lin

Due to the great progress of computer technology and mature development of network, more and more data are generated and distributed through the network, which is called data streams. During the last couple of years, a number of researchers have paid their attention to data stream management, which is different from the conventional database management. At present, the new type of data management system, called data stream management system (DSMS), has become one of the most popular research areas in data engineering field. Lots of research projects have made great progress in this area. Since the current DSMS does not support queries on sequence data, this project will study the issues related to two types of data. First, we will focus on the content filtering on single-attribute streams, such as sensor data. Second, we will focus on multi-attribute streams, such as video films. We will discuss the related issues such as how to build an efficient index for all queries of different streams and the corresponding query processing mechanisms.


2012 ◽  
Vol 433-440 ◽  
pp. 4457-4462 ◽  
Author(s):  
Jun Shan Tan ◽  
Zhu Fang Kuang ◽  
Guo Gui Yang

The design of synopses structure is an important issue of frequent patterns mining over data stream. A data stream synopses structure FPD-Graph which is based on directed graph is proposed in this paper. The FPD-Graph contains list head node FPDG-Head and list node FPDG-Node. The operations of FPD-Graph consist of insert operation and deletion operation. A frequent pattern mining algorithm DGFPM based on sliding window over data stream is proposed in this paper. The IBM synthesizes data generation which output customers shopping a data are adopted as experiment data. The DGFPM algorithm not only has high precision for mining frequent patterns, but also has low processing time.


2018 ◽  
Vol 76 (6) ◽  
pp. 4040-4040
Author(s):  
Shobharani Pacha ◽  
Suresh Ramalingam Murugan ◽  
R. Sethukarasi

2014 ◽  
Vol 573 ◽  
pp. 543-548 ◽  
Author(s):  
K.P. Ramya ◽  
R. Chithra Devi ◽  
M.K. Revathi ◽  
P. Annapandi

Large number of application areas, like location-based services, transaction logs, sensor networks are qualified by uninterrupted data stream from many. Sensor data handling of continuous data needs to cover various issues, admitting the storage efficiency, processing throughput, bandwidth conception and secure transmission. This paper addresses the challenges by providing secure and efficient transmission of sensor data by embedding it over the inter-packet delays (IPDs). The embedding of sensor data within a host medium makes this technique reminiscent of watermarking. Interpolation technique is used to hide the sensor data into an image which is send to another node. By enforcing linear enlargement to interpolation-errors, a extremely effective reversible watermarking scheme is achieved, which can ensure high image quality without sacrificing embedding capacity. Time-Based flow watermarking technique is proposed, that avoids data degradation due to traditional watermarking. Sensor data is extracted effectively based on the inter-packet delays that minimizes the probability of decoding error. The outcome of the observation depicts that this system is scalable and highly resilient in sensor data.


Sign in / Sign up

Export Citation Format

Share Document