首页    期刊浏览 2024年12月03日 星期二
登录注册

文章基本信息

  • 标题:Efficient and Through Way Routing In Path Networks by User Distinct Queries
  • 本地全文:下载
  • 作者:G.Brindha ; Dr.C.Saravanabhavan
  • 期刊名称:International Journal of Innovative Research in Science, Engineering and Technology
  • 印刷版ISSN:2347-6710
  • 电子版ISSN:2319-8753
  • 出版年度:2016
  • 卷号:5
  • 期号:10
  • 页码:17893
  • DOI:10.15680/IJIRSET.2016.0510086
  • 出版社:S&S Publications
  • 摘要:Estimating the straight path between two given locations in an exceedingly road network is a veryimportant shortcoming that finds applications in varied map services and business navigation commodities. Proposedtechnique divided into two categories: spatial-coherence-based ways and vertex-importance based approaches. The twoclasses of techniques, however, have not been compared consistently lower identical experimental framework, as theywere developed from two irregular lines of analysis that don't visit one another. We propose a novel data miningalgorithm named PATE (Prediction-based Algorithm for Travel time Evaluation) that can proficiently forecast themoving time of a routing path and precisely recommends the routing path to the users under a user-Specified traveltime constraint in road network environments. Utilizing a form of real way networks with up to twenty million vertices,we tend to estimate every technique in terms of its preprocessing time, area consumption and question potency. Ourtentative outcome reveals the characteristics of various techniques, based on that we offer pointers on choosingapplicable methods for varied eventualities.
  • 关键词:Navigation paths; shortest path; Data mining; PATE (Prediction-based Algorithm for Travel time;Evaluation)
国家哲学社会科学文献中心版权所有