The search functionality is under construction.

Author Search Result

[Author] Xibin WANG(2hit)

1-2hit
  • Personalized Movie Recommendation System Based on Support Vector Machine and Improved Particle Swarm Optimization

    Xibin WANG  Fengji LUO  Chunyan SANG  Jun ZENG  Sachio HIROKAWA  

     
    PAPER-Data Engineering, Web Information Systems

      Pubricized:
    2016/11/21
      Vol:
    E100-D No:2
      Page(s):
    285-293

    With the rapid development of information and Web technologies, people are facing ‘information overload’ in their daily lives. The personalized recommendation system (PRS) is an effective tool to assist users extract meaningful information from the big data. Collaborative filtering (CF) is one of the most widely used personalized recommendation techniques to recommend the personalized products for users. However, the conventional CF technique has some limitations, such as the low accuracy of of similarity calculation, cold start problem, etc. In this paper, a PRS model based on the Support Vector Machine (SVM) is proposed. The proposed model not only considers the items' content information, but also the users' demographic and behavior information to fully capture the users' interests and preferences. An improved Particle Swarm Optimization (PSO) algorithm is also proposed to improve the performance of the model. The efficiency of the proposed method is verified by multiple benchmark datasets.

  • Dynamic Macro-Based Heuristic Planning through Action Relationship Analysis

    Zhuo JIANG  Junhao WEN  Jun ZENG  Yihao ZHANG  Xibin WANG  Sachio HIROKAWA  

     
    PAPER-Artificial Intelligence, Data Mining

      Pubricized:
    2014/10/23
      Vol:
    E98-D No:2
      Page(s):
    363-371

    The success of heuristic search in AI planning largely depends on the design of the heuristic. On the other hand, previous experience contains potential domain information that can assist the planning process. In this context, we have studied dynamic macro-based heuristic planning through action relationship analysis. We present an approach for analyzing the action relationship and design an algorithm that learns macros in solved cases. We then propose a dynamic macro-based heuristic that appropriately reuses the macros rather than immediately assigning them to domains. The above ideas are incorporated into a working planning system called Dynamic Macro-based Fast Forward planner. Finally, we evaluate our method in a series of experiments. Our method effectively optimizes planning since it reduces the result length by an average of 10% relative to the FF, in a time-economic manner. The efficiency is especially improved when invoking an action consumes time.