CN116233055A - Method for realizing high concurrency and high precision position social platform service - Google Patents
Method for realizing high concurrency and high precision position social platform service Download PDFInfo
- Publication number
- CN116233055A CN116233055A CN202211514387.3A CN202211514387A CN116233055A CN 116233055 A CN116233055 A CN 116233055A CN 202211514387 A CN202211514387 A CN 202211514387A CN 116233055 A CN116233055 A CN 116233055A
- Authority
- CN
- China
- Prior art keywords
- user
- social
- metadata
- sub
- communication
- Prior art date
- Legal status (The legal status 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 status listed.)
- Granted
Links
- 238000000034 method Methods 0.000 title claims abstract description 29
- 238000004891 communication Methods 0.000 claims abstract description 44
- 239000000284 extract Substances 0.000 claims description 3
- 238000012795 verification Methods 0.000 claims description 2
- 238000004364 calculation method Methods 0.000 abstract description 5
- 238000003672 processing method Methods 0.000 abstract description 5
- 238000013461 design Methods 0.000 abstract description 4
- 238000012545 processing Methods 0.000 abstract description 4
- 238000011161 development Methods 0.000 abstract description 3
- 238000007726 management method Methods 0.000 description 11
- 101100285899 Saccharomyces cerevisiae (strain ATCC 204508 / S288c) SSE2 gene Proteins 0.000 description 5
- 238000012986 modification Methods 0.000 description 2
- 230000004048 modification Effects 0.000 description 2
- 108010067930 structure-specific endonuclease I Proteins 0.000 description 2
- 238000012550 audit Methods 0.000 description 1
- 230000009286 beneficial effect Effects 0.000 description 1
- 230000001413 cellular effect Effects 0.000 description 1
- 230000007547 defect Effects 0.000 description 1
- 238000010586 diagram Methods 0.000 description 1
- 238000005516 engineering process Methods 0.000 description 1
- 238000012544 monitoring process Methods 0.000 description 1
- 238000011084 recovery Methods 0.000 description 1
Images
Classifications
-
- Y—GENERAL TAGGING OF NEW TECHNOLOGICAL DEVELOPMENTS; GENERAL TAGGING OF CROSS-SECTIONAL TECHNOLOGIES SPANNING OVER SEVERAL SECTIONS OF THE IPC; TECHNICAL SUBJECTS COVERED BY FORMER USPC CROSS-REFERENCE ART COLLECTIONS [XRACs] AND DIGESTS
- Y02—TECHNOLOGIES OR APPLICATIONS FOR MITIGATION OR ADAPTATION AGAINST CLIMATE CHANGE
- Y02D—CLIMATE CHANGE MITIGATION TECHNOLOGIES IN INFORMATION AND COMMUNICATION TECHNOLOGIES [ICT], I.E. INFORMATION AND COMMUNICATION TECHNOLOGIES AIMING AT THE REDUCTION OF THEIR OWN ENERGY USE
- Y02D10/00—Energy efficient computing, e.g. low power processors, power management or thermal management
Landscapes
- Management, Administration, Business Operations System, And Electronic Commerce (AREA)
Abstract
The invention belongs to the technical field of data processing, and particularly relates to a method for realizing high-concurrency and high-precision position social platform service, wherein a social platform service network management center is used for managing a plurality of sub-management centers; the social platform server generates the latest release position and the historical release position of the user into a position set and sends the position set to a sub-management center where the latest release position is located; accurately determining the instant position of the user by the communication position and the latest release position; when the user views the timeline, metadata is directly called from the timeline list, and then corresponding social data is obtained from the database. The design and development of a millions of data Feed stream service system are realized, and better system performance is further provided; the processing method optimizes and enhances a social recommendation algorithm, optimizes data accurate matching and solves the problem of data repetition in social relations; and high-precision user positioning can be realized, so that the calculation force is saved, and the running efficiency of the server is improved.
Description
Technical Field
The present application relates to the field of data processing and communication technologies, and in particular, to a method for implementing a high concurrency and high precision location social platform service.
Background
The data acquisition of big data is based on the determination of the user target, and the data is processed after the acquisition for all structured, semi-structured and unstructured data in the range, and valuable information is analyzed and mined from the data. With the access of mass equipment, high concurrency of data acquisition can generate performance bottlenecks, so that the problems of data backlog, connection overtime and the like are caused; the system can not dynamically and real-time transmit the data to the subscribers, so that the content push of the social network based on SNS is not easy to realize; aiming at the problems exposed in the use process of the current data high concurrency processing method, the data high concurrency processing method is necessary to be structurally improved and optimized. An "application" constituted by location information refers to a specific application. The application wireless terminal and the processor are wireless infrastructure networks or wireless terminals in communication with the processor that identify a location in any one of the implementations in software executed by a computer. The information application uses a personal location service application, such as a location sensitive billing asset tracking asset monitoring and recovery crew and resource management personal location service, to provide a Local Map (Local Map) based on its location by the wireless terminal. The recommendation of location facilities (e.g., hotels or restaurants) of wireless terminals and the provision of recommended facilities for navigation directions by specifications of wireless terminals require a social platform that enables high concurrency and provides high-precision location.
The purpose of the present application is to solve at least one of the above-mentioned background art or other related technical problems.
Disclosure of Invention
Aiming at solving at least one or other related technical problems mentioned in the background art, the application provides a method for realizing high concurrency and high precision social network platform service, realizes the design and development of a millions of data Feed stream service system, and further provides better system performance; the processing method optimizes and enhances a social recommendation algorithm, optimizes data accurate matching and solves the problem of data repetition in social relations; and high-precision user positioning can be realized, so that the calculation force is saved, and the running efficiency of the server is improved.
A method of implementing a high concurrency and high accuracy location social platform service, comprising:
s1, when a user publishes social data, writing metadata into a time line list; only metadata is saved, wherein the metadata comprises a release position; by means of the cache, a large amount of metadata pushing can be well supported, and high concurrency is achieved;
s2, the social platform service network management center manages a plurality of sub-management centers, and the jurisdiction of the sub-management centers takes the coordinate of the sub-management centers as the circle center and a preset communication distance R i A circular region of radius;
s3, the social platform server generates the latest release position and the historical release position of the user as a position set and sends the position set to a sub-management center where the latest release position is located;
s4, determining the communication position of the user according to social information of the user and other users in the sub-management center and/or social information of the user used for the user and other sub-management centers, and accurately determining the instant position of the user according to the communication position and the latest release position;
s5, when the user views the own time line, metadata is directly called from the time line list, and then the corresponding social data is obtained from the database.
In a preferred embodiment of the method for implementing a highly concurrent and highly accurate location social platform service, in step S1, when the social data is a Feed message,
1) The Feed message firstly enters a queue service, and metadata is extracted from the Feed message;
2) Storing the Feed information into a database, and asynchronously calling a metadata release service to release after the Feed information is stored successfully;
3) The metadata publishing service extracts IDs of a sender, a publishing domain and a Feed message from metadata, and invokes the social relation service to determine a queue list of the Feed to be pushed;
4) A batch write interface using a metadata post service writes multiple rows of data into multiple Feed streams at once.
In step S1, the metadata further includes a publisher, a publication location, a publication time, a content, and a content type.
In step S2, the separate management center may also receive a registration request from a user, perform identity verification on the user submitting the registration request, determine that the position of the new application user is the central position of the separate management center, and send the information of the new application user to the social platform service network management center, and store the information in the social platform server.
In the preferred scheme of the method for realizing the social platform service with high concurrency and high precision positions, in step S3, the latest release position and the historical release position are marked by adopting different management labels.
In the preferred scheme of the method for implementing the social platform service of the high concurrency and high precision location, in step S3, the location set changes along with the change of the latest release location.
The optimal scheme of the method for realizing the social platform service with high concurrency and high precision position adopts a ternary closure theory and a common friend and time sequence recommendation algorithm, and adds a time dimension and a position dimension on the basis of the common friend, wherein the position dimension is embodied in the jurisdiction of a sub-management center.
In the preferred scheme of the method for implementing the social platform service with high concurrency and high precision location, in step S4, the communication location of the user is determined through the following steps:
a) Determining communication distances between the user and other users in the same sub-management center;
b) Determining the release distance between the latest release position of the user and the communication positions of other users in the step a);
c) Counting the average value of the distance difference between the communication distance and the release distance, and if the average value is smaller than a threshold value, confirming that the latest release position of the user is the communication position of the user; and if the average value is not smaller than the threshold value, confirming that the communication position of the user is the communication position of the user. By comparing the communication distance between the user and other users with the distance between the latest release distance of the user and the communication positions of other users, the instant position of the user can be accurately determined, and when the distance is lower than a set threshold value, the latest release position of the user is determined to be the communication position of the user, so that the user can be conveniently positioned by the latest release position, high-precision positioning is realized, calculation power can be saved, and the running efficiency of the server is improved.
A computer storage medium storing one or more computer instructions, characterized by: the computer instructions, when executed, perform the method described previously.
An apparatus comprising a storage medium and a processor, the storage medium having stored therein an executable program executable by the processor, which when executed by the processor, performs the method described previously.
The invention adopts the technical proposal to realize the aim, makes up the defects of the prior art, has reasonable design and convenient operation.
Compared with the prior art, the invention has the beneficial effects that: the design and development of a millions of data Feed stream service system are realized, and better system performance is further provided; the processing method optimizes and enhances a social recommendation algorithm, optimizes data accurate matching and solves the problem of data repetition in social relations; when the user needs to be positioned, the latest release position of the user is determined to be the communication position of the user by comparing the communication distance between the user and other users and the distance between the latest release distance of the user and the communication position of other users to be lower than a set threshold, so that the user can be conveniently positioned by the latest release position, high-precision positioning is realized, calculation force can be saved, and the running efficiency of the server is improved.
Drawings
The accompanying drawings, which are included to provide a further understanding of the present application, are incorporated herein and constitute a part of this specification and are incorporated herein by reference, for further understanding of the present application, and are incorporated into the specification and constitute a further understanding of the present application.
FIG. 1 is a flow chart of a method of implementing a social platform service for high concurrency and high accuracy location;
FIG. 2 is a flow chart of the communication location determination steps;
fig. 3 is a schematic diagram of maximum throughput rate as users increase.
Detailed Description
In order to clearly illustrate the technical features of the present solution, the present application will be described in detail below with reference to the following detailed description and the accompanying drawings. The following disclosure provides many different embodiments, or examples, for implementing different results of the invention. In order to simplify the present disclosure, components and arrangements of specific examples are described below. Furthermore, the present invention may repeat reference numerals and/or letters in the various examples, which are for the purpose of brevity and clarity, and which do not themselves indicate the relationship between the various embodiments and/or arrangements discussed. It should be noted that the components illustrated in the figures are not necessarily drawn to scale. Descriptions of well-known components and processing techniques and processes are omitted so as to not unnecessarily obscure the present invention.
The present application is described in detail below with reference to specific examples.
The following description of the embodiments of the present invention will be made clearly and completely with reference to the accompanying drawings, in which it is apparent that the embodiments described are only some embodiments of the present invention, but not all embodiments. All other embodiments, which can be made by those skilled in the art based on the embodiments of the invention without making any inventive effort, are intended to be within the scope of the invention.
Feed message: each state or message in the Feed stream is a Feed message, for example, one state in a circle of friends is a Feed message, and one microblog in the microblog is a Feed message. A Feed stream is an information stream that is continuously updated and presented to the user content.
Metadata: is meta-information that records each state or message in the Feed stream, including the data format of the publisher, the publication location, the publication time, the content type, etc.
The present invention is specifically described below.
Example 1:
as shown in FIG. 1, a method for implementing a high concurrency and high accuracy location social platform service is provided, comprising.
S1, when a user publishes social data, writing metadata into a time line list; only the metadata is stored, the metadata comprises a publisher, a publishing position, a publishing time, content and a content type, and the cache can well support the pushing of a large amount of metadata to realize high concurrency.
S2, the social platform service network management center manages a plurality of sub-management centers, and the jurisdiction of the sub-management centers takes the coordinate of the sub-management centers as the circle center and a preset communication distance R i A circular region of radius; the management center can also receive the registration application of the user, conduct identity audit on the user submitting the registration application, determine the position of the new application user as the center position of the management center, send the information of the new application user to the social platform service network management center, and store the information in the social platform server. Generally, a split management center is a miniature cellular network device including, but not limited to, a base station.
S3, the social platform server adopts different management labels to identify the latest release position and the historical release position, generates the latest release position and the historical release position of the user into a position set, and sends the position set to a sub-management center where the latest release position is located, and obviously, the position set changes along with the change of the latest release position.
S4, determining the communication position of the user according to social information of the user and other users in the sub-management center and/or social information of the user used for the user and other sub-management centers, and accurately determining the instant position of the user according to the communication position and the latest release position.
S5, when the user views the own time line, metadata is directly called from the time line list, and then the corresponding social data is obtained from the database.
Example 2:
based on the foregoing embodiments, the method for implementing the high concurrency and high precision location social platform service further includes: when the social data is a Feed message,
1) The Feed message firstly enters a queue service, and metadata is extracted from the Feed message;
2) Storing the Feed information into a database, and asynchronously calling a metadata release service to release after the Feed information is stored successfully;
3) The metadata publishing service extracts IDs of a sender, a publishing domain and a Feed message from metadata, and invokes the social relation service to determine a queue list of the Feed to be pushed;
4) A batch write interface using a metadata post service writes multiple rows of data into multiple Feed streams at once.
When the Feed message is to be read out,
1) Reading the Feed ID of the latest N Feed messages from the Feed stream;
2) After the Feed ID list is obtained, a Feed content storage interface is called asynchronously, and the interface has a buffer function and directly reads the corresponding Feed message content.
Example 3:
based on the foregoing embodiment, the method for implementing the high concurrency and high precision location social platform service adopts the ternary closure theory and the common friends and time sequence recommendation algorithm, and adds a time dimension and a location dimension based on the common friends, wherein the location dimension is embodied in the jurisdiction of the sub-management center.
The location dimension is embodied in the communication location of the user, i.e. the instant location, as shown in fig. 2, which is determined via the following steps:
a) Determining communication distances between the user and other users in the same sub-management center;
b) Determining the release distance between the latest release position of the user and the communication positions of other users in the step a);
c) Counting the average value of the distance difference between the communication distance and the release distance, and if the average value is smaller than a threshold value, confirming that the latest release position of the user is the communication position of the user; and if the average value is not smaller than the threshold value, confirming that the communication position of the user is the communication position of the user. By comparing the communication distance between the user and other users with the distance between the latest release distance of the user and the communication positions of other users, the instant position of the user can be accurately determined, and when the distance is lower than a set threshold value, the latest release position of the user is determined to be the communication position of the user, so that the user can be conveniently positioned by the latest release position, high-precision positioning is realized, calculation power can be saved, and the running efficiency of the server is improved.
The threshold value determining method comprises the following steps:
let the data set of the distance difference between the statistical communication distance and the distribution pitch be a= { a1, a2, … ai }, where a1, a2 … ai represent i data records in the data set, respectively.
The initial centroid is randomly generated for the first time, denoted k1= { K11, K21, … Kj1} where Kj denotes the jth centroid and Kj1 denotes the point where Kj is first located. After centroid generation, the distances from a1, a2 to ai to K11, K21, … Kj1 are calculated by traversing them, and determining which distance ai is closest to Kj1 divides ai into clusters centered on Kj 1. The first SSE is calculated as equation (Q1), i.e., the sum of squares of the distances ai from the centroid Kj1 at which ai is located:
where SSE1 represents the first SSE, m represents the variable representing the number of centroids at programming, taking the integer values from 1 to j, am1 represents all data belonging to the mth centroid after the first centroid determination, km1 represents the mth centroid determined for the first time, am1 ε Km1 represents am1 divided into clusters centered at Km 1. Calculating the mean value of points in each cluster, and taking the mean value as a new centroid K2:
k2 = { K21, K22, … …, K2j } formula (Q2)
Kj2=mean (am 1) type (Q3)
Mean () in equation (Q3) represents the mean function by which the centroid K2 of the second time can be determined, reassigning the data in a to a new cluster according to the nearest principle. Calculate the second SSE, SSE2:
calculating the gap ΔSSE2 between SSE2 and SSE1
SSE2= |SSE1-SSE2| (Q5)
Whether the delta SSE2 meets the error requirement is judged, delta is set as a set positive number, and the delta is a threshold value for error judgment and is determined according to actual conditions. If ΔSSE2 is less than δ, then:
SSE2< delta > (Q6)
The error of the cluster is considered to meet the accuracy requirement and the algorithm stops. If the requirement is not met, calculating the average value of points in each cluster taking K2 as the centroid to form a new centroid K3, redistributing the data in A to SSE3 which is not calculated for the 3 rd time in the new cluster according to the principle of distance nearest, calculating delta SSE3, judging whether to terminate or recycle again, outputting K cluster values until the algorithm is finished, and taking the average value of the cluster values as a threshold value. Through automatic processing of the threshold value, the algorithm efficiency can be improved, and therefore high concurrency results are achieved. Fig. 3 shows that the data throughput can be further expanded in the case of an increased number of users, and is not expanded due to the limited space.
It should be understood that while the invention has been described in conjunction with the drawings and detailed description, the foregoing description is not intended to limit the scope of the invention. Modifications and variations of the various embodiments described herein may be made by those skilled in the art and, as such, remain within the scope of the present application. And thus need not be, nor cannot be exhaustive of all embodiments. On the basis of the technical scheme of the invention, various modifications or variations which can be made by the person skilled in the art without the need of creative efforts are still within the protection scope of the invention.
In addition, the parts not described in detail in this application are common general knowledge in the art, and are not described in detail herein.
Claims (8)
1. A method for realizing high concurrency and high precision position social platform service is characterized in that:
s1, when a user publishes social data, writing metadata into a time line list; only metadata is saved, wherein the metadata comprises a release position;
s2, the social platform service network management center manages a plurality of sub-management centers, and the jurisdiction of the sub-management centers takes the coordinate of the sub-management centers as the circle center and a preset communication distance R i A circular region of radius;
s3, the social platform server generates the latest release position and the historical release position of the user as a position set and sends the position set to a sub-management center where the latest release position is located;
s4, determining the communication position of the user according to social information of the user and other users in the sub-management center and/or social information of the user used for the user and other sub-management centers, and accurately determining the instant position of the user according to the communication position and the latest release position;
s5, when the user views the own time line, metadata is directly called from the time line list, and then the corresponding social data is obtained from the database.
2. The method according to claim 1, characterized in that:
in step S1, when the social data is a Feed message,
1) The Feed message firstly enters a queue service, and metadata is extracted from the Feed message;
2) Storing the Feed information into a database, and asynchronously calling a metadata release service to release after the Feed information is stored successfully;
3) The metadata publishing service extracts IDs of a sender, a publishing domain and a Feed message from metadata, and invokes the social relation service to determine a queue list of the Feed to be pushed;
4) A batch write interface using a metadata post service writes multiple rows of data into multiple Feed streams at once.
3. The method according to claim 1, characterized in that: in step S1, the metadata further includes a publisher, a publication location, a publication time, a content, and a content type.
4. The method according to claim 1, characterized in that: in step S2, the separate management center may also receive a registration application of the user, perform identity verification on the user submitting the registration application, determine the position of the new application user as the central position of the separate management center, and send the information of the new application user to the social platform service network management center, and store the information in the social platform server.
5. The method according to claim 1, characterized in that: and adding a time dimension and a position dimension on the basis of the common friends by adopting a ternary closure theory and a common friends and time sequence recommendation algorithm, wherein the position dimension is embodied in the jurisdiction of the sub-management center.
6. The method according to claim 1, characterized in that: in step S4, the communication position of the user is determined via the following steps:
a) Determining communication distances between the user and other users in the same sub-management center;
b) Determining the release distance between the latest release position of the user and the communication positions of other users in the step a);
c) Counting the average value of the distance difference between the communication distance and the release distance, and if the average value is smaller than a threshold value, confirming that the latest release position of the user is the communication position of the user; and if the average value is not smaller than the threshold value, confirming that the communication position of the user is the communication position of the user.
7. A computer storage medium storing one or more computer instructions, characterized by: when executed, performs the method of any of claims 1-6.
8. An apparatus comprising a storage medium and a processor, the storage medium having stored therein an executable program executable by the processor, which when executed by the processor, performs the method of any of claims 1-6.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211514387.3A CN116233055B (en) | 2022-11-30 | 2022-11-30 | Method for realizing high concurrency and high precision position social platform service |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN202211514387.3A CN116233055B (en) | 2022-11-30 | 2022-11-30 | Method for realizing high concurrency and high precision position social platform service |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN116233055A true CN116233055A (en) | 2023-06-06 |
| CN116233055B CN116233055B (en) | 2024-09-20 |
Family
ID=86579233
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN202211514387.3A Active CN116233055B (en) | 2022-11-30 | 2022-11-30 | Method for realizing high concurrency and high precision position social platform service |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN116233055B (en) |
Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20100332326A1 (en) * | 2008-02-13 | 2010-12-30 | Ron Ishai | System And Methods For Positioning Information From A Plurality Of Users |
| US20140143061A1 (en) * | 2006-11-22 | 2014-05-22 | Raj Abhyanker | Garage sales in a geo-spatial social network |
| CN104281605A (en) * | 2013-07-08 | 2015-01-14 | 北京齐尔布莱特科技有限公司 | Social network site Feed stream pushing method |
| CN104811372A (en) * | 2015-05-19 | 2015-07-29 | 长春工程学院 | Multi-user communication method based on geographic position and spatial range |
| EP2933773A1 (en) * | 2014-04-16 | 2015-10-21 | Facebook, Inc. | Power management of mobile clients using location-based services |
| CN107135092A (en) * | 2017-03-15 | 2017-09-05 | 浙江工业大学 | A kind of Web service clustering method towards global social interaction server net |
| CN108337713A (en) * | 2018-01-31 | 2018-07-27 | 南京邮电大学 | Based on the mine wireless sensing net Uneven Cluster method for routing for improving K mean values |
| CN112398895A (en) * | 2019-08-19 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Method and device for providing service information |
| CN112861016A (en) * | 2020-12-11 | 2021-05-28 | 深圳市蟠桃树科技有限公司 | Data high-concurrency processing method of Feed stream system of healthy social platform |
| CN113297597A (en) * | 2021-06-09 | 2021-08-24 | 河南科技大学 | Social networking communication group establishing method based on position privacy protection |
| CN113779395A (en) * | 2021-09-10 | 2021-12-10 | 粒子文化科技集团(杭州)股份有限公司 | Media asset recommendation method, device, system, electronic device and storage medium |
-
2022
- 2022-11-30 CN CN202211514387.3A patent/CN116233055B/en active Active
Patent Citations (11)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20140143061A1 (en) * | 2006-11-22 | 2014-05-22 | Raj Abhyanker | Garage sales in a geo-spatial social network |
| US20100332326A1 (en) * | 2008-02-13 | 2010-12-30 | Ron Ishai | System And Methods For Positioning Information From A Plurality Of Users |
| CN104281605A (en) * | 2013-07-08 | 2015-01-14 | 北京齐尔布莱特科技有限公司 | Social network site Feed stream pushing method |
| EP2933773A1 (en) * | 2014-04-16 | 2015-10-21 | Facebook, Inc. | Power management of mobile clients using location-based services |
| CN104811372A (en) * | 2015-05-19 | 2015-07-29 | 长春工程学院 | Multi-user communication method based on geographic position and spatial range |
| CN107135092A (en) * | 2017-03-15 | 2017-09-05 | 浙江工业大学 | A kind of Web service clustering method towards global social interaction server net |
| CN108337713A (en) * | 2018-01-31 | 2018-07-27 | 南京邮电大学 | Based on the mine wireless sensing net Uneven Cluster method for routing for improving K mean values |
| CN112398895A (en) * | 2019-08-19 | 2021-02-23 | 阿里巴巴集团控股有限公司 | Method and device for providing service information |
| CN112861016A (en) * | 2020-12-11 | 2021-05-28 | 深圳市蟠桃树科技有限公司 | Data high-concurrency processing method of Feed stream system of healthy social platform |
| CN113297597A (en) * | 2021-06-09 | 2021-08-24 | 河南科技大学 | Social networking communication group establishing method based on position privacy protection |
| CN113779395A (en) * | 2021-09-10 | 2021-12-10 | 粒子文化科技集团(杭州)股份有限公司 | Media asset recommendation method, device, system, electronic device and storage medium |
Non-Patent Citations (2)
| Title |
|---|
| YURONG ZHONG: "The application of K-means clustering algorithm based on Hadoop", 《2016 IEEE INTERNATIONAL CONFERENCE ON CLOUD COMPUTING AND BIG DATA ANALYSIS (ICCCBDA)》, 4 August 2016 (2016-08-04) * |
| 王瑞祥: "基于用户空间位置评分云模型的Web服务协同过滤推荐算法", 《计算机应用研究》, no. 38, 31 October 2021 (2021-10-31) * |
Also Published As
| Publication number | Publication date |
|---|---|
| CN116233055B (en) | 2024-09-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN110166943B (en) | Method for processing terminal position information | |
| US20170300919A1 (en) | Transaction risk detection method and apparatus | |
| US20120185458A1 (en) | Clustering crowd-sourced data to identify event beacons | |
| WO2015154438A1 (en) | Positioning method and device | |
| Cheng et al. | Chinese Location Word Recognition Using Service Context Information for Location‐Based Service | |
| WO2018161729A1 (en) | User path recovery method and device | |
| CN103942221B (en) | Search method and equipment | |
| CN106210163B (en) | IP address-based localization method and device | |
| JP2019512764A (en) | Method and apparatus for identifying the type of user geographical location | |
| CN111522968B (en) | Knowledge graph fusion method and device | |
| CN108428001B (en) | Credit score prediction method and device | |
| CN106027693B (en) | IP address-based localization method and device | |
| CN110322295B (en) | Relationship strength determination method and system, server and computer readable medium | |
| CN110781971A (en) | Merchant type identification method, device, equipment and readable medium | |
| WO2016127880A1 (en) | Method and device for determining quality of offline positioning data | |
| CN106971345A (en) | A kind of location recommendation method based on position social networks | |
| CN107818116B (en) | Method and equipment for determining user behavior area position information | |
| WO2023129440A1 (en) | Assessing risk of fraud associated with user unique identifier using telecommunications data | |
| CN110909804B (en) | Method, device, server and storage medium for detecting abnormal data of base station | |
| JP2009169843A (en) | Information delivery server, information delivery system and information delivery method | |
| CN116233055B (en) | Method for realizing high concurrency and high precision position social platform service | |
| CN112887910B (en) | Method and device for determining abnormal coverage area and computer readable storage medium | |
| CN107181672A (en) | The friend recommendation method based on Annual distribution relative entropy in the social networks of position | |
| CN109377391B (en) | Information tracking method, storage medium and server | |
| CN111444182A (en) | Data management method and device |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| GR01 | Patent grant | ||
| GR01 | Patent grant |