Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I ...Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.展开更多
针对高维数据分类问题的特点,提出一种基于改进型局部线性嵌入LLE(Locally Linear Embedding)算法的数据降维算法,结合支持向量机SVM(Support Vector Machine)算法实现数据分类。首先,通过LLE算法降维后的数据集,按照数据集内的离差最小...针对高维数据分类问题的特点,提出一种基于改进型局部线性嵌入LLE(Locally Linear Embedding)算法的数据降维算法,结合支持向量机SVM(Support Vector Machine)算法实现数据分类。首先,通过LLE算法降维后的数据集,按照数据集内的离差最小化,数据集间的离差最大化的原则,计算得到最优化邻近点个数;其次,将最优邻近点个数所得的降维数据作为最优结果,按一定比例选取训练集,输入SVM算法建立数据分类器;最后,将测试集输入训练完成的分类器中,实现最优化数据分类。选取Iris flower,Yale等多类数据集与传统算法进行对比实验,验证算法的可行性。实验结果表明:所提出的算法可以有效地完成数据分类,针对低维数据和高维数据分类问题具有较好的适用性和优越性,在人脸检测中也取得较好的结果。展开更多
基金supported by the Natural Science Foundation of Xinjiang Uygur Autonomous Region of China“Graph problems of topological parameters based on the spectra of graph matrices”(2021D01C069)the National Natural Science Foundation of the People's Republic of China“The investigation of spectral properties of graph operations and their related problems”(12161085)。
文摘Let G be a connected graph of order n and m_(RD)^(L)_(G)I denote the number of reciprocal distance Laplacian eigenvaluesof G in an interval I.For a given interval I,we mainly present several bounds on m_(RD)^(L)_(G)I in terms of various structuralparameters of the graph G,including vertex-connectivity,independence number and pendant vertices.