Search

Equatorial plasma bubbles (EPBs) represent areas of reduced electron density that develop within Earth’s ionosphere as a result of Rayleigh–Taylor instability. These formations can trigger signal scintillation, which induces signal degradation and navigation positioning inaccuracies. EPBs can be identified via imagery gathered by All-Sky Imager (ASI) networks. The present research introduces an inexpensive, automated technique for identifying EPBs within ASI datasets, suitable for real-time monitoring as well as categorization tasks. This approach couples Two-Dimensional Principal Component Analysis (2DPCA) and Recursive Feature Elimination (RFE) alongside a Random Forest machine learning classifier to construct an Explainable Artificial Intelligence (XAI) framework. This framework extracts image characteristics to automate EPB detection using minimal dimensionality, yielding a compact and exceptionally rapid-to-train model designed to discern EPBs in recorded ASI frames. A collection of 2458 images, categorized into "Event" and "Empty" classes, was assembled to construct the database. This image repository was partitioned randomly into two distinct portions: an 80% training dataset and a 20% testing dataset. The developed XAI framework achieved a marginally better detection accuracy relative to the conventional 2DPCA approach while maintaining a notably smaller structural footprint. Additionally, the execution of the proposed framework was assessed and contrasted against alternative deep learning baselines (ResNet18, Inception-V3, VGG16, and VGG19) under identical environmental conditions.

The escalating complexity of malicious digital activities highlights the necessity for dependable and transparent intrusion detection systems (IDS) to preserve network integrity. Although machine learning frameworks like Decision Tree (DT), Random Forest (RF), k-Nearest Neighbors (K-NN), and XGBoost demonstrate exceptional capabilities in identifying malicious behavior, their inner mechanics grow increasingly opaque as structural complexity and predictive precision expand, creating challenges for high-stakes safety operations. Local Interpretable Model-agnostic Explanations (LIME) is frequently deployed to mitigate this issue; nevertheless, its dependency on Gaussian distributions when generating data variations often fails to capture the non-linear and disproportionate traits of frameworks like CIC-IDS-2018. To overcome these limitations, we introduce an adapted LIME variation strategy utilizing Weibull, Gamma, Beta, and Pareto distributions to more accurately represent the attributes of network telemetry. Our framework enhances the consistency of diverse machine learning systems optimized on CIC-IDS repositories, yielding more constructive and dependable rationales for predictive outputs. These proposed algorithmic adjustments yield a gain in explanatory fidelity of up to 78% relative to the standard normal distribution framework. Variations rooted in the Pareto distribution deliver the most optimal outcomes. Across all evaluated distributions, the Pareto framework consistently generated the peak explanation fidelity and consistency, notably for K-NN (R^2 = 0.9971, S = 0.9907) and DT (R^2 = 0.9267, S = 0.9797). This demonstrates that heavy-tailed distributions align effectively with actual network operational trends, minimizing the discrepancy in attribute significance justifications and rendering them more resilient.

This research investigates and refines the MINDWALC node classification algorithm, specifically targeting its capacity to extract human-interpretable decision trees from knowledge graph (KG) architectures. We propose techniques to tailor MINDWALC for environments where the knowledge graph is bifurcated into internal background knowledge (domain-specific data) and instance knowledge (specific case data). While the core logic of MINDWALC—utilizing discriminative graph walks as features—is preserved, we introduce two primary enhancements. First, we implement relation-tail merging to empower the algorithm to process relation-modified nodes. Second, we propose flexible walking depths that, when combined with the original MINDWALC strategy, improve the detection of commonalities between node instances. Our findings suggest that these flexible walks can markedly increase classification accuracy in hierarchical or incomplete tree-like graphs, though performance varies on more heterogeneous KG structures. Ultimately, this work demonstrates that our refinements significantly boost MINDWALC’s utility in tree-structured environments, allowing the system to use background knowledge to bridge gaps in instance data in a transparent way. Initial evaluations on medical toy datasets suggest these optimizations could refine clinical decision-making, particularly in sectors requiring explainable artificial intelligence.