Irrelevant Data Research Articles

Pengaruh Metode Tasmi’ dalam Meningkatkan Minat Menghafal Qur’an bagi Siswa di MTs Mualimin UNIVA Medan

This study aims to explore the influence of the Tasmi’ method on increasing students' interest in memorizing the Qur'an. Utilizing a descriptive qualitative approach, the research collects data through interviews, observations, and documentation. Interviews were conducted with Qur'an teachers and students participating in the memorization program to gain in-depth insights into the implementation of the Tasmi’ method. Observations were made during the classroom learning process to see the direct application of the Tasmi’ method and the students' responses to it. Additionally, documentation includes records of students' memorization achievements and relevant learning reports. Data were analyzed through three stages: presentation, reduction, and verification. In the presentation stage, the data were organized systematically, while in the reduction stage, irrelevant data were filtered out, and significant data were retained. In the verification stage, the researcher drew conclusions based on the obtained results. The findings indicate that the Tasmi’ method significantly enhances students' interest in memorizing the Qur'an, with students feeling more motivated and engaged in the memorization process due to this approach. It is hoped that these findings will contribute to the development of more effective Qur'an teaching methods.

Enhancing IoT intrusion detection through machine learning with AN-SFS: a novel approach to high performing adaptive feature selection

The vast volume of redundant and irrelevant network traffic data poses significant hurdles for intrusion detection. Effective feature selection is crucial for eliminating irrelevant information. Presently, most filtering and embedded methods rely on fixed thresholds or ratios, necessitating prior knowledge. Conversely, wrapper methods are computationally intensive, and individual feature selection methods may introduce biases in evaluation. To address these challenges, this study introduces Adaptive Neighborhood based Feature Selection (AN-SFS), a dynamic feature selection approach that adapts to local statistical properties of the data. Unlike traditional methods, AN-SFS adjusts its threshold based on the characteristics of the current feature subset and incorporates statistical measures of neighboring features, capturing subtle relationships and dependencies. This adaptability enables AN-SFS to achieve robust and effective feature selection outcomes. Using NSL-KDD and UNSW-NB15 datasets, our model demonstrates superiority over conventional ML classifiers in detection rate, precision, and recall, achieving outstanding accuracy rates of 99.3% on NSL-KDD and 97.5% on UNSW-NB15, significantly outperforming contemporary methods. To further demonstrate the effectiveness of our feature selection approach, we conducted a series of comparisons with other statistical methods, including ANOVA, Pearson correlation, and the chi-square test. In each comparison, our approach consistently outperformed these alternatives, underscoring its superior efficacy.

An optimized multi-layer ensemble model for airborne networks intrusion detection

In view of the characteristics of airborne networks, such as the traffic data of 1553B data bus and public networks, numerous redundant and irrelevant data, and fewer but more types of attack behaviors, a highly representative balanced data subset is generated by combining K-means with synthetic minority oversampling technique (SMOTE). A feature selection (FS) method of fast correlation-based filter combined with information gain (IG-FCBF) is proposed to filter the key characteristics with 90 % cumulative importance. Aiming at the problem that it is not easy for a single classifier to accurately classify various types of attacks, as well as the difficulty in obtaining the best prediction results by adjusting default and manual parameters, a multi-layer ensemble model based on Bayesian optimization tree-structured Parzen estimator (BO-TPE) is proposed for airborne networks intrusion detection, combining the advantages of supervised learning, stacking ensemble method and hyperparameter optimization (HPO). The experimental results show the superiority and effectiveness of the model, as well as its universality in Integrated Avionics Systems (IAS) and onboard public networks, which provides a new approach for airborne networks intrusion identification and protection.

ResiDEM: Analytical Tool for Isomorphous Difference Electron Density Maps Utilizing Dynamic Residue Identification via Density Clustering.

Time-resolved serial femtosecond crystallography (TR-SFX) of biological molecules captures the time-evolved dynamics of the residual motions across crystal structures, enabling the visualization of structural changes in response to chemical and physical stimuli to elucidate the relationship between the structure and function of the system under study. However, interpretations of residual motions can be complex to deconvolute because of various factors such as the system's size, temporal and spatial complexity, and allosteric behavior away from active sites. Relying solely on electron density map visualization can also pose a challenge in differentiating between useful and irrelevant data. In order to accurately identify residues and determine their respective contributions to the reaction dynamics, new tools are needed. We developed a new tool, ResiDEM, which employs a clustering-based approach to group difference electron densities and associate them with proximal residues. It can identify and rank residues with significant motions. Network representation can be used to delineate the interrelations between the residues in motion. With these features, ResiDEM helps to interpret residual motions in TR-SFX data, identify key residues, and elucidate their roles in dynamic processes.

Node and relevant data selection in distributed predictive analytics: A query-centric approach

Distributed Predictive Analytics (DPA) refers to constructing predictive models based on data distributed across nodes. DPA reduces the need for data centralization, thus, alleviating concerns about data privacy, decreasing the load on central servers, and minimizing communication overhead. However, data collected by nodes are inherently different; each node can have different distributions, volumes, access patterns, and features space. This heterogeneity hinders the development of accurate models in a distributed fashion. Many state-of-the-art methods adopt random node selection as a straightforward approach. Such method is particularly ineffective when dealing with data and access pattern heterogeneity, as it increases the likelihood of selecting nodes with low-quality or irrelevant data for DPA. Consequently, it is only after training models over randomly selected nodes that the most suitable ones can be identified based on the predictive performance. This results in more time and resource consumption, and increased network load. In this work, holistic knowledge of nodes’ data characteristics and access patterns is crucial. Such knowledge enables the successful selection of a subset of suitable nodes for each DPA task (query) before model training. Our method engages the most suitable nodes by predicting their relevant distributed data and learning predictive models per query. We introduce a novel DPA query-centric mechanism for node and relevant data selection. We contribute with (i) predictive selection mechanisms based on the availability and relevance of data per DPA query and (ii) various distributed machine learning mechanisms that engage the most suitable nodes for model training. We evaluate the efficiency of our mechanism and provide a comparative assessment with other methods found in the literature. Our experiments showcase that our mechanism significantly outperforms other approaches being applicable in DPA.

PDSMV3-DCRNN: A novel ensemble deep learning framework for enhancing phishing detection and URL extraction

Phishing is a cyber-attack that exploits victims' technical ignorance or naivety and commonly involves a Uniform Resources Locator (URL). As a result, it is beneficial to examine URLs before accessing them to spot a phishing assault. Several algorithms based on machine learning have been presented to detect phishing attempts. However, these approaches often suffer from lower performance outcomes, such as lower accuracy, longer response times, and higher false positive rates. Furthermore, many existing methods rely heavily on predefined feature sets, which may limit their adaptability and robustness. In contrast, our proposed method leverages a more dynamic feature selection process, which includes the Conditional Wasserstein Generative Adversarial Network (CWGAN) for addressing data imbalance and the Binary Grey Goose Optimization Algorithm (BGGOA) for optimal feature selection. This dynamic approach enhances the model's ability to adapt to varying data characteristics, improving detection performance. The proposed solution is divided into two stages: pre-deployment and deployment. During the pre-deployment stage, the dataset is preprocessed, including data transformation, handling irrelevant and redundant data, and ensuring data balancing. Minority samples are increased using CWGAN to avoid class imbalance. Features are then selected using BGGOA, resulting in a feature-reduced dataset used for training and testing ensemble deep learning classifiers, specifically the Novel Pyramid Depth-wise Separable-MobileNetV3 (PyDS-MV3) and Deformable Convolutional Residual Neural Network (DCRNN), termed PDSMV3-DCRNN. During the deployment phase, the Boosted ConvNeXt approach extracts URL features fed into the trained classifier to predict "phishing" or "benign". According to experimental findings, the proposed solution outperforms all other tested approaches, displaying a faster training time of 0.11 s and achieving an optimal accuracy of 99.21%.

Channel adaptive CVFCN using a new transfer method for PolSAR terrain classification

ABSTRACT This paper mainly addresses the lack of labelled data and insufficient data utilization in PolSAR image classification. We propose a channel adaptive Complex-Valued Fully Convolutional Networks based on Transfer learning (TF-CVFCN). To solve the problem of less labelled data, we borrowed from the transfer learning method, which can use a large amount of easily obtained relevant or even irrelevant data for pre-training and then use a small amount of source data for network training fine-tuning. Since PolSAR data can obtain different data information by using different decomposition methods, the current research trend is to process PolSAR data in the complex-valued containing more information. In our work, to cater to the proposed network model and make the network design more liberal, a new transfer learning method is proposed, which uses a new method to realize partial layer parameter transfer, and achieves the purpose of optimizing the traditional Transfer learning method. On this basis, we optimize the network structure to improve the classification accuracy of PolSAR data, and evaluate its performance on three datasets. Furthermore, we lighten the TF-CVFCN and optimize the relevant parameters using Competitive Multi-Objective Particle Swarm Optimizer, emphasizing the importance of this parameter optimization in large networks.

Occlusion-guided multi-modal fusion for vehicle-infrastructure cooperative 3D object detection

In autonomous driving, leveraging sensor data (e.g. camera, LiDAR data) from both the vehicle and the infrastructure significantly improves perception capabilities. However, this integration traditionally results in increased demands on communication bandwidth. To address these challenges, we introduce Fusion2comm, an occlusion-guided feature fusion approach designed to optimize vehicle-infrastructure cooperative 3D object detection. Our innovative strategy employs an intelligent fusion of camera and LiDAR data to enhance the expressiveness of features. Subsequently, it leverages a segmentation model to extract foreground features and utilizes an occlusion-based selection of communication content, effectively easing bandwidth constraints. We propose a multimodal foreground feature fusion architecture that selectively processes and transmits critical information, substantially reducing irrelevant background data transfer. An innovative occlusion confidence-aware communication technique dynamically adjusts communication regions based on occlusion levels, ensuring efficient data exchange. Fusion2comm sets a new benchmark in the DAIR-V2X dataset, achieving an average precision of 71.25% with minimal bandwidth usage of 221.04 bytes. Our comprehensive experimental evaluations confirm that Fusion2comm substantially advances detection precision while simultaneously improving communication efficiency.

Adaptive-propagating heterophilous graph convolutional network

Graph convolutional networks have significant advantages in dealing with graph-structured data, but most existing methods usually potentially assume that nodes belonging to the same class in a graph tend to form edges, yet inter-class edges exist in many real-world graph-structured data. Due to the propagation mechanism of graph convolutional networks, it is challenging to prevent the interference aggregation from nodes of different classes, which may result in the incorporation of noise and irrelevant data in the outcome, ultimately decreasing the performance of the model. In this paper, we propose a new framework to address this issue on heterophilous graph-structured data. The proposed method comprises two main components. On one hand, the homophily of the graph-structured data is modeled so that the method can adaptively adjust the information propagation process according to the homophily of the edges, and mitigate the influence of inter-class information. On the other hand, the implicit node interaction is captured through the learned feature space, which is then fused with the original interaction to aggregate sufficient intra-class knowledge. Extensive experiments on real-world datasets demonstrate the superiority of the proposed method against current state-of-the-art approaches. 22Code to reproduce our experiments is available at https://github.com/rebridger/APHGCN.

A 4096 channel event-based multielectrode array with asynchronous outputs compatible with neuromorphic processors

Bio-signal sensing is pivotal in medical bioelectronics. Traditional methods focus on high sampling rates, leading to large amounts of irrelevant data and high energy consumption. We introduce a self-clocked microelectrode array (MEA) that digitizes bio-signals at the pixel level by encoding changes as asynchronous digital address-events only when they exceed a threshold, significantly reducing off-chip data transmission. This novel MEA comprises a 64 × 64 electrode array, an asynchronous 2D-arbiter, and an Address-Event Representation (AER) communication block. Each pixel operates autonomously, monitoring voltage fluctuations from cellular activity and producing digital pulses for significant changes. Positive and negative signal changes are encoded as “up” and “down” events and are routed off-chip via the asynchronous arbiter. We present results from chip characterization and experimental measurements using electrogenic cells. Additionally, we interface the MEA to a mixed-signal neuromorphic processor, demonstrating a prototype for end-to-end event-based bio-signal sensing and processing.

Deep Learning Method for Real-Time Fire Detection System for Urban Fire Monitoring and Control

During urban fire incidents, real-time videos and images are vital for emergency responders and decision-makers, facilitating efficient decision-making and resource allocation in smart city fire monitoring systems. However, real-time videos and images require simple and embeddable models in small computer systems with highly accurate fire detection ratios. YOLOv5s has a relatively small model size and fast processing time with limited accuracy. The aim of this study is to propose a method that employs a YOLOv5s network with a squeeze-and-excitation module for image filtering and classification to meet the urgent need for rapid and accurate real-time screening of irrelevant data. In this study, over 3000 internet images were used for crawling and annotating to construct a dataset. Furthermore, the YOLOv5, YOLOv5x and YOLOv5s models were developed to train and test the dataset. Comparative analysis revealed that the proposed YOLOv5s model achieved 98.2% accuracy, 92.5% recall, and 95.4% average accuracy, with a remarkable processing speed of 0.009 s per image and 0.19 s for a 35 frames-per-second video. This surpasses the performance of other models, demonstrating the efficacy of the proposed YOLOv5s for real-time screening and classification in smart city fire monitoring systems.

Development of Ancient Khmer Stone Castle Ontology

This research delves into the development of ontology, a crucial aspect of knowledge organization system studies. The primary goal is to establish a semantic search system tailored to the Khmer stone castles of the Greater Mekong Subregion (GMS), specifically addressing the challenge of semantic gaps. This paper details a novel approach to developing ontologies for Khmer stone castles in the GMS to enhance our understanding of these countries' rich and ancient cultural heritage. A systematic four-step theoretical framework for ontology development was adopted, utilizing the Hozo Ontology Editor to create the ontologies by used the Wizard for documenting ontologies (WIDOCO) framework for web ontology platform. This methodology plays a key role in differentiating relevant from irrelevant data, thus significantly improving the efficiency of semantic searches. Central to this study is developing a comprehensive ontology encompassing ten primary classes: castle, location, country, Khmer art, art type, castle size, castle type, material, religion, and condition. This ontology is foundational for developing a semantic search system designed explicitly for the Khmer stone castles in the GMS. The insights from this research offer significant implications for advancing semantic search systems in cultural heritage, providing a robust framework for future studies in this field.

Deep autoencoder based image enhancement approach with hybrid feature extraction for plant disease detection using supervised classification

Plant leaf diseases pose significant threats to global agriculture, leading to reduced crop yields and economic losses. Rapid and accurate disease detection is essential for timely interventions and sustainable farming practices. This study presents an innovative approach for plant leaf disease detection by integrating wavelet analysis, color, and texture features, coupled with autoencoder denoising and support vector machine (SVM) classification. Wavelet analysis is employed to extract multi-resolution features, capturing intricate details at different scales. Furthermore, color and texture characteristics are extracted to encompass a broad spectrum of visual information crucial for distinguishing diseases. The Autoencoder model helps to enhance the feature representation that mitigates the impact of noise and irrelevant data. The SVM classifier is utilized to learn complex patterns and accurately classify different disease classes. The combined model of wavelet, color, and texture attributes, in combination with autoencoder denoising and SVM classification, markedly enhances the precision and efficiency of disease detection in contrast to conventional methods. The system's performance is evaluated using a PlantVillage dataset, showcasing its adaptability to different plant species and disease types. The overall performance is obtained as 98.60%, 97.25%, 96.89%, and 97.20% in terms of accuracy, precision, recall, and F-Score, respectively.

Sparse graphs-based dynamic attention networks

In previous research, the prevailing assumption was that Graph Neural Networks (GNNs) precisely depicted the interconnections among nodes within the graph's architecture. Nonetheless, real-world graph datasets are often rife with noise, elements that can disseminate through the network and ultimately affect the outcome of the downstream tasks. Facing the complex fabric of real-world graphs and the myriad potential disturbances, we introduce the Sparse Graph Dynamic Attention Networks (SDGAT) in this research. SDGAT employs the L0 regularization technique to achieve a sparse representation of the graph structure, which eliminates noise and generates a more concise sparse graph. Building upon this foundation, the model integrates a dynamic attention mechanism, allowing it to selectively focus on key nodes and edges, filter out irrelevant data, and simultaneously facilitate effective feature aggregation with important neighbors. To evaluate the performance of SDGAT, we conducted experiments on three citation datasets and compared its performance against commonly employed models. The outcomes indicate that SDGAT excels in node classification tasks, notably on the Cora dataset, with an accuracy rate of 85.29%, marking a roughly 3% enhancement over the majority of baseline models. The experimental findings provide evidence that SDGAT delivers effective performance on all three citation datasets, underscoring the efficacy of the dynamic attention network built upon a sparse graph.

The use of genetic algorithm and particle swarm optimization on tiered feature selection method in machine learning-based coronary heart disease diagnosis system

Coronary heart disease (CHD) is a leading global cause of death. Early detection is the right step to reduce mortality rates and treatment costs. Early detection can be developed using machine learning by utilizing patient medical record datasets. Unfortunately, this dataset has excessive features which can reduce machine learning performance. For this reason, it is necessary to reduce the number of redundant features and irrelevant data to improve machine learning performance. Therefore, this research proposes a tiered of feature selection model with genetic algorithm (GA) and particle swarm optimization (PSO) to improve the performance of the diagnosis model. The feature selection model is evaluated using parameters derived from the confusion matrix and using the CatBoost machine learning algorithm. Model testing uses z-Alizadeh Sani, Cleveland, Statlog, and Hungarian datasets. The best results for this model were obtained on the z-Alizadeh Sani dataset with 6 selected features from 54 features and the resulting performance for accuracy parameters was 99.32%, specificity 98.57%, sensitivity 100.00%, area under the curve (AUC) 99.28%, and F1-Score 99.37%. The proposed feature selection model is able to provide machine learning performance in the very good category. The diagnostic model proposed is of excellent standard.

Hybrid Filtering and Probabilistic Techniques for Privacy-Preserving Community Detection in OSNs

Online Social Networks (OSNs) face the major challenge of protecting participant's privacy, due to the high dimensionality and volume of the data. In real-time social networks, where hundreds of personal details of people are shared every day, there remains a significant threat to privacy. Privacy preservation is challenging for a community detection problem due to the high computational complexity and memory requirements, especially in larger real-world OSN graphs. Although weighted nodes provide better results, as they allow capturing the frequencies of the values, the privacy preservation of sensitive attributes such as specific profiles becomes harder compared to these models. This problem can result in queries and subsequent learnings from social network profiles of specific individuals, which may be of personal, political or otherwise concern. Online social networks (OSNs) grapple with significant privacy challenges due to the extensive dimensions and vast quantities of data involved. This research fills the void in current privacy-preserving community detection methodologies, which face problems in computational complexity and memory usage in large-scale OSNs. The proposed framework seeks to bolster privacy preservation through a comprehensive multi-step process. Data filtering uses a blended data filter system to remove outliers and irrelevant data, thus enhancing the quality of the input data. Density-Oriented Clustering phase employs a density-oriented clustering model to identify communities, with each cluster representing a distinct community. Privacy Preservation component introduces a new privacy preservation technique for sensitive OSN attributes, surpassing existing k-anonymization methods. The developed density-based social network community detection model and its novel privacy-preserving scheme are evaluated using the datasets Yelp, Football, Zachary and Dolphin from the SNAP dataset. Experimental results on these datasets embed a comprehensive evaluation based on the order of each node and the graph-based networks, where each node is laden with weights as proximity values, indicating the semantic proximity between communities and individuals. The proposed framework employs the normalized mutual information (NMI), modularity (Q), Rand index and runtime measurements to demonstrate widespread advantages in the multi-dimensional functional space, including greater accuracy, cluster compatibility, and computational tractability over the existing prominent traditional models for OSNs.

Wind Speed Prediction Using Deep Recurrent Neural Networks and Farm Platform Features for One-Hour-Ahead Forecast

This paper proposes a deep recurrent neural network (DRNN) approach to model the one-hour-ahead wind speed forecasting by using various meteorological sensory data from the North Wyke farm platform (NWFP). To refine model input, mutual information analysis is applied to eliminate irrelevant sensory data. The DRNN architecture employs three recurrent layers Long-Short Term Memory (LSTM), Gated Recurrent Unit (GRU), and simple Recurrent Neural Network (RNN) to capture temporal relationships. The proposed networks are tested using real-life, one-year data from the NWFP. The results showed a strong correlation between the actual and predicted wind speed for LSTM, GRU, and RNN layers-based DRNN, however, simple RNN slightly outperformed the other two recurrent layers. The distribution of the network errors over the year is also analyzed. Although the observed meteorological data between the years was from different distributions, the proposed network generalized well even though these data were altered due to global warming.

Enhancing trustworthiness among iot network nodes with ensemble deep learning-based cyber attack detection

A lot of machine learning methods and expert systems are used in network intrusion detection automation. When different industrial control systems merge with the Internet of Things (IoT) environment, they become vulnerable to cyber-attacks in critical infrastructure situations requiring communication technologies. Conventional machine learning techniques used for network anomaly detection are ineffective due to the substantial amount of network traffic within important Cyber-Physical Systems (CPSs). In this manuscript, Cyberattack Identification Through Ensemble Deep Learning in an IoT environment is proposed. Initially, the input network traffic data are taken from the IoT-23 dataset. Then the network traffic data are preprocessed using Z-Score normalization to reduce any irrelevant or erroneous data from the input dataset. Then the relevant features are selected using the Gorilla Troops Optimization (GTO) algorithm. Afterwards, the selected features are fed into the ensemble classification model based on Random Space (RS), Random Tree (RT), Extreme Gradient Boosting (XGBoost), and Graph Convolutional Neural Network (GCNN). Among the several ensembling techniques, GCNN can achieve better performance. Python is used to accomplish the suggested technique. The performance of the proposed GCNN method provides 12.09%, 4.34%, and 3.21% higher accuracy than the other models like RS, RT and XGBoost respectively.

Which pooling method is better: Max, Avg, or Concat (Max, Avg)

Pooling is a non-linear operation that aggregates the results of a given region to a single value. This method effectively removes extraneous details in feature maps while keeping the overall information. As a result, the size of feature maps is reduced, which decreases computing costs and prevents overfitting by eliminating irrelevant data. In CNN models, the max pooling and average pooling methods are commonly utilized. The max pooling selects the highest value within the pooling area and aids in preserving essential features of the image. However, it ignores the other values inside the pooling region, resulting in a significant loss of information. The average pooling computes the average values within the pooling area, which reduces data loss. However, by failing to emphasize critical pixels in the image, it may result in the loss of significant features. To examine the performance of pooling methods, this study comprised the experimental analysis of multiple models, i.e. shallow and deep, datasets, i.e. Cifar10, Cifar100, and SVHN, and pool sizes, e.g. $2x2$, $3x3$, $10x10$. Furthermore, the study investigated the effectiveness of combining two approaches, namely Concat (Max, Avg), to minimize information loss. The findings of this work provide an important guideline for selecting pooling methods in the design of CNNs. The experimental results demonstrate that pooling methods have a considerable impact on model performance. Moreover, there are variances based on the model and pool size.

Trivial State Fuzzy Processing for Error Reduction in Healthcare Big Data Analysis towards Precision Diagnosis.

There is a significant public health concern regarding medical diagnosis errors, which are a major cause of mortality. Identifying the root cause of these errors is challenging, and even if one is identified, implementing an effective treatment to prevent their recurrence is difficult. Optimization-based analysis in healthcare data management is a reliable method for improving diagnostic precision. Analyzing healthcare data requires pre-classification and the identification of precise information for precision-oriented outcomes. This article introduces a Cooperative-Trivial State Fuzzy Processing method for significant data analysis with possible derivatives. Trivial State Fuzzy Processing operates on the principle of fuzzy logic-based processing applied to structured healthcare data, focusing on mitigating errors and uncertainties inherent in the data. The derivatives are aided by identifying and grouping diagnosis-related and irrelevant data. The proposed method mitigates invertible derivative analysis issues in similar data grouping and irrelevance estimation. In the grouping and detection process, recent knowledge of the diagnosis progression is exploited to identify the functional data for analysis. Such analysis improves the impact of trivial diagnosis data compared to a voluminous diagnosis history. The cooperative derivative states under different data irrelevance factors reduce trivial state errors in healthcare big data analysis.