路由自适应移动连续推荐的逆向方法开发

Mrs. S. Nithya, S. Visakh, J. Gollner, C. Ashley
{"title":"路由自适应移动连续推荐的逆向方法开发","authors":"Mrs. S. Nithya, S. Visakh, J. Gollner, C. Ashley","doi":"10.9790/0661-1903032932","DOIUrl":null,"url":null,"abstract":"The Backward Approach Development is the pre-planning requisite for the traveller’s.So they are more exposed to our taxi service in and out. In addition, accurate query results with up-to-date travel times, price etc.we propose a novel dynamic programming based method to solve the mobile sequential recommendation problem with the new algorithm, named UniBic, outperformed all previous biclustering algorithms in terms of commonly used evaluation scenarios except for BicSPAM on narrow biclusters Simultaneously, the process of sequence generation to reduce the search space of the potential sequences effectively. Moreover, our method can handle the problem of optimal route search with a maximum cruising distance or a destination constraint. Experimental results on real and synthetic data sets show that both the pruning ability and the efficiency of our method surpass the state-of-the-art methods. Our techniques can therefore be effectively employed to address the problem of mobile sequential recommendation with many pickup points in real-world applications","PeriodicalId":91890,"journal":{"name":"IOSR journal of computer engineering","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2017-05-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":"{\"title\":\"Backward Approach Development for Route Adaptive Mobile Successive Recommendation\",\"authors\":\"Mrs. S. Nithya, S. Visakh, J. Gollner, C. Ashley\",\"doi\":\"10.9790/0661-1903032932\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The Backward Approach Development is the pre-planning requisite for the traveller’s.So they are more exposed to our taxi service in and out. In addition, accurate query results with up-to-date travel times, price etc.we propose a novel dynamic programming based method to solve the mobile sequential recommendation problem with the new algorithm, named UniBic, outperformed all previous biclustering algorithms in terms of commonly used evaluation scenarios except for BicSPAM on narrow biclusters Simultaneously, the process of sequence generation to reduce the search space of the potential sequences effectively. Moreover, our method can handle the problem of optimal route search with a maximum cruising distance or a destination constraint. Experimental results on real and synthetic data sets show that both the pruning ability and the efficiency of our method surpass the state-of-the-art methods. Our techniques can therefore be effectively employed to address the problem of mobile sequential recommendation with many pickup points in real-world applications\",\"PeriodicalId\":91890,\"journal\":{\"name\":\"IOSR journal of computer engineering\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2017-05-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"0\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"IOSR journal of computer engineering\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.9790/0661-1903032932\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"IOSR journal of computer engineering","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.9790/0661-1903032932","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

摘要

发展是旅行者的预先规划的必要条件。所以他们更多地接触到我们的出租车服务。此外,我们提出了一种新的基于动态规划的方法来解决移动序列推荐问题,该算法名为UniBic,在窄双聚类上,除了BicSPAM之外,在常用的评估场景中优于以往的所有双聚类算法。同时,序列生成过程有效地减少了潜在序列的搜索空间。此外,该方法还可以处理具有最大巡航距离或目的地约束的最优路线搜索问题。在真实数据集和合成数据集上的实验结果表明,该方法的剪枝能力和剪枝效率都超过了目前最先进的方法。因此,我们的技术可以有效地用于解决现实应用中具有许多拾取点的移动顺序推荐问题
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Backward Approach Development for Route Adaptive Mobile Successive Recommendation
The Backward Approach Development is the pre-planning requisite for the traveller’s.So they are more exposed to our taxi service in and out. In addition, accurate query results with up-to-date travel times, price etc.we propose a novel dynamic programming based method to solve the mobile sequential recommendation problem with the new algorithm, named UniBic, outperformed all previous biclustering algorithms in terms of commonly used evaluation scenarios except for BicSPAM on narrow biclusters Simultaneously, the process of sequence generation to reduce the search space of the potential sequences effectively. Moreover, our method can handle the problem of optimal route search with a maximum cruising distance or a destination constraint. Experimental results on real and synthetic data sets show that both the pruning ability and the efficiency of our method surpass the state-of-the-art methods. Our techniques can therefore be effectively employed to address the problem of mobile sequential recommendation with many pickup points in real-world applications
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信