DiscoveringPopularRoutesfromTrajectories从轨迹中发现热门路线分享人：J-JaSonConferenceICDE2011InternationalConferenceonDataEngineeringSchool&Author2014/15QS43School&AuthorZaibenChenHengTaoShenXiaofangZhouTheaimDiscoveringtheMostPopularRoutebetweentwolocationsbyobservingbehaviorsofmanyprevioususers.通过观察之前用户的行为，找出两地之间最热门的路线WhydothisIsusefulespeciallyforuserswhoaretravelingtounfamiliarareas.对在陌生区域驾驶的人很有帮助。Theshortestorthefastestmaynotbethebest.最短的和最快的不一定是最好的。HowdothisHowdothisThreesteps:1DevelopaCoherenceExpandingalgorithmtoretrieveatransfernetworkfromrawtrajectories提出CoherenceExpandingalgorithm用于从未预处理的轨迹中得到transfernetworkHowdothisThreesteps:2TheAbsorbingMarkovChainmodelisappliedtoderiveareasonabletransferprobabilityforeachtransfernode用AbsorbingMarkovChainmodel推导出每个转换点的transferprobabilityHowdothisThreesteps:3ProposeaMaximumProbabilityProductalgorithmtodiscovertheMPRfromatransfernetwork使用MaximumProbabilityProduct从转换网络中得到MPR(最热门路径)RelatedWorkStep1MiningTransferNetworkIsasetoftransfernodes,whichcanbeanintersectionoftrajectoriesorjusttheendlocationsofatrajectory.N是交换点的集合，交换点可以是轨迹的交叉点也可以是轨迹的终点。Isacollectionoftransferedgesconnectingtransfernodes.E是一系列连接交换点的交换边。MiningTransferNetworkNoticethatifthereisaroadmapavailable,wecanfindoutthetransfernetworkbymap-matchingtrajectories.Tracesofhiking,boating,walking,andmanyout-dooractivitiesarenotconstrainedbyaroadnetwork.爬山，划船，步行等户外运动的不会被路网所限制mostmapsthatpeoplethinkofasfreehavelegalortechnicalrestrictionsontheiruse.很多地图上的路线或有法律或者技术上的限制MiningTransferNetworkDetecttheintersectionsoftrajectoriesIntersectionsoftrajectoriesWithinanintersectionregion,thedensityoftrajectorypointsisnormallyhigher,incomparisonwiththedensityofpointsonanincoming/outgoingroadedge,becauseitistheplacewheretrajectoriesjointogetherordriversslowdowntomakeaturn.Ifweconsideranintersectionasagro...
