An efficient data extraction framework for mining wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2016
- Type: Text , Conference paper
- Relation: 23rd International Conference, ICONIP 2016; Kyoto, Japan; 16th-21st October 2016; published in Neural Information Processing, Part III (Lecture Notes in Computer Science series) Vol. 9949, p. 491-498
- Full Text:
- Reviewed:
- Description: Behavioral patterns for sensors have received a great deal of attention recently due to their usefulness in capturing the temporal relations between sensors in wireless sensor networks. To discover these patterns, we need to collect the behavioral data that represents the sensor's activities over time from the sensor database that attached with a well-equipped central node called sink for further analysis. However, given the limited resources of sensor nodes, an effective data collection method is required for collecting the behavioral data efficiently. In this paper, we introduce a new framework for behavioral patterns called associated-correlated sensor patterns and also propose a MapReduce based new paradigm for extract data from the wireless sensor network by distributed away. Extensive performance study shows that the proposed method is capable to reduce the data size almost 50% compared to the centralized model.
A mapreduce based technique for mining behavioral patterns from sensor data
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Conference paper
- Relation: 22nd International Conference on Neural Information Processing, ICONIP 2015; Istanbul, Turkey; 9th-12th November 2015 Vol. 9492, p. 145-153
- Full Text: false
- Reviewed:
- Description: WSNs generate a large amount of data in the form of streams, and temporal regularity in occurrence behavior is considered as an important measure for assessing the importance of patterns in WSN data. A frequent sensor pattern that occurs after regular intervals in WSNs is called regularly frequent sensor patterns (RFSPs). Existing RFSPs techniques assume that the data structure of the mining task is small enough to fit in the main memory of a processor. However, given the emergence of the Internet of Things (IoT), WSNs in future will generate huge volume of data, which means such an assumption does not hold any longer. To overcome this, a distributed solution using MapReduce model has not yet been explored extensively. Since MapReduce is becoming the de-facto model for computation on large data, an efficient RFSPs mining algorithm on this model is likely to provide a highly effective solution. In this work, we propose a regularly frequent sensor patterns mining algorithm called RFSP-H which uses MapReduce based framework. Extensive performance analyses show that our technique is significantly time efficient in finding regularly frequent sensor patterns. © Springer International Publishing Switzerland 2015.
Condition monitoring through mining fault frequency from machine vibration data
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Conference paper
- Relation: International Joint Conference on Neural Networks, IJCNN 2015; Killarney; Ireland; 12th-17th July 2015 p. 1-8
- Full Text: false
- Reviewed:
- Description: In machine health monitoring, fault frequency identification of potential bearing faults is very important and necessary when it comes to reliable operation of a given system. In this paper, we proposed a data mining based scheme for fault frequency identification from the bearing data. In this scheme, we propose a compact tree called SAP-tree (sliding window associated frequency pattern tree) which is built upon the analysis of frequency domain characteristics of machine vibration data. Using this tree we devised a sliding window-based associated frequency pattern mining technique, called SAP algorithm, that mines for the frequencies relevant to machine fault. Our SAP algorithm can mine associated frequency patterns in the current window with frequent pattern (FP)-growth like pattern-growth method and used these patterns to identify the fault frequency. Extensive experimental analyses show that our technique is very efficient in identifying fault frequency over vibration data stream.
A novel algorithm for mining behavioral patterns from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Conference paper
- Relation: 2014 International Joint Conference on Neural Networks, IJCNN 2014; Beijing, China; 6th-11th July 2014 p. 1-7
- Full Text: false
- Reviewed:
- Description: Due to recent advances in wireless sensor networks (WSNs) and their ability to generate huge amount of data in the form of streams, knowledge discovery techniques have received a great deal of attention to extract useful knowledge regarding the underlying network. Traditionally sensor association rules measure occurrence frequency of patterns. However, these rules often generate a huge number of rules, most of which are non-informative or fail to reflect the true correlation among data objects. In this paper, we propose a new type of sensor behavioral pattern called associated sensor patterns that captures association-like co-occurrences and the strong temporal correlations implied by such co-occurrences in the sensor data. We also propose a novel tree structure called as associated sensor pattern tree (ASPT) and a mining algorithm, associated sensor pattern (ASP) which facilitates frequent pattern (FP) growth-based technique to generate all associated sensor patterns from WSN data with only one scan over the sensor database. Extensive performance study shows that our algorithm is very efficient in finding associated sensor patterns than the existing significant algorithms.
A technique for parallel share-frequent sensor pattern mining from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Conference paper
- Relation: 14th Annual International Conference on Computational Science, ICCS 2014; Cairns, Australia; 10th-12th June 2014; published in Procedia Computer Science p. 124-133
- Full Text:
- Reviewed:
- Description: WSNs generate huge amount of data in the form of streams and mining useful knowledge from these streams is a challenging task. Existing works generate sensor association rules using occurrence frequency of patterns with binary frequency (either absent or present) or support of a pattern as a criterion. However, considering the binary frequency or support of a pattern may not be a sufficient indicator for finding meaningful patterns from WSN data because it only reflects the number of epochs in the sensor data which contain that pattern. The share measure of sensorsets could discover useful knowledge about numerical values associated with sensor in a sensor database. Therefore, in this paper, we propose a new type of behavioral pattern called share-frequent sensor patterns by considering the non-binary frequency values of sensors in epochs. To discover share-frequent sensor patterns from sensor dataset, we propose a novel parallel technique. In this technique, we develop a novel tree structure, called parallel share-frequent sensor pattern tree (PShrFSP-tree) that is constructed at each local node independently, by capturing the database contents to generate the candidate patterns using a pattern growth technique with a single scan and then merges the locally generated candidate patterns at the final stage to generate global share-frequent sensor patterns. Comprehensive experimental results show that our proposed model is very efficient for mining share-frequent patterns from WSN data in terms of time and scalability.
ACSP-Tree: A tree structure for mining behavioral patterns from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Conference paper
- Relation: IEEE Conference on Local Computer Networks (LCN 2013) (21 October 2013 to 24 October 2013) p. 691-694
- Full Text: false
- Reviewed:
- Description: WSNs generates a large amount of data in the form of stream and mining knowledge from the stream of data can be extremely useful. Association rules mining, from the sensor data, has been studied in recent literature. However, sensor association rules mining often produces a huge number of rules, but most of them either are redundant or fail to reflect the true correlation relationship among data objects. In this paper, we address this problem and propose mining of a new type of sensor behavioral pattern called associated-correlated sensor patterns. The proposed behavioral patterns capture not only association-like co-occurrences but also the substantial temporal correlations implied by such co-occurrences in the sensor data. Here, we also use a prefix tree-based structure called associated-correlated sensor pattern-tree (ACSP-tree), which facilitates frequent pattern (FP) growth-based mining technique to generate all associated-correlated patterns from WSN data with only one scan over the sensor database. Extensive performance study shows that our approach is time and memory efficient in finding associated-correlated patterns than the existing most efficient algorithms.
Regularly frequent patterns mining from sensor data stream
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Conference paper
- Relation: International Conference on Neural Information Processing (ICONIP 2013) p. 417-424
- Full Text: false
- Reviewed:
- Description: Mining interesting and useful knowledge from the huge amount of data gathered in wireless sensor networks is a challenging task. Works reported in literature use support metric-based sensor association rule which employs the occurrence frequency of patterns as criteria. Such criteria may not be appropriate for finding significant patterns. Moreover, temporal regularity in occurrence behavior should be considered as another important measure for assessing the importance of patterns in WSNs. Frequent sensor patterns that occur after regular intervals is called regularly frequent sensor patterns. Even though mining regularly frequent sensor patterns from sensor data stream is extremely important in many real-time applications, no such algorithm has been proposed yet. In this paper, we propose a novel tree structure called Regularly Frequent Sensor Pattern-tree (RSP-tree) and an efficient mining approach for finding regularly frequent sensor patterns from WSNs. Extensive performance analyses show that our technique is time and memory efficient in finding regularly frequent sensor patterns.