A redundant subspace weighting procedure for clock ensemble

A redundant-subspace-weighting(RSW)-based approach is proposed to enhance the frequency stability on a time scale of a clock ensemble.In this method,multiple overlapping subspaces are constructed in the clock ensemble,and the weight of each clock in this ensemble is defined by using the spatial covariance matrix.The superimposition average of covariances in different subspaces reduces the correlations between clocks in the same laboratory to some extent.After optimizing the parameters of this weighting procedure,the frequency stabilities of virtual clock ensembles are significantly improved in most cases.

Contrastive Consistency and Attentive Complementarity for Deep Multi-View Subspace Clustering

Deep multi-view subspace clustering (DMVSC) based on self-expression has attracted increasing attention dueto its outstanding performance and nonlinear application. However, most existing methods neglect that viewprivatemeaningless information or noise may interfere with the learning of self-expression, which may lead to thedegeneration of clustering performance. In this paper, we propose a novel framework of Contrastive Consistencyand Attentive Complementarity (CCAC) for DMVsSC. CCAC aligns all the self-expressions of multiple viewsand fuses them based on their discrimination, so that it can effectively explore consistent and complementaryinformation for achieving precise clustering. Specifically, the view-specific self-expression is learned by a selfexpressionlayer embedded into the auto-encoder network for each view. To guarantee consistency across views andreduce the effect of view-private information or noise, we align all the view-specific self-expressions by contrastivelearning. The aligned self-expressions are assigned adaptive weights by channel attention mechanism according totheir discrimination. Then they are fused by convolution kernel to obtain consensus self-expression withmaximumcomplementarity ofmultiple views. Extensive experimental results on four benchmark datasets and one large-scaledataset of the CCAC method outperformother state-of-the-artmethods, demonstrating its clustering effectiveness.

Adaptive detection of range-spread targets in homogeneous and partially homogeneous clutter plus subspace interference

Adaptive detection of range-spread targets is considered in the presence of subspace interference plus Gaussian clutter with unknown covariance matrix.The target signal and interference are supposed to lie in two linearly independent subspaces with deterministic but unknown coordinates.Relying on the two-step criteria,two adaptive detectors based on Gradient tests are proposed,in homogeneous and partially homogeneous clutter plus subspace interference,respectively.Both of the proposed detectors exhibit theoretically constant false alarm rate property against unknown clutter covariance matrix as well as the power level.Numerical results show that,the proposed detectors have better performance than their existing counterparts,especially for mismatches in the signal steering vectors.

Multiscale and Auto-Tuned Semi-Supervised Deep Subspace Clustering and Its Application in Brain Tumor Clustering

In this paper,we introduce a novel Multi-scale and Auto-tuned Semi-supervised Deep Subspace Clustering(MAS-DSC)algorithm,aimed at addressing the challenges of deep subspace clustering in high-dimensional real-world data,particularly in the field of medical imaging.Traditional deep subspace clustering algorithms,which are mostly unsupervised,are limited in their ability to effectively utilize the inherent prior knowledge in medical images.Our MAS-DSC algorithm incorporates a semi-supervised learning framework that uses a small amount of labeled data to guide the clustering process,thereby enhancing the discriminative power of the feature representations.Additionally,the multi-scale feature extraction mechanism is designed to adapt to the complexity of medical imaging data,resulting in more accurate clustering performance.To address the difficulty of hyperparameter selection in deep subspace clustering,this paper employs a Bayesian optimization algorithm for adaptive tuning of hyperparameters related to subspace clustering,prior knowledge constraints,and model loss weights.Extensive experiments on standard clustering datasets,including ORL,Coil20,and Coil100,validate the effectiveness of the MAS-DSC algorithm.The results show that with its multi-scale network structure and Bayesian hyperparameter optimization,MAS-DSC achieves excellent clustering results on these datasets.Furthermore,tests on a brain tumor dataset demonstrate the robustness of the algorithm and its ability to leverage prior knowledge for efficient feature extraction and enhanced clustering performance within a semi-supervised learning framework.

Persymmetric adaptive polarimetric detection of subspace range-spread targets in compound Gaussian sea clutter

This paper focuses on the adaptive detection of range and Doppler dual-spread targets in non-homogeneous and nonGaussian sea clutter.The sea clutter from two polarimetric channels is modeled as a compound-Gaussian model with different parameters,and the target is modeled as a subspace rangespread target model.The persymmetric structure is used to model the clutter covariance matrix,in order to reduce the reliance on secondary data of the designed detectors.Three adaptive polarimetric persymmetric detectors are designed based on the generalized likelihood ratio test(GLRT),Rao test,and Wald test.All the proposed detectors have constant falsealarm rate property with respect to the clutter texture,the speckle covariance matrix.Experimental results on simulated and measured data show that three adaptive detectors outperform the competitors in different clutter environments,and the proposed GLRT detector has the best detection performance under different parameters.

DOA estimation of high-dimensional signals based on Krylov subspace and weighted l_(1)-norm

With the extensive application of large-scale array antennas,the increasing number of array elements leads to the increasing dimension of received signals,making it difficult to meet the real-time requirement of direction of arrival(DOA)estimation due to the computational complexity of algorithms.Traditional subspace algorithms require estimation of the covariance matrix,which has high computational complexity and is prone to producing spurious peaks.In order to reduce the computational complexity of DOA estimation algorithms and improve their estimation accuracy under large array elements,this paper proposes a DOA estimation method based on Krylov subspace and weighted l_(1)-norm.The method uses the multistage Wiener filter(MSWF)iteration to solve the basis of the Krylov subspace as an estimate of the signal subspace,further uses the measurement matrix to reduce the dimensionality of the signal subspace observation,constructs a weighted matrix,and combines the sparse reconstruction to establish a convex optimization function based on the residual sum of squares and weighted l_(1)-norm to solve the target DOA.Simulation results show that the proposed method has high resolution under large array conditions,effectively suppresses spurious peaks,reduces computational complexity,and has good robustness for low signal to noise ratio(SNR)environment.

Low-Rank Multi-View Subspace Clustering Based on Sparse Regularization

Multi-view Subspace Clustering (MVSC) emerges as an advanced clustering method, designed to integrate diverse views to uncover a common subspace, enhancing the accuracy and robustness of clustering results. The significance of low-rank prior in MVSC is emphasized, highlighting its role in capturing the global data structure across views for improved performance. However, it faces challenges with outlier sensitivity due to its reliance on the Frobenius norm for error measurement. Addressing this, our paper proposes a Low-Rank Multi-view Subspace Clustering Based on Sparse Regularization (LMVSC- Sparse) approach. Sparse regularization helps in selecting the most relevant features or views for clustering while ignoring irrelevant or noisy ones. This leads to a more efficient and effective representation of the data, improving the clustering accuracy and robustness, especially in the presence of outliers or noisy data. By incorporating sparse regularization, LMVSC-Sparse can effectively handle outlier sensitivity, which is a common challenge in traditional MVSC methods relying solely on low-rank priors. Then Alternating Direction Method of Multipliers (ADMM) algorithm is employed to solve the proposed optimization problems. Our comprehensive experiments demonstrate the efficiency and effectiveness of LMVSC-Sparse, offering a robust alternative to traditional MVSC methods.

The Study of Root Subspace Decomposition between Characteristic Polynomials and Minimum Polynomial

Let Abe the linear transformation on the linear space V in the field P, Vλibe the root subspace corresponding to the characteristic polynomial of the eigenvalue λi, and Wλibe the root subspace corresponding to the minimum polynomial of λi. Consider the problem of whether Vλiand Wλiare equal under the condition that the characteristic polynomial of Ahas the same eigenvalue as the minimum polynomial (see Theorem 1, 2). This article uses the method of mutual inclusion to prove that Vλi=Wλi. Compared to previous studies and proofs, the results of this research can be directly cited in related works. For instance, they can be directly cited in Daoji Meng’s book “Introduction to Differential Geometry.”

Modeling One Dimensional Two-Cell Model with Tumor Interaction Using Krylov Subspace Methods

A brain tumor occurs when abnormal cells grow, sometimes very rapidly, into an abnormal mass of tissue. The tumor can infect normal tissue, so there is an interaction between healthy and infected cell. The aim of this paper is to propose some efficient and accurate numerical methods for the computational solution of one-dimensional continuous basic models for the growth and control of brain tumors. After computing the analytical solution, we construct approximations of the solution to the problem using a standard second order finite difference method for space discretization and the Crank-Nicolson method for time discretization. Then, we investigate the convergence behavior of Conjugate gradient and generalized minimum residual as Krylov subspace methods to solve the tridiagonal toeplitz matrix system derived.

Subspace Identification for Closed-Loop Systems With Unknown Deterministic Disturbances

This paper presents a subspace identification method for closed-loop systems with unknown deterministic disturbances.To deal with the unknown deterministic disturbances,two strategies are implemented to construct the row space that can be used to approximately represent the unknown deterministic disturbances using the trigonometric functions or Bernstein polynomials depending on whether the disturbance frequencies are known.For closed-loop identification,CCF-N4SID is extended to the case with unknown deterministic disturbances using the oblique projection.In addition,a proper Bernstein polynomial order can be determined using the Akaike information criterion(AIC)or the Bayesian information criterion(BIC).Numerical simulation results demonstrate the effectiveness of the proposed identification method for both periodic and aperiodic deterministic disturbances.

An Improved Soft Subspace Clustering Algorithm for Brain MR Image Segmentation

In recent years,the soft subspace clustering algorithm has shown good results for high-dimensional data,which can assign different weights to each cluster class and use weights to measure the contribution of each dimension in various features.The enhanced soft subspace clustering algorithm combines interclass separation and intraclass tightness information,which has strong results for image segmentation,but the clustering algorithm is vulnerable to noisy data and dependence on the initialized clustering center.However,the clustering algorithmis susceptible to the influence of noisydata and reliance on initializedclustering centers andfalls into a local optimum;the clustering effect is poor for brain MR images with unclear boundaries and noise effects.To address these problems,a soft subspace clustering algorithm for brain MR images based on genetic algorithm optimization is proposed,which combines the generalized noise technique,relaxes the equational weight constraint in the objective function as the boundary constraint,and uses a genetic algorithm as a method to optimize the initialized clustering center.The genetic algorithm finds the best clustering center and reduces the algorithm’s dependence on the initial clustering center.The experiment verifies the robustness of the algorithm,as well as the noise immunity in various ways and shows good results on the common dataset and the brain MR images provided by the Changshu First People’s Hospital with specific high accuracy for clinical medicine.

Subspace Clustering in High-Dimensional Data Streams:A Systematic Literature Review

Clustering high dimensional data is challenging as data dimensionality increases the distance between data points,resulting in sparse regions that degrade clustering performance.Subspace clustering is a common approach for processing high-dimensional data by finding relevant features for each cluster in the data space.Subspace clustering methods extend traditional clustering to account for the constraints imposed by data streams.Data streams are not only high-dimensional,but also unbounded and evolving.This necessitates the development of subspace clustering algorithms that can handle high dimensionality and adapt to the unique characteristics of data streams.Although many articles have contributed to the literature review on data stream clustering,there is currently no specific review on subspace clustering algorithms in high-dimensional data streams.Therefore,this article aims to systematically review the existing literature on subspace clustering of data streams in high-dimensional streaming environments.The review follows a systematic methodological approach and includes 18 articles for the final analysis.The analysis focused on two research questions related to the general clustering process and dealing with the unbounded and evolving characteristics of data streams.The main findings relate to six elements:clustering process,cluster search,subspace search,synopsis structure,cluster maintenance,and evaluation measures.Most algorithms use a two-phase clustering approach consisting of an initialization stage,a refinement stage,a cluster maintenance stage,and a final clustering stage.The density-based top-down subspace clustering approach is more widely used than the others because it is able to distinguish true clusters and outliers using projected microclusters.Most algorithms implicitly adapt to the evolving nature of the data stream by using a time fading function that is sensitive to outliers.Future work can focus on the clustering framework,parameter optimization,subspace search techniques,memory-efficient synopsis structures,explicit cluster change detection,and intrinsic performance metrics.This article can serve as a guide for researchers interested in high-dimensional subspace clustering methods for data streams.

基于改进的Random Subspace 的客户投诉分类方法

电信业的客户投诉不断增多而又亟待高效处理。针对电信客户投诉数据的特点,提出了一种面向高维数据的改进的集成学习分类方法。该方法综合考虑客户投诉中的文本信息及客户通讯状态信息,基于Random Subspace方法,以支持向量机(Support Vector Machine,SVM)为基分类器,采用证据推理(Evidential Reasoning,ER)规则为一种新的集成策略,构造分类模型对电信客户投诉进行分类。所提模型和方法在某电信公司客户投诉数据上进行了验证,实验结果显示该方法能够显著提高客户投诉分类的准确率和投诉处理效率。

Mining maximal pattern-based subspace clusters in high dimensional space

The problem of pattern-based subspace clustering, a special type of subspace clustering that uses pattern similarity as a measure of similarity, is studied. Unlike most traditional clustering algorithms that group the close values of objects in all the dimensions or a set of dimensions, clustering by pattern similarity shows an interesting pattern, where objects exhibit a coherent pattern of rise and fall in subspaces. A novel approach, named EMaPle to mine the maximal pattern-based subspace clusters, is designed. The EMaPle searches clusters only in the attribute enumeration spaces which are relatively few compared to the large number of row combinations in the typical datasets, and it exploits novel pruning techniques. EMaPle can find the clusters satisfying coherent constraints, size constraints and sign constraints neglected in MaPle. Both synthetic data sets and real data sets are used to evaluate EMaPle and demonstrate that it is more effective and scalable than MaPle.

New subspace algorithm for blind channel estimation in OFDM systems

In order to increase the transmission efficiency,a subspace-based algorithm for blind channel estimation using second-order statistics is proposed in orthogonal frequency division multiplexing (OFDM) systems.Because the transmission equation of OFDM systems does not exactly have the desired structure to directly derive a subspace algorithm,the algorithm first divides the OFDM signals into three parts,then,by exploiting the redundancy introduced by the cyclic prefix (CP) in OFDM signals,a new equation with Toeplitz channel matrix is derived.Based on the equation,a new blind subspace algorithm is developed.Toeplitz structure eases the derivation of the subspace algorithm and practical computation.Moreover the algorithm does not change the existing OFDM system,is robust to channel order overdetermination,and the channel zero locations.The performances are demonstrated by simulation results.

Temporal-spatial subspaces modern combination method for 2D-DOA estimation in MIMO radar

A 2D-direction of arrival estimation (DOAE) for multi input and multi-output (MIMO) radar using improved multiple temporal-spatial subspaces in estimating signal parameters via rotational invariance techniques method (TS-ESPRIT) is introduced. In order to realize the improved TS-ESPRIT, the proposed algorithm divides the planar array into multiple uniform sub-planar arrays with common reference point to get a unified phase shifts measurement point for all sub-arrays. The TS-ESPRIT is applied to each sub-array separately, and in the same time with the others to realize the parallelly temporal and spatial processing, so that it reduces the non-linearity effect of model and decreases the computational time. Then, the time difference of arrival (TDOA) technique is applied to combine the multiple sub-arrays in order to form the improved TS-ESPRIT. It is found that the proposed method achieves high accuracy at a low signal to noise ratio (SNR) with low computational complexity, leading to enhancement of the estimators performance.

Third-order nonlinear differential operators preserving invariant subspaces of maximal dimension

In this paper, third-order nonlinear differential operators are studied. It is shown that they are quadratic forms when they preserve invariant subspaces of maximal dimension. A complete description of third-order quadratic operators with constant coefficients is obtained. One example is given to derive special solutions for evolution equations with third-order quadratic operators.

Study of Stochastic Subspace System Identification Method

Stochastic Subspace Identification (SSI) is a novel time domain identification method, which directly uses operational response data to identify the system model by linear algebraic manipulations such as QR factorization and Singular Value Decomposition (SVD). This paper deals with SSI and its applications for structural modal identification. The NASA mini mast model is used for simulations to illustrate how to select input parameters, and to demonstrate identification precision. A real building structure, the Heritage Court Tower (HCT) in Canada is analyzed. From the simulation and test researches, the conclusions can be made to instruct how to identify structural modal parameters using SSI method.

Second-order nonlinear differential operators possessing invariant subspaces of submaximal dimension

The invariant subspace method is used to construct the explicit solution of a nonlinear evolution equation. The second-order nonlinear differential operators that possess invariant subspaces of submaximal dimension are described. There are second-order nonlinear differential operators, including cubic operators and quadratic operators, which preserve an invariant subspace of submaximal dimension. A full. description, of the second-order cubic operators with constant coefficients admitting a four-dimensional invariant subspace is given. It is shown that the maximal dimension of invaxiant subspaces preserved by a second-order cubic operator is four. Several examples are given for the construction of the exact solutions to nonlinear evolution equations with cubic nonlinearities. These solutions blow up in a finite

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.