With the rapid development of the Internet of Things(IoT),Location-Based Services(LBS)are becoming more and more popular.However,for the users being served,how to protect their location privacy has become a growing co...With the rapid development of the Internet of Things(IoT),Location-Based Services(LBS)are becoming more and more popular.However,for the users being served,how to protect their location privacy has become a growing concern.This has led to great difficulty in establishing trust between the users and the service providers,hindering the development of LBS for more comprehensive functions.In this paper,we first establish a strong identity verification mechanism to ensure the authentication security of the system and then design a new location privacy protection mechanism based on the privacy proximity test problem.This mechanism not only guarantees the confidentiality of the user s information during the subsequent information interaction and dynamic data transmission,but also meets the service provider's requirements for related data.展开更多
Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is sc...Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.展开更多
With the evolution of location-based services(LBS),a new type of LBS has already gain a lot of attention and implementation,we name this kind of LBS as the Device-Dependent LBS(DLBS).In DLBS,the service provider(SP)wi...With the evolution of location-based services(LBS),a new type of LBS has already gain a lot of attention and implementation,we name this kind of LBS as the Device-Dependent LBS(DLBS).In DLBS,the service provider(SP)will not only send the information according to the user’s location,more significant,he also provides a service device which will be carried by the user.DLBS has been successfully practised in some of the large cities around the world,for example,the shared bicycle in Beijing and London.In this paper,we,for the first time,blow the whistle of the new location privacy challenges caused by DLBS,since the service device is enabled to perform the localization without the permission of the user.To conquer these threats,we design a service architecture along with a credit system between DLBS provider and the user.The credit system tie together the DLBS device usability with the curious behaviour upon user’s location privacy,DLBS provider has to sacrifice their revenue in order to gain extra location information of their device.We make the simulation of our proposed scheme and the result convince its effectiveness.展开更多
Internet takes a role as a place for communication between people beyond a space simply for the acquisition of information.Recently,social network service(SNS)reflecting human’s basic desire for talking and communica...Internet takes a role as a place for communication between people beyond a space simply for the acquisition of information.Recently,social network service(SNS)reflecting human’s basic desire for talking and communicating with others is focused on around the world.And location-based service(LBS)is a service that provides various life conveniences like improving productivity through location information,such as GPS and WiFi.This paper suggests an application combining LBS and SNS based on Android OS.By using smart phone which is personal mobile information equipment,it combines location information with user information and SNS so that the service can be developed.It also maximizes sharing and use of information via twit based on locations of friends.This proposed system is aims for users to show online identity more actively and more conveniently.展开更多
The purpose of this study is to analyze the spatial patterns of location-based social network (LBSN) data in Seoul using the spatial analysis techniques of geographic information system (GIS). The study explores the a...The purpose of this study is to analyze the spatial patterns of location-based social network (LBSN) data in Seoul using the spatial analysis techniques of geographic information system (GIS). The study explores the applications of LBSN data by analyzing the association between Seoul’s Foursquare venues data created based on user participation and the city’s characteristics. The data regarding Foursquare venues were compiled with a program we created based on Foursquare’s Python API. The compiled information was converted into GIS data, which in turn was depicted as a heat map. Cluster analysis was then performed based on hotspots and the correlation with census variables was analyzed for each administrative unit using geographically weighted regression (GWR). Based on analytical results, we were able to identify venue clusters around city centers, as well as differences in hotspots for various venue categories and correlations with census variables.展开更多
In Delay Tolerant Networks(DTNs),the offiine users can,through the encountering nodes,use the specific peer-to-peer message routing approach to deliver messages to the destination.Thus,it solves the problem that users...In Delay Tolerant Networks(DTNs),the offiine users can,through the encountering nodes,use the specific peer-to-peer message routing approach to deliver messages to the destination.Thus,it solves the problem that users have the demands to deliver messages while they are temporarily not able to connect to the Internet.Therefore,by the characteristics of DTNs,people who are not online can still query some location based information,with the help of users using the same service in the nearby area.In this paper,we proposed a location-based content search approach.Based on the concept of three-tier area and hybrid node types,we presented four strategies to solve the query problem,namely,Data Replication,Query Replication,Data Reply,and Data Synchronization strategies.Especially we proposed a Message Queue Selection algorithm for message transferring.The priority concept is set associated with every message such that the most"important"one could be sent first.In this way,it can increase the query success ratio and reduce the query delay time.Finally,we evaluated our approach,and compared with other routing schemes.The simulation results showed that our proposed approach had better query efficiency and shorter delay.展开更多
Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forward...Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forwarding,thus enabling the best routing to be selected,reducing energy consumption and optimizing the whole network.Through three aspects involving the flooding restriction scheme,the virtual area partition scheme and the best routing choice scheme,the importance of location information is seen in the routing algorithm.展开更多
<div style="text-align:justify;"> In the era of information and communication technology (ICT) and big data, the map gradually shows a new qualitative feature of “spatiotemporal ubiquitous” due to th...<div style="text-align:justify;"> In the era of information and communication technology (ICT) and big data, the map gradually shows a new qualitative feature of “spatiotemporal ubiquitous” due to the extension of its object space and the geographic information it contains, which brings new challenges to map information organization. This paper analyzes the concept and information characteristics of the ubiquitous map. Based on that, it proposes a ubiquitous map information organization model oriented to location-based aggregation. This new model includes three parts as “ubiquitous map instance”, “location-based aggregation mode” and “map scene”. This paper focuses on the “map scene” part which is the core of the model and contains two mutually mapped aspects as “content scene” and “representation scene”. And both aspects are divided into three levels as “features” ←→ “elements” ←→ “scenes” according to ubiquitous map information characteristics and location-based aggregation mode. With cases of map decomposition, the application of the model is explained to illustrate its effectiveness. The model is expected to provide powerful data organization and management capabilities for ubiquitous map production and use. </div>展开更多
Mobile professionals need to be assisted with suitable mobile GeoBI (Geospatial Business Intelligence) systems, which are able to capture, organize and structure the user’s reality into a relevant context model and r...Mobile professionals need to be assisted with suitable mobile GeoBI (Geospatial Business Intelligence) systems, which are able to capture, organize and structure the user’s reality into a relevant context model and reason on it. GeoBI context modelling and reasoning are still research issues since there is not yet either a model or a relevant taxonomy regarding GeoBI contextual information. To fill this gap, this paper proposes an extended and detailed OWL-based mobile GeoBI context ontology to provide context-aware applications and users with relevant contextual information and context-based reasoning capabilities. Context quality issues are handled an implementation architecture which is provided.展开更多
Casper Cloak is a privacy protection method based on K-anonymity algorithm. To be anonymous, Casper Cloak needs to search regional sibling and parent node, which requires a complex process and huge expenditure. In add...Casper Cloak is a privacy protection method based on K-anonymity algorithm. To be anonymous, Casper Cloak needs to search regional sibling and parent node, which requires a complex process and huge expenditure. In addition,the anonymous area has space redundancy and it is not accurate enough to achieve high Location-Based Services (LBS) quality. To address these problems,this paper proposes an improved privacy protection method-NCC, based on the Casper Cloak. To reduce the unnecessary search, NCC introduced the concept of the first sibling node. NCC also improves the LBS quality by considering the characteristics of user mobility. Moreover, the improved method,NCC, which is incorporated with a redundancy optimization processing strategy,realizing more precise in the anonymous area and accurately guaranteeing the related degree of privacy. Adopting NCC verification experiments reflects varied advantages as bellow: (1) By reducing 80% searching time, NCC highly improved searching process. (2) The anonymous area produced in NCC not only meet users' anonymous demands, but the direction of the mobility which improves 4 times accuracy of services in comparison with Casper mode.(3) According to optimization strategy, NCC can reach minimum anonymous area index, increasing the rates of anonymous optimization in original algorithm.展开更多
兴趣点(Point-Of-Interest,POI)推荐是基于位置的社交网络中(Location-Based Social Networks,LBSN)一种重要的个性化推荐功能.本文提出基于预测的兴趣点推荐算法.该算法根据LBSN中用户历史POI数据分布学习用户出行行为,利用变阶的马尔...兴趣点(Point-Of-Interest,POI)推荐是基于位置的社交网络中(Location-Based Social Networks,LBSN)一种重要的个性化推荐功能.本文提出基于预测的兴趣点推荐算法.该算法根据LBSN中用户历史POI数据分布学习用户出行行为,利用变阶的马尔科夫算法根据当前位置预测用户未来到达POI的语义信息,最终推荐时考虑用户签到次数的差异为用户推荐N个具有高兴趣度的POI.实验结果表明:本文提出的算法在准确率和召回率上均高于两个对比算法,说明该算法提高了兴趣点推荐效果,并可以有效的推荐给用户下一个访问的兴趣点.展开更多
兴趣点(POI,point of interest)推荐是位置社交网络(LBSN,location-based social network)重要的个性化服务,广泛用于热门景点推荐和旅游线路规划等。传统的基于协同过滤的推荐算法根据用户相似性和位置相似性进行推荐,未考虑推荐用户...兴趣点(POI,point of interest)推荐是位置社交网络(LBSN,location-based social network)重要的个性化服务,广泛用于热门景点推荐和旅游线路规划等。传统的基于协同过滤的推荐算法根据用户相似性和位置相似性进行推荐,未考虑推荐用户与目标用户间的信任关系,而信任关系有助于提高推荐系统的准确性、顽健性和用户满意度。首先分析了信任与不信任关系的传播特征,然后给出了信任度的表示和计算方法,最后提出了融合用户相似性、地理位置相似性和信任关系的混合推荐模型。实验结果表明,与传统协同过滤推荐方法相比,融合信任关系的混合推荐方法显著提高了推荐结果的准确性和用户满意度。展开更多
近年来,异质网络中的社区发现逐渐成为人们关注的研究热点,然而现有大多数非重叠或重叠的社区发现方法都局限于考虑单一类型的网络结构,而无法适用于包含多模实体及其多维关系的异质网络,基于位置的社交网络(location based social netw...近年来,异质网络中的社区发现逐渐成为人们关注的研究热点,然而现有大多数非重叠或重叠的社区发现方法都局限于考虑单一类型的网络结构,而无法适用于包含多模实体及其多维关系的异质网络,基于位置的社交网络(location based social network,LBSN)作为最近兴起的一种新型异质网络,如何有效发现其含有多维关系的复杂社区结构对现有研究来说是一个挑战性的难题.为此,提出了一种融合用户与位置实体及其多维关系的社区发现方法MRNMF(multi-relational nonnegative matrix factorization),该方法通过建立基于非负矩阵分解的联合聚类目标函数,并考虑融入用户社交关系、用户位置签到关系以及兴趣点特征等多维度的影响因素,能同时获得紧密关联的用户模糊社区与兴趣点聚簇结构,以有效缓解推荐中的数据稀疏问题.在2种真实LBSN数据集上的实验结果表明,所提出的MRNMF方法同时在兴趣点与朋友这双重推荐上比其他传统方法具有更优越的推荐性能.展开更多
随着智能移动设备的发展和普及,空间定位技术不断成熟,基于位置的社交网络(Location-based Social Network,LBSN)得到了广泛应用。大量用户在LBSN签到,以及针对签到进行的评论不仅记录了用户的时空行为轨迹,也为研究用户行为模式和特征...随着智能移动设备的发展和普及,空间定位技术不断成熟,基于位置的社交网络(Location-based Social Network,LBSN)得到了广泛应用。大量用户在LBSN签到,以及针对签到进行的评论不仅记录了用户的时空行为轨迹,也为研究用户行为模式和特征偏好提供了巨大的机会。提出一种基于LBSN签到数据的商业店铺选址推荐系统,首先分析用户在LBSN上的签到时间、签到地点、签到商铺类型3个方面的特征;然后提出4个影响商铺选址的因素:多样性、竞争性、相关性和客流性;最后实现商业选址推荐系统,并根据选址因素生成最优候选。并以此为基础进行相关实验来验证推荐结果,结果符合相关预期。展开更多
利用用户生成短文本(User Generated Short Text,UGST)推测用户的细粒度位置对基于位置服务的应用有重要的意义。现有的细粒度位置推测方法较少引入UGST中的语义信息,且未考虑UGST中语义实体的权重,因此性能较低。针对这些问题,提出了...利用用户生成短文本(User Generated Short Text,UGST)推测用户的细粒度位置对基于位置服务的应用有重要的意义。现有的细粒度位置推测方法较少引入UGST中的语义信息,且未考虑UGST中语义实体的权重,因此性能较低。针对这些问题,提出了一种基于位置社交网络(Location-based Social Network,LBSN)的UGST细粒度位置推测方法。该方法包括如下3个过程:1)使用Foursquare中的UGST构建实体和位置之间的关联模型,以解决位置标记稀疏问题;2)判断待推测位置的UGST中是否含有位置信息,过滤不包含任何位置语义信息的UGST,以消除噪声短文本的干扰;3)根据UGST内容推测可能的候选位置,并对每个候选位置进行排名,选择排名最靠前的位置作为推测位置。实验结果验证了所提方法的有效性。展开更多
基金This work has been partly supported by the National Natural Science Foundation of China under Grant No.61702212the Fundamental Research Funds for the Central Universities under Grand NO.CCNU19TS017.
文摘With the rapid development of the Internet of Things(IoT),Location-Based Services(LBS)are becoming more and more popular.However,for the users being served,how to protect their location privacy has become a growing concern.This has led to great difficulty in establishing trust between the users and the service providers,hindering the development of LBS for more comprehensive functions.In this paper,we first establish a strong identity verification mechanism to ensure the authentication security of the system and then design a new location privacy protection mechanism based on the privacy proximity test problem.This mechanism not only guarantees the confidentiality of the user s information during the subsequent information interaction and dynamic data transmission,but also meets the service provider's requirements for related data.
文摘Recently, location-based routings in wireless sensor networks (WSNs) are attracting a lot of interest in the research community, especially because of its scalability. In location-based routing, the network size is scalable without increasing the signalling overhead as routing decisions are inherently localized. Here, each node is aware of its position in the network through some positioning device like GPS and uses this information in the routing mechanism. In this paper, we first discuss the basics of WSNs including the architecture of the network, energy consumption for the components of a typical sensor node, and draw a detailed picture of classification of location-based routing protocols. Then, we present a systematic and comprehensive taxonomy of location-based routing protocols, mostly for sensor networks. All the schemes are subsequently discussed in depth. Finally, we conclude the paper with some insights on potential research directions for location-based routing in WSNs.
基金This work was supported by National Natural Science Foundation of China(Grant Nos.61871140,61702223,61702220,61572153,61723022,61601146)and the National Key research and Development Plan(Grant No.2018YFB0803504,2017YFB0803300).
文摘With the evolution of location-based services(LBS),a new type of LBS has already gain a lot of attention and implementation,we name this kind of LBS as the Device-Dependent LBS(DLBS).In DLBS,the service provider(SP)will not only send the information according to the user’s location,more significant,he also provides a service device which will be carried by the user.DLBS has been successfully practised in some of the large cities around the world,for example,the shared bicycle in Beijing and London.In this paper,we,for the first time,blow the whistle of the new location privacy challenges caused by DLBS,since the service device is enabled to perform the localization without the permission of the user.To conquer these threats,we design a service architecture along with a credit system between DLBS provider and the user.The credit system tie together the DLBS device usability with the curious behaviour upon user’s location privacy,DLBS provider has to sacrifice their revenue in order to gain extra location information of their device.We make the simulation of our proposed scheme and the result convince its effectiveness.
基金MKE(the Ministry of Knowledge Economy),Korea,under the ITRC(Infor mation Technology Research Center)support program supervised by the NIPA(National IT Industry Promotion Agency)(NIPA-2011-C1090-1121-0010)
文摘Internet takes a role as a place for communication between people beyond a space simply for the acquisition of information.Recently,social network service(SNS)reflecting human’s basic desire for talking and communicating with others is focused on around the world.And location-based service(LBS)is a service that provides various life conveniences like improving productivity through location information,such as GPS and WiFi.This paper suggests an application combining LBS and SNS based on Android OS.By using smart phone which is personal mobile information equipment,it combines location information with user information and SNS so that the service can be developed.It also maximizes sharing and use of information via twit based on locations of friends.This proposed system is aims for users to show online identity more actively and more conveniently.
文摘The purpose of this study is to analyze the spatial patterns of location-based social network (LBSN) data in Seoul using the spatial analysis techniques of geographic information system (GIS). The study explores the applications of LBSN data by analyzing the association between Seoul’s Foursquare venues data created based on user participation and the city’s characteristics. The data regarding Foursquare venues were compiled with a program we created based on Foursquare’s Python API. The compiled information was converted into GIS data, which in turn was depicted as a heat map. Cluster analysis was then performed based on hotspots and the correlation with census variables was analyzed for each administrative unit using geographically weighted regression (GWR). Based on analytical results, we were able to identify venue clusters around city centers, as well as differences in hotspots for various venue categories and correlations with census variables.
文摘In Delay Tolerant Networks(DTNs),the offiine users can,through the encountering nodes,use the specific peer-to-peer message routing approach to deliver messages to the destination.Thus,it solves the problem that users have the demands to deliver messages while they are temporarily not able to connect to the Internet.Therefore,by the characteristics of DTNs,people who are not online can still query some location based information,with the help of users using the same service in the nearby area.In this paper,we proposed a location-based content search approach.Based on the concept of three-tier area and hybrid node types,we presented four strategies to solve the query problem,namely,Data Replication,Query Replication,Data Reply,and Data Synchronization strategies.Especially we proposed a Message Queue Selection algorithm for message transferring.The priority concept is set associated with every message such that the most"important"one could be sent first.In this way,it can increase the query success ratio and reduce the query delay time.Finally,we evaluated our approach,and compared with other routing schemes.The simulation results showed that our proposed approach had better query efficiency and shorter delay.
文摘Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forwarding,thus enabling the best routing to be selected,reducing energy consumption and optimizing the whole network.Through three aspects involving the flooding restriction scheme,the virtual area partition scheme and the best routing choice scheme,the importance of location information is seen in the routing algorithm.
文摘<div style="text-align:justify;"> In the era of information and communication technology (ICT) and big data, the map gradually shows a new qualitative feature of “spatiotemporal ubiquitous” due to the extension of its object space and the geographic information it contains, which brings new challenges to map information organization. This paper analyzes the concept and information characteristics of the ubiquitous map. Based on that, it proposes a ubiquitous map information organization model oriented to location-based aggregation. This new model includes three parts as “ubiquitous map instance”, “location-based aggregation mode” and “map scene”. This paper focuses on the “map scene” part which is the core of the model and contains two mutually mapped aspects as “content scene” and “representation scene”. And both aspects are divided into three levels as “features” ←→ “elements” ←→ “scenes” according to ubiquitous map information characteristics and location-based aggregation mode. With cases of map decomposition, the application of the model is explained to illustrate its effectiveness. The model is expected to provide powerful data organization and management capabilities for ubiquitous map production and use. </div>
文摘Mobile professionals need to be assisted with suitable mobile GeoBI (Geospatial Business Intelligence) systems, which are able to capture, organize and structure the user’s reality into a relevant context model and reason on it. GeoBI context modelling and reasoning are still research issues since there is not yet either a model or a relevant taxonomy regarding GeoBI contextual information. To fill this gap, this paper proposes an extended and detailed OWL-based mobile GeoBI context ontology to provide context-aware applications and users with relevant contextual information and context-based reasoning capabilities. Context quality issues are handled an implementation architecture which is provided.
文摘Casper Cloak is a privacy protection method based on K-anonymity algorithm. To be anonymous, Casper Cloak needs to search regional sibling and parent node, which requires a complex process and huge expenditure. In addition,the anonymous area has space redundancy and it is not accurate enough to achieve high Location-Based Services (LBS) quality. To address these problems,this paper proposes an improved privacy protection method-NCC, based on the Casper Cloak. To reduce the unnecessary search, NCC introduced the concept of the first sibling node. NCC also improves the LBS quality by considering the characteristics of user mobility. Moreover, the improved method,NCC, which is incorporated with a redundancy optimization processing strategy,realizing more precise in the anonymous area and accurately guaranteeing the related degree of privacy. Adopting NCC verification experiments reflects varied advantages as bellow: (1) By reducing 80% searching time, NCC highly improved searching process. (2) The anonymous area produced in NCC not only meet users' anonymous demands, but the direction of the mobility which improves 4 times accuracy of services in comparison with Casper mode.(3) According to optimization strategy, NCC can reach minimum anonymous area index, increasing the rates of anonymous optimization in original algorithm.
文摘兴趣点(Point-Of-Interest,POI)推荐是基于位置的社交网络中(Location-Based Social Networks,LBSN)一种重要的个性化推荐功能.本文提出基于预测的兴趣点推荐算法.该算法根据LBSN中用户历史POI数据分布学习用户出行行为,利用变阶的马尔科夫算法根据当前位置预测用户未来到达POI的语义信息,最终推荐时考虑用户签到次数的差异为用户推荐N个具有高兴趣度的POI.实验结果表明:本文提出的算法在准确率和召回率上均高于两个对比算法,说明该算法提高了兴趣点推荐效果,并可以有效的推荐给用户下一个访问的兴趣点.
文摘兴趣点(POI,point of interest)推荐是位置社交网络(LBSN,location-based social network)重要的个性化服务,广泛用于热门景点推荐和旅游线路规划等。传统的基于协同过滤的推荐算法根据用户相似性和位置相似性进行推荐,未考虑推荐用户与目标用户间的信任关系,而信任关系有助于提高推荐系统的准确性、顽健性和用户满意度。首先分析了信任与不信任关系的传播特征,然后给出了信任度的表示和计算方法,最后提出了融合用户相似性、地理位置相似性和信任关系的混合推荐模型。实验结果表明,与传统协同过滤推荐方法相比,融合信任关系的混合推荐方法显著提高了推荐结果的准确性和用户满意度。
文摘近年来,异质网络中的社区发现逐渐成为人们关注的研究热点,然而现有大多数非重叠或重叠的社区发现方法都局限于考虑单一类型的网络结构,而无法适用于包含多模实体及其多维关系的异质网络,基于位置的社交网络(location based social network,LBSN)作为最近兴起的一种新型异质网络,如何有效发现其含有多维关系的复杂社区结构对现有研究来说是一个挑战性的难题.为此,提出了一种融合用户与位置实体及其多维关系的社区发现方法MRNMF(multi-relational nonnegative matrix factorization),该方法通过建立基于非负矩阵分解的联合聚类目标函数,并考虑融入用户社交关系、用户位置签到关系以及兴趣点特征等多维度的影响因素,能同时获得紧密关联的用户模糊社区与兴趣点聚簇结构,以有效缓解推荐中的数据稀疏问题.在2种真实LBSN数据集上的实验结果表明,所提出的MRNMF方法同时在兴趣点与朋友这双重推荐上比其他传统方法具有更优越的推荐性能.
文摘随着智能移动设备的发展和普及,空间定位技术不断成熟,基于位置的社交网络(Location-based Social Network,LBSN)得到了广泛应用。大量用户在LBSN签到,以及针对签到进行的评论不仅记录了用户的时空行为轨迹,也为研究用户行为模式和特征偏好提供了巨大的机会。提出一种基于LBSN签到数据的商业店铺选址推荐系统,首先分析用户在LBSN上的签到时间、签到地点、签到商铺类型3个方面的特征;然后提出4个影响商铺选址的因素:多样性、竞争性、相关性和客流性;最后实现商业选址推荐系统,并根据选址因素生成最优候选。并以此为基础进行相关实验来验证推荐结果,结果符合相关预期。
文摘利用用户生成短文本(User Generated Short Text,UGST)推测用户的细粒度位置对基于位置服务的应用有重要的意义。现有的细粒度位置推测方法较少引入UGST中的语义信息,且未考虑UGST中语义实体的权重,因此性能较低。针对这些问题,提出了一种基于位置社交网络(Location-based Social Network,LBSN)的UGST细粒度位置推测方法。该方法包括如下3个过程:1)使用Foursquare中的UGST构建实体和位置之间的关联模型,以解决位置标记稀疏问题;2)判断待推测位置的UGST中是否含有位置信息,过滤不包含任何位置语义信息的UGST,以消除噪声短文本的干扰;3)根据UGST内容推测可能的候选位置,并对每个候选位置进行排名,选择排名最靠前的位置作为推测位置。实验结果验证了所提方法的有效性。
