Latent representations have demonstrated significant effectiveness in multi-view subspace clustering (MVSC). However, existing latent MVSC methods usually suffer from high time complexity—typicallyO(n3) fornsamples—which restricts their application to large-scale data. Moreover, the self-representation matrix relies heavily on the recovery quality of the latent subspace representation, potentially leading to insufficient learning of subspace structures across different views. To address these limitations, this paper proposes an Enhanced and Scalable Latent Multi-view Subspace Clustering method, termed ESLMSC. Specifically, ESLMSC constructs a compact representation matrix via anchor learning to replace the computationally expensive full self-representation matrix. Meanwhile, the compact representation matrix jointly learns subspace structures from both the recovered latent subspace representation and the original data matrix of each view, whereby its comprehensive representational ability is strengthened. Furthermore, multiple anchor projection matrices of different dimensions enhance the learning of complementary information in the recovered latent subspace representation through a hierarchical descent manner. Finally, with a fast alternating optimization algorithm, we can obtain an enhanced subspace representation matrix for clustering. Extensive experiments on diverse multi-view benchmark datasets, including several large-scale ones, demonstrate that ESLMSC consistently achieves superior performance over state-of-the-art MVSC methods.

Accurate citywide traffic flow forecasting is an essential task in intelligent transportation systems. Unlike single-step forecasting, multi-step traffic flow forecasting offers extended insights that support proactive traffic management and resource allocation over longer time horizons. This paper proposes a Multi-Step Multiscale Spatial–Temporal Transformer (MS-MSTformer) for citywide traffic flow forecasting, which leverages a multiscale patch mechanism to capture both local and global spatial dependencies while integrating temporal patterns of closeness, period, and trend. Two novel cross-attention modules, namely Patch-Temporal Cross-Attention (PTCA) and Region-Temporal Cross-Attention (RTCA) are presented. These modules utilize temporal information as the query, with PTCA and RTCA focusing on patches and regions, respectively, to effectively fuse diverse spatio-temporal features. Extensive experiments on the widely used New York City Taxi (NYCTaxi) and New York City Bike (NYCBike) datasets demonstrate the MS-MSTformer’s capability to provide accurate multi-step citywide traffic flow forecasting. Specifically, the proposed model outperforms the baseline models in 11 out of 12 evaluation scenarios. On average, MS-MSTformer improves Root Mean Square Error (RMSE) by 31.13% and Mean Absolute Error (MAE) by 29.22% over the deep learning baselines. In addition, the ablation study demonstrates the contributions of both PTCA and RTCA to the proposed MS-MSTformer.

Hyperspectral images (HSI) provide a wealth of information surpassing human visual capabilities, enabling precise identification of remote sensing targets. However, it faces significant challenges, including insufficient long-range dependency modeling, difficulties in data collection, and the tendency of models to get trapped in local optima during training. To overcome these obstacles, we present the sorted texture-aware glance and gaze network (ST-GGNet) tailored for HSI classification. First, we propose the glance and gaze attention (GGA) mechanism, which employs feature interaction-based long-term modeling to minimize information loss across spectral bands and focus on critical land cover features within HSI. Subsequently, the sorted texture-aware module (STM) is introduced to deeply mine and efficiently utilizes detailed texture and spectral information, thereby enhancing accuracy even with limited training data. Additionally, we propose the budding growth optimization algorithm (BGO), which integrates a budding growth mechanism to help the model discover better solutions, boosting optimization and classification performance. Experimental evaluations conducted on four public HSI datasets—Pavia University, Salinas, Houston, and WHU-Longkou—demonstrate the superior performance of ST-GGNet compared to nine state-of-the-art (SOTA) classification methods. Specifically, under limited training samples, ST-GGNet achieves overall accuracies (OA) of 99.42%, 96.88%, 96.86%, and 97.74%; average accuracies (AA) of 98.90%, 98.01%, 97.07%, and 92.48%; and Kappa coefficients of 99.24%, 96.53%, 96.59%, and 97.03% respectively. The findings reveal that ST-GGNet not only maintains strong robustness and generalization but also effectively suppresses noise and excels at distinguishing spatially similar adjacent land covers, especially in low-samples scenarios, consistently outperforming existing SOTA methods. We have released our code and models at https://github.com/Pluviophile-sy/ST-GGNet.

Ensemble clustering learns more accurate consensus results from a set of weak base clustering results. This technique is more challenging than other clustering algorithms due to the base clustering result set's randomness and the inaccessibility of data features. Existing ensemble clustering methods rely on the Co-association (CA) matrix quality but lack the capability to handle missing connections in base clustering. Inspired by the neighborhood high-order and topological similarity theories, this paper proposes a topological ensemble model based on high-order information. Specifically, this paper compensates for missing connections by mining neighborhood high-order connection information in the CA matrix and learning optimal connections with adaptive weights. Afterward, the learned excellent connections are embedded into topology learning to capture the topology of the base clustering. Finally, we incorporate adaptive high-order connection representation and topology learning into a unified learning framework. To our knowledge, this is the first ensemble clustering work based on topological similarity and high-order connectivity relations. Extensive experiments on multiple datasets demonstrate the effectiveness of the proposed method. The source code of the proposed approach is available at https://github.com/ltyong/awec.

Hierarchical Federated Learning (HFL) improves the scalability and communication efficiency of the system and achieves load balancing at each level. Incentive mechanisms enhance participant motivation and optimize resource allocation for HFL. However, existing mechanisms mainly focus on maximizing individual utility from the quantity of client data while neglecting to optimize social utility from the learning quality perspective. Meanwhile, strategic behavior and heterogeneous devices can significantly degrade the performance of incentive mechanisms. To this end, we propose a quality-aware incentive mechanism (QAIM) for HFL to improve training efficiency. Specifically, we first systematically evaluate the learning quality of clients based on their training loss and historical records, which allows us to recruit high-quality clients for model updating selectively. Then, we model the cloud-edge-end interaction and cooperation as a three-layer Stackelberg game to analyze the strategies of participants and utilize carefully designed algorithms to derive the solution of the unique Stackelberg Equilibrium (SE). Through the Pareto improvement of client association modeled as a coalition game, we can maximize social utility. Experimental results on both synthetic and real-world datasets demonstrate that our QAIM outperforms the state-of-the-art baselines, with an average increase in accuracy and social utility of 17% and 45%, respectively.

Korotkoff sounds are known to change their characteristics during blood pressure (BP) measurement, resulting in some uncertainties for systolic and diastolic pressure (SBP and DBP) determinations. The aim of this study was to assess the variation of Korotkoff sounds during BP measurement by examining all stethoscope sounds associated with each heartbeat from above systole to below diastole during linear cuff deflation. Three repeat BP measurements were taken from 140 healthy subjects (age 21 to 73 years; 62 female and 78 male) by a trained observer, giving 420 measurements. During the BP measurements, the cuff pressure and stethoscope signals were simultaneously recorded digitally to a computer for subsequent analysis. Heartbeats were identified from the oscillometric cuff pressure pulses. The presence of each beat was used to create a time window (1 s, 2000 samples) centered on the oscillometric pulse peak for extracting beat-by-beat stethoscope sounds. A time-frequency two-dimensional matrix was obtained for the stethoscope sounds associated with each beat, and all beats between the manually determined SBPs and DBPs were labeled as "Korotkoff." A convolutional neural network was then used to analyze consistency in sound patterns that were associated with Korotkoff sounds. A 10-fold cross-validation strategy was applied to the stethoscope sounds from all 140 subjects, with the data from ten groups of 14 subjects being analyzed separately, allowing consistency to be evaluated between groups. Next, within-subject variation of the Korotkoff sounds analyzed from the three repeats was quantified, separately for each stethoscope sound beat. There was consistency between folds with no significant differences between groups of 14 subjects (P = 0.09 to P = 0.62). Our results showed that 80.7% beats at SBP and 69.5% at DBP were analyzed as Korotkoff sounds, with significant differences between adjacent beats at systole (13.1%, P = 0.001) and diastole (17.4%, P < 0.001). Results reached stability for SBP (97.8%, at sixth beat below SBP) and DBP (98.1%, at sixth beat above DBP) with no significant differences between adjacent beats (SBP P = 0.74; DBP P = 0.88). There were no significant differences at high-cuff pressures, but at low pressures close to diastole there was a small difference (3.3%, P = 0.02). In addition, greater within subject variability was observed at SBP (21.4%) and DBP (28.9%), with a significant difference between both (P < 0.02). In conclusion, this study has demonstrated that Korotkoff sounds can be consistently identified during the period below SBP and above DBP, but that at systole and diastole there can be substantial variations that are associated with high variation in the three repeat measurements in each subject.

Alzheimer’s disease (AD) is the most common form of de-mentia that causes progressive impairment of memory and other cognitive functions. Multivariate regression models have been studied in AD for revealing relationships between neuroimaging measures and cognitive scores to understand how structural changes in brain can influence cognitive sta-tus. Existing regression methods, however, do not explic-itly model dependence relation among multiple scores de-rived from a single cognitive test. It has been found that such dependence can deteriorate the performance of these methods. To overcome this limitation, we propose an effi-cient sparse Bayesian multi-task learning algorithm, which adaptively learns and exploits the dependence to achieve improved prediction performance. The proposed algorithm is applied to a real world neuroimaging study in AD to pre-dict cognitive performance using MRI scans. The effective-ness of the proposed algorithm is demonstrated by its supe-rior prediction performance over multiple state-of-the-art competing methods and accurate identification of compact sets of cognition-relevant imaging biomarkers that are con-sistent with prior knowledge. 1.