NZ625092B2 - Method and server for searching for nearby user in social networking services - Google Patents

Method and server for searching for nearby user in social networking services Download PDF

Info

Publication number
NZ625092B2
NZ625092B2 NZ625092A NZ62509212A NZ625092B2 NZ 625092 B2 NZ625092 B2 NZ 625092B2 NZ 625092 A NZ625092 A NZ 625092A NZ 62509212 A NZ62509212 A NZ 62509212A NZ 625092 B2 NZ625092 B2 NZ 625092B2
Authority
NZ
New Zealand
Prior art keywords
user
grid
users
location information
distances
Prior art date
Application number
NZ625092A
Other versions
NZ625092A (en
Inventor
Junchao Chen
Haochuan Cui
Jingqiong Feng
Tianqing Huang
Zhonghua Lai
Xiangyao Lin
Xueqin Lin
Guo Ling
Cuilong Ma
Kunfeng Rong
Original Assignee
Tencent Technology (Shenzhen) Company Limited
Priority date (The priority date is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the date listed.)
Filing date
Publication date
Priority claimed from CN201110363120.4A external-priority patent/CN102571910B/en
Application filed by Tencent Technology (Shenzhen) Company Limited filed Critical Tencent Technology (Shenzhen) Company Limited
Publication of NZ625092A publication Critical patent/NZ625092A/en
Publication of NZ625092B2 publication Critical patent/NZ625092B2/en

Links

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2457—Query processing with adaptation to user needs
    • G06F16/24578—Query processing with adaptation to user needs using ranking
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/29—Geographical information databases
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/953—Querying, e.g. by the use of web search engines
    • G06F16/9535—Search customisation based on user profiles and personalisation
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q10/00—Administration; Management
    • G06Q10/10—Office automation; Time management
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
    • G06Q50/00—Information and communication technology [ICT] specially adapted for implementation of business processes of specific business sectors, e.g. utilities or tourism
    • G06Q50/01—Social networking

Abstract

Disclosed are a method and server for searching for nearby users in a social network. The method comprises after receiving the position information and a user identifier reported by the client-side of any user X, determining a grid Y where the received position information is located. The method further comprises storing the user identifier and the latest position information of user X only in the list corresponding to grid Y. The grid Y is any one grid in a series of grid arrays with an equal area pre-plotted on the earth surface. The server searches for the users in grid Y and the other grids forming an N-grid structure together with grid Y and taking grid Y as center. The server sequences the searched users in the sequence from proximal to distal according to distances to user X, and returns the user identifiers of the sequenced users and the distances to user X to the client-side of user X. The reporting time can be further considered as another factor in the sequencing process. The method and device of the present invention improve the accuracy of search result. ther comprises storing the user identifier and the latest position information of user X only in the list corresponding to grid Y. The grid Y is any one grid in a series of grid arrays with an equal area pre-plotted on the earth surface. The server searches for the users in grid Y and the other grids forming an N-grid structure together with grid Y and taking grid Y as center. The server sequences the searched users in the sequence from proximal to distal according to distances to user X, and returns the user identifiers of the sequenced users and the distances to user X to the client-side of user X. The reporting time can be further considered as another factor in the sequencing process. The method and device of the present invention improve the accuracy of search result.

Description

METHOD AND SERVER FOR SEARCHING FOR NEARBY USER IN SOCIAL NETWORKING SERVICES This application claims the benefit of priority from Chinese Patent Application, No. 201110363120.4, entitled "Method and Server for Searching for Nearby User in Social Networking Services (SNS)" and filed on November 16, 2011, the entire content of which is hereby incorporated by reference.
FIELD OF THE INVENTION The present disclosure relates to Internet technologies, and more particularly, to methods and servers for searching for nearby users in SNS.
BACKGROUND In SNS, a user may search for nearby users and contact with a user to make friends with the user or seek the user's help, etc.
SUMMARY The present disclosure provides methods and servers for searching for nearby users in SNS, to enhance accuracy of a searching result.
A method for searching for nearby users in Social Networking Services (SNS) includes: receiving location information and a user Identification (ID) from a client terminal device of a user X; determining a grid Y, to which the location information belongs; saving the user ID, the location information and reporting time of the user X in a list of the grid Y; wherein the grid Y is one of grids in a grid array obtained by dividing a surface of the earth into the grids; searching for users in the grid Y and other girds; wherein the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n, n is an odd larger than or equal to 3; ranking the users according to distances between the users and the user X and the reporting time of the user X; wherein the closer a distance between a 6418633_2.docx user and the user X, the higher rank of the user is, and the shorter time between the reporting time of the user and a current time is, the higher the rank of the user is; and sending the ranked user IDs of the users and the distances between the users and the user X to the client terminal device of the user X.
A server includes: a first processing module, to divide a surface of the earth into a grid array and set a list for a grid; a second processing module, when location information and a user Identification (ID) from a client terminal device of a user X is received, to determine a grid Y, to which the location information belongs, store the user ID, the location information and reporting time of the user X in a list of the grid Y, search for users in the grid Y and other girds, in which the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N= n*n and n is an odd larger than or equal to 3, rank the users according to distances between the users and the user X and the reporting time of the user X and send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X; wherein the closer a distance between a user and the user X, the higher rank of the user is, and the shorter time between the reporting time of the user and a current time is, the higher the rank of the user is.
With the technical scheme of the present disclosure, the searching is performed in the grid, at which the user X is located and nearby grids of the grid.
The users which are searched out are ranked according to an ascending order of the distances between the users and the user X. Even a user is not located in the above grid, if the distance between the user the user X is short, the user may be searched out and sent to the user X, which may enhance the accuracy of the result of the searching. In addition, in the scheme of the present disclosure, the ranking may be further performed according to the reporting time in addition to the location information and the user ID of the user X. The shorter time between the reporting time of the user and a current time is, the more likely the user X may get in touch with the user and the higher the rank of the user is, which may enhance the accuracy of the searching result. 6418633_2.docx BRIEF DESCRIPTION OF THE DRAWINGS Figure 1 is a schematic diagram illustrating a location of a user X; Figure 2 is a flow chart illustrating a method for searching for nearby users in SNS in accordance with an example of the present disclosure; id="p-10" id="p-10"
[0010] Figure 3 is a schematic diagram illustrating a 9-grid formed by a Y grid and nearby grids; Figure 4 is a flow chart illustrating another method for searching for nearby users in the SNS in accordance with an example of the present disclosure; id="p-12" id="p-12"
[0012] Figure 5 is a schematic diagram illustrating structure of a server in accordance with an example of the present disclosure.
DETAILED DESCRIPTION For simplicity and illustrative purposes, the present disclosure is described by referring mainly to non-limiting examples. In the following description, numerous specific details are set forth in order to provide a thorough understanding of the present disclosure. It will be readily apparent however, that the present disclosure may be practiced without limitation to these specific details.
In other instances, some methods and structures have not been described in detail so as not to unnecessarily obscure the present disclosure. As used throughout the present disclosure, the term "includes" means includes but not limited to, the term "including" means including but not limited to. The term "based on" means based at least in part on. In addition, the terms "a" and "an" are intended to denote at least one of a particular element.
Nearby users may be searched via following methods. According to longitude and latitude information, a server may divide a surface of the earth in to a grid array, in which the area of each grid is the same. As for any user X, when the user X needs to search for nearby users, the user X may send his/her location information and a user Identification (ID) to a server via a client terminal 6418633_2.docx device used by the user X. The client terminal device may be a mobile terminal device. The location information may be the longitude and latitude information.
After the server receives the location information from the user X, the server first may determine a grid, to which the location information belongs. Then, the server may search for other users in this grid, search for user IDs of the other users and distances between the other users and the user X and send the user IDs and the distances to the client terminal device of the user X.
However, there are some drawbacks in the above method. The user X may be close to a boundary of two adjacent grids. Figure 1 is a schematic diagram illustrating a location of the user X. As shown in figure 1, two adjacent grids may be grid A and grid B. The user X and user Z are located at the grid A and the user Y is located at the grid B. As for the user X, the distance between the user X and the user Y is shorter than that between the user X and the user Z.
If the user X seeks for help, the user Y is obviously a better choice than the user Z. According to an example, the user X may search for the user Z but cannot search for the user Y, resulting in inaccurate searching result.
In order to enhance the accuracy of the searching result, the present disclosure provides a scheme for searching for nearby users.
Figure 2 is a flow chart illustrating a method for searching for nearby users in SNS in accordance with an example of the present disclosure. As shown in figure 2, the method includes the following blocks.
In block 21, a surface of the earth may be divided into a grid array. A list may be set for a grid. According to an example, a list may be set for each grid.
According to an example of the present disclosure, the surface of the earth may be divided into the grid array. Areas of grids in the grid array may be different or may be the same.
According to longitude and latitude information, the surface of the earth may be divided into the grid array, in which the area of each grid may be the same. The area of the grid may be configured as needed, such as one square 6418633_2.docx kilometers.
The list may be empty at an initial stage.
In block 22, when location information and a user ID is received from a client terminal device of a user X, a grid Y, to which the location information belongs may be determined. As for the user X, the user ID and location information of the user X may be stored in list of the grid Y.
The location information may be the longitude and latitude information.
Since the grids are divided according to the longitude and latitude information, the grid, to which the received location information belongs, may be determined. id="p-24" id="p-24"
[0024] For the convenience of description, in various example of the present disclosure, any user may be denoted by the user X and the grid, to which the user X is located is denoted by the grid Y.
After determining the grid Y, the received user ID and location information may be stored in the list of the grid Y. Therefore, if another user searches for nearby users in the grid Y, the user X may be found.
It should be noted that the user X may search for nearby users repeatedly.
The user ID and the location information may be reported many times. In this example, the user ID and the location information of the user X may be stored in the list of the grid Y to ensure the uniqueness of the user information.
For example, assume that the user X is in a grid A and reports his/her user ID and location information. The user ID and location information of the user X may be stored in a list of the grid A. Then, if the gird, at which the user X is located, is changed to a grid B, the user X may report his/her user ID and location information again. Therefore, the user ID and location information of the user X stored in the list of the grid A may be deleted and the user ID and the location information of the user X may be stored in the list of the grid B.
In block 23, users in the grid Y and other grids may be searched out. The grid Y and the other grids may form an N-grid and the grid Y may be the center of 6418633_2.docx the N-grid. Wherein, N=n*n and n is an odd larger than or equal to 3.
The structure of the N-grid may ensure that users on each direction around the user X may be found.
The value of n may be determined according to actual requirements. For example, compared with sparsely populated cities, such as Qinghai and Neimenggu, in densely populated cities, such as Guangzhou, Beijing and Shanghai, the value of N may be 5 or 7, etc.
Figure 3 is a schematic diagram illustrating a 9-grid formed by a Y grid and nearby grids. id="p-32" id="p-32"
[0032] If the N-grid in this block is the 9-grid shown in figure 3, users in the list of the 9-grid may be the users which are searched out, except for the user X.
In block 24, users which are searched out may be ranked in an ascending order of distances between the user X and the users and the ranked user IDs of the users and distances between the user X and the user may be sent to the client terminal device of the user X.
Since the location information of the users which are searched out may be known, the location information of the user X may be known. Therefore, the distances between the user X and the users which are searched out may be computed and the ranking of the user may be performed. id="p-35" id="p-35"
[0035] The searching scope in examples of the present disclosure may be enlarged. Therefore, the number of the users which are searched out is increased.
For the user X, users ranked lower are basically not concerned. Therefore, the information of these users needs not to be sent to the user X, which may reduce amount of transmitted data and save bandwidth resources, etc.
After the ranking is finished, whether the number of users which are searched out is less than or equal to M may be determined. If the number of the users which are searched out is less than or equal to M, the user IDs of the users and the distances between the user X and the users may be sent to the client 6418633_2.docx terminal device of the user X. If the number of the users which are searched out is larger than M, the user IDs of users among top M and the distances between the user X and the users among the top M may be sent to the client terminal device of the user X. M may be a positive integer larger than one. The value of M may be determined according to actual requirements.
Other information besides the user IDs of the users and the distances between the user X and the users, such as avatars of the users may be sent to the client terminal device of the user X.
Figure 4 is a flow chart illustrating another method for searching for nearby users in the SNS in accordance with an example of the present disclosure.
As shown in figure 4, the method may include following blocks.
In block 41, a surface of the earth may be divided into a grid array. A list may be set for a grid.
According to an example of the present disclosure, the surface of the earth may be divided into the grid array. Areas of grids in the grid array may be different or may be the same.
In block 42, when location information and a user ID is received from a client terminal device of a user X, a grid Y, to which the location information belongs may be determined. As for the user X, the user ID, location information 9 0 and reporting time of the user X may be stored in list of the grid Y.
In block 43, users in the grid Y and other grids may be searched out. The grid Y and the grid may form an N-grid and the grid Y may be the center of the N-grid. Wherein, N=n*n and n may be an odd larger than or equal to 3.
In block 44, users which are searched out may be ranked according to the distances between the users and the user X and the reporting time and ranked user IDs of the users and distances between the user X and the users may be sent to the client terminal device of the user X. The closer the distance between the user X and a user is, the higher the rank of the user is. The shorter 6418633_2.docx the time between the reporting time of the user and the current time is, the higher the rank of the user is.
Compared with the example shown in figure 2, when the ranking is performed in this example, the reporting time may be taken into consideration. In block 42, the report time of the user ID and the location information of the user X may be stored in the list of the grid Y.
In block 44, a weight of a user i 4 = a* D, +b* T, may be computed, a and b are weighting coefficients and values of a and b may be determined as needed. the distance between the user i and the user X. r, denotes the time between the current time and the reporting time of the user i. The users are ranked in an ascending order of the weight.
After the ranking is finished, whether the number of users which are searched out is less than or equal to M may be determined. If the number of the users which are searched out is less than or equal to M, the user IDs of the users and the distances between the user X and the users may be sent to the client terminal device of the user X. If the number of the users which are searched out is larger than M, the user IDs of the users among top M and the distances between the user X and the users among the top M may be sent to the client terminal device of the user X. M may be a positive integer larger than one.
In the above two examples, the client terminal device of the user X may obtain the location information of the user X with following methods. That is, the client terminal device of the user X may obtain the location information of the user X via method one to method L. After the location information of the user X is obtained, the client terminal device may report the location information. If the location information of the user X is not obtained with a method, the client terminal device of the user X may obtain the location information with a next method. L may be a positive integer larger than one. As for different methods, the smaller the number is, the higher the accuracy of the location information is.
The value of L may be three. Method one may be obtaining the location 6418633_2.docx information via a Global Positioning System (GPS) function. Method two may be obtaining the location information via a Cell ID of an eNode B. Method three may be obtaining the location information via a Media Access Control (MAC) address of a connected Wireless Fidelity (WiFi) access point. id="p-49" id="p-49"
[0049] The description of the methods in examples of the present disclosure is finished.
On the basis of the above description, figure 5 is a schematic diagram illustrating structure of a server in accordance with an example of the present disclosure. As shown in figure 5, the server 500 may include: a first processing module 501, to divide a surface of the earth into a grid id="p-51" id="p-51"
[0051] array, in which area of each grid may be the same and set a list for a grid; and a second processing module 502, when location information and a user Identification (ID) from a client terminal device of a user X is received, to determine a grid Y, to which the location information belongs, store the user ID and the location information of the user X in a list of the grid Y, search for users in the grid Y and other girds, in which the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N = n*n, n is an odd larger than or equal to 3, rank the users in an ascending order of distances between the users the user X and send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X.
The second processing module 502 may further determine whether number of the users is less than or equal to M after the users are ranked, send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M and send ranked user IDs of users among top M and distances between the users among the top M and the user X to the client terminal device of the user X if the number of the users is larger than M; wherein M may be a positive integer larger than one.
According to another example of the present disclosure, the server 500 6418633_2.docx may include: a first processing module 501, to divide a surface of the earth into a grid array, in which an area of each grid may be the same and set a list for a grid; a second processing module 502, when location information and a user Identification (ID) from a client terminal device of a user X is received, to determine a grid Y, to which the location information belongs, store the user ID, the location information and reporting time of the user X in a list of the grid Y, search for users in the grid Y and other girds, in which the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n, n is an odd larger than or equal to 3, rank the users according to distances between the users and the user X and the reporting time of the user X and send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X; wherein the closer a distance between a user and the user X is, the higher rank of the user is, and the shorter time between the reporting time of the user and a current time is, the higher the rank of the user is.
According to an example of the present disclosure, the first processing module 501 may divide the surface of the earth into the grid array. Areas of grids in the grid array may be different or may be the same.
The second processing module 502 may further compute a weight A, = a *D i +b*T, of a user i; wherein a and b are weighting coefficients, R is a distance between the user i and the user X, 77 is time between the current time and the reporting time of the user i and rank the users in an ascending order of the weight.
The second processing module 502 may further determine whether number of the users is less than or equal to M after the users are ranked, send the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M and send ranked user IDs of users among top M and distances between the users among the top M and the user X to the client terminal device 6418633_2.docx of the user X if the number of the users is larger than M; wherein M may be a positive integer larger than one.
With the technical scheme of the present disclosure, the searching is performed in the grid, at which the user X is located and nearby grids of the grid.
The users which are searched out are ranked according to an ascending order of the distances between the users and the user X. Even a user is not located in the above grid, if the distance between the user the user X is short, the user may be searched out and sent to the user X, which may enhance the accuracy of the result of the searching. In addition, in the scheme of the present disclosure, the ranking may be further performed according to the reporting time in addition to the location information and the user ID of the user X. The shorter time between the reporting time of the user and a current time is, the more likely the user X may get in touch with the user and the higher the rank of the user is, which may enhance the accuracy of the searching result. id="p-61" id="p-61"
[0061] The foregoing only describes preferred embodiments of the present invention. The protection scope of the present invention, however, is not limited to the above description. Any change or substitution, easily occurring to those skilled in the art, should be covered by the protection scope of the present invention. 6418633_2.docx

Claims (5)

WHAT WE CLAIM IS:
1. A method for searching for nearby users in Social Networking Services (SNS), including: receiving location information and a user Identification (ID) from a client 5 terminal device of a user X; determining a grid Y, to which the location information belongs; saving the user ID, the location information and reporting time of the user X in a list of the grid Y; wherein the grid Y is one of grids in a grid array obtained by dividing a surface of the earth into the grids; to searching for users in the grid Y and other girds; wherein the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N =n*n, n is an odd larger than or equal to 3; ranking the users according to distances between the users and the user X and the reporting time of the user X; wherein the closer a distance between a 15 user and the user X, the higher rank of the user is, and the shorter time between the reporting time of the user and a current time is, the higher the rank of the user is; and sending the ranked user IDs of the users and the distances between the users and the user X to the client terminal device of the user X.
2. The method according to claim 1, wherein ranking the users according to the distances between the users and the user X and the reporting time of the user X includes: computing a weight A, =a*D,+b*T, of a user i; wherein a and b are 25 weighting coefficients, D, is a distance between the user i and the user X, T, is time between the current time and the reporting time of the user i; and ranking the users in an ascending order of the weight.
3. The method according to claim 1, wherein sending the ranked user IDs of 30 the users and distances between the users and the user X to the client terminal device of the user X includes: determining whether number of the users is less than or equal to M; 6418633_2.docx sending the ranked user IDs of the users and distances between the users and the user X to the client terminal device of the user X if the number of the users is less than or equal to M; and sending ranked user IDs of users among top M and distances between the 5 users among the top M and the user X to the client terminal device of the user X if the number of the users is larger than M; wherein M is a positive integer larger than one.
4. The method according to any of claims 1 to 3, wherein before receiving the 10 location information of the user X, the method further includes: obtaining, by the client terminal device of the user X, the location information of the user X according to any of method one to method three; wherein method one is a Global Positioning System (GPS) function, method two is a Cell ID of an eNode B and method three is a Media Access Control (MAC) address of a 15 connected Wireless Fidelity (WiFi) access point; reporting, by the client terminal device of the user X, the location information of the user X if the location information of the user X is successfully obtained with one of the method one to method three; and obtaining, by the client terminal device of the user X, the location information of the user X with another method of the method one to method three if the location information of the user X is not successfully obtained with the one of the method one to method three.
5. A server, including: 25 a first processing module, to divide a surface of the earth into a grid array and set a list for a grid; a second processing module, when location information and a user Identification (ID) from a client terminal device of a user X is received, to determine a grid Y, to which the location information belongs, store the user ID, the location information and reporting time of the user X in a list of the grid Y, search for users in the grid Y and other girds, in which the grid Y and the other grids form an N-grid and the grid Y is a center of the N-grid, N=n*n and n is an odd larger than or equal to 3, rank the users according to distances between the 6418633_2.docx
NZ625092A 2011-11-16 2012-08-02 Method and server for searching for nearby user in social networking services NZ625092B2 (en)

Applications Claiming Priority (3)

Application Number Priority Date Filing Date Title
CN201110363120.4A CN102571910B (en) 2011-11-16 2011-11-16 Method for searching nearby users in social network, and server
CN201110363120.4 2011-11-16
PCT/CN2012/079561 WO2013071773A1 (en) 2011-11-16 2012-08-02 Method and server for searching for nearby user in social network

Publications (2)

Publication Number Publication Date
NZ625092A NZ625092A (en) 2015-08-28
NZ625092B2 true NZ625092B2 (en) 2015-12-01

Family

ID=

Similar Documents

Publication Publication Date Title
AU2012339408B2 (en) Method and server for searching for nearby user in social network
Zhang et al. On reliable task assignment for spatial crowdsourcing
KR101976236B1 (en) Locating a mobile device
KR101355269B1 (en) Managing a location database for network-based positioning system
CN102831170B (en) Method and device for pushing activity information
US9420426B2 (en) Inferring a current location based on a user location history
JP5925338B2 (en) Discovery of wireless network access points
KR20120117865A (en) Determining a location of a mobile device using a location database
CN108882174B (en) Mobile terminal positioning method and device, electronic equipment and storage medium
Yamaguchi et al. Landmark-based user location inference in social media
US9936353B2 (en) Method, server device and mobile terminal for processing information
CN104811372B (en) A kind of multi-user's means of communication based on geographical position and spatial dimension
CN104281646B (en) Urban waterlogging detection method based on microblog data
CN111651681A (en) Message pushing method and device based on intelligent information recommendation in cloud network fusion environment
Brunato et al. A location-dependent recommender system for the web
US20180270620A1 (en) Collaborative geo-positioning of electronic devices
Teller et al. Organic indoor location discovery
NZ625092B2 (en) Method and server for searching for nearby user in social networking services
Chen et al. Optimal region search with submodular maximization
JP6433059B2 (en) Apparatus, program and method for positioning mobile terminal based on communication record
US10783169B1 (en) Inferring user interests from geo-location reports
Konstantinidis et al. Radio map prefetching for indoor navigation in intermittently connected wi-fi networks
OA16978A (en) Method and server for searching for nearby user in social network.
RU2769920C2 (en) Method and system for determining fact of user's visiting point of interest
Hicks et al. Organic Indoor Location Discovery