Anomaly detection is a vibrant research direction in controller area networks, which provides the fundamental real-time data transmission underpinning in-vehicle data interaction for the internet of vehicles. However, existing unsupervised learning methods suffer from insufficient temporal and spatial constraints on shallow features, resulting in fragmented feature representations that compromise model stability and accuracy. To improve the extraction of valuable features, this paper investigates the influence of clustering constraints on shallow feature convergence paths at the model level and further proposes an end-to-end intrusion detection system based on efficient deep embedded subspace clustering (EDESC-IDS). Following the standard learning approach, continuous messages are encoded into two-dimensional data frames via a frame builder, which are then input into an extended convolutional autoencoder for extracting shallow features from high-dimensional data. On this basis, the dual constraints of these output features and the embedding clustering module facilitate end-to-end training of the EDESC-IDS in various attack scenarios. Extensive experimental results show that such a system exhibits significant detection performance on four types of attack datasets, including DoS, Gear, Fuzzy, and RPM, with precision, recall, and F1 scores consistently above 97.79%, while maintaining a false negative rate (FNR) and an error rate (ER) below 2.22%.
With the rapid advancement of artificial intelligence technologies in the era of big data, time series forecasting has become indispensable in critical fields such as environmental monitoring and financial market analysis. However, the existing forecasting models often encounter performance limitations when extracting high-dimensional features and generally cannot dynamically focus on critical information within long-term sequences. To address these challenges, this study proposes a multi-head attention fusion model (MAFM) designed to enhance the predictive accuracy and modelling capability for high-dimensional and nonlinear data across diverse application scenarios. Experiments were conducted on two heterogeneous datasets from the environmental and financial domains. After the key hyperparameters of the MAFM were optimized through an orthogonal experimental design, the model achieved coefficients of determination exceeding 0.90 on both datasets. Furthermore, the results of four comparative experiments demonstrate that the MAFM consistently outperforms traditional machine learning models, including support vector regression and extreme gradient boosting, as well as state-of-the-art deep learning models such as long short-term memory, temporal convolutional networks, and transformers. Compared with the best-performing baseline model on each sub-dataset, the MAFM reduced the mean squared error by 44.4%, 8.3%, 29.4%, and 65.5%, respectively, highlighting its superior predictive performance and strong generalization capability. In summary, the proposed MAFM provides an efficient, robust, and interpretable solution for time series forecasting tasks across multiple domains. Its outstanding performance demonstrates significant potential for practical applications in environmental monitoring, financial forecasting, and other real-world scenarios.
Opinion-maximization methods often optimize an aggregate network response and may therefore distribute target-aligned intervention gains unevenly across groups. This issue is especially important in signed networks, where cooperative and antagonistic relations can make the same positive opinion seed increase the equilibrium opinion of one group while decreasing that of another. We study fairness-aware internal-opinion seeding in undirected signed Friedkin–Johnsen networks with heterogeneous anchoring strengths. The objective combines the whole-network average opinion gain with the minimum group-average gain through a tunable fairness parameter. We show that the equilibrium response of any seed set decomposes additively into candidate-wise group-gain vectors. This representation yields an equivalent mixed-integer linear program for exact optimization on tractable instances and an adjoint formulation that evaluates all candidate gains using only one shifted signed-Laplacian solve per group. Because the global averaging vector is a size-weighted combination of the group averaging vectors, no additional global solve is required. We further introduce a dynamically maintained Pareto frontier based on componentwise dominance and establish conditions under which pruning preserves the underlying greedy sequence. Theoretical results establish well-posedness and stability of the signed equilibrium, correctness of the gain and adjoint formulations, sufficient conditions for monotonicity, non-submodularity in general, residual-based numerical error bounds, and computational complexity. Experiments on 14 signed networks ranging from hundreds to more than four million nodes show that the adjoint implementation scales most robustly among the tested methods. The results further demonstrate that the fairness parameter and heterogeneous anchoring strengths can substantially affect both the selected seed sets and the fairness–efficiency balance. Against structural, random, and target-aware Top-K baselines, the proposed greedy method remains broadly competitive, and on small full-candidate instances it matches the solver-certified mixed-integer linear program (MILP) optimum in five of six tested configurations. Overall, the framework provides a scalable approach to group-aware opinion intervention in signed networks while explicitly distinguishing opinion seeding from clamped leader selection.