基于双图混合随机游走的社会化推荐模型

近年来,可以有效缓解数据稀疏和冷启动问题的社会化推荐受到了研究者和业界的关注.社会化推荐利用显式或隐式社交关系作为辅助信息,提升了推荐性能.然而,目前的社会化推荐模型通常采用普通图描述社交关系.普通图中的边常描述为成对节点的关系,这种方法适合描述显式关系,但难以描述复杂的隐式关系,如购买过同一商品的多个用户之间的集合关系,因此难以学习到准确的节点表示,影响推荐的性能.针对此问题,本文结合超图和普通图,提出基于双图混合随机游走的推荐（BG-Rec）模型.构建超图描述复杂的隐式关系,同时用普通图描述显式的社交关系,并在两种图上定义混合随机游走策略,生成结合隐式关系和显式关系的游走节点序列,学习更准确的节点嵌入表示.根据用户评分的高低,构建了正反馈超图和负反馈超图,考虑更细粒度的朋友关系,以识别可靠的朋友.融合可靠朋友的偏好和后验概率最大化优化物品个性化排序.三个公开数据集的大量实验表明了BG-Rec在推荐性能上的优越性,冷启动和消融实验表明了其在缓解冷启动问题的有效性和超图建模的合理性.     

基于加权的社会网络重要节点发现算法研究

本文针对网络一般算法存在问题,提出来一种基于加权的社会网络重要节点发现算法。该算法基于社会网络中节点和边的属性进行有向加权社会网络建模,融合节点之间相对重要性理论和网络拓扑原理,共同发现加权的社会网络中的重要节点。     

基于稀疏方位超图匹配的图像配准算法

为提高超图匹配的正确匹配率并降低其计算复杂度,提出了一种基于稀疏方位超图匹配的图像配准算法。提取图像的结构特征点为图节点,采用最小生成树算法获取节点间的主要连接关系,并用包含邻近的节点与边的三元组结构定义超边,计算超边的方位角度信息,由此构建稀疏方位超图;利用方位信息构建亲近矩阵,并采用全局最优匹配方法实现匹配。实验表明,对于实际图像的配准,该算法既具有较低的计算复杂度,又有良好的匹配效果。     

基于随机游走和多样性图排序的个性化服务推荐方法

针对传统服务推荐算法由于数据稀疏性而导致推荐准确性不高,以及推荐结果缺乏多样性等缺陷,提出基于随机游走和多样性图排序的个性化服务推荐方法（PRWDR）.在分析直接相似关系稀疏性的基础上提出带权重的随机游走模型,通过在用户网络上进行随机游走来挖掘更多的相似关系;基于所有相似用户预测服务的QoS值,并给出服务图模型构建方法,以过滤大量性能过低的候选服务;提出最优节点集合选取策略,利用贪婪算法得到兼具推荐准确性和功能多样性的服务推荐列表.在公开发布的数据集上进行实验,并与多个经典算法进行比较,验证了本算法的有效性.     

企业科技创新团队申请专利系统研究——基于超网络视角

基于加权超图的超网络分析法为复杂系统的描述提供了新的途径.本文利用超网络分析法对企业科技创新团队申请专利系统进行研究,建立了基于加权超图的某企业科技创新团队申请专利系统的超网络,分析了超网络的拓扑结构特征,对超网络的结构进行了测量,最后分析了超网络的演化过程,动态地描述了企业科技创新团队的形成过程.通过计算发现,超网络...     

基于局域世界的WSN拓扑加权演化模型

 无标度加权网络模型,反映了现实网络的存在形式和动力学特征,是无线传感网络建模和拓扑演化的有效研究工具.本文基于局域世界理论提出一种不均匀成簇的无线传感网络拓扑动态加权演化模型,考虑节点能量,通信流量和距离等因素,对边权重和节点强度进行了定义,同时研究了拓扑生长对边权重分布的影响.实验证明演化所得网络节点度,强度和边权重均服从幂律分布,结合已有理论成果可知,该拓扑不仅继承了无权网络较高的鲁棒性和抗毁性,同时降低了节点发生相继故障的几率,增强了无线传感网络的同步能力.     

基于跳距修正粒子群优化的WSN定位算法

针对DV-Hop算法在节点随机分布的网络拓扑环境中存在较大误差的问题,提出了一种基于跳距修正粒子群优化的定位算法WPDV-Hop(weight PSO DV-Hop)。本算法通过对锚节点广播的数据分组结构进行了改进,对参考锚节点的平均每跳距离的误差进行加权处理以及用改进的粒子群(PSO)算法对定位中的迭代过程进行优化,实现WPDV-Hop定位算法的全面改进,以提高定位精度。仿真结果表明,改进的算法与原始算法相比,定位精度和算法的稳定性有明显提高。     

基于层次化随机游走算法的静态P/G网分析

将随机游走法和层次法相结合,采用层次化随机游走法对静态P/G网(Power and Ground Networks)进行分析.针对大规模的电路,在通过多层的参数提取和建模得到静态P/G网模型后,运用层次法将P/G网分割,在子网内采用随机游走法,并且在此基础上比较5种加速算法.实验数据表明,改进的双共轭梯度(BCG)随机游走法的计算速度是普通随机游走法的6倍以及是层次法的14倍.新方法有效地节省了计算时间,有益于对P/G网的研究.     

距离加权的二进制传感器网络目标跟踪算法

提出了基于距离加权的二进制传感器网络中的目标跟踪算法.该算法可在二进制传感器节点判决输出信息比特的同时产生感测节点的权值.仿真结果证明了基于距离加权的目标跟踪算法的有效性,并且不论目标运动采用直线、曲线或随机轨迹,都具有良好的性能,误差分布均集中在[0,0.2]的区间范围中.     

基于完全加权正负关联模式挖掘的越-英跨语言查询译后扩展

主题漂移和词不匹配是自然语言处理中一个难题,文本挖掘与信息检索的结合有助于解决该问题.鉴于此,本文提出一种基于完全加权正负关联模式挖掘的越-英跨语言查询译后扩展算法.该算法采用新的完全加权正负项集支持度和关联度计算方法以及模式评价框架,对初检用户相关反馈文档集挖掘与原查询词相关的正负关联模式,从模式中提取扩展词实现跨语言查询译后扩展.与现有基于伪相关反馈、加权关联模式挖掘的跨语言扩展算法比较,本文算法能有效地减少查询主题漂移和词不匹配问题,提高跨语言信息检索性能;本文模式挖掘方法可用于推荐系统,提高其准确性.     

融合耦合距离区分度和强类别特征的短文本相似度计算方法

短文本相似度计算在社会网络、文本挖掘和自然语言处理等领域中起着至关重要的作用.针对短文本内容简短、特征稀疏等特点,以及传统的短文本相似度计算忽略类别信息等问题,提出一种融合耦合距离区分度和强类别特征的短文本相似度计算方法.一方面,在整个短文本语料库中利用两个共现词之间的距离计算词项共现距离相关度,并以此来对词项加权从而捕获词项间内联和外联关系,得到短文本的耦合距离区分度相似度;另一方面,基于少量带类别标签的监督数据提取每类中强类别区分能力的特征项作为强类别特征集合,并利用词项的上下文来对强类别特征语义消歧,然后基于文本间包含相同类别的强类别特征数量来衡量文本间的相似度.最后,本文结合耦合距离区分度和强类别特征来衡量短文本的相似度.经实验证明本文提出的方法能够提高短文本相似度计算的准确率.     

基于超图排序算法的视频摘要

视频摘要技术作为一种快速感知视频内容的方式得到了广泛的关注.现有基于图模型的视频摘要方法将视频帧作为顶点,通过边表示两个顶点之间的关系,但并不能很好地捕获视频帧之间的复杂关系.为了克服该缺点,本文提出了一种基于超图排序算法的静态视频摘要方法（Hyper-Graph Ranking based Video Summarization,HGRVS）.HGRVS方法首先通过构建视频超图模型,将任意多个有内在关联的视频帧使用一条超边连接;然后提出一种基于超图排序的视频帧分类算法将视频帧按内容分类;最后通过求解提出的一种优化函数来生成静态视频摘要.在Open Video Project和YouTube两个数据集上的大量主观与客观实验验证了所提HGRVS算法的优良性能.     

Decentralized State Initialization with Delay Compensation for Multi-modal Sensor Networks

Decentralized processing algorithms are attractive alternatives to centralized algorithms for target tracking applications in smart sensor networks since they provide the ability to scale, reduce vulnerability, reduce communication, and share processing responsibilities among individual nodes. Sharing the processing responsibilities allows parallel processing of raw data at the individual nodes. However, this introduces other difficulties in multi-modal smart sensor networks, such as non-observability of the targets’ states at any individual node and various delays such as varying processing delays, communication delays and signal propagation delays for the different modalities. In this paper, we provide a novel algorithm to determine the initial probability distribution of multiple targets’ states in a decentralized manner. The targets’ state vectors consist of the targets’ positions and velocities on the 2D plane. Our approach can determine the state vector distribution even if the individual sensors alone are not capable of observing it. Our approach can also compensate for varying delays among the assorted modalities. The resulting distribution can be used to initialize various tracking algorithms. Our approach is based on Monte Carlo methods, where the state distributions are represented by a weighted set of discrete state realizations. A robust weighting strategy is formulated to account for missed detections, clutter and estimation delays. To demonstrate the effectiveness of the algorithm, we simulate a network with direction-of-arrival nodes and range-Doppler nodes.     

Frontal face authentication using morphological elastic graphmatching

A novel dynamic link architecture based on multiscale morphological dilation-erosion is proposed for frontal face authentication. Instead of a set of Gabor filters tuned to different orientations and scales, multiscale morphological operations are employed to yield a feature vector at each node of the reference grid. Linear projection algorithms for feature selection and automatic weighting of the nodes according to their discriminatory power succeed to increase the authentication capability of the method. The performance of the morphological dynamic link architecture is evaluated in terms of the receiver operating characteristic in the M2VTS face image database. The comparison with other frontal face authentication algorithms indicates that the morphological dynamic link architecture with discriminatory power coefficients is the best algorithm with respect to the equal error rate achieved.     

Fast principal component extraction by a weighted informationcriterion

Principal component analysis (PCA) is an essential technique in data compression and feature extraction, and there has been much interest in developing fast PICA algorithms. On the basis of the concepts of both weighted subspace and information maximization, this paper proposes a weighted information criterion (WINC) for searching the optimal solution of a linear neural network. We analytically show that the optimum weights globally asymptotically converge to the principal eigenvectors of a stationary vector stochastic process. We establish a dependent relation of choosing the weighting matrix on statistics of the input process through the analysis of stability of the equilibrium of the proposed criterion. Therefore, we are able to reveal the constraint on the choice of a weighting matrix. We develop two adaptive algorithms based on the WINC for extracting in parallel multiple principal components. Both algorithms are able to provide adaptive step size, which leads to a significant improvement in the learning performance. Furthermore, the recursive least squares (RLS) version of WINC algorithms has a low computational complexity O(Np), where N is the input vector dimension, and p is the number of desired principal components. In fact, the WINC algorithm corresponds to a three-layer linear neural network model capable of performing, in parallel, the extraction of multiple principal components. The WINC algorithm also generalizes some well-known PCA/PSA algorithms just by adjusting the corresponding parameters. Since the weighting matrix does not require an accurate value, it facilitates the system design of the WINC algorithm for practical applications. The accuracy and speed advantages of the WINC algorithm are verified through simulations     

基于超图正则化受限的概念分解算法

针对概念分解(Concept Factorization, CF)算法没有同时考虑样本中存在的类别信息及数据间多元几何结构信息的问题,该文提出一种基于超图正则化受限的概念分解(Hyper-graph regularized Constrained Concept Factorization, HCCF)算法。HCCF算法通过构建一个无向加权的拉普拉斯超图正则项,提取数据间的多元几何结构信息,克服了传统图模型只能表达数据间成对关系的缺陷;同时采用硬约束的方式使样本的类别信息在低维空间中保持一致,充分利用了标记样本的类别信息。该文采用乘性迭代的方法求解HCCF算法的目标函数并证明了其收敛性。在TDT2库、Reuters库和PIE库上的实验结果表明,HCCF算法提高了聚类的准确率和归一化互信息,验证了算法的有效性。     

基于增量式鲁棒非负矩阵分解的短文本在线聚类

对社会化媒体产生的大量短文本进行聚类分析具有重要的应用价值,但短文本往往具有噪音数据多、增长迅速且数据量大的特点,导致现有相关算法难于有效处理.提出一种基于增量式鲁棒非负矩阵分解的短文本在线聚类算法STOCIRNMF.STOCIRNMF基于非负矩阵分解构建短文本聚类模型,通过l_2,1范数设计模型的优化求解目标函数提高鲁棒性,同时应用增量式迭代更新规则实现短文本的在线聚类.在搜狐新闻标题和微博短文本数据集上进行相关实验,结果表明STOCIRNMF不仅比现有代表性算法具有更好的聚类性能,而且能够有效对微博话题进行在线检测.     

一种基于改进W-SVM算法的概率密度估计

研究了基于加权支持向量机的概率密度估计算法。现有算法只考虑采样时间或样本密度,导致概率密度结果误差较大。为提升估计精度,文中提出了一种改进的W-SVM算法,该算法同时考虑了采用时间和区域样本点,依次选择不同的加权惩罚系数,并对加权系数进行归一化处理,最后采用网格寻优法找出最合适的加权系数。仿真结果表明,所提改进加权支持向量的概率密度估计的均方误差远小于传统算法,即所提算法优于传统算法。     

General approach to first-order error prediction in rigid point registration

A general approach to the first-order analysis of error in rigid point registration is presented that accommodates fiducial localization error (FLE) that may be inhomogeneous (varying from point to point) and anisotropic (varying with direction) and also accommodates arbitrary weighting that may also be inhomogeneous and anisotropic. Covariances are derived for target registration error (TRE) and for weighted fiducial registration error (FRE) in terms of covariances of FLE, culminating in a simple implementation that encompasses all combinations of weightings and anisotropy. Furthermore, it is shown that for ideal weighting, in which the weighting matrix for each fiducial equals the inverse of the square root of the cross covariance of its two-space FLE, fluctuations of FRE and TRE are mutually independent. These results are validated by comparison with previously published expressions and by simulation. Furthermore, simulations for randomly generated fiducial positions and FLEs are presented that show that correlation is negligible (correlation coefficient < 0.1) in the exact case for both ideal and uniform weighting (i.e., no weighting), the latter of which is employed in commercial surgical guidance systems. From these results we conclude that for these weighting schemes, while valid expressions exist relating the covariance of FRE to the covariance of TRE, there are no measures of the goodness of fit of the fiducials for a given registration that give to first order any information about the fluctuation of TRE from its expected value and none that give useful information in the exact case. Therefore, as estimators of registration accuracy, such measures should be approached with extreme caution both by the purveyors of guidance systems and by the practitioners who use them.     

Flash scene video coding using weighted prediction

A novel algorithm for coding flash scenes is proposed. In principle, flash scenes can be detected by analyzing the histogram differences between frames. The proposed algorithm then suggests an adaptive coding order technique for increasing the efficiency of video coding by taking account of characteristics of flash scenes in video contents. The use of adaptive coding technique also benefits to enhance the accuracy of derived motion vectors for determination of weighting parameter sets. Experimental results show that a significant improvement of coding performance in terms of bitrate and PSNR can be achieved in comparison with the conventional weighted prediction algorithms.