Large Language Models (LLMs) have enabled dynamic reasoning in automated data analytics, yet recent multi-agent systems remain limited by rigid, single-path workflows that restrict strategic exploration and often lead to suboptimal outcomes.To overcome these limitations, we propose SPIO (Sequential Plan Integration and Optimization), a framework that replaces rigid workflows with adaptive, multi-path planning across four core modules: data preprocessing, feature engineering, model selection, and hyperparameter tuning.In each module, specialized agents generate diverse candidate strategies, which are cascaded and refined by an optimization agent.SPIO offers two operating modes: SPIO-S for selecting a single optimal pipeline, and SPIO-E for ensembling top-k pipelines to maximize robustness.Extensive evaluations on Kaggle and OpenML benchmarks show that SPIO consistently outperforms state-of-the-art baselines, achieving an average performance gain of 5.6%.By explicitly exploring and integrating multiple solution paths, SPIO delivers a more flexible, accurate, and reliable foundation for automated data science.* denotes equal contribution.† denotes corresponding author(s).

Graph sampling frequently compresses a large graph into a limited screen space. This paper proposes a hierarchical structure model that partitions scale-free graphs into three blocks: the core, which captures the underlying community structure, the vertical graph, which represents minority structures that are important in visual analysis, and the periphery, which describes the connection structure between low-degree nodes. A new algorithm named hierarchical structure sampling (HSS) was then designed to preserve the characteristics of the three blocks, including complete replication of the connection relationship between high-degree nodes in the core, joint node/degree distribution between high- and low-degree nodes in the vertical graph, and proportional replication of the connection relationship between low-degree nodes in the periphery. Finally, the importance of some global statistical properties in visualization was analyzed. Both the global statistical properties and local visual features were used to evaluate the proposed algorithm, which verify that the algorithm can be applied to sample scale-free graphs with hundreds to one million nodes from a visualization perspective.

Abstract In the process of synthetic aperture radar image noise suppression by the bi‐dimensional empirical mode decomposition (BEMD) algorithm, the edge effect is a key problem in the BEMD operation. To weaken this effect, an improved BEMD‐kernel principal component analysis (BEMD‐KPCA) method of image denoising is proposed in this study. Experimental results show that the BEMDKPCA algorithm has a good capability of improving edge effects in the BEMD decomposition process and satisfying the requirement of the reliable decomposition results. Compared with the traditional BEMD method, the proposed approach has a good effect on suppressing speckle noise. Additionally, the denoised image from the decomposed components of the IMFs processed by the BEMD‐KPCA method sufficiently preserves the edge and detail information, confirming its high coherency with the original image.