Mining associated patterns from wireless sensor networks
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Journal article
- Relation: IEEE Transactions on Computers Vol. 64, no. 7 (2015), p. 1998-2011
- Full Text: false
- Reviewed:
- Description: Mining of sensor data for useful knowledge extraction is a very challenging task. Existing works generate sensor association rules using occurrence frequency of patterns to extract the knowledge. These techniques often generate huge number of rules, most of which are non-informative or fail to reflect true correlation among sensor data. In this paper, we propose a new type of behavioral pattern called associated sensor patterns which capture association-like co-occurrences as well as temporal correlations which are linked with such co-occurrences. To capture such patterns a compact tree structure, called associated sensor pattern tree (ASP-tree) and a mining algorithm (ASP) are proposed which use pattern growth-based approach to generate all associated patterns with only one scan over dataset. Moreover, when data stream flows through, old information may lose significance for the current time. To capture significance of recent data, ASP-tree is further enhanced to SWASP-tree by adopting sliding observation window and updating the tree structure accordingly. Finally, window size is made dynamically adaptive to ensure efficient resource usage. Different characteristics of the proposed techniques and their computational complexity are presented. Experimental results show that our approach is very efficient in discovering associated sensor patterns and outperforms existing techniques.
Share-frequent sensor patterns mining from wireless sensor network data
- Authors: Rashid, Md. Mamunur , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2015
- Type: Text , Journal article
- Relation: IEEE Transactions on Parallel and Distributed Systems Vol. 26, no. 12 (2015), p. 3471-3484
- Full Text: false
- Reviewed:
- Description: Mining interesting knowledge from the huge amount of data gathered from WSNs is a challenge. Works reported in literature use support metric-based sensor association rules which employ the occurrence frequency of patterns as criteria. However, consideration of the binary frequency of a pattern is not a sufficient indicator for finding meaningful patterns because it only reflects the number of epochs which contain that pattern in the dataset. The share measure of sensorsets could discover useful knowledge about trigger values associated with a sensor. Here, we propose a new type of behavioral pattern called share-frequent sensor patterns (SFSPs) by considering the non-binary frequency values of sensors in epochs. SFSPs can find a correlation among a set of sensors and hence can improve the performance of WSNs in a resource management process. In this paper, a share-frequent sensor pattern tree (ShrFSP-Tree) has been proposed to facilitate a pattern growth mining technique to discover SFSPs from WSN data. We also present a parallel and distributed method where the ShrFSP-Tree is enhanced into PShrFSP-Tree and its performance is investigated for both homogeneous and heterogeneous systems. Results show that our method is time and memory efficient in finding SFSPs than the existing most efficient algorithms.
Self static interference mitigation scheme for coexisting wireless networks
- Authors: Yaqub, Muhammad , Haider, Ammar , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2014
- Type: Text , Journal article
- Relation: Computers and Electrical Engineering Vol. 40, no. 2 (2014), p. 307-318
- Full Text: false
- Reviewed:
- Description: High density of coexisting networks in the Industrial, Scientific and Medical (ISM) band leads to static and self interferences among different communication entities. The inevitability of these interferences demands for interference avoidance schemes to ensure reliability of network operations. This paper proposes a novel Diversified Adaptive Frequency Rolling (DAFR) technique for frequency hopping in Bluetooth piconets. DAFR employs intelligent hopping procedures in order to mitigate self interferences, weeds out the static interferer efficiently and ensures sufficient frequency diversity. We compare the performance of our proposed technique with the widely used existing frequency hopping techniques, namely, Adaptive Frequency Hopping (AFH) and Adaptive Frequency Rolling (AFR). Simulation studies validate the significant improvement in goodput and hopping diversity of our scheme compared to other schemes and demonstrate its potential benefit in real world deployment.
Abrasion modeling of multiple-point defect dynamics for machine condition monitoring
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder , Loparo, Kenneth
- Date: 2013
- Type: Text , Journal article
- Relation: IEEE Transactions on Reliability Vol. 62, no. 1 (2013), p. 171-182
- Full Text: false
- Reviewed:
- Description: Multiple-point defects and abraded surfaces in rotary machinery induce complex vibration signatures, and have a tendency to mislead defect diagnosis models. A challenging problem in machine defect diagnosis is to model and study defect signature dynamics in the case of multiple-point defects and surface abrasion. In this study, a multiple-point defect model (MPDM) that characterizes the dynamics of n-point bearing defects is proposed. MPDM is further extended to model degradation in a rotating machine as a special case of multiple-point defects. Analytical and experimental results for multiple-point defects and abrasions show that the location of the fundamental defect frequency shifts depending upon the relative location of the defects and width of the abrasive region. This variation in the defect frequency results in a degradation of the defect detection accuracy of the defect diagnostic model. Based on envelope detection analysis, a modification in existing defect diagnostic models is recommended to nullify the impact of multiple-point defects, and general abrasion in machine components.
An adaptive self-configuration scheme for severity invariant machine fault diagnosis
- Authors: Yaqub, Muhammad , Gondal, Iqbal , Kamruzzaman, Joarder
- Date: 2013
- Type: Text , Journal article
- Relation: IEEE Transactions on Reliability Vol. 62, no. 1 (2013), p. 116-126
- Full Text: false
- Reviewed:
- Description: Vibration signals, used for abnormality detection in machine health monitoring (MHM), exhibit significant variation with varying fault severity. This signal variation causes overlap among the features characterizing different types of faults, which results in severe performance degradation of the fault diagnostic model. In this paper, a wavelet based adaptive training set and feature selection (WATF) self-configuration scheme is presented, which selects the optimum wavelet decomposition level, and employs adaptive selection of the training set and features. Optimal wavelet decomposition level selection is such that the maximum fault signature-signal energy bands are achieved. The severity variant features, which could cause detrimental class overlap for MHM, are avoided using adaptive selection of the training set and features based on the location of a test data in feature space. WATF uses Support Vector Machines (SVM) to build the fault diagnostic model, and its performance and robustness has been tested with data having different severity levels. Comparative studies of WATF with eight existing fault diagnosis schemes show that, for publicly available data sets, WATF achieves higher fault detection accuracy, even when training and testing data sets belong to different severity levels.
How to improve postgenomic knowledge discovery using imputation
- Authors: Sehgal, Muhammad Shoaib B , Gondal, Iqbal , Dooley, Laurence , Coppel, Ross
- Date: 2009
- Type: Text , Journal article
- Relation: Eurasip Journal on Bioinformatics and Systems Biology Vol. 2009, no. 1 (2009), p. 1-14
- Full Text:
- Reviewed:
- Description: While microarrays make it feasible to rapidly investigate many complex biological problems, their multistep fabrication has the proclivity for error at every stage. The standard tactic has been to either ignore or regard erroneous gene readings as missing values, though this assumption can exert a major influence upon postgenomic knowledge discovery methods like gene selection and gene regulatory network (GRN) reconstruction. This has been the catalyst for a raft of new flexible imputation algorithms including local least square impute and the recent heuristic collateral missing value imputation, which exploit the biological transactional behaviour of functionally correlated genes to afford accurate missing value estimation. This paper examines the influence of missing value imputation techniques upon postgenomic knowledge inference methods with results for various algorithms consistently corroborating that instead of ignoring missing values, recycling microarray data by flexible and robust imputation can provide substantial performance benefits for subsequent downstream procedures