CN112784152A - Method and device for marking user - Google Patents
Method and device for marking user Download PDFInfo
- Publication number
- CN112784152A CN112784152A CN201911097091.4A CN201911097091A CN112784152A CN 112784152 A CN112784152 A CN 112784152A CN 201911097091 A CN201911097091 A CN 201911097091A CN 112784152 A CN112784152 A CN 112784152A
- Authority
- CN
- China
- Prior art keywords
- user
- node
- message link
- tracking information
- data
- 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.)
- Pending
Links
- 238000000034 method Methods 0.000 title claims abstract description 44
- 238000006243 chemical reaction Methods 0.000 claims description 14
- 238000004590 computer program Methods 0.000 claims description 9
- 230000004992 fission Effects 0.000 claims description 9
- 238000010586 diagram Methods 0.000 description 13
- 238000004891 communication Methods 0.000 description 7
- 238000007405 data analysis Methods 0.000 description 7
- 230000000694 effects Effects 0.000 description 6
- 230000006870 function Effects 0.000 description 6
- 238000012545 processing Methods 0.000 description 5
- 230000003287 optical effect Effects 0.000 description 4
- 230000008569 process Effects 0.000 description 4
- 238000004458 analytical method Methods 0.000 description 3
- 230000006399 behavior Effects 0.000 description 3
- 230000004048 modification Effects 0.000 description 3
- 238000012986 modification Methods 0.000 description 3
- 230000008901 benefit Effects 0.000 description 2
- 238000010276 construction Methods 0.000 description 2
- 238000005336 cracking Methods 0.000 description 2
- 239000000835 fiber Substances 0.000 description 2
- 230000000644 propagated effect Effects 0.000 description 2
- 239000004065 semiconductor Substances 0.000 description 2
- 230000002159 abnormal effect Effects 0.000 description 1
- 238000013475 authorization Methods 0.000 description 1
- 235000014510 cooky Nutrition 0.000 description 1
- 238000013461 design Methods 0.000 description 1
- 230000006872 improvement Effects 0.000 description 1
- 238000002372 labelling Methods 0.000 description 1
- 239000004973 liquid crystal related substance Substances 0.000 description 1
- 239000013307 optical fiber Substances 0.000 description 1
- 238000005457 optimization Methods 0.000 description 1
- 230000003068 static effect Effects 0.000 description 1
- 238000006467 substitution reaction Methods 0.000 description 1
Images
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/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
- 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/9536—Search customisation based on social or collaborative filtering
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
-
- 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
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0241—Advertisements
- G06Q30/0251—Targeted advertisements
- G06Q30/0269—Targeted advertisements based on user profile or attribute
- G06Q30/0271—Personalized advertisement
-
- H—ELECTRICITY
- H04—ELECTRIC COMMUNICATION TECHNIQUE
- H04L—TRANSMISSION OF DIGITAL INFORMATION, e.g. TELEGRAPHIC COMMUNICATION
- H04L67/00—Network arrangements or protocols for supporting network services or applications
- H04L67/50—Network services
- H04L67/55—Push-based network services
Abstract
The invention discloses a method and a device for marking a user, and relates to the technical field of computers. One embodiment of the method comprises: acquiring user tracking information corresponding to each message link, constructing a user relationship chain according to the user tracking information corresponding to each message link, and acquiring user tracking data of each node user in the user relationship chain; and marking each node user according to the user tracking data of each node user in the user relationship chain. The implementation mode can solve the technical problems of redundant pushing and invalid pushing.
Description
Technical Field
The invention relates to the technical field of computers, in particular to a method and a device for marking users.
Background
Modern marketing or operation is generally a comprehensive scheme combining operation and marketing experience, social hotspots, advertisement reach, big data analysis and the like, and operation or marketing is selectively performed, for example, comprehensive analysis is performed in modes of network popularization, big data identification crowd, consumption capability, historical consumption record and the like, so that message pushing is performed for each user group.
In the process of implementing the invention, the inventor finds that at least the following problems exist in the prior art:
according to experience or data analysis and the like, all user groups are marked, and the marking is not accurate to a single user, so that the problems of redundant pushing and invalid pushing are caused.
Disclosure of Invention
In view of this, embodiments of the present invention provide a method and an apparatus for tagging a user to solve the technical problems of redundant push and invalid push.
To achieve the above object, according to an aspect of an embodiment of the present invention, there is provided a method of tagging a user, including:
acquiring user tracking information corresponding to each message link, constructing a user relationship chain according to the user tracking information corresponding to each message link, and acquiring user tracking data of each node user in the user relationship chain;
and marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
Optionally, the message link includes an original message link and a shared message link generated by the original message link through at least one fission.
Optionally, the user tracking information includes a channel identifier, a first platform identifier and/or a second platform identifier of the user, location information of the user, device information, access time, access times, access duration, and an access track;
wherein the device information includes an IP address, a model, a brand, and a device identification of the device.
Optionally, after constructing the user relationship chain according to the user tracking information corresponding to each message link, the method further includes:
and for any node user in the user relationship chain, if the first platform identification of the node user exists in the user tracking information, naming the node user by using the first platform identification, otherwise, naming the node user by using the second platform identification.
Optionally, after marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain, the method further includes:
determining a pushing strategy of each node user according to the marking result of each node user;
and updating the user relation chain and user tracking data of each node user in the user relation chain based on the user tracking information generated by the push strategy, so as to update the mark of each node user.
Optionally, the user tracking information further includes an association relationship between a first platform identifier and a second platform identifier of the user;
after naming the node user by the second platform identifier, the method further comprises the following steps:
and naming the node user by the first platform identifier according to the incidence relation between the first platform identifier and the second platform identifier of the node user.
Optionally, the user tracking data includes forwarding times, access probability, and conversion rate.
In addition, according to another aspect of the embodiments of the present invention, there is provided an apparatus for tagging a user, including:
the building module is used for obtaining user tracking information corresponding to each message link, building a user relationship chain according to the user tracking information corresponding to each message link, and obtaining user tracking data of each node user in the user relationship chain;
and the marking module is used for marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
Optionally, the message link includes an original message link and a shared message link generated by the original message link through at least one fission.
Optionally, the user tracking information includes a channel identifier, a first platform identifier and/or a second platform identifier of the user, location information of the user, device information, access time, access times, access duration, and an access track;
wherein the device information includes an IP address, a model, a brand, and a device identification of the device.
Optionally, the building module is further configured to:
after a user relationship chain is constructed according to the user tracking information corresponding to each message link, for any node user in the user relationship chain, if the first platform identification of the node user exists in the user tracking information, naming the node user by using the first platform identification, otherwise naming the node user by using the second platform identification.
Optionally, the marking module is further configured to:
marking each node user according to user tracking data and user portrait data of each node user in the user relationship chain, and then determining a pushing strategy of each node user according to a marking result of each node user;
the building module is further configured to:
and updating the user relation chain and user tracking data of each node user in the user relation chain based on the user tracking information generated by the push strategy, so as to update the mark of each node user.
Optionally, the user tracking information further includes an association relationship between a first platform identifier and a second platform identifier of the user;
the building module is further configured to:
after naming the node user by the second platform identifier, naming the node user by the first platform identifier according to the incidence relation between the first platform identifier and the second platform identifier of the node user.
Optionally, the user tracking data includes forwarding times, access probability, and conversion rate.
According to another aspect of the embodiments of the present invention, there is also provided an electronic device, including:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any of the embodiments described above.
According to another aspect of the embodiments of the present invention, there is also provided a computer readable medium, on which a computer program is stored, which when executed by a processor implements the method of any of the above embodiments.
One embodiment of the above invention has the following advantages or benefits: because the user relationship chain is constructed according to the user tracking information corresponding to each message link and the user tracking data of each node user is obtained, the technical means of marking each node user by combining the user portrait data is adopted, and the technical problems of redundant pushing and invalid pushing in the prior art are solved. According to the embodiment of the invention, the user relation chain is constructed according to the user tracking information corresponding to each message link, data analysis and marking are carried out on each node user in the user relation chain, and a proper pushing strategy is matched based on a marking result, so that redundant pushing and invalid pushing are avoided, and the reach rate and the conversion rate are increased in a targeted manner.
Further effects of the above-mentioned non-conventional alternatives will be described below in connection with the embodiments.
Drawings
The drawings are included to provide a better understanding of the invention and are not to be construed as unduly limiting the invention. Wherein:
FIG. 1 is a schematic diagram of a main flow of a method of tagging a user according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of a main flow of a method of tagging a user according to one referential embodiment of the present invention;
FIG. 3 is a schematic diagram of the main modules of a device for tagging users according to an embodiment of the present invention;
FIG. 4 is an exemplary system architecture diagram in which embodiments of the present invention may be employed;
fig. 5 is a schematic block diagram of a computer system suitable for use in implementing a terminal device or server of an embodiment of the invention.
Detailed Description
Exemplary embodiments of the present invention are described below with reference to the accompanying drawings, in which various details of embodiments of the invention are included to assist understanding, and which are to be considered as merely exemplary. Accordingly, those of ordinary skill in the art will recognize that various changes and modifications of the embodiments described herein can be made without departing from the scope and spirit of the invention. Also, descriptions of well-known functions and constructions are omitted in the following description for clarity and conciseness.
Fig. 1 is a schematic diagram of a main flow of a method of tagging a user according to an embodiment of the present invention. As one embodiment of the present invention. As shown in fig. 1, the method of tagging a user may include:
step 101, obtaining user tracking information corresponding to each message link, constructing a user relationship chain according to the user tracking information corresponding to each message link, and obtaining user tracking data of each node user in the user relationship chain.
In order to construct the user relationship chain, user tracking information corresponding to each message link needs to be acquired. Wherein the message link comprises an original message link and a shared message link generated by the original message link through at least one fission. The server side pushes the original message link to the user terminal through channels such as mobile phone short messages, various social software, large screen launching or advertisement launching, the user cracks the original message link to generate at least one sharing message link through modes such as sharing and forwarding, and other users can continuously access the sharing message link generated by cracking.
For mobile phone short messages, the text content received by each short message is the same, but the link information in the short messages is different, dynamic and personalized processing is carried out on a certain user, and a person clicks the link for several times at any time and any place, and subsequent behaviors such as browsing, purchasing and the like of the link can be tracked according to the message link.
For social software, the information pushed to the group by the server is the same, but when a user in the group clicks, the message link is dynamically processed, the information (similar to cookies, unique marks of WeChat, unique device numbers, brands, models and the like) of the user who clicks the message link at present is added or reported, the added or reported information is combined to integrate the message link, the current user can be uniquely identified, and the later behavior of the user is tracked.
For static large screens such as subway advertisement two-dimensional codes, elevator television advertisements and the like, when a user scans code access links, because the unique mark or user information allocated by social software can not be acquired by the social software, the user can be tracked according to the information such as the current position of the large screen, the IP address of user equipment, the equipment model and the like, so that behavior tracking and analysis can be performed subsequently. Because the information of the users is not comprehensive enough and cannot completely identify the current user, the association or the replacement can be carried out when the subsequent user logs in or can obtain an accurate user mark.
The method comprises the steps that sharing fission tracking is carried out after a user clicks, purchases or forwards the user after clicking, so that user tracking information is obtained, a large amount of user tracking information can be collected through user tracking information corresponding to each message link, a user relation chain can be constructed by correlating the user tracking information, and meanwhile user tracking data of each node user in the user relation chain can be analyzed and obtained.
Optionally, the user tracking information includes a channel identifier, a first platform identifier and/or a second platform identifier of the user, location information of the user, device information, access time, access times, access duration, and an access track. Wherein the device information includes an IP address, a model, a brand, and a device identification of the device. Optionally, the user tracking data includes forwarding times, access probability, and conversion rate, and may further include location information, access habits, consumption capabilities, and the like of the user.
If the user is in the non-login state, the track of the user can be known by acquiring the IP address of the user equipment, and the IP of the same place is the same. If the user goes to different places, whether the user is connected by WIFI or 4G, the IP of the device is different, and therefore information such as the position and the track where the user is located can be accurately analyzed based on the IP address. For example, if a user is always one or a fixed few IP addresses, the user may be an abnormal or inactive user, and the possibility of activity participation is lower, or there is a special case, for example, if a user is always a fixed IP, but the activity of the user is high, and no matter clicking, sharing or subsequent purchasing, the user is an inactive fixed user, and also needs a special mark, which may be an enterprise user, a swipe user, or the like. If the user is to be accurately tagged, a more accurate conclusion can be drawn further in conjunction with the user imagery data of the user.
For example, the user a shares a message link to the user B, the user B reports the user tracking information of the user B when clicking the message link, if the user B shares the message link to the group, the user C, the user D, and the user E report the user tracking information of the user C, the user D, and the user E when clicking the message link, the records of the association chains have a fixed association relationship and a cross association relationship (there may also be multiple cross relationships, and the more the cross relationships there are, the more the relationship chains there are), so that the user relationship chain is constructed based on the association relationships.
And one message link is pushed to different user groups, when different users in different user groups click the message link, different user unique marks can be obtained to mark different users, the unique mark provided by an application program and the user unique mark marked by comprehensively combining other information such as equipment, a network and the like are provided, and the unique mark and the user click are used for carrying out dynamic operation to establish a unique chain type tracking relationship for subsequent click and analysis tracking. Through the user tracking information corresponding to each message link, which people click the message link in the same WeChat group and which people can be identified in different user groups, so that a horizontal relation chain and a vertical cross relation chain are established.
The embodiment of the invention can track the message links accessed, forwarded and shared by each user, can analyze and track who is tracked and how many people open the link of the user and browse, purchase or share and the like at what time even if the user does not log in, calculates the touch ability value of a certain user through deep recursion, and then can accurately push the users with high touch ability values, thereby improving the touch rate and the conversion rate. Therefore, the embodiment of the invention can track the relationship chain among the users under the condition that the users do not sense and accurately analyze the user tracking data of the users, thereby configuring different push strategies for different users.
Optionally, after obtaining or collecting the tracking information reported by the user, the implementation manner of step 101 may be: the method comprises the following steps of circularly executing a program, executing the program at a fixed time, triggering a statistical execution program when a user browses for a certain number of times or triggering a preset statistical program within a service activity time range period, and the like.
And for any node user in the user relationship chain, if the first platform identification of the node user exists in the user tracking information, naming the node user by using the first platform identification, otherwise, naming the node user by using the second platform identification. If the first platform and the second platform have no authorization relationship, whether the first platform identifier and the second platform identifier have an association relationship cannot be known, so that the node user is named by the first platform identifier preferentially. If the association relationship between the first platform identifier and the second platform identifier of the user is based on subsequent data acquisition, the node user may be named with the first platform identifier according to the association relationship between the first platform identifier and the second platform identifier of the node user, so as to associate user portrait data of the node user from the first platform.
And 102, marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
For any node user in the user relationship chain, user portrait data or user group portrait data and the like associated with the node user can be acquired from a database, and then the node user is marked by combining user tracking data of the node user, the user portrait data or the user group portrait data and the like. And determining a pushing strategy matched with the marking result according to the marking result, and dynamically filling the recommended page data with pushing information, thereby improving the conversion rate. In addition, by combining the user relationship chain and portrait data of the user group where the node users are located, the preference and preference of potential users which are possibly shared can be predicted, and further fission sharing propagation reaching the potential users is promoted.
Optionally, after marking each node user according to the user tracking data of each node user in the user relationship chain, the method further includes: determining a pushing strategy of each node user according to the marking result of each node user; and updating the user relation chain and user tracking data of each node user in the user relation chain based on the user tracking information generated by the push strategy, so as to update the mark of each node user. After information is pushed to the node user according to the pushing strategy, new user tracking information is generated, and user portrait data may be updated. Thus, the user-relationship chain and the user-tracking data of each node user in the user-relationship chain may be updated based on the newly generated user-tracking information, and then the indicia of each node user may be updated based on the new user-tracking data and the updated user-representation data. Meanwhile, the user relationship chain constructed in step 101 needs to be updated according to the new user tracking information, such as adding node users, adding an association relationship between node users, or deleting node users.
In addition, if the new user tracking information also contains the association relationship between the first platform identifier and the second platform identifier of the user, naming the node user by using the first platform identifier according to the association relationship between the first platform identifier and the second platform identifier of the node user.
For example, through step 102, it can be counted which users are deep relationship chain users, such as users with multiple relationship points, records opened for multiple times, records purchased for multiple times, and the like, which users are only touched once, and the touch mode is active push touch, or touch through content sharing by other people, and after multiple data analyses, if a user is a touch acquired through friend sharing, different types of users can be marked. If the user has a complex reach relationship chain or a conversion record, which users are active users, which users are large V users, and the like can be marked, and the push of the nature is prioritized or rewarded in subsequent reach activities, so as to promote the optimization of the push effect.
For another example, through multiple touchdowns, it can be counted which users with low access frequency or access probability or users who never access, such users can be marked as cold users according to the service index, and the cold users can be individually stimulated or pushed less and not pushed meaningless touchdowns according to the service requirements, so as to pointedly promote touchdowns or conversion.
According to the various embodiments, the user relationship chain is constructed according to the user tracking information corresponding to each message link, and the user tracking data of each node user is obtained, so that the technical means of marking each node user by combining the user portrait data is combined, and the technical problems of redundant push and invalid push in the prior art are solved. According to the embodiment of the invention, the user relation chain is constructed according to the user tracking information corresponding to each message link, data analysis and marking are carried out on each node user in the user relation chain, and a proper pushing strategy is matched based on a marking result, so that redundant pushing and invalid pushing are avoided, and the reach rate and the conversion rate are increased in a targeted manner.
Fig. 2 is a schematic diagram of a main flow of a method of tagging a user according to one referential embodiment of the present invention. As another embodiment of the present invention, as shown in fig. 2, the method for tagging a user may include:
step 201, obtaining user tracking information corresponding to each message link.
In order to construct the user relationship chain, user tracking information corresponding to each message link needs to be acquired. Wherein the message link comprises an original message link and a shared message link generated by the original message link through at least one fission. The server side pushes the original message link to the user terminal through channels such as mobile phone short messages, various social software, large screen launching or advertisement launching, the user cracks the original message link to generate at least one sharing message link through modes such as sharing and forwarding, and other users can continuously access the sharing message link generated by cracking.
Step 202, constructing a user relationship chain according to the user tracking information corresponding to each message link, and obtaining user tracking data of each node user in the user relationship chain.
The method comprises the steps that sharing fission tracking is carried out after a user clicks, purchases or forwards the user after clicking, so that user tracking information is obtained, a large amount of user tracking information can be collected through user tracking information corresponding to each message link, a user relation chain can be constructed by correlating the user tracking information, and meanwhile user tracking data of each node user in the user relation chain can be analyzed and obtained.
Optionally, the user tracking information includes a channel identifier, a first platform identifier and/or a second platform identifier of the user, location information of the user, device information, access time, access times, access duration, and an access track. Wherein the device information includes an IP address, a model, a brand, and a device identification of the device. Optionally, the user tracking data includes forwarding times, access probability, and conversion rate, and may further include location information, access habits, consumption capabilities, and the like of the user.
Step 203, for any node user in the user relationship chain, if the first platform identifier of the node user exists in the user tracking information, naming the node user by using the first platform identifier, otherwise naming the node user by using the second platform identifier.
Step 204, obtaining user portrait data associated with each node user.
And step 205, marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
For any node user in the user relationship chain, user portrait data or user group portrait data and the like associated with the node user can be acquired from a database, and then the node user is marked by combining user tracking data of the node user, the user portrait data or the user group portrait data and the like.
Step 206, determining the push strategy of each node user according to the marking result of each node user.
Step 207, updating the user relationship chain and the user tracking data of each node user in the user relationship chain based on the user tracking information generated by the push strategy, so as to update the mark of each node user.
And if the user tracking information further comprises the association relationship between the first platform identification and the second platform identification of the user, naming the node user by using the first platform identification according to the association relationship between the first platform identification and the second platform identification of the node user.
In addition, in a reference embodiment of the present invention, the detailed implementation of the method for tagging users is already described in detail in the above-mentioned method for tagging users, and therefore, the repeated content will not be described again.
Fig. 3 is a schematic diagram of main modules of a device for marking a user according to an embodiment of the present invention, and as shown in fig. 3, the device 300 for marking a user includes a construction module 301 and a marking module 302. The building module 301 is configured to obtain user tracking information corresponding to each message link, build a user relationship chain according to the user tracking information corresponding to each message link, and obtain user tracking data of each node user in the user relationship chain; and the marking module 302 is configured to mark each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
Optionally, the message link includes an original message link and a shared message link generated by the original message link through at least one fission.
Optionally, the user tracking information includes a channel identifier, a first platform identifier and/or a second platform identifier of the user, location information of the user, device information, access time, access times, access duration, and an access track;
wherein the device information includes an IP address, a model, a brand, and a device identification of the device.
Optionally, the building module 301 is further configured to:
after a user relationship chain is constructed according to the user tracking information corresponding to each message link, for any node user in the user relationship chain, if the first platform identification of the node user exists in the user tracking information, naming the node user by using the first platform identification, otherwise naming the node user by using the second platform identification.
Optionally, the marking module 302 is further configured to:
marking each node user according to user tracking data and user portrait data of each node user in the user relationship chain, and then determining a pushing strategy of each node user according to a marking result of each node user;
the building block 301 is further configured to:
and updating the user relation chain and user tracking data of each node user in the user relation chain based on the user tracking information generated by the push strategy, so as to update the mark of each node user.
Optionally, the user tracking information further includes an association relationship between a first platform identifier and a second platform identifier of the user;
the building block 301 is further configured to:
after naming the node user by the second platform identifier, naming the node user by the first platform identifier according to the incidence relation between the first platform identifier and the second platform identifier of the node user.
Optionally, the user tracking data includes forwarding times, access probability, and conversion rate.
According to the various embodiments, the user relationship chain is constructed according to the user tracking information corresponding to each message link, and the user tracking data of each node user is obtained, so that the technical means of marking each node user by combining the user portrait data is combined, and the technical problems of redundant push and invalid push in the prior art are solved. According to the embodiment of the invention, the user relation chain is constructed according to the user tracking information corresponding to each message link, data analysis and marking are carried out on each node user in the user relation chain, and a proper pushing strategy is matched based on a marking result, so that redundant pushing and invalid pushing are avoided, and the reach rate and the conversion rate are increased in a targeted manner.
It should be noted that, in the embodiment of the apparatus for tagging users according to the present invention, the detailed description has been given in the above method for tagging users, and therefore, the repeated description is not repeated here.
Fig. 4 illustrates an exemplary system architecture 400 to which the method of tagging users or the apparatus of tagging users of embodiments of the present invention may be applied.
As shown in fig. 4, the system architecture 400 may include terminal devices 401, 402, 403, a network 404, and a server 405. The network 404 serves as a medium for providing communication links between the terminal devices 401, 402, 403 and the server 405. Network 404 may include various types of connections, such as wire, wireless communication links, or fiber optic cables, to name a few.
A user may use terminal devices 401, 402, 403 to interact with a server 405 over a network 404 to receive or send messages or the like. The terminal devices 401, 402, 403 may have installed thereon various communication client applications, such as shopping-like applications, web browser applications, search-like applications, instant messaging tools, mailbox clients, social platform software, etc. (by way of example only).
The terminal devices 401, 402, 403 may be various electronic devices having a display screen and supporting web browsing, including but not limited to smart phones, tablet computers, laptop portable computers, desktop computers, and the like.
The server 405 may be a server providing various services, such as a background management server (for example only) providing support for shopping websites browsed by users using the terminal devices 401, 402, 403. The background management server may analyze and otherwise process the received data such as the item information query request, and feed back a processing result (for example, target push information, item information — just an example) to the terminal device.
It should be noted that the method for tagging users provided by the embodiment of the present invention is generally performed by the server 405, and accordingly, the device of the tagged user is generally disposed in the server 405. The method for marking the user provided by the embodiment of the present invention may also be executed by the terminal devices 401, 402, and 403, and accordingly, the device for marking the user may be disposed in the terminal devices 401, 402, and 403.
It should be understood that the number of terminal devices, networks, and servers in fig. 4 is merely illustrative. There may be any number of terminal devices, networks, and servers, as desired for implementation.
Referring now to FIG. 5, shown is a block diagram of a computer system 500 suitable for use with a terminal device implementing an embodiment of the present invention. The terminal device shown in fig. 5 is only an example, and should not bring any limitation to the functions and the scope of use of the embodiments of the present invention.
As shown in fig. 5, the computer system 500 includes a Central Processing Unit (CPU)501 that can perform various appropriate actions and processes according to a program stored in a Read Only Memory (ROM)502 or a program loaded from a storage section 508 into a Random Access Memory (RAM) 503. In the RAM503, various programs and data necessary for the operation of the system 500 are also stored. The CPU 501, ROM 502, and RAM503 are connected to each other via a bus 504. An input/output (I/O) interface 505 is also connected to bus 504.
The following components are connected to the I/O interface 505: an input portion 506 including a keyboard, a mouse, and the like; an output portion 507 including a display such as a Cathode Ray Tube (CRT), a Liquid Crystal Display (LCD), and the like, and a speaker; a storage portion 508 including a hard disk and the like; and a communication section 509 including a network interface card such as a LAN card, a modem, or the like. The communication section 509 performs communication processing via a network such as the internet. The driver 510 is also connected to the I/O interface 505 as necessary. A removable medium 511 such as a magnetic disk, an optical disk, a magneto-optical disk, a semiconductor memory, or the like is mounted on the drive 510 as necessary, so that a computer program read out therefrom is mounted into the storage section 508 as necessary.
In particular, according to the embodiments of the present disclosure, the processes described above with reference to the flowcharts may be implemented as computer software programs. For example, embodiments of the present disclosure include a computer program comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method illustrated in the flow chart. In such an embodiment, the computer program may be downloaded and installed from a network through the communication section 509, and/or installed from the removable medium 511. The computer program performs the above-described functions defined in the system of the present invention when executed by the Central Processing Unit (CPU) 501.
It should be noted that the computer readable medium shown in the present invention can be a computer readable signal medium or a computer readable storage medium or any combination of the two. A computer readable storage medium may be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or any combination of the foregoing. More specific examples of the computer readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In the present invention, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In the present invention, however, a computer readable signal medium may include a propagated data signal with computer readable program code embodied therein, for example, in baseband or as part of a carrier wave. Such a propagated data signal may take many forms, including, but not limited to, electro-magnetic, optical, or any suitable combination thereof. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: wireless, wire, fiber optic cable, RF, etc., or any suitable combination of the foregoing.
The flowchart and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer programs according to various embodiments of the present invention. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams or flowchart illustration, and combinations of blocks in the block diagrams or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.
The modules described in the embodiments of the present invention may be implemented by software or hardware. The described modules may also be provided in a processor, which may be described as: a processor includes a building module and a labeling module, where the names of the modules do not in some way constitute a limitation on the modules themselves.
As another aspect, the present invention also provides a computer-readable medium that may be contained in the apparatus described in the above embodiments; or may be separate and not incorporated into the device. The computer readable medium carries one or more programs which, when executed by a device, cause the device to comprise: acquiring user tracking information corresponding to each message link, constructing a user relationship chain according to the user tracking information corresponding to each message link, and acquiring user tracking data of each node user in the user relationship chain; and marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
According to the technical scheme of the embodiment of the invention, the technical means of marking each node user by combining the user portrait data is adopted for constructing the user relationship chain according to the user tracking information corresponding to each message link and obtaining the user tracking data of each node user, so that the technical problems of redundant pushing and invalid pushing in the prior art are solved. According to the embodiment of the invention, the user relation chain is constructed according to the user tracking information corresponding to each message link, data analysis and marking are carried out on each node user in the user relation chain, and a proper pushing strategy is matched based on a marking result, so that redundant pushing and invalid pushing are avoided, and the reach rate and the conversion rate are increased in a targeted manner.
The above-described embodiments should not be construed as limiting the scope of the invention. Those skilled in the art will appreciate that various modifications, combinations, sub-combinations, and substitutions can occur, depending on design requirements and other factors. Any modification, equivalent replacement, and improvement made within the spirit and principle of the present invention should be included in the protection scope of the present invention.
Claims (10)
1. A method of tagging a user, comprising:
acquiring user tracking information corresponding to each message link, constructing a user relationship chain according to the user tracking information corresponding to each message link, and acquiring user tracking data of each node user in the user relationship chain;
and marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
2. The method of claim 1, wherein the message link comprises an original message link and a shared message link resulting from at least one fission of the original message link.
3. The method of claim 1, wherein the user tracking information comprises a channel identifier, a first platform identifier and/or a second platform identifier of the user, location information of the user, device information, access time, access times, access duration, and an access track;
wherein the device information includes an IP address, a model, a brand, and a device identification of the device.
4. The method according to claim 3, wherein after constructing the user relationship chain according to the user tracking information corresponding to each message link, further comprising:
and for any node user in the user relationship chain, if the first platform identification of the node user exists in the user tracking information, naming the node user by using the first platform identification, otherwise, naming the node user by using the second platform identification.
5. The method of claim 4, wherein after tagging each node user in the chain of user relationships based on user tracking data and user representation data for the respective node user, further comprising:
determining a pushing strategy of each node user according to the marking result of each node user;
and updating the user relation chain and user tracking data of each node user in the user relation chain based on the user tracking information generated by the push strategy, so as to update the mark of each node user.
6. The method of claim 5, wherein the user tracking information further comprises an association between a first platform identification and a second platform identification of the user;
after naming the node user by the second platform identifier, the method further comprises the following steps:
and naming the node user by the first platform identifier according to the incidence relation between the first platform identifier and the second platform identifier of the node user.
7. The method of claim 1, wherein the user tracking data includes forwarding times, access probabilities, and conversion rates.
8. An apparatus for tagging a user, comprising:
the building module is used for obtaining user tracking information corresponding to each message link, building a user relationship chain according to the user tracking information corresponding to each message link, and obtaining user tracking data of each node user in the user relationship chain;
and the marking module is used for marking each node user according to the user tracking data and the user portrait data of each node user in the user relationship chain.
9. An electronic device, comprising:
one or more processors;
a storage device for storing one or more programs,
when executed by the one or more processors, cause the one or more processors to implement the method of any one of claims 1-7.
10. A computer-readable medium, on which a computer program is stored, which, when being executed by a processor, carries out the method according to any one of claims 1-7.
Priority Applications (2)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911097091.4A CN112784152A (en) | 2019-11-11 | 2019-11-11 | Method and device for marking user |
| PCT/CN2020/112797 WO2021093423A1 (en) | 2019-11-11 | 2020-09-01 | Method and device for tagging user |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201911097091.4A CN112784152A (en) | 2019-11-11 | 2019-11-11 | Method and device for marking user |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN112784152A true CN112784152A (en) | 2021-05-11 |
Family
ID=75749846
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201911097091.4A Pending CN112784152A (en) | 2019-11-11 | 2019-11-11 | Method and device for marking user |
Country Status (2)
| Country | Link |
|---|---|
| CN (1) | CN112784152A (en) |
| WO (1) | WO2021093423A1 (en) |
Families Citing this family (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN113221009A (en) * | 2021-05-26 | 2021-08-06 | 东莞市盟大塑化科技有限公司 | Invitation code generation method, device, equipment and storage medium |
| CN113900907B (en) * | 2021-11-17 | 2024-01-30 | 杭州推啊网络科技有限公司 | Mapping construction method and system |
| CN114745421B (en) * | 2022-03-30 | 2023-10-10 | 北京奇艺世纪科技有限公司 | Method, device, server and storage medium for recording fission path data |
| CN117196662A (en) * | 2023-03-22 | 2023-12-08 | 山东浪潮爱购云链信息科技有限公司 | User behavior acquisition method, device and medium based on e-commerce platform |
Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130346841A1 (en) * | 2012-06-25 | 2013-12-26 | International Business Machines Corporation | Tracking Interactions with a Shared Link Through a Chain of Forwarding |
| CN104809225A (en) * | 2015-05-06 | 2015-07-29 | 泰康人寿保险股份有限公司 | Chain information spreading tracking management system and chain information spreading tracking management method |
| CN108345636A (en) * | 2017-12-31 | 2018-07-31 | 广东智媒云图科技股份有限公司 | A kind of reading conditions tracking, electronic equipment and storage medium |
| CN108920527A (en) * | 2018-06-07 | 2018-11-30 | 桂林电子科技大学 | A kind of personalized recommendation method of knowledge based map |
| CN109242633A (en) * | 2018-09-20 | 2019-01-18 | 阿里巴巴集团控股有限公司 | A kind of commodity method for pushing and device based on bigraph (bipartite graph) network |
| CN109241427A (en) * | 2018-09-04 | 2019-01-18 | 中国平安人寿保险股份有限公司 | Information-pushing method, device, computer equipment and storage medium |
| CN110413896A (en) * | 2019-06-06 | 2019-11-05 | 腾讯科技（北京）有限公司 | Network information push method, device, computer equipment and storage medium |
-
2019
- 2019-11-11 CN CN201911097091.4A patent/CN112784152A/en active Pending
-
2020
- 2020-09-01 WO PCT/CN2020/112797 patent/WO2021093423A1/en active Application Filing
Patent Citations (7)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20130346841A1 (en) * | 2012-06-25 | 2013-12-26 | International Business Machines Corporation | Tracking Interactions with a Shared Link Through a Chain of Forwarding |
| CN104809225A (en) * | 2015-05-06 | 2015-07-29 | 泰康人寿保险股份有限公司 | Chain information spreading tracking management system and chain information spreading tracking management method |
| CN108345636A (en) * | 2017-12-31 | 2018-07-31 | 广东智媒云图科技股份有限公司 | A kind of reading conditions tracking, electronic equipment and storage medium |
| CN108920527A (en) * | 2018-06-07 | 2018-11-30 | 桂林电子科技大学 | A kind of personalized recommendation method of knowledge based map |
| CN109241427A (en) * | 2018-09-04 | 2019-01-18 | 中国平安人寿保险股份有限公司 | Information-pushing method, device, computer equipment and storage medium |
| CN109242633A (en) * | 2018-09-20 | 2019-01-18 | 阿里巴巴集团控股有限公司 | A kind of commodity method for pushing and device based on bigraph (bipartite graph) network |
| CN110413896A (en) * | 2019-06-06 | 2019-11-05 | 腾讯科技（北京）有限公司 | Network information push method, device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| WO2021093423A1 (en) | 2021-05-20 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN112784152A (en) | Method and device for marking user | |
| CN104333599A (en) | Application sharing method and system and application service platform | |
| CN104253741B (en) | A kind of method for sending information, relevant apparatus and system | |
| CN110019087B (en) | Data processing method and system | |
| CN110300084B (en) | IP address-based portrait method and apparatus, electronic device, and readable medium | |
| US10650412B2 (en) | Multi-profile tracking identification of a mobile user | |
| CN111522978B (en) | Data pushing method and device | |
| CN111612503B (en) | Advertisement pushing method and device based on external page delivery touch user information and electronic equipment | |
| CN108810047B (en) | Method and device for determining information push accuracy rate and server | |
| KR20200011443A (en) | Matching and Attributes of User Device Events | |
| CN107330717B (en) | Advertisement putting method and system | |
| CN110866040A (en) | User portrait generation method, device and system | |
| US20150095487A1 (en) | Third-party link tracker system and method | |
| CN112835904A (en) | Data processing method and data processing device | |
| CN113297288A (en) | User real-time label generation method and device and electronic equipment | |
| CN110874307A (en) | Event buried point collecting and reporting method and device | |
| CN103618639A (en) | Method, device and system for monitoring media data | |
| US10454889B2 (en) | Automatic anomaly detection framework for grid resources | |
| CN113190558A (en) | Data processing method and system | |
| CN110796543B (en) | Custom information acquisition method and device based on relational network and electronic equipment | |
| CN111125503B (en) | Method and apparatus for generating information | |
| CN110708238A (en) | Method and apparatus for processing information | |
| CN110322039B (en) | Click rate estimation method, server and computer readable storage medium | |
| CN113434754A (en) | Method and device for determining recommended API (application program interface) service, electronic equipment and storage medium | |
| CN113362097B (en) | User determination 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 |