IDEAS home Printed from https://ideas.repec.org/a/ids/ijenma/v11y2020i1p3-13.html
   My bibliography  Save this article

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

Author

Listed:
  • M. Venkatesh
  • V. Mohan Raj
  • Y. Suresh

Abstract

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.

Suggested Citation

  • M. Venkatesh & V. Mohan Raj & Y. Suresh, 2020. "Mining massive online location-based services from user activity using best first gradient boosted distributed decision tree," International Journal of Enterprise Network Management, Inderscience Enterprises Ltd, vol. 11(1), pages 3-13.
    • Handle: RePEc:ids:ijenma:v:11:y:2020:i:1:p:3-13
    as

    Download full text from publisher

    File URL: http://www.inderscience.com/link.php?id=103880
    Download Restriction: Access to full text is restricted to subscribers.
    ---><---

    As the access to this document is restricted, you may want to search for a different version of it.

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:ids:ijenma:v:11:y:2020:i:1:p:3-13. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: Sarah Parker (email available below). General contact details of provider: http://www.inderscience.com/browse/index.php?journalID=187 .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.