Personal Interest Attention Graph Neural Networks for Session-Based Recommendation

Session-based recommendations aim to predict a user’s next click based on the user’s current and historical sessions, which can be applied to shopping websites and APPs. Existing session-based recommendation methods cannot accurately capture the complex transitions between items. In addition, some approaches compress sessions into a fixed representation vector without taking into account the user’s interest preferences at the current moment, thus limiting the accuracy of recommendations. Considering the diversity of items and users’ interests, a personalized interest attention graph neural network (PIA-GNN) is proposed for session-based recommendation. This approach utilizes personalized graph convolutional networks (PGNN) to capture complex transitions between items, invoking an interest-aware mechanism to activate users’ interest in different items adaptively. In addition, a self-attention layer is used to capture long-term dependencies between items when capturing users’ long-term preferences. In this paper, the cross-entropy loss is used as the objective function to train our model. We conduct rich experiments on two real datasets, and the results show that PIA-GNN outperforms existing personalized session-aware recommendation methods.     

175Hf核ε衰变的IXK/Iγ(343keV)比值计算和分析及其辐射数据计算

简要地介绍了¹⁷⁵Hf核ε衰变的I_XK/I_γ(343keV)比值的计算方法与实验测量的比较与分析,并在此基础上,计算得到了P_γ(343keV)=0.869±0.004,还给出了¹⁷⁵Hf核ε衰变的辐射数据的计算与推荐     

Effective mechanism for social recommendation of news

Recommender systems represent an important tool for news distribution on the Internet. In this work we modify a recently proposed social recommendation model in order to deal with no explicit ratings of users on news. The model consists of a network of users which continually adapts in order to achieve an efficient news traffic. To optimize the network’s topology we propose different stochastic algorithms that are scalable with respect to the network’s size. Agent-based simulations reveal the features and the performance of these algorithms. To overcome the resultant drawbacks of each method we introduce two improved algorithms and show that they can optimize the network’s topology almost as fast and effectively as other not-scalable methods that make use of much more information.     

基于视频推荐技术的无线网络视频服务器设计

无线网络视频服务器中视频推荐技术已成为重要技术之一,视频推荐技术是为了用户在使用无线网络是视频务器时,更快的找到感兴趣的视频。采用当前方法对用户进行视频推荐时,未考虑用户的兴趣偏好是否随着时间有所变化,使视频推荐出现偏差。为此,提出一种基于视频推荐技术的无线网络视频服务器设计方法。该方法首先使用无线网络视频服务器硬件部分的MPEG-4进行视频数据采集,并对MPEG-4采集的视频数据进行整理。在由软件部分把采集到的视频数据储存到缓冲区,进行视频缓冲,并建立视频数据队列进行视频数据输送。以计算无线网络视频的相似度来搜索相近视频,将搜索到的视频与目标用户观看过的视频进行对比,对比相似度越接近1,则说明用户对推荐视频感兴趣的几率大,反之越接近-1用户对推荐视频越不感兴趣。此计算方法能有效的从海量视频数据中快速的搜索出目标用户感兴趣视频。实验结果表明,将视频推荐技术应用到无线网络视频中可以迅速准确的搜索出目标用户感兴趣视频。     

液相色谱专家系统中柱系统推荐规则的建立和验证

把分子结构和分子、离子静电作用力作为影响溶质保留值和选择性的基本点,提出了液相色谱专家系统柱系统推荐的基本规则,由此可以从溶质所包含的基团或官能团的信息进行色谱柱系统推荐。为了验证这些规则的正确性,应用几类常用的或典型的样品从分子结构通道进行液相色谱柱系统推荐,获得满意的结果。     

组合调整频率会影响投资者的回报率么?——基于分析师股票推荐的投资策略研究

利用巨灵数据库的分析师评级数据,从投资者角度建立动态组合,检验了按每日、每周、每两周、每月、每季度头寸调整频率后的超额收益,研究发现:"买入"评级组合在各种头寸调整频率策略下都获得了超越市场指数的超额回报率,其中按每周频率进行头寸调整策略获得的市场调整后平均超额回报率最高,按三个月频率进行头寸调整策略获得的市场调整后平均超额回报率最低。投资者在面对分析师一致认为"买入"评级股票时,可按照每周更新的频率构建组合,以获取较高的超额回报率。投资者如果按季度调整频率来卖出股票可能会错失投资机会,卖掉的股票很可能会跑赢市场,投资者可按每两周或每四周的频率调整投资组合中的股票,卖出负面推荐评级"减持/卖出"股票,降低投资亏损。     

Robust inverse optimization

Given an observation of a decision-maker’s uncertain behavior, we develop a robust inverse optimization model for imputing an objective function that is robust against mis-specifications of the behavior. We characterize the inversely optimized cost vectors for uncertainty sets that may or may not intersect the feasible region, and propose tractable solution methods for special cases. We demonstrate the proposed model in the context of diet recommendation.     

热点应力法在高速列车设计中的应用

应力可靠性预测对高速列车车体的安全设计非常重要.本文采用国际焊接学会推荐标准预测高速列车车体关键部位应力,通过热点应力法对应力集中部位表面应力进行外推.计算结果表明通过参考点外推得到的热点应力总是明显小于有限元计算的结果,并且更接近于实验值.采用两点外推法或三点外推法计算结果的差别很小.     

Heterogeneity in initial resource configurations improves a network-based hybrid recommendation algorithm

Network-based recommendation algorithms for user–object link predictions have achieved significant developments in recent years. For bipartite graphs, the resource reallocation in such algorithms is analogous to heat spreading (HeatS) or probability spreading (ProbS) processes. The best algorithm to date is a hybrid of the HeatS and ProbS techniques with homogeneous initial resource configurations, which fulfills simultaneously high accuracy and large diversity requirements. We investigate the effect of heterogeneity in initial configurations on the HeatS + ProbS hybrid algorithm and find that both recommendation accuracy and diversity can be further improved in this new setting. Numerical experiments show that the improvement is robust.     

A New Method Combining Pattern Prediction and Preference Prediction for Next Basket Recommendation

Market basket prediction, which is the basis of product recommendation systems, is the concept of predicting what customers will buy in the next shopping basket based on analysis of their historical shopping records. Although product recommendation systems develop rapidly and have good performance in practice, state-of-the-art algorithms still have plenty of room for improvement. In this paper, we propose a new algorithm combining pattern prediction and preference prediction. In pattern prediction, sequential rules, periodic patterns and association rules are mined and probability models are established based on their statistical characteristics, e.g., the distribution of periods of a periodic pattern, to make a more precise prediction. Products that have a higher probability will have priority to be recommended. If the quantity of recommended products is insufficient, then we make a preference prediction to select more products. Preference prediction is based on the frequency and tendency of products that appear in customers’ individual shopping records, where tendency is a new concept to reflect the evolution of customers’ shopping preferences. Experiments show that our algorithm outperforms those of the baseline methods and state-of-the-art methods on three of four real-world transaction sequence datasets.