A State-Migration Particle Swarm Optimizer for Adaptive Latent Factor Analysis of High-Dimensional and Incomplete Data

High-dimensional and incomplete(HDI) matrices are primarily generated in all kinds of big-data-related practical applications. A latent factor analysis(LFA) model is capable of conducting efficient representation learning to an HDI matrix,whose hyper-parameter adaptation can be implemented through a particle swarm optimizer(PSO) to meet scalable requirements.However, conventional PSO is limited by its premature issues,which leads to the accuracy loss of a resultant LFA model. To address this thorny issue, this study merges the information of each particle's state migration into its evolution process following the principle of a generalized momentum method for improving its search ability, thereby building a state-migration particle swarm optimizer(SPSO), whose theoretical convergence is rigorously proved in this study. It is then incorporated into an LFA model for implementing efficient hyper-parameter adaptation without accuracy loss. Experiments on six HDI matrices indicate that an SPSO-incorporated LFA model outperforms state-of-the-art LFA models in terms of prediction accuracy for missing data of an HDI matrix with competitive computational efficiency.Hence, SPSO's use ensures efficient and reliable hyper-parameter adaptation in an LFA model, thus ensuring practicality and accurate representation learning for HDI matrices.

Censored Composite Conditional Quantile Screening for High-Dimensional Survival Data

In this paper,we introduce the censored composite conditional quantile coefficient(cC-CQC)to rank the relative importance of each predictor in high-dimensional censored regression.The cCCQC takes advantage of all useful information across quantiles and can detect nonlinear effects including interactions and heterogeneity,effectively.Furthermore,the proposed screening method based on cCCQC is robust to the existence of outliers and enjoys the sure screening property.Simulation results demonstrate that the proposed method performs competitively on survival datasets of high-dimensional predictors,particularly when the variables are highly correlated.

Optimal Estimation of High-Dimensional Covariance Matrices with Missing and Noisy Data

The estimation of covariance matrices is very important in many fields, such as statistics. In real applications, data are frequently influenced by high dimensions and noise. However, most relevant studies are based on complete data. This paper studies the optimal estimation of high-dimensional covariance matrices based on missing and noisy sample under the norm. First, the model with sub-Gaussian additive noise is presented. The generalized sample covariance is then modified to define a hard thresholding estimator , and the minimax upper bound is derived. After that, the minimax lower bound is derived, and it is concluded that the estimator presented in this article is rate-optimal. Finally, numerical simulation analysis is performed. The result shows that for missing samples with sub-Gaussian noise, if the true covariance matrix is sparse, the hard thresholding estimator outperforms the traditional estimate method.

Similarity measurement method of high-dimensional data based on normalized net lattice subspace

The performance of conventional similarity measurement methods is affected seriously by the curse of dimensionality of high-dimensional data.The reason is that data difference between sparse and noisy dimensionalities occupies a large proportion of the similarity,leading to the dissimilarities between any results.A similarity measurement method of high-dimensional data based on normalized net lattice subspace is proposed.The data range of each dimension is divided into several intervals,and the components in different dimensions are mapped onto the corresponding interval.Only the component in the same or adjacent interval is used to calculate the similarity.To validate this method,three data types are used,and seven common similarity measurement methods are compared.The experimental result indicates that the relative difference of the method is increasing with the dimensionality and is approximately two or three orders of magnitude higher than the conventional method.In addition,the similarity range of this method in different dimensions is [0,1],which is fit for similarity analysis after dimensionality reduction.

数据空间建设的实践进展与运营模式分析——基于Data Spaces Radar的案例

数据空间建设为数据要素的价值实现提供了可资借鉴的实践经验,全面解析其实践进展与运营模式,有助于破解数据流通的现实堵点、拓展数据利用的发展思路。文章首先将结构主义分析方法中的案例研究法作为主要研究方法,综合运用文献调研、比较分析等方法,以Data Spaces Radar为案例来源,从实践进展、运营模式、核心要素等维度提炼数据空间建设特征。其次,在制度与技术的双轮驱动下,数据空间建设秉持制度规范统一性、技术设计整体性和治理模式协同性的架构原则,并按照产业思维、底线思维、信任思维、链式思维、集约思维的底层逻辑,形成较为完整的运营体系。未来应着力探索和解决数据空间视域下的数据资源价值化开发路径,针对数据流通堵点、利用痛点及信任难点问题,从体制机制、政策框架与技术应用等角度为推进我国的数据要素流通利用提供有益参考。

CSFW-SC: Cuckoo Search Fuzzy-Weighting Algorithm for Subspace Clustering Applying to High-Dimensional Clustering

Aimed at the issue that traditional clustering methods are not appropriate to high-dimensional data, a cuckoo search fuzzy-weighting algorithm for subspace clustering is presented on the basis of the exited soft subspace clustering algorithm. In the proposed algorithm, a novel objective function is firstly designed by considering the fuzzy weighting within-cluster compactness and the between-cluster separation, and loosening the constraints of dimension weight matrix. Then gradual membership and improved Cuckoo search, a global search strategy, are introduced to optimize the objective function and search subspace clusters, giving novel learning rules for clustering. At last, the performance of the proposed algorithm on the clustering analysis of various low and high dimensional datasets is experimentally compared with that of several competitive subspace clustering algorithms. Experimental studies demonstrate that the proposed algorithm can obtain better performance than most of the existing soft subspace clustering algorithms.

Indexing the bit-code and distance for fast KNN search in high-dimensional spaces

Various index structures have recently been proposed to facilitate high-dimensional KNN queries, among which the techniques of approximate vector presentation and one-dimensional (1D) transformation can break the curse of dimensionality. Based on the two techniques above, a novel high-dimensional index is proposed, called Bit-code and Distance based index (BD). BD is based on a special partitioning strategy which is optimized for high-dimensional data. By the definitions of bit code and transformation function, a high-dimensional vector can be first approximately represented and then transformed into a 1D vector, the key managed by a B+-tree. A new KNN search algorithm is also proposed that exploits the bit code and distance to prune the search space more effectively. Results of extensive experiments using both synthetic and real data demonstrated that BD out- performs the existing index structures for KNN search in high-dimensional spaces.

A nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix

Problems existin similarity measurement and index tree construction which affect the performance of nearest neighbor search of high-dimensional data. The equidistance problem is solved using NPsim function to calculate similarity. And a sequential NPsim matrix is built to improve indexing performance. To sum up the above innovations,a nearest neighbor search algorithm of high-dimensional data based on sequential NPsim matrix is proposed in comparison with the nearest neighbor search algorithms based on KD-tree or SR-tree on Munsell spectral data set. Experimental results show that the proposed algorithm similarity is better than that of other algorithms and searching speed is more than thousands times of others. In addition,the slow construction speed of sequential NPsim matrix can be increased by using parallel computing.

Global Attractor for High-dimensional Spacially Discrete FitzHugh-Nagumo System in Weighted Space

In this paper,We study the global attractor and its properties on in nite lattice dynamical system FitzHugh-Nagumo in a weighted space lσ^2×lσ^2.We prove the existence and uniqueness of the solution to the lattice dynamical system FitzHugh-Nagumo in lσ^2×lσ^2.Then we get a bounded absorbing set,which suggests the existence of global attractors.Finally,we study the uniform boundedness and the upper semicontinuity of the global attractor.

Dimensionality Reduction of High-Dimensional Highly Correlated Multivariate Grapevine Dataset

Viticulturists traditionally have a keen interest in studying the relationship between the biochemistry of grapevines’ leaves/petioles and their associated spectral reflectance in order to understand the fruit ripening rate, water status, nutrient levels, and disease risk. In this paper, we implement imaging spectroscopy (hyperspectral) reflectance data, for the reflective 330 - 2510 nm wavelength region (986 total spectral bands), to assess vineyard nutrient status;this constitutes a high dimensional dataset with a covariance matrix that is ill-conditioned. The identification of the variables (wavelength bands) that contribute useful information for nutrient assessment and prediction, plays a pivotal role in multivariate statistical modeling. In recent years, researchers have successfully developed many continuous, nearly unbiased, sparse and accurate variable selection methods to overcome this problem. This paper compares four regularized and one functional regression methods: Elastic Net, Multi-Step Adaptive Elastic Net, Minimax Concave Penalty, iterative Sure Independence Screening, and Functional Data Analysis for wavelength variable selection. Thereafter, the predictive performance of these regularized sparse models is enhanced using the stepwise regression. This comparative study of regression methods using a high-dimensional and highly correlated grapevine hyperspectral dataset revealed that the performance of Elastic Net for variable selection yields the best predictive ability.

Making Short-term High-dimensional Data Predictable

Making accurate forecast or prediction is a challenging task in the big data era, in particular for those datasets involving high-dimensional variables but short-term time series points,which are generally available from real-world systems.To address this issue, Prof.

INTERNET TRAFFIC DATA FLOW FORECAST BY RBF NEURAL NETWORK BASED ON PHASE SPACE RECONSTRUCTION

Characteristics of the Internet traffic data flow are studied based on the chaos theory. A phase space that is isometric with the network dynamic system is reconstructed by using the single variable time series of a network flow. Some parameters, such as the correlative dimension and the Lyapunov exponent are calculated, and the chaos characteristic is proved to exist in Internet traffic data flows. A neural network model is construct- ed based on radial basis function （RBF） to forecast actual Internet traffic data flow. Simulation results show that, compared with other forecasts of the forward-feedback neural network, the forecast of the RBF neural network based on the chaos theory has faster learning capacity and higher forecasting accuracy.

Reliable transmission of consultative committee for space data systems file delivery protocol in deep space communication

In consultative committee for space data systems（CCSDS） file delivery protocol（CFDP） recommendation of reliable transmission,there are no detail transmission procedure and delay calculation of prompted negative acknowledge and asynchronous negative acknowledge models.CFDP is designed to provide data and storage management,story and forward,custody transfer and reliable end-to-end delivery over deep space characterized by huge latency,intermittent link,asymmetric bandwidth and big bit error rate（BER）.Four reliable transmission models are analyzed and an expected file-delivery time is calculated with different trans-mission rates,numbers and sizes of packet data units,BERs and frequencies of external events,etc.By comparison of four CFDP models,the requirement of BER for typical missions in deep space is obtained and rules of choosing CFDP models under different uplink state informations are given,which provides references for protocol models selection,utilization and modification.

THE STATE SPACE RECONSTRUCTION TECHNOLOGY OF DIFFERENT KINDS OF CHAOTIC DATA OBTAINED FROM DYNAMICAL SYSTEM

Certain deterministic nonlinear systems may show chaotic behavior. We consider the motion of qualitative information and the practicalities of extracting a part from chaotic experimental data. Our approach based on a theorem of Takens draws on the ideas from the generalized theory of information known as singular system analysis. We illustrate this technique by numerical data from the chaotic region of the chaotic experimental data. The method of the singular-value decomposition is used to calculate the eigenvalues of embedding space matrix. The corresponding concrete algorithm to calculate eigenvectors and to obtain the basis of embedding vector space is proposed in this paper. The projection on the orthogonal basis generated by eigenvectors of timeseries data and concrete paradigm are also provided here. Meanwhile the state space reconstruction technology of different kinds of chaotic data obtained from dynamical system has also been discussed in detail.

Experiment on diffuse reflection laser ranging to space debris and data analysis

Space debris poses a serious threat to human space activities and needs to be measured and cataloged. As a new technology for space target surveillance, the measurement accuracy of diffuse reflection laser ranging （DRLR） is much higher than that of microwave radar and optoelectronic measurement. Based on the laser ranging data of space debris from the DRLR system at Shanghai Astronomical Observatory acquired in March-April, 2013, the characteristics and precision of the laser ranging data are analyzed and their applications in orbit determination of space debris are discussed, which is implemented for the first time in China. The experiment indicates that the precision of laser ranging data can reach 39 cm-228 cm. When the data are sufficient enough （four arcs measured over three days）, the orbital accuracy of space debris can be up to 50 m.

Randomized Latent Factor Model for High-dimensional and Sparse Matrices from Industrial Applications

Latent factor(LF) models are highly effective in extracting useful knowledge from High-Dimensional and Sparse(HiDS) matrices which are commonly seen in various industrial applications. An LF model usually adopts iterative optimizers,which may consume many iterations to achieve a local optima,resulting in considerable time cost. Hence, determining how to accelerate the training process for LF models has become a significant issue. To address this, this work proposes a randomized latent factor(RLF) model. It incorporates the principle of randomized learning techniques from neural networks into the LF analysis of HiDS matrices, thereby greatly alleviating computational burden. It also extends a standard learning process for randomized neural networks in context of LF analysis to make the resulting model represent an HiDS matrix correctly.Experimental results on three HiDS matrices from industrial applications demonstrate that compared with state-of-the-art LF models, RLF is able to achieve significantly higher computational efficiency and comparable prediction accuracy for missing data.I provides an important alternative approach to LF analysis of HiDS matrices, which is especially desired for industrial applications demanding highly efficient models.

Constructing Three-Dimension Space Graph for Outlier Detection Algorithms in Data Mining

Outlier detection has very important applied value in data mining literature. Different outlier detection algorithms based on distinct theories have different definitions and mining processes. The three-dimensional space graph for constructing applied algorithms and an improved GridOf algorithm were proposed in terms of analyzing the existing outlier detection algorithms from criterion and theory. Key words outlier - detection - three-dimensional space graph - data mining CLC number TP 311. 13 - TP 391 Foundation item: Supported by the National Natural Science Foundation of China (70371015)Biography: ZHANG Jing (1975-), female, Ph. D, lecturer, research direction: data mining and knowledge discovery.

Analysis of dynamic of two-phase flow in small channel based on phase space reconstruction combined with data reduction sub-frequency band wavelet

A new method of nonlinear analysis is established by combining phase space reconstruction and data reduction sub-frequency band wavelet. This method is applied to two types of chaotic dynamic systems(Lorenz and Rssler) to examine the anti-noise ability for complex systems. Results show that the nonlinear dynamic system analysis method resists noise and reveals the internal dynamics of a weak signal from noise pollution. On this basis, the vertical upward gas–liquid two-phase flow in a 2 mm × 0.81 mm small rectangular channel is investigated. The frequency and energy distributions of the main oscillation mode are revealed by analyzing the time–frequency spectra of the pressure signals of different flow patterns. The positive power spectral density of singular-value frequency entropy and the damping ratio are extracted to characterize the evolution of flow patterns and achieve accurate recognition of different vertical upward gas–liquid flow patterns(bubbly flow:100%, slug flow: 92%, churn flow: 96%, annular flow: 100%). The proposed analysis method will enrich the dynamics theory of multi-phase flow in small channel.

Observation points classifier ensemble for high-dimensional imbalanced classification

In this paper,an Observation Points Classifier Ensemble(OPCE)algorithm is proposed to deal with High-Dimensional Imbalanced Classification(HDIC)problems based on data processed using the Multi-Dimensional Scaling(MDS)feature extraction technique.First,dimensionality of the original imbalanced data is reduced using MDS so that distances between any two different samples are preserved as well as possible.Second,a novel OPCE algorithm is applied to classify imbalanced samples by placing optimised observation points in a low-dimensional data space.Third,optimization of the observation point mappings is carried out to obtain a reliable assessment of the unknown samples.Exhaustive experiments have been conducted to evaluate the feasibility,rationality,and effectiveness of the proposed OPCE algorithm using seven benchmark HDIC data sets.Experimental results show that(1)the OPCE algorithm can be trained faster on low-dimensional imbalanced data than on high-dimensional data;(2)the OPCE algorithm can correctly identify samples as the number of optimised observation points is increased;and(3)statistical analysis reveals that OPCE yields better HDIC performances on the selected data sets in comparison with eight other HDIC algorithms.This demonstrates that OPCE is a viable algorithm to deal with HDIC problems.

《空间数据与信息传输系统 航天器SpaceFibre总线通信协议》国家标准解读

SpaceFibre总线是专门面向新一代智能航天器在轨海量数据可靠传输设计的新型超高速组网互联技术,其提供了优先级、带宽预留和时隙规划等多种服务质量保证机制,支持最高50Gbps的超高链路传输带宽,具备数据检错重传、链路状态机管理、多信道冗余与平滑降级等多层级容错机制,在航天器安全关键应用领域具有显著优势。制定GB/T 43670—2024《空间数据与信息传输系统SpaceFibre总线通信协议标准》,对于支持SpaceFibre核心芯片和网络系统研制,保证各类星载高性能处理设备之间高速通信接口一致性和匹配性,实现整星系统快速集成测试和不同航天器之间产品可重用性具有极其重要的意义。