We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner...We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner product defined on both the unit ball and the unit sphere, construct the kernel-regularized learning algorithm from the view of semi-supervised learning and bound the upper bounds for the learning rates. The theory analysis shows that the learning algorithm has better uniform convergence according to the number of samples. The research can be regarded as an application of kernel-regularized semi-supervised learning.展开更多
为了对大量电力用户的稀疏、不规律的日耗电量数据进行特征分析,并对用户进行分类,文章提出一种函数性数据聚类分析方法。首先,应用kernel方法将离散的电量数据还原成连续曲线;然后,受Sobolev空间距离的启发,定义了新的函数距离,用于k-m...为了对大量电力用户的稀疏、不规律的日耗电量数据进行特征分析,并对用户进行分类,文章提出一种函数性数据聚类分析方法。首先,应用kernel方法将离散的电量数据还原成连续曲线;然后,受Sobolev空间距离的启发,定义了新的函数距离,用于k-means算法进行聚类。以某城市10 000户居民538天的实际用电数据进行实验,得到了用户在不同距离和聚类个数下的聚类原型。实验结果显示,由于选取的用户主要是城市居民,其用电模式比较相似:大高峰时段主要在6—9月,小高峰时段主要在1—2月,日消耗波动较小。而不同用户类别的主要区别体现在用电量的范围上:低耗电用户整体低于13 k W?h/天,高耗电用户接近100 k W?h/天。展开更多
In this paper, an improved nonlinear process fault detection method is proposed based on modified kernel partial least squares(KPLS). By integrating the statistical local approach(SLA) into the KPLS framework, two new...In this paper, an improved nonlinear process fault detection method is proposed based on modified kernel partial least squares(KPLS). By integrating the statistical local approach(SLA) into the KPLS framework, two new statistics are established to monitor changes in the underlying model. The new modeling strategy can avoid the Gaussian distribution assumption of KPLS. Besides, advantage of the proposed method is that the kernel latent variables can be obtained directly through the eigen value decomposition instead of the iterative calculation, which can improve the computing speed. The new method is applied to fault detection in the simulation benchmark of the Tennessee Eastman process. The simulation results show superiority on detection sensitivity and accuracy in comparison to KPLS monitoring.展开更多
In this paper,an efficient multi-step scheme is presented based on reproducing kernel Hilbert space(RKHS)theory for solving ordinary stiff differential systems.The solution methodology depends on reproducing kernel fu...In this paper,an efficient multi-step scheme is presented based on reproducing kernel Hilbert space(RKHS)theory for solving ordinary stiff differential systems.The solution methodology depends on reproducing kernel functions to obtain analytic solutions in a uniform formfor a rapidly convergent series in the posed Sobolev space.Using the Gram-Schmidt orthogonality process,complete orthogonal essential functions are obtained in a compact field to encompass Fourier series expansion with the help of kernel properties reproduction.Consequently,by applying the standard RKHS method to each subinterval,approximate solutions that converge uniformly to the exact solutions are obtained.For this purpose,several numerical examples are tested to show proposed algorithm’s superiority,simplicity,and efficiency.The gained results indicate that themulti-step RKHSmethod is suitable for solving linear and nonlinear stiffness systems over an extensive duration and giving highly accurate outcomes.展开更多
For the kernel K-mean cluster method is run in an implicit feature space, the initial and iterative cluster centers cannot be defined explicitly. Against the deficiency of the initial cluster centers selected in the o...For the kernel K-mean cluster method is run in an implicit feature space, the initial and iterative cluster centers cannot be defined explicitly. Against the deficiency of the initial cluster centers selected in the original space discretionarily in the existing methods, this paper proposes a new method for ensuring the clustering center that virtual clustering centers are defined in the feature space by the original classification as the initial cluster centers and the iteration clustering centers are ensured by the further virtual classification. The improved method is used for fault diagnosis of roller bearing that achieves a good cluster and diagnosis result, which demonstrates the effectiveness of the proposed method.展开更多
The kernel of interval grey number is most likely the real number,which can be used to represent whitenization value of interval grey number.A novel method for calculating kernel of interval grey number is constructed...The kernel of interval grey number is most likely the real number,which can be used to represent whitenization value of interval grey number.A novel method for calculating kernel of interval grey number is constructed based on the geometric barycenter of whitenization weight function in the two-dimensional coordinate plane,and the calculation of kernel is converted to the calculation of barycenter in geometric figures.The method fully considers the effect of all information contained in whitenization weight function on the calculation result of kernel,and is the extension and perfection of the existing methods in the scope of application.展开更多
Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be labeled.However,multiple kernel clustering for incomplete da...Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be labeled.However,multiple kernel clustering for incomplete data is a critical yet challenging task.Although the existing absent multiple kernel clustering methods have achieved remarkable performance on this task,they may fail when data has a high value-missing rate,and they may easily fall into a local optimum.To address these problems,in this paper,we propose an absent multiple kernel clustering(AMKC)method on incomplete data.The AMKC method rst clusters the initialized incomplete data.Then,it constructs a new multiple-kernel-based data space,referred to as K-space,from multiple sources to learn kernel combination coefcients.Finally,it seamlessly integrates an incomplete-kernel-imputation objective,a multiple-kernel-learning objective,and a kernel-clustering objective in order to achieve absent multiple kernel clustering.The three stages in this process are carried out simultaneously until the convergence condition is met.Experiments on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is signicantly better than state-of-the-art competitors.Meanwhile,the proposed method gains fast convergence speed.展开更多
A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickl...A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickly produce balanced clusters of similar sizes in the kernel feature space,which makes it efficient and effective for reducing training samples.Theoretical analysis and experimental results on three UCI real data benchmarks both show that,with very short sampling time,the proposed algorithm dramatically accelerates SVM sampling and training while maintaining high test accuracy.展开更多
The analysis of microstates in EEG signals is a crucial technique for understanding the spatiotemporal dynamics of brain electrical activity.Traditional methods such as Atomic Agglomerative Hierarchical Clustering(AAH...The analysis of microstates in EEG signals is a crucial technique for understanding the spatiotemporal dynamics of brain electrical activity.Traditional methods such as Atomic Agglomerative Hierarchical Clustering(AAHC),K-means clustering,Principal Component Analysis(PCA),and Independent Component Analysis(ICA)are limited by a fixed number of microstate maps and insufficient capability in cross-task feature extraction.Tackling these limitations,this study introduces a Global Map Dissimilarity(GMD)-driven density canopy K-means clustering algorithm.This innovative approach autonomously determines the optimal number of EEG microstate topographies and employs Gaussian kernel density estimation alongside the GMD index for dynamic modeling of EEG data.Utilizing this advanced algorithm,the study analyzes the Motor Imagery(MI)dataset from the GigaScience database,GigaDB.The findings reveal six distinct microstates during actual right-hand movement and five microstates across other task conditions,with microstate C showing superior performance in all task states.During imagined movement,microstate A was significantly enhanced.Comparison with existing algorithms indicates a significant improvement in clustering performance by the refined method,with an average Calinski-Harabasz Index(CHI)of 35517.29 and a Davis-Bouldin Index(DBI)average of 2.57.Furthermore,an information-theoretical analysis of the microstate sequences suggests that imagined movement exhibits higher complexity and disorder than actual movement.By utilizing the extracted microstate sequence parameters as features,the improved algorithm achieved a classification accuracy of 98.41%in EEG signal categorization for motor imagery.A performance of 78.183%accuracy was achieved in a four-class motor imagery task on the BCI-IV-2a dataset.These results demonstrate the potential of the advanced algorithm in microstate analysis,offering a more effective tool for a deeper understanding of the spatiotemporal features of EEG signals.展开更多
文摘We provide a kernel-regularized method to give theory solutions for Neumann boundary value problem on the unit ball. We define the reproducing kernel Hilbert space with the spherical harmonics associated with an inner product defined on both the unit ball and the unit sphere, construct the kernel-regularized learning algorithm from the view of semi-supervised learning and bound the upper bounds for the learning rates. The theory analysis shows that the learning algorithm has better uniform convergence according to the number of samples. The research can be regarded as an application of kernel-regularized semi-supervised learning.
基金Projected Supported by the National High Technology Research and Development Program of China(863 Program)(2015AA050203)National Talents Training Base for Basic Research and Teaching of Natural Science of China(J1103105)~~
文摘为了对大量电力用户的稀疏、不规律的日耗电量数据进行特征分析,并对用户进行分类,文章提出一种函数性数据聚类分析方法。首先,应用kernel方法将离散的电量数据还原成连续曲线;然后,受Sobolev空间距离的启发,定义了新的函数距离,用于k-means算法进行聚类。以某城市10 000户居民538天的实际用电数据进行实验,得到了用户在不同距离和聚类个数下的聚类原型。实验结果显示,由于选取的用户主要是城市居民,其用电模式比较相似:大高峰时段主要在6—9月,小高峰时段主要在1—2月,日消耗波动较小。而不同用户类别的主要区别体现在用电量的范围上:低耗电用户整体低于13 k W?h/天,高耗电用户接近100 k W?h/天。
基金Supported by the Special Scientific Research of Selection and Cultivation of Excellent Young Teachers in Shanghai Universities(YYY11076)
文摘In this paper, an improved nonlinear process fault detection method is proposed based on modified kernel partial least squares(KPLS). By integrating the statistical local approach(SLA) into the KPLS framework, two new statistics are established to monitor changes in the underlying model. The new modeling strategy can avoid the Gaussian distribution assumption of KPLS. Besides, advantage of the proposed method is that the kernel latent variables can be obtained directly through the eigen value decomposition instead of the iterative calculation, which can improve the computing speed. The new method is applied to fault detection in the simulation benchmark of the Tennessee Eastman process. The simulation results show superiority on detection sensitivity and accuracy in comparison to KPLS monitoring.
文摘In this paper,an efficient multi-step scheme is presented based on reproducing kernel Hilbert space(RKHS)theory for solving ordinary stiff differential systems.The solution methodology depends on reproducing kernel functions to obtain analytic solutions in a uniform formfor a rapidly convergent series in the posed Sobolev space.Using the Gram-Schmidt orthogonality process,complete orthogonal essential functions are obtained in a compact field to encompass Fourier series expansion with the help of kernel properties reproduction.Consequently,by applying the standard RKHS method to each subinterval,approximate solutions that converge uniformly to the exact solutions are obtained.For this purpose,several numerical examples are tested to show proposed algorithm’s superiority,simplicity,and efficiency.The gained results indicate that themulti-step RKHSmethod is suitable for solving linear and nonlinear stiffness systems over an extensive duration and giving highly accurate outcomes.
文摘For the kernel K-mean cluster method is run in an implicit feature space, the initial and iterative cluster centers cannot be defined explicitly. Against the deficiency of the initial cluster centers selected in the original space discretionarily in the existing methods, this paper proposes a new method for ensuring the clustering center that virtual clustering centers are defined in the feature space by the original classification as the initial cluster centers and the iteration clustering centers are ensured by the further virtual classification. The improved method is used for fault diagnosis of roller bearing that achieves a good cluster and diagnosis result, which demonstrates the effectiveness of the proposed method.
基金Supported by the National Natural Science Foundation of China(71271226,70971064,71101159)the Humanities and Social Science Foundation of Ministry of Education(11YJC630273,12YJC630140)+4 种基金the Program for Chongqing Innovation Team in University(KJTD201313)the Science and Technology Research Projects of Chongqing Education Commission(KJ120706)the Open Foundation of Chongqing Key Laboratory of Electronic Commerce and Supply Chain System(2012ECSC0101)the Special Fund of Chongqing Key Laboratory of Electronic Commerce and Supply Chain System(2012ECSC0217)the Chongqing City Board of Education Science and Technology Research Projects(1202010)
文摘The kernel of interval grey number is most likely the real number,which can be used to represent whitenization value of interval grey number.A novel method for calculating kernel of interval grey number is constructed based on the geometric barycenter of whitenization weight function in the two-dimensional coordinate plane,and the calculation of kernel is converted to the calculation of barycenter in geometric figures.The method fully considers the effect of all information contained in whitenization weight function on the calculation result of kernel,and is the extension and perfection of the existing methods in the scope of application.
基金funded by National Natural Science Foundation of China under Grant Nos.61972057 and U1836208Hunan Provincial Natural Science Foundation of China under Grant No.2019JJ50655+3 种基金Scientic Research Foundation of Hunan Provincial Education Department of China under Grant No.18B160Open Fund of Hunan Key Laboratory of Smart Roadway and Cooperative Vehicle Infrastructure Systems(Changsha University of Science and Technology)under Grant No.kfj180402the“Double First-class”International Cooperation and Development Scientic Research Project of Changsha University of Science and Technology under Grant No.2018IC25the Researchers Supporting Project No.(RSP-2020/102)King Saud University,Riyadh,Saudi Arabia.
文摘Multiple kernel clustering is an unsupervised data analysis method that has been used in various scenarios where data is easy to be collected but hard to be labeled.However,multiple kernel clustering for incomplete data is a critical yet challenging task.Although the existing absent multiple kernel clustering methods have achieved remarkable performance on this task,they may fail when data has a high value-missing rate,and they may easily fall into a local optimum.To address these problems,in this paper,we propose an absent multiple kernel clustering(AMKC)method on incomplete data.The AMKC method rst clusters the initialized incomplete data.Then,it constructs a new multiple-kernel-based data space,referred to as K-space,from multiple sources to learn kernel combination coefcients.Finally,it seamlessly integrates an incomplete-kernel-imputation objective,a multiple-kernel-learning objective,and a kernel-clustering objective in order to achieve absent multiple kernel clustering.The three stages in this process are carried out simultaneously until the convergence condition is met.Experiments on six datasets with various characteristics demonstrate that the kernel imputation and clustering performance of the proposed method is signicantly better than state-of-the-art competitors.Meanwhile,the proposed method gains fast convergence speed.
基金National Natural Science Foundation of China (No. 60975083)Key Grant Project,Ministry of Education,China(No. 104145)
文摘A new algorithm named kernel bisecting k-means and sample removal(KBK-SR) is proposed as sampling preprocessing for support vector machine(SVM) training to improve the efficiency.The proposed algorithm tends to quickly produce balanced clusters of similar sizes in the kernel feature space,which makes it efficient and effective for reducing training samples.Theoretical analysis and experimental results on three UCI real data benchmarks both show that,with very short sampling time,the proposed algorithm dramatically accelerates SVM sampling and training while maintaining high test accuracy.
基金funded by National Nature Science Foundation of China,Yunnan Funda-Mental Research Projects,Special Project of Guangdong Province in Key Fields of Ordinary Colleges and Universities and Chaozhou Science and Technology Plan Project of Funder Grant Numbers 82060329,202201AT070108,2023ZDZX2038 and 202201GY01.
文摘The analysis of microstates in EEG signals is a crucial technique for understanding the spatiotemporal dynamics of brain electrical activity.Traditional methods such as Atomic Agglomerative Hierarchical Clustering(AAHC),K-means clustering,Principal Component Analysis(PCA),and Independent Component Analysis(ICA)are limited by a fixed number of microstate maps and insufficient capability in cross-task feature extraction.Tackling these limitations,this study introduces a Global Map Dissimilarity(GMD)-driven density canopy K-means clustering algorithm.This innovative approach autonomously determines the optimal number of EEG microstate topographies and employs Gaussian kernel density estimation alongside the GMD index for dynamic modeling of EEG data.Utilizing this advanced algorithm,the study analyzes the Motor Imagery(MI)dataset from the GigaScience database,GigaDB.The findings reveal six distinct microstates during actual right-hand movement and five microstates across other task conditions,with microstate C showing superior performance in all task states.During imagined movement,microstate A was significantly enhanced.Comparison with existing algorithms indicates a significant improvement in clustering performance by the refined method,with an average Calinski-Harabasz Index(CHI)of 35517.29 and a Davis-Bouldin Index(DBI)average of 2.57.Furthermore,an information-theoretical analysis of the microstate sequences suggests that imagined movement exhibits higher complexity and disorder than actual movement.By utilizing the extracted microstate sequence parameters as features,the improved algorithm achieved a classification accuracy of 98.41%in EEG signal categorization for motor imagery.A performance of 78.183%accuracy was achieved in a four-class motor imagery task on the BCI-IV-2a dataset.These results demonstrate the potential of the advanced algorithm in microstate analysis,offering a more effective tool for a deeper understanding of the spatiotemporal features of EEG signals.