首页> 外文期刊>International journal of enterprise network management >Mining massive online location-based services from user activity using best first gradient boosted distributed decision tree
【24h】

Mining massive online location-based services from user activity using best first gradient boosted distributed decision tree

机译:使用最佳的第一梯度提升分布式决策树从用户活动中挖掘大规模的基于位置的在线服务

获取原文
获取原文并翻译 | 示例
       

摘要

User activity is predicted through the frequency in which the online substances in location-based social networks (LBSN) are produced and used by the consumer. Users are classified by researchers into a number of groups depending upon the level of their functioning. This work involves gradient boosted distributed decision tree (GBDT) which is optimised on the basis of total iterations and shrinkage on using best algorithm. Implementation of the data is done through Hadoop network. A foursquare dataset is created using work, food, travel, park and shop. One of the most commonly used machine learning algorithm is stochastic gradient boosted decision trees (GBDT) at present. The node with lowest lower bound is developed through best first search (BFS). Its own filing system is provided through Hadoop which is called Hadoop distributed file system (HDFS). The algorithm used is K-nearest Neighbour (KNN) classifier algorithm.
机译:通过基于位置的社交网络(LBSN)中的在线物质被消费者生产和使用的频率来预测用户活动。研究人员根据其功能级别将用户分为多个组。这项工作涉及梯度提升的分布式决策树(GBDT),该算法基于总迭代和收缩率使用最佳算法进行了优化。数据的实现通过Hadoop网络完成。使用工作,食物,旅行,公园和商店来创建Foursquare数据集。目前,最常用的机器学习算法之一是随机梯度提升决策树(GBDT)。下限最低的节点是通过最佳优先搜索(BFS)开发的。它自己的归档系统通过Hadoop提供,称为Hadoop分布式文件系统(HDFS)。使用的算法是K近邻(KNN)分类器算法。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号