Continuum versus discrete networks,graph Laplacians,and reproducing kernel Hilbert spaces

Motivated by applications to machine learning, we construct a reversible and irreducible Markov chain whose state space is a certain collection of measurable sets of a chosen l.c.h. space $\mathfrak{X}$. We study the resulting network (connected undirected graph), including transience, Royden and Riesz decompositions, and kernel factorization. We describe a construction for Hilbert spaces of signed measures which comes equipped with a new notion of reproducing kernels and there is a unique solution to a regularized optimization problem involving the approximation of $L^2$ functions by functions of finite energy. The latter has applications to machine learning (for Markov random fields, for example).     

基于图注意力网络的案件罪名预测方法:CP-GAT

案件罪名预测任务是基于文本数据去预测案件所属罪名.针对现有方法在相似罪名和长尾数据集上表现不佳的问题，提出了一种基于图注意力网络的案件罪名预测方法CP-GAT(charge prediction based on graph attention network).该方法首先使用司法文书数据集中的案例事件描述文本和案例对应的法条信息建立异质图结构数据，构建后的异质图包含两种类型的节点(词节点、案例节点)，两种类型的边(词节点与词节点相连的边，词节点与案例节点相连的边).在基于法律文本构建后的异质图上使用图注意力网络进行图特征提取，最后将得到的特征向量输入到罪名预测的分类器中，得到案例所属的罪名.在CAIL2018法律数据集上的实验结果表明，基于图注意力网络的罪名预测方法优于对比实验使用的方法，准确率和宏观F1值分别达到了95.2%和66.1，验证了提出的方法有利于提升案件罪名预测任务的性能.     

On the existence of positive solutions of the p‐Laplacian dynamic equations on time scales

In this paper, we investigate the existence of positive solutions for a nonlinear m‐point boundary value problem for the p‐Laplacian dynamic equations on time scales, by applying a Krasnosel'skii's fixed point theorem. As an application, an example is included to demonstrate the main results. Copyright © 2017 John Wiley & Sons, Ltd.     

On weighted spectral radius of unraveled balls and normalized Laplacian eigenvalues

For a graph G, the unraveled ball of radius r centered at a vertex v is the ball of radius r centered at v in the universal cover of G. We obtain a lower bound on the weighted spectral radius of unraveled balls of fixed radius in a graph with positive weights on edges, which is used to present an upper bound on the $s^{\text{th}}$ (where $s\ge 2$) smallest normalized Laplacian eigenvalue of irregular graphs under minor assumptions. Moreover, when $s=2$, the result may be regarded as an Alon–Boppana type bound for a class of irregular graphs.     

基于小波变换和支持向量机的心电信号ST段分类

摘要: 为完成ECG(Electrocardiogram)信号特征点提取, 并对ST 段分类, 提出了一种基于离散小波变换和支持向量机的ST 分类算法。首先对信号进行预处理, 完成噪声消除, QRS 波群检测和提取特征值; 然后计算ST段平均值、曲线面积和标准差, 并结合使用SVM(Support Vector Machine)对ST段进行分类。Matlab 仿真结果表
明, 小波去噪效果明显,ST 段未出现失真现象, 特征点提取完整。经MIT鄄BIT 数据库验证, 分类结果显示交叉验证准确率平均值为80. 70%, 训练准确率平均值为91. 83%, 测试准确率平均值为74. 28%。     

Mining potential social relationship with active learning in LBSN

Rapid development of local-based social network ( LBSN ) makes it more convenient for re-searchers to carry out studies related to social network.Mining potential social relationship in LBSN is the most important one.Traditionally, researchers use topological relation of social network or tel-ecommunication network to mine potential social relationship.But the effect is unsatisfactory as the network can not provide complete information of topological relation.In this work, a new model called PSRMAL is proposed for mining potential social relationships with LBSN.With the model, better performance is obtained and guaranteed, and experiments verify the effectiveness.     

面向事件的地理要素时空回溯研究

以基础地理数据为例,在研究现实世界-计算机世界-数据库中事件-变更操作-要素之间的逻辑关系的基础上,通过建立要素信息表、事件信息表以及包含事件关联、事件约束的事件树索引体系,提出并实现了面向事件的地理要素的时空回溯方法,为地理要素的时空查询与回溯奠定了基础.     

Explicit–implicit mapping approach to nonlinear blind separation of sparse nonnegative dependent sources from a single mixture: pure component extraction from nonlinear mixture mass spectra

The nonlinear, nonnegative single‐mixture blind source separation problem consists of decomposing observed nonlinearly mixed multicomponent signal into nonnegative dependent component (source) signals. The problem is difficult and is a special case of the underdetermined blind source separation problem. However, it is practically relevant for the contemporary metabolic profiling of biological samples when only one sample is available for acquiring mass spectra; afterwards, the pure components are extracted. Herein, we present a method for the blind separation of nonnegative dependent sources from a single, nonlinear mixture. First, an explicit feature map is used to map a single mixture into a pseudo multi‐mixture. Second, an empirical kernel map is used for implicit mapping of a pseudo multi‐mixture into a high‐dimensional reproducible kernel Hilbert space. Under sparse probabilistic conditions that were previously imposed on sources, the single‐mixture nonlinear problem is converted into an equivalent linear, multiple‐mixture problem that consists of the original sources and their higher‐order monomials. These monomials are suppressed by robust principal component analysis and hard, soft, and trimmed thresholding. Sparseness‐constrained nonnegative matrix factorizations in reproducible kernel Hilbert space yield sets of separated components. Afterwards, separated components are annotated with the pure components from the library using the maximal correlation criterion. The proposed method is depicted with a numerical example that is related to the extraction of eight dependent components from one nonlinear mixture. The method is further demonstrated on three nonlinear chemical reactions of peptide synthesis in which 25, 19, and 28 dependent analytes are extracted from one nonlinear mixture mass spectra. The goal application of the proposed method is, in combination with other separation techniques, mass spectrometry‐based non‐targeted metabolic profiling, such as biomarker identification studies. Copyright © 2015 John Wiley & Sons, Ltd.     

基于特征融合的视频异常事件检测方法

为有效对视频数据进行降维并去除特征集合中的冗余信息, 以提高异常事件的检测效率, 从特征提取和选择的角度提出了融合特征区分度和相关性的视频异常事件检测方法。利用视频数据的时空邻域信息进行特征提取。通过分析特征的判别力和相关性进行特征选择, 从而去除特征集合中的冗余信息, 提高异常事件检测的效率和准确性。实验结果表明, 该方法的检测准确率都优于其他传统方法, 能有效地对场景中发生异常事件的区域进行准确定位。