2022/01/28 更新

写真a

ホウ シガ
鮑 思雅
所属
理工学術院 基幹理工学部
職名
講師(任期付)

学歴

  • 2017年04月
    -
    2020年03月

    早稲田大学   大学院基幹理工学研究科 博士後期課程  

  • 2015年09月
    -
    2017年03月

    早稲田大学   大学院基幹理工学研究科 修士課程  

  • 2011年09月
    -
    2015年09月

    早稲田大学   基幹理工学部  

経歴

  • 2020年04月
    -
    継続中

    早稲田大学   理工学術院   講師

所属学協会

  •  
     
     

    電子情報通信学会

  •  
     
     

    IEEE

 

研究分野

  • 高性能計算

  • データベース

研究キーワード

  • 量子計算

  • 地理空間情報処理

  • テキストマイニング

論文

  • An Approach to the Vehicle Routing Problem with Balanced Pick-up Using Ising Machines

    Siya Bao, Masashi Tawada, Shu Tanaka, Nozomu Togawa

    2021 International Symposium on VLSI Design, Automation and Test (VLSI-DAT)    2021年04月

    DOI

  • An Approach to the Vehicle Routing Problem with Balanced Pick-up Using Ising Machines

    Siya Bao, Masashi Tawada, Shu Tanaka, Nozomu Togawa

    2021 International Symposium on VLSI Design, Automation and Test, VLSI-DAT 2021 - Proceedings    2021年04月

     概要を見る

    Vehicle routing problems (VRPs) can be solved as optimization problems. Practical applications of the VRPs are involved in various areas including manufacturing, supply chain, and tourism. Conventional approaches using von Neumann computers obtain good approximate solutions to the optimization problems, but conventional approaches show disadvantages of computation costs in large-scale or complex problems due to the combinatorial explosion. Oppositely, Ising machines or quantum annealing machines are non-von Neumann computers that are designed to solve complex optimization problems. In this paper, we propose an Ising-machine based approach for the vehicle routing problem with balanced pick-up (VRPBP). The development of the VRPBP is motivated by postal items pick-up services in the real-world. Our approach includes various features of VRP variants. We propose a 2-phase approach to solve the VRPBP and key elements in each phase are mapped onto quadratic unconstrained binary optimization (QUBO) forms. Specifically, the first phase belongs to the clustering phase which is an extension to the knapsack problem with additional distance and load balancing concerns. The second phase is mapped to the traveling salesman problem. Experimental results of our approach are evaluated in terms of solution quality and computation time compared with conventional approaches.

    DOI

  • An Approach to the Vehicle Routing Problem with Balanced Pick-up Using Ising Machines.

    Siya Bao, Masashi Tawada, Shu Tanaka, Nozomu Togawa

        1 - 4  2021年

    DOI

  • Document-level sentiment classification in japanese by stem-based segmentation with category and data-source information

    Siya Bao, Nozomu Togawa

    Proceedings - 14th IEEE International Conference on Semantic Computing, ICSC 2020     311 - 314  2020年02月

     概要を見る

    © 2020 IEEE. Existing studies focus on text information while ignoring category and data source information, both of which are verified to be important in interpreting sentiments in travel comments in this paper. Furthermore, the unique linguistic characteristics of Japanese cause difficulty in applying the conventional token-based word segmentation methods to Japanese comments directly. In this paper, we propose a method of stem-based segmentation based on Japanese linguistic characteristics and incorporate it with category and data source information into a hierarchical network model for document-level sentiment classification. Empirical results of our proposed model outperform existing models on a real-world dataset.

    DOI

  • A travel decision support algorithm: Landmark activity extraction from japanese travel comments

    Siya Bao, Masao Yanagisawa, Nozomu Togawa

    Studies in Computational Intelligence   849   109 - 123  2020年

     概要を見る

    © Springer Nature Switzerland AG 2020. To help people smoothly and efficiently make travel decisions, we utilize the advantages of travel comments posted by thousands of other travelers. In this paper, we analyze the feasibility of exploring landmark activity queries and representative examples from Japanese travel comments. Contributions in this paper include a framework for extracting activity concerned keywords and queries, quantifying the relationship between landmark activities and comment contents. An evaluation of activity-example extraction is conducted in two case studies through 18,939 travel comments.

    DOI

  • Landmark Seasonal Travel Distribution and Activity Prediction Based on Language-specific Analysis

    Siya Bao, Masao Yanagisawa, Nozomu Togawa

    Proceedings - 2018 IEEE International Conference on Big Data, Big Data 2018     3628 - 3637  2019年01月

     概要を見る

    © 2018 IEEE. Online media communities have globally spanned and have increasingly accelerated the development of intelligent travel recommendation systems in both academic and industrial fields. However, there is a bottleneck that differences in users' seasonal travel distributions (when to visit) in various language groups are ignored. This paper proposes a seasonal activity prediction algorithm based on user comments over the period of 2012 to 2017 in different language groups. We take the advantage of online user comments which provide visiting time for each landmark and detailed activity description. With the accumulation of 417,787 user comments on TripAdvisor for 300 landmarks in three big cities, we analyze the language-specific differences in travel distributions. After that, prediction of future travel distribution for each language group is generated. Then potential peak and off seasons of each landmark are distinguished and representative seasonal activities are extracted through comment contents for peak and off seasons, respectively. Experimental results in the three cities show that the proposed algorithm is more accurate in terms of peak season detection and seasonal activity prediction than previous studies.

    DOI

  • Personalized Landmark Recommendation for Language-Specific Users by Open Data Mining

    Siya Bao, Masao Yanagisawa, Nozomu Togawa

    Studies in Computational Intelligence   791   107 - 121  2019年

     概要を見る

    © 2019, Springer Nature Switzerland AG. This paper proposes a personalized landmark recommendation algorithm aiming at exploring new sights into the determinants of landmark satisfaction prediction. We gather 1,219,048 user-generated comments in Tokyo, Shanghai and New York from four travel websites. We find that users have diverse satisfaction on landmarks those findings, we propose an effective algorithm for personalize landmark satisfaction prediction. Our algorithm provides the top-6 landmarks with the highest satisfaction to users for a one-day trip plan our proposed algorithm has better performances than previous studies from the viewpoints of landmark recommendation and landmark satisfaction prediction.

    DOI

  • Personalized landmark recommendation algorithm based on language-specific satisfaction prediction using heterogeneous open data sources

    Siya Bao, Masao Yanagisawa, Nozomu Togawa

    Proceedings - 2018 10th International Conference on Computational Intelligence and Communication Networks, CICN 2018     70 - 76  2018年08月

     概要を見る

    © 2018 IEEE. This paper proposes a personalized landmark recommendation algorithm based on the prediction of users' satisfaction on landmarks. We have accumulated 270,239 user-generated comments from travel websites of Ctrip, Jaran and TripAdvisor for 196 landmarks in Tokyo, Japan. We find that users do have different satisfaction on landmarks depending on their commonly used languages and travel websites. Then we establish a database for landmarks with abundant and accurate landmark type and landmark satisfaction information. Finally, we propose an effective personalized landmark satisfaction prediction algorithm based on users' landmark type, language and travel website preferences. After that, landmarks with the top-6 highest satisfaction are provided to the user for a one-day visit plan in Tokyo. Experimental results demonstrate that the proposed algorithm can recommend landmarks that fit the user's preferences and our algorithm also successfully predicts the user's landmark satisfaction with a low error rate less than 7%, which is superior to other previous studies.

    DOI

  • Road-illuminance level inference across road networks based on Bayesian analysis

    Siya Bao, Masao Yanagisawa, Nozomu Togawa

    2018 IEEE International Conference on Consumer Electronics, ICCE 2018   2018-January   1 - 6  2018年03月

     概要を見る

    © 2018 IEEE. This paper proposes a road-illuminance level inference method based on the naive Bayesian analysis. We investigate quantities and types of road lights and landmarks with a large set of roads in real environments and reorganize them into two safety classes, safe or unsafe, with seven road attributes. Then we carry out data learning using three types of datasets according to different groups of the road attributes. Experimental results demonstrate that the proposed method successfully classifies a set of roads with seven attributes into safe ones and unsafe ones with the accuracy of more than 85%, which is superior to other machine-learning based methods and a manual-based method.

    DOI

  • Personalized one-day travel with multi-nearby-landmark recommendation

    Siya Bao, Masao Yanagisawa, Nozomu Togawa

    IEEE International Conference on Consumer Electronics - Berlin, ICCE-Berlin   2017-September   239 - 242  2017年12月

     概要を見る

    © 2017 IEEE. Travel route recommendation can strongly influence users' satisfaction and the success of touristic businesses. This paper proposes a personalized travel recommendation algorithm with time planning. We use landmark categorization and region clustering to obtain effective elements. Then we build a travel map to generate all possible travel routes. Our proposed algorithm has higher precision in landmark recommendation and time planning than thoes in previous algorithms.

    DOI

  • A safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions

    Siya Bao, Tomoyuki Nitta, Masao Yanagisawa, Nozomu Togawa

    IEICE Transactions on Fundamentals of Electronics, Communications and Computer Sciences   E100A ( 11 ) 2439 - 2450  2017年11月

     概要を見る

    Copyright © 2017 The Institute of Electronics, Information and Communication Engineers. In this paper, we propose a safe and comprehensive route finding algorithm for pedestrians based on lighting and landmark conditions. Safety and comprehensiveness can be predicted by the five possible indicators: (1) lighting conditions, (2) landmark visibility, (3) landmark effectiveness, (4) turning counts along a route, and (5) road widths. We first investigate impacts of these five indicators on pedestrians' perceptions on safety and comprehensiveness during route findings. After that, a route finding algorithm is proposed for pedestrians. In the algorithm, we design the score based on the indicators (1), (2), (3), and (5) above and also introduce a turning count reduction strategy for the indicator (4). Thus we find out a safe and comprehensive route through them. In particular, we design daytime score and nighttime score differently and find out an appropriate route depending on the time periods. Experimental simulation results demonstrate that the proposed algorithm obtains higher scores compared to several existing algorithms. We also demonstrate that the proposed algorithm is able to find out safe and comprehensive routes for pedestrians in real environments in accordance with questionnaire results.

    DOI

  • A safe and comprehensive route finding method for pedestrian based on lighting and landmark

    Siya Bao, Tomoyuki Nitta, Kazuaki Ishikawa, Masao Yanagisawa, Nozomu Togawa

    2016 IEEE 5th Global Conference on Consumer Electronics, GCCE 2016    2016年12月

     概要を見る

    © 2016 IEEE. This paper proposes a safe and comprehensive route finding method for pedestrians. We evaluate five factors that do relieve pedestrians' fear of darkness. Based upon the evaluation, we propose a comprehensive route finding method by taking road width and reduction on turning points into consideration. The experimental results on real outdoor environments under different lighting situations confirm that the proposed method can obtain safety and comprehensive routes for pedestrians.

    DOI

  • A landmark-based route recommendation method for pedestrian walking strategies

    Siya Bao, Tomoyuki Nitta, Daisuke Shindou, Masao Yanagisawa, Nozomu Togawa

    2015 IEEE 4th Global Conference on Consumer Electronics, GCCE 2015     672 - 673  2016年02月

     概要を見る

    © 2015 IEEE. This paper proposes a landmark-based route recommendation method for enjoyable walking atmosphere strategies by accumulating and analyzing geographical information. We utilize landmark categorization and region clustering to obtain effective elements. Experimental results demonstrate that our proposed method improves walking environment quality and confirm that it is applicable in both urban and rural areas.

    DOI

▼全件表示

受賞

  • Best Student Opponent

    2020年01月   IEEE ICSC 2020  

特定課題研究

  • Document-level Sentiment Classification in Japanese Travel Comments of Heterogeneous Sources

    2020年  

     概要を見る

     A user's travel satisfaction is directly and explicitly reflected in their comments compared with the other types of travelogues such as GPS trajectory and check-in data. In this advantage of user comments, it is aiming at shedding lights on determinants of travel satisfaction to serve personalized travel route recommendation. To obtain a large dataset, 479,799 user comments are collected in Tokyo, Kyoto, and Sapporo from three travel websites including TripAdvisor, Jaran, and Ctrip. Prior works have been elaborated on data-source-specific and language-specific analysis. It is found that landmark coverages vary among different websites and users have diverse satisfaction on landmarks depending on their frequently used languages and travel websites. With those findings, a personalized travel route recommendation algorithm is proposed that (1) recommends top-6 personalized landmarks and (2) generates a realistic travel route for a one-day visit. Experimental results confirm the advantages of the proposed algorithm beyond previous studies from the viewpoints of landmark recommendation precision and travel time optimization.

 

現在担当している科目

▼全件表示

担当経験のある科目(授業)

  • Cプログラミング入門

    2020年04月
    -
    継続中