Massive music data and diverse listening behaviors have caused great difficulties for existing methods in user-personalized recommendation scenarios. Most previous music recommendation models extract features from temporal relationships among sequential listening records and ignore the utilization of additional information, such as music's singer and album. Especially, a piece of music is commonly created by a specific musician and belongs to a particular album. Singer and album information, regarded as music metadata, can be utilized as important auxiliary information among different music pieces and may considerably influence the user's choices of music. In this paper, we focus on the music sequential recommendation task with the consideration of the additional information and propose a novel Graphbased Attentive Sequential model with Metadata (GASM), which incorporates metadata to enrich music representations and effectively mine the user's listening behavior patterns. Specifically, we first use a directed listening graph to model the relations between various kinds of nodes (user, music, singer, album) and then adopt the graph neural networks to learn their latent representation vectors. After that, we decompose the user's preference for music into long-term, short-term and dynamic components with personalized attention networks. Finally, GASM integrates three types of preferences to predict the next (new) music in accordance with the user's music taste. Extensive experiments have been conducted on three real-world datasets, and the results show that the proposed method GASM achieves better performance than baselines.

No abstract

Ship path planning plays an important role in the intelligent decision-making system which can provide important navigation information for ship and coordinate with other ships via wireless networks. However, existing methods still suffer from slow path planning and low security problems. In this paper, we propose a second-order ship path planning model, which consists of two main steps, i.e., first-order static global path planning and second-order dynamic local path planning. Specifically, we first create a raster map using ArcGIS. Second, the global path planning is performed on the raster map based on the Dyna-Sarsa($$\lambda$$ λ ) model, which integrates the eligibility trace and the Dyna framework on the Sarsa algorithm. Particularly, the eligibility trace has a short-term memory for the trajectory, which can improve the convergence speed of the model. Meanwhile, the Dyna framework obtains simulation experience through simulation training, which can further improve the convergence speed of the model. Then, the improved ship trajectory prediction model based on stacked bidirectional gated recurrent unit is used to identify the risk of ship collision and switch the path planning from the first order to the second order. Finally, the second-order dynamic local path planning is presented based on the FCC-A* algorithm, where the cost function of the traditional path planning A* algorithm is rewritten using the fuzzy collision cost membership function (fuzzy collision cost, FCC) to reduce the collision risk of ships. The proposed model is evaluated on the Baltic Sea geographic information and ship trajectory datasets. The experimental results show that the eligibility trace and the Dyna learning framework in the proposed model can effectively improve the planning efficiency of the ship’s global path planning, and the collision risk membership function can effectively reduce the number of collisions in A* local path planning and thus improve the navigation safety of encountering ships.

No abstract