随着移动互联网与社会网络的深度融合,基于位置服务(Location Based Service,LBS)的社交媒体应用更加流行,成为地理社会网络(Geo-Social Networks,GSN)的研究重点。基于位置信息的社会网络(Location Based Social Network,LBSN)由于具...随着移动互联网与社会网络的深度融合,基于位置服务(Location Based Service,LBS)的社交媒体应用更加流行,成为地理社会网络(Geo-Social Networks,GSN)的研究重点。基于位置信息的社会网络(Location Based Social Network,LBSN)由于具有时空特性,其海量数据可视化不同于传统信息可视化,必须结合其地理信息特征进行表达。该文以GSN中抽取出的海量时空数据为分析对象,从LBSN时空数据抽取、海量时空数据可视化等方面进行综述,对地理社会网络时空数据交互可视化分析技术开展研究,以期能够实现比较方便、快速、直接地从地理社会网络的海量数据中提取出有用、可靠、可知识化的综合信息,并通过信息可视化方式进行直观表达、展示与分析。展开更多
Due to the wide-spread use of geo-positioning technologies and geo-social networks,the reverse top-k geo-social keyword query has attracted considerable attention from both industry and research communities.A reverse ...Due to the wide-spread use of geo-positioning technologies and geo-social networks,the reverse top-k geo-social keyword query has attracted considerable attention from both industry and research communities.A reverse top-k geo-social keyword(RkGSK)query finds the users who are spatially near,textually similar,and socially relevant to a specified point of interest.RkGSK queries are useful in many real-life applications.For example,they can help the query issuer identify potential customers in marketing decisions.However,the query constraints could be too strict sometimes,making it hard to find any result for the RkGSK query.The query issuers may wonder how to modify their original queries to get a certain number of query results.In this paper,we study non-answer questions on reverse top-k geo-social keyword queries(NARGSK).Given an RkGSK query and the required number M of query results,NARGSK aim to find the refined RkGSK query having M users in its result set.To efficiently answer NARGSK,we propose two algorithms(ERQ and NRG)based on query relaxation.As this is the first work to address NARGSK to the best of our knowledge,ERQ is the baseline extended from the state-of-the-art method,while NRG further improves the efficiency of ERQ.Extensive experiments using real-life datasets demonstrate the efficiency of our proposed algorithms,and the performance of NRG is improved by a factor of 1–2 on average compared with ERQ.展开更多
Simple navigation receivers can be used for positioning with sub-centimeter accuracy in a wireless sensor network if the read-out of the carrier phase(CP)data is possible and all data are permanently broadcast to a ce...Simple navigation receivers can be used for positioning with sub-centimeter accuracy in a wireless sensor network if the read-out of the carrier phase(CP)data is possible and all data are permanently broadcast to a central processing computer.At this base station an automated near real-time processing takes place and a precise differential GNSS-based positioning of the involved sensor nodes is computed.The paper describes the technical principles of such a system with its essential demands for the sensing,the communication,and the computing components.First experiences in a research project related to landslide monitoring are depicted.Of course the developed system can also be embedded for location finding in a widespread multifunctional geo sensor network.The quality of the obtained result is restricted due to the fact that the CP measurements must be recorded over a certain time span,usually a few minutes for every independent position solution.As far as possible a modular structure with commercial off-theshelf components,e.g.standard wireless local area network for communication,and in cooperation of existing proofed and powerful program tools is chosen.Open interfaces are used as far as possible.展开更多
With increasing popularity of mobile devices and flourish of social networks,a large number of trajectory data is accumulated.Trajectory data contains a wealth of information,including spatiality,time series,and other...With increasing popularity of mobile devices and flourish of social networks,a large number of trajectory data is accumulated.Trajectory data contains a wealth of information,including spatiality,time series,and other external descriptive attributes(i.e.,travelling mode,activities,etc.).Trajectory recommendation is especially important to users for finding the routes meeting the user’s travel needs quickly.Most existing trajectory recommendation works return the same route to different users given an origin and a destination.However,the users’behavior preferences can be learned from users’historical multi-attributes trajectories.In this paper,we propose two novel personalized trajectory recommendation methods,i.e.,user behavior probability learning based on matrix decomposition and user behavior probability learning based on Kernel density estimation.We transform the route recommendation problem to a shortest path problem employing Bayesian probability model.Combining the user input(i.e.,an origin and a destination),the trajectory query is performed on a behavior graph based on the learned behavior probability automatically.Finally,a series of experiments on two real datasets validate the effectiveness of our proposed methods.展开更多
文摘随着移动互联网与社会网络的深度融合,基于位置服务(Location Based Service,LBS)的社交媒体应用更加流行,成为地理社会网络(Geo-Social Networks,GSN)的研究重点。基于位置信息的社会网络(Location Based Social Network,LBSN)由于具有时空特性,其海量数据可视化不同于传统信息可视化,必须结合其地理信息特征进行表达。该文以GSN中抽取出的海量时空数据为分析对象,从LBSN时空数据抽取、海量时空数据可视化等方面进行综述,对地理社会网络时空数据交互可视化分析技术开展研究,以期能够实现比较方便、快速、直接地从地理社会网络的海量数据中提取出有用、可靠、可知识化的综合信息,并通过信息可视化方式进行直观表达、展示与分析。
基金the National Natural Science Foundation of China under Grant Nos.61972338,62025206 and 62102351。
文摘Due to the wide-spread use of geo-positioning technologies and geo-social networks,the reverse top-k geo-social keyword query has attracted considerable attention from both industry and research communities.A reverse top-k geo-social keyword(RkGSK)query finds the users who are spatially near,textually similar,and socially relevant to a specified point of interest.RkGSK queries are useful in many real-life applications.For example,they can help the query issuer identify potential customers in marketing decisions.However,the query constraints could be too strict sometimes,making it hard to find any result for the RkGSK query.The query issuers may wonder how to modify their original queries to get a certain number of query results.In this paper,we study non-answer questions on reverse top-k geo-social keyword queries(NARGSK).Given an RkGSK query and the required number M of query results,NARGSK aim to find the refined RkGSK query having M users in its result set.To efficiently answer NARGSK,we propose two algorithms(ERQ and NRG)based on query relaxation.As this is the first work to address NARGSK to the best of our knowledge,ERQ is the baseline extended from the state-of-the-art method,while NRG further improves the efficiency of ERQ.Extensive experiments using real-life datasets demonstrate the efficiency of our proposed algorithms,and the performance of NRG is improved by a factor of 1–2 on average compared with ERQ.
文摘Simple navigation receivers can be used for positioning with sub-centimeter accuracy in a wireless sensor network if the read-out of the carrier phase(CP)data is possible and all data are permanently broadcast to a central processing computer.At this base station an automated near real-time processing takes place and a precise differential GNSS-based positioning of the involved sensor nodes is computed.The paper describes the technical principles of such a system with its essential demands for the sensing,the communication,and the computing components.First experiences in a research project related to landslide monitoring are depicted.Of course the developed system can also be embedded for location finding in a widespread multifunctional geo sensor network.The quality of the obtained result is restricted due to the fact that the CP measurements must be recorded over a certain time span,usually a few minutes for every independent position solution.As far as possible a modular structure with commercial off-theshelf components,e.g.standard wireless local area network for communication,and in cooperation of existing proofed and powerful program tools is chosen.Open interfaces are used as far as possible.
基金This work was partially supported by the grant from the Natural Science Foundation of Hebei Province(F2021210005)the Hebei Province Innovation Capability Improvement Plan(21550803D)+2 种基金the Outstanding Youth Foundation of Hebei Education Department(BJ2021085)the Fourth Outstanding Youth Foundation of Shijiazhuang Tiedao University,and Training Project for Improving Students of Scientific and Technological Innovation Ability for College and Middle School(DXS202106)Scientific Research Project from China Railway Corporation(2020F026).
文摘With increasing popularity of mobile devices and flourish of social networks,a large number of trajectory data is accumulated.Trajectory data contains a wealth of information,including spatiality,time series,and other external descriptive attributes(i.e.,travelling mode,activities,etc.).Trajectory recommendation is especially important to users for finding the routes meeting the user’s travel needs quickly.Most existing trajectory recommendation works return the same route to different users given an origin and a destination.However,the users’behavior preferences can be learned from users’historical multi-attributes trajectories.In this paper,we propose two novel personalized trajectory recommendation methods,i.e.,user behavior probability learning based on matrix decomposition and user behavior probability learning based on Kernel density estimation.We transform the route recommendation problem to a shortest path problem employing Bayesian probability model.Combining the user input(i.e.,an origin and a destination),the trajectory query is performed on a behavior graph based on the learned behavior probability automatically.Finally,a series of experiments on two real datasets validate the effectiveness of our proposed methods.