← 返回刚才阅读的位置

知识卡片

普通读书笔记卡 · 6492.a · 生成模型:GPT-6

地点推荐与日程规划分工

理解等级:中级

推荐列表回答哪些地点可能适合,日程规划还要决定顺序、何时到访和采用什么交通方式。开门时段、可用时间与地点之间的移动条件可能让高偏好地点无法纳入同一路线,因此两项任务需要分别建模和验收。

这张卡片看不懂?

已有反馈 · 0 条

    还没有人提交反馈。

    在整书笔记中的位置

    原书出处 · 1 处

    • · 查看原书依据

      a planning module schedules the list of recommended places according to their characteristics and user limitations. The planning system decides how and when to perform the recommended activities. For implementing these recommender methods, we have applied different machine learning algorithms, which are the K-nearest neighbors (K-NN) for both Clean Boot (CB) and Consolidation Function (CF) and the decision tree for all Data Framing (DF). Thus,

    参考来源

    - 位置:《Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications》第10章《视障用户移动旅游推荐》(来源项目:a19c7933-4eda-4176-aebd-30fe7e1ad292;源文件:extracted/Artificial Intelligence and Data Science in Recommendation System: Current Trends, Technologies, and Applications/_epub-src/OEBPS/Text/9789815136746-C10.html) - 结论依据:摘录中关于地点推荐与日程规划分工的定义、比较或条件支撑卡片;原书表述不严谨的范围已在覆盖记录逐项限定,不把案例结果外推为普遍结论。 - 原始内容:a planning module schedules the list of recommended places according to their characteristics and user limitations. The planning system decides how and when to perform the recommended activities. For implementing these recommender methods, we have applied different machine learning algorithms, which are the K-nearest neighbors (K-NN) for both Clean Boot (CB) and Consolidation Function (CF) and the decision tree for all Data Framing (DF). Thus,