CN109460930B - Method for determining risk account and related equipment - Google Patents
Method for determining risk account and related equipment Download PDFInfo
- Publication number
- CN109460930B CN109460930B CN201811359082.3A CN201811359082A CN109460930B CN 109460930 B CN109460930 B CN 109460930B CN 201811359082 A CN201811359082 A CN 201811359082A CN 109460930 B CN109460930 B CN 109460930B
- Authority
- CN
- China
- Prior art keywords
- score
- aggregative
- sub
- determining
- graph
- 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.)
- Active
Links
Images
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q10/00—Administration; Management
- G06Q10/06—Resources, workflows, human or project management; Enterprise or organisation planning; Enterprise or organisation modelling
- G06Q10/063—Operations research, analysis or management
- G06Q10/0635—Risk analysis of enterprise or organisation activities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06F—ELECTRIC DIGITAL DATA PROCESSING
- G06F21/00—Security arrangements for protecting computers, components thereof, programs or data against unauthorised activity
- G06F21/30—Authentication, i.e. establishing the identity or authorisation of security principals
- G06F21/31—User authentication
Abstract
The embodiment of the invention provides a method for determining risk accounts and related equipment, which can quickly and accurately identify the risk accounts registered in batches in a live broadcast platform, eliminate the risk accounts in the live broadcast platform from a registration source and purify the network environment of the live broadcast platform. The method comprises the following steps: constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform; determining at least one connected subgraph based on the undirected graph structure; determining an aggregate composite score for each of the at least one connected subgraph; and determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than a preset threshold value as a risk account.
Description
Technical Field
The invention relates to the technical field of information processing, in particular to a method for determining a risk account and related equipment.
Background
With the progress of network communication technology and the increasing speed of broadband networks, the video live broadcast technology is developed and applied more and more.
On a live broadcast platform, false cheating behaviors often exist for achieving certain purposes, and the cheating behaviors can greatly influence the live broadcast ecology of the platform. The most effective method for preventing the cheating behaviors is to identify the cheating behaviors at the source, namely mining suspicious users in a registration link. The black industry registers accounts in large quantities for subsequent purposes.
In the prior art, whether the account numbers are registered in batches is usually identified manually, so that the identification rate is not high, and a large amount of manpower and material resources are wasted.
Disclosure of Invention
The embodiment of the invention provides a method for determining risk accounts and related equipment, which can quickly and accurately identify the risk accounts registered in batches in a live broadcast platform, eliminate the risk accounts in the live broadcast platform from a registration source and purify the network environment of the live broadcast platform.
A first aspect of an embodiment of the present invention provides a method for determining a risk account, including:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
and determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than a preset threshold value as a risk account.
Optionally, the determining an aggregate composite score for each of the at least one connected subgraph comprises:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score.
Optionally, the calculating a protocol IP aggregability score for interconnections between networks of each of the at least one connected subgraph comprises:
calculating an IP aggregability score for each of the at least one connected subgraph by the formula:
wherein N is the number of users in each sub-graph, g is the user set in each sub-graph, ImFor the IP set used by user m in each subgraph in a preset period, InFor the IP set used by the user n in each sub-graph in the preset time period, | Im∩InI is the intersection of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period, and Im∪In| is the user n in the presetAnd the IP set used in the time period is the union of the IP sets used by the user m in the preset time period.
Optionally, the calculating the enrollment source aggregability score for each of the at least one connected subgraph comprises:
calculating a registered source aggregative score for each of the at least one connected subgraph by:
wherein N isiAnd the number of registered sources in each sub-graph is i, N is the number of users in each sub-graph, and k is the number of registered sources in each sub-graph.
Optionally, the calculating the registration time aggregability score for each of the at least one connected subgraph comprises:
calculating a registration time aggregation for each of the at least one connected subgraph by the following formula;
wherein n is the number of users of any one of the at least one sub-image together with riThe number of days from the registration time of the user i in any one of the at least one sub-image and the at least one sub-image to the current moment;
normalizing the registration time aggregations of each sub-graph by the following formula to obtain a registration time aggregations score of each sub-graph:
wherein conv _ createiAn aggregation of registration times for an ith sub-graph of the at least one connected sub-graph,
min (conv _ create) for the registration time aggregativity score of the ith subgraphi) For the minimum value of registration time aggregations in the at least one connected subgraph, max (conv _ create)i) Registering a maximum value of time aggregations in the at least one connected subgraph.
Optionally, said determining said aggregative composite score from said IP aggregative score, said enrollment source aggregative score, and said enrollment time aggregative score comprises:
calculating the aggregative composite score by the formula:
score＝αip_conv+βsrc_conv+γconv_create0；
wherein, score is the aggregate comprehensive score of each subgraph, IP _ conv is the IP aggregate score of each subgraph, src _ conv is the registered source aggregate score of each subgraph, conv _ create0For the registration time aggregativity score of each subgraph, α is a weight coefficient of the IP aggregativity score of each subgraph, β is a weight coefficient of the registration source aggregativity score of each subgraph, γ is a weight coefficient of the registration time aggregativity score of each subgraph, α, β and γ take values between 0 and 1, and α + β + γ equals to 1.
A second aspect of the embodiments of the present invention provides an apparatus for determining a risk account, including:
the system comprises a construction unit, a registration unit and a processing unit, wherein the construction unit is used for constructing an undirected graph structure corresponding to a live broadcast platform, and the undirected graph structure indicates the corresponding relation between a registered account in the live broadcast platform and registered equipment;
a first determining unit for determining at least one connected subgraph based on the undirected graph structure;
a second determining unit for determining an aggregate composite score for each of the at least one connected subgraph;
and the third determining unit is used for determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than the preset threshold value as the risk account.
Optionally, the second determining unit is specifically configured to:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score.
Optionally, the second determining unit is further specifically configured to:
calculating an IP aggregability score for each of the at least one connected subgraph by the formula:
wherein N is the number of users in each sub-graph, g is the user set in each sub-graph, ImFor the IP set used by user m in each subgraph in a preset period, InFor the IP set used by the user n in each sub-graph in the preset time period, | Im∩InI is the intersection of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period, and Im∪InAnd | is a union of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period.
Optionally, the second determining unit is further specifically configured to:
calculating a registered source aggregative score for each of the at least one connected subgraph by:
wherein N isiAnd the number of registered sources in each sub-graph is i, N is the number of users in each sub-graph, and k is the number of registered sources in each sub-graph.
Optionally, the second determining unit is further specifically configured to:
calculating a registration time aggregation for each of the at least one connected subgraph by the following formula;
wherein n is the number of users of any one of the at least one sub-image together with riThe number of days from the registration time of the user i in any one of the at least one sub-image and the at least one sub-image to the current moment;
normalizing the registration time aggregations of each sub-graph by the following formula to obtain a registration time aggregations score of each sub-graph:
wherein conv _ createiAn aggregation of registration times for an ith sub-graph of the at least one connected sub-graph,
min (conv _ create) for the registration time aggregativity score of the ith subgraphi) For the minimum value of registration time aggregations in the at least one connected subgraph, max (conv _ create)i) Registering a maximum value of time aggregations in the at least one connected subgraph.
Optionally, the second determining unit is further specifically configured to:
calculating the aggregative composite score by the formula:
score＝αip_conv+βsrc_conv+γconv_create0；
wherein, score is the aggregate comprehensive score of each subgraph, IP _ conv is the IP aggregate score of each subgraph, src _ conv is the registered source aggregate score of each subgraph, conv _ create0For the registration time aggregativity score of each subgraph, α is a weight coefficient of the IP aggregativity score of each subgraph, β is a weight coefficient of the registration source aggregativity score of each subgraph, γ is a weight coefficient of the registration time aggregativity score of each subgraph, α, β and γ take values between 0 and 1, and α + β + γ equals to 1.
A third aspect of the present invention provides an electronic device comprising a memory and a processor, wherein the processor is configured to implement the steps of the method for determining a risk account according to any one of the above items when executing a computer management program stored in the memory.
A fourth aspect of the present invention provides a computer-readable storage medium having a computer management-like program stored thereon, characterized in that: the computer management class program when executed by a processor implements the steps of the method of determining a risk account as set forth in any one of the above.
In summary, in the embodiment provided by the present invention, the device for determining a risk account may first construct an undirected graph structure between a registered account and a registered device in a live broadcast platform, then dig out a largest connected subgraph in the undirected graph structure to obtain at least one connected subgraph, then calculate an aggregative comprehensive score of the at least one connected subgraph, where the aggregative comprehensive score is used to indicate whether members in the subgraph have aggregative property, and finally determine the registered account corresponding to the subgraph whose aggregative comprehensive score is greater than a preset threshold as the risk account. Therefore, the risk accounts registered in batches in the live broadcast platform can be quickly and accurately identified, the risk accounts in the live broadcast platform are stopped from the registration source, and the network environment of the live broadcast platform is purified.
Drawings
Fig. 1 is a schematic flowchart of a method for determining a risk account according to an embodiment of the present invention;
FIG. 2 is a schematic diagram of an embodiment of an apparatus for determining a risk account according to an embodiment of the present invention;
fig. 3 is a schematic hardware structure diagram of an apparatus for determining a risk account according to an embodiment of the present invention;
fig. 4 is a schematic diagram of an embodiment of an electronic device according to an embodiment of the present invention;
fig. 5 is a schematic diagram of an embodiment of a computer-readable storage medium according to an embodiment of the present invention.
Detailed Description
The embodiment of the invention provides a method for determining risk accounts and related equipment, which can quickly and accurately identify the risk accounts registered in batches in a live broadcast platform, eliminate the risk accounts in the live broadcast platform from a registration source and purify the network environment of the live broadcast platform.
The terms "first," "second," "third," "fourth," and the like in the description and in the claims, as well as in the drawings, if any, are used for distinguishing between similar elements and not necessarily for describing a particular sequential or chronological order. It will be appreciated that the data so used may be interchanged under appropriate circumstances such that the embodiments described herein may be practiced otherwise than as specifically illustrated or described herein. Furthermore, the terms "comprises," "comprising," and "having," and any variations thereof, are intended to cover a non-exclusive inclusion, such that a process, method, system, article, or apparatus that comprises a list of steps or elements is not necessarily limited to those steps or elements expressly listed, but may include other steps or elements not expressly listed or inherent to such process, method, article, or apparatus. The technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are only a part of the embodiments of the present invention, and not all of the embodiments.
The method for determining a risk account will be described below from the perspective of a device for determining a risk account, which may be a server or a service unit in a server.
Referring to fig. 1, fig. 1 is a schematic diagram of an embodiment of a method for determining a risk account according to an embodiment of the present invention, including:
101. and constructing a corresponding undirected graph structure in the live broadcast platform.
In this embodiment, the device for determining a risk account may construct an undirected graph structure corresponding to the live platform, where the undirected graph structure indicates a correspondence between registered accounts and registered devices in the live platform, that is, the device for determining a risk account may view each registered user in the live platform as a vertex on a graph, and if the same wireless device (e.g., a mobile phone, a tablet computer, etc.) is used between two registered users, an edge may be formed between the corresponding vertices, thereby forming a complete undirected graph structure.
102. At least one connected subgraph is determined based on the undirected graph structure.
In this embodiment, the device for determining risk accounts mines the largest connected subgraph according to the constructed undirected graph structure, so that at least one connected subgraph can be formed.
103. An aggregate composite score is determined for each of the word graphs in the at least one connected sub-graph.
In this embodiment, the means for determining the risk account may determine the aggregate composite score of the at least one connected sub-graph after determining the at least one connected sub-graph, and the means for determining the risk account may first calculate an IP aggregate score, a registration source aggregate score, and a registration time aggregate score of each of the at least one connected sub-graph, and then determine the aggregate composite score of each sub-graph according to the IP aggregate score, the registration source aggregate score, and the registration time aggregate score of each sub-graph, specifically determine the aggregate composite score of each sub-graph of the at least one sub-graph by:
step 1, calculating an Internet Protocol (IP) aggregative score of interconnection between networks of each of at least one connected subgraph.
Specifically, the IP is IP address data collected when the user uses the live platform, the number of IPs used by one user may be multiple in a preset period (for example, 1 day, 2 days, or 3 days), all IP address data used by registered users within 1 day after registration is collected, an average value of the goodness of contact of IP sets between every two users is calculated, and the means for determining the risk account may calculate the IP aggregative score of each sub-graph in at least one connected sub-graph by the following formula:
wherein N is the number of users in each sub-graph, g is the user set in each sub-graph, ImSet of IPs, I, used for a preset period of time for user m in each sub-graphnFor the IP set used by user n in each subgraph in the preset time period, | Im∩InI is the intersection of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period, and Im∪InAnd | is the union of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period.
And 2, calculating the clustering score of the registered sources of each sub-graph in the at least one connected sub-graph.
Specifically, the registration source is a source of user registration in the live broadcast platform, and a general source is a website, an application program, a QQ, or a WeChat. The value space of the registration is finite, whereby the means for determining the risk account may calculate the registration source aggregative score for each of the at least one connected sub-graph by:
wherein N isiRegistering the number of users whose source is i in each sub-graph, N is the number of users in each sub-graph, and k is the number of users registered in each sub-graphThe number of sources.
And 3, calculating the registration time aggregative score of each sub-graph in the at least one connected sub-graph.
Specifically, the means for determining the risk account may calculate the clustering of registration times for each of the at least one connected sub-graph by the following formula;
where n is the number of users in any one of the at least one sub-graph together with the sub-graph, riThe number of days from the current time of the registration time of the user i in any one of the at least one sub-graph and the sub-graph (here, the number of days is taken as an example for explanation, and it is needless to say that other time representations such as hours, etc., may also be used, and the details are not limited);
since the calculated IP aggregativity score and the registration source aggregativity score are between 0 and 1, in order that the registration time aggregativity score is also between 0 and 1, the registration time aggregativity of each sub-graph can be normalized by the following formula to obtain the registration time aggregativity score of each sub-graph:
wherein conv _ createiAn aggregation of registration times for an ith sub-graph of the at least one connected sub-graph,
registration time aggregativity score, min (conv _ create), for the ith sub-graphi) For registering the minimum value of temporal aggregations, max (conv _ create), in at least one connected subgraphi) Is at least one connected toRegisters the maximum value of time aggregations in the subgraph of (1).
It should be noted that, the IP aggregation score of each sub-graph in the at least one connected sub-graph may be calculated through step 1, the registered source aggregation score of each sub-graph in the at least one connected sub-graph may be calculated through step 2, and the time-frowning aggregation score of each sub-graph in the at least one connected sub-graph may be calculated through step 3, however, there is no restriction on the order of execution between these three steps, and step 1 may be executed first. Step 2 may be performed first, step 3 may be performed first, or both, and the specific implementation is not limited.
Step 4, determining an aggregative comprehensive score according to the IP aggregative score, the registration source aggregative score and the registration time aggregative score comprises the following steps:
calculating an aggregative composite score for each subgraph by the following formula:
score＝αip_conv+βsrc_conv+γconv_create0；
wherein, score is the aggregate comprehensive score of each subgraph, IP _ conv is the IP aggregate score of each subgraph, src _ conv is the registered source aggregate score of each subgraph, conv _ create0For the registration time aggregability score of each subgraph, α is a weight coefficient of the IP aggregability score of each subgraph, β is a weight coefficient of the registration source aggregability score of each subgraph, γ is a weight coefficient of the registration time aggregability score of each subgraph, α, β and γ take values between 0 and 1, and α + β + γ equals 1.
104. And determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than the preset threshold value as the risk account.
In this embodiment, after determining the aggregate composite score of each of the at least one connected sub-graph, the risk account determining device may determine, as the risk account, the registered account corresponding to the sub-graph whose aggregate composite score is greater than the preset threshold, for example, may determine, as the risk account, the user corresponding to the sub-graph whose aggregate composite score is greater than 0.9 in the at least one sub-graph, that is, the sub-graph whose aggregate composite score is greater than 0.9 is a group with batch registration risk.
In summary, in the embodiment provided by the present invention, the device for determining a risk account may first construct an undirected graph structure between a registered account and a registered device in a live broadcast platform, then dig out a largest connected subgraph in the undirected graph structure to obtain at least one connected subgraph, then calculate an aggregative comprehensive score of the at least one connected subgraph, where the aggregative comprehensive score is used to indicate whether members in the subgraph have aggregative property, and finally determine the registered account corresponding to the subgraph whose aggregative comprehensive score is greater than a preset threshold as the risk account. Therefore, the risk accounts registered in batches in the live broadcast platform can be quickly and accurately identified, and the risk accounts in the live broadcast platform are stopped from the registration source, so that the network environment of the live broadcast platform is purified.
The method for determining a risk account in the embodiment of the present invention is described above, and the apparatus for determining a risk account in the embodiment of the present invention is described below.
Referring to fig. 2, an embodiment of the apparatus for determining a risk account according to the embodiment of the present invention includes:
the establishing unit 201 is configured to establish an undirected graph structure corresponding to a live platform, where the undirected graph structure indicates a correspondence between a registered account in the live platform and a registered device;
a first determining unit 202 for determining at least one connected subgraph based on the undirected graph structure;
a second determining unit 203 for determining an aggregate composite score for each of the at least one connected subgraph;
a third determining unit 204, configured to determine, as a risk account, a registered account corresponding to the sub-graph with the aggregative comprehensive score being greater than a preset threshold.
Optionally, the second determining unit 203 is specifically configured to:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score.
Optionally, the second determining unit 203 is further specifically configured to:
calculating an IP aggregability score for each of the at least one connected subgraph by the formula:
wherein N is the number of users in each sub-graph, g is the user set in each sub-graph, ImFor the IP set used by user m in each subgraph in a preset period, InFor the IP set used by the user n in each sub-graph in the preset time period, | Im∩InI is the intersection of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period, and Im∪InAnd | is a union of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period.
Optionally, the second determining unit 203 is further specifically configured to:
calculating a registered source aggregative score for each of the at least one connected subgraph by:
wherein N isiAnd the number of registered sources in each sub-graph is i, N is the number of users in each sub-graph, and k is the number of registered sources in each sub-graph.
Optionally, the second determining unit 203 is further specifically configured to:
calculating a registration time aggregation for each of the at least one connected subgraph by the following formula;
wherein n is the number of users of any one of the at least one sub-image together with riThe number of days from the registration time of the user i in any one of the at least one sub-image and the at least one sub-image to the current moment;
normalizing the registration time aggregations of each sub-graph by the following formula to obtain a registration time aggregations score of each sub-graph:
wherein conv _ createiAn aggregation of registration times for an ith sub-graph of the at least one connected sub-graph,
min (conv _ create) for the registration time aggregativity score of the ith subgraphi) For the minimum value of registration time aggregations in the at least one connected subgraph, max (conv _ create)i) Registering a maximum value of time aggregations in the at least one connected subgraph.
Optionally, the second determining unit 203 is further specifically configured to:
calculating the aggregative composite score by the formula:
score＝αip_conv+βsrc_conv+γconv_create0；
wherein score is the aggregate composite score of each subgraph, IP _ conv is the IP aggregate score of each subgraph, and src _ conv is the registered source aggregate of each subgraphCollective score, conv _ create0For the registration time aggregativity score of each subgraph, α is a weight coefficient of the IP aggregativity score of each subgraph, β is a weight coefficient of the registration source aggregativity score of each subgraph, γ is a weight coefficient of the registration time aggregativity score of each subgraph, α, β and γ take values between 0 and 1, and α + β + γ equals to 1.
Fig. 2 above describes the apparatus for determining a risk account in the embodiment of the present invention from the perspective of a modular functional entity, and the apparatus for determining a risk account in the embodiment of the present invention is described in detail below from the perspective of hardware processing, referring to fig. 3, an embodiment of an apparatus 300 for determining a risk account in the embodiment of the present invention includes:
an input device 301, an output device 302, a processor 303 and a memory 304 (wherein the number of the processor 303 may be one or more, and one processor 303 is taken as an example in fig. 3). In some embodiments of the present invention, the input device 301, the output device 502, the processor 303, and the memory 304 may be connected by a bus or other means, wherein the connection by the bus is exemplified in fig. 3.
Wherein, by calling the operation instruction stored in the memory 304, the processor 303 is configured to perform the following steps:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
and determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than a preset threshold value as a risk account.
The processor 303 is also configured to perform any of the methods in the corresponding embodiments of fig. 1 by calling the operation instructions stored in the memory 304.
Referring to fig. 4, fig. 4 is a schematic view of an embodiment of an electronic device according to an embodiment of the invention.
As shown in fig. 4, an embodiment of the present invention provides an electronic device, which includes a memory 410, a processor 420, and a computer program 411 stored in the memory 420 and running on the processor 420, and when the processor 420 executes the computer program 411, the following steps are implemented:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
and determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than a preset threshold value as a risk account.
In a specific implementation, when the processor 420 executes the computer program 411, any of the embodiments corresponding to fig. 1 may be implemented.
Since the electronic device described in this embodiment is a device used for implementing an apparatus for determining a risk account in the embodiment of the present invention, based on the method described in the embodiment of the present invention, a person skilled in the art can understand a specific implementation manner of the electronic device of this embodiment and various variations thereof, so that how to implement the method in the embodiment of the present invention by the electronic device is not described in detail herein, and as long as the device used for implementing the method in the embodiment of the present invention by the person skilled in the art belongs to the intended scope of the present invention.
Referring to fig. 5, fig. 5 is a schematic diagram illustrating an embodiment of a computer-readable storage medium according to the present invention.
As shown in fig. 5, the present embodiment provides a computer-readable storage medium 500 having a computer program 511 stored thereon, the computer program 511 implementing the following steps when executed by a processor:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
and determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than a preset threshold value as a risk account.
In a specific implementation, the computer program 511 may implement any of the embodiments corresponding to fig. 1 when executed by a processor.
It should be noted that, in the foregoing embodiments, the descriptions of the respective embodiments have respective emphasis, and reference may be made to relevant descriptions of other embodiments for parts that are not described in detail in a certain embodiment.
As will be appreciated by one skilled in the art, embodiments of the present invention may be provided as a method, system, or computer program product. Accordingly, the present invention may take the form of an entirely hardware embodiment, an entirely software embodiment or an embodiment combining software and hardware aspects. Furthermore, the present invention may take the form of a computer program product embodied on one or more computer-usable storage media (including, but not limited to, disk storage, CD-ROM, optical storage, and the like) having computer-usable program code embodied therein.
The present invention is described with reference to flowchart illustrations and/or block diagrams of methods, apparatus (systems), and computer program products according to embodiments of the invention. It will be understood that each flow and/or block of the flow diagrams and/or block diagrams, and combinations of flows and/or blocks in the flow diagrams and/or block diagrams, can be implemented by computer program instructions. These computer program instructions may be provided to a processor of a general purpose computer, special purpose computer, embedded computer, or other programmable data processing apparatus to produce a machine, such that the instructions, which execute via the processor of the computer or other programmable data processing apparatus, create means for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be stored in a computer-readable memory that can direct a computer or other programmable data processing apparatus to function in a particular manner, such that the instructions stored in the computer-readable memory produce an article of manufacture including instruction means which implement the function specified in the flowchart flow or flows and/or block diagram block or blocks.
These computer program instructions may also be loaded onto a computer or other programmable data processing apparatus to cause a series of operational steps to be performed on the computer or other programmable apparatus to produce a computer implemented process such that the instructions which execute on the computer or other programmable apparatus provide steps for implementing the functions specified in the flowchart flow or flows and/or block diagram block or blocks.
Embodiments of the present invention further provide a computer program product, where the computer program product includes computer software instructions, and when the computer software instructions are executed on a processing device, the processing device executes a flow in the method for designing a wind farm digital platform in the embodiment corresponding to fig. 1.
The computer program product includes one or more computer instructions. When loaded and executed on a computer, cause the processes or functions described in accordance with the embodiments of the invention to occur, in whole or in part. The computer may be a general purpose computer, a special purpose computer, a network of computers, or other programmable device. The computer instructions may be stored on a computer readable storage medium or transmitted from one computer readable storage medium to another, for example, from one website, computer, server, or data center to another website, computer, server, or data center via wire (e.g., coaxial cable, fiber optic, Digital Subscriber Line (DSL)) or wireless (e.g., infrared, wireless, microwave, etc.). The computer-readable storage medium can be any available medium that a computer can store or a data storage device, such as a server, a data center, etc., that is integrated with one or more available media. The usable medium may be a magnetic medium (e.g., floppy disk, hard disk, magnetic tape), an optical medium (e.g., DVD), or a semiconductor medium (e.g., Solid State Disk (SSD)), among others.
It is clear to those skilled in the art that, for convenience and brevity of description, the specific working processes of the above-described systems, apparatuses and units may refer to the corresponding processes in the foregoing method embodiments, and are not described herein again.
In the embodiments provided in the present invention, it should be understood that the disclosed system, apparatus and method may be implemented in other ways. For example, the above-described apparatus embodiments are merely illustrative, and for example, the division of the units is only one logical division, and other divisions may be realized in practice, for example, a plurality of units or components may be combined or integrated into another system, or some features may be omitted, or not executed. In addition, the shown or discussed mutual coupling or direct coupling or communication connection may be an indirect coupling or communication connection through some interfaces, devices or units, and may be in an electrical, mechanical or other form.
The units described as separate parts may or may not be physically separate, and parts displayed as units may or may not be physical units, may be located in one place, or may be distributed on a plurality of network units. Some or all of the units can be selected according to actual needs to achieve the purpose of the solution of the embodiment.
In addition, functional units in the embodiments of the present invention may be integrated into one processing unit, or each unit may exist alone physically, or two or more units are integrated into one unit. The integrated unit can be realized in a form of hardware, and can also be realized in a form of a software functional unit.
The integrated unit, if implemented in the form of a software functional unit and sold or used as a stand-alone product, may be stored in a computer readable storage medium. Based on such understanding, the technical solution of the present invention may be embodied in the form of a software product, which is stored in a storage medium and includes instructions for causing a computer device (which may be a personal computer, a server, or a network device) to execute all or part of the steps of the method according to the embodiments of the present invention. And the aforementioned storage medium includes: various media capable of storing program codes, such as a usb disk, a removable hard disk, a Read-Only Memory (ROM), a Random Access Memory (RAM), a magnetic disk, or an optical disk.
The above-mentioned embodiments are only used for illustrating the technical solutions of the present invention, and not for limiting the same; although the present invention has been described in detail with reference to the foregoing embodiments, it will be understood by those of ordinary skill in the art that: the technical solutions described in the foregoing embodiments may still be modified, or some technical features may be equivalently replaced; such modifications and substitutions do not depart from the spirit and scope of the corresponding technical solutions of the embodiments of the present invention.
Claims (9)
1. A method of determining a risk account, comprising:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
determining the registered account corresponding to the subgraph with the aggregative comprehensive score larger than a preset threshold value as a risk account;
said determining an aggregate composite score for each of said at least one connected subgraph comprises:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score;
said calculating a protocol IP aggregative score for interconnections between networks of each of said at least one connected subgraph comprises:
calculating an IP aggregability score for each of the at least one connected subgraph by the formula:
wherein the content of the first and second substances,
for the number of users in each sub-graph,
for the set of users in each of the sub-graphs,
an IP set used for a preset period for user m in each sub-graph,
for the IP set used by user n in each sub-graph within the preset time period,
enabling the user n and the user m to use the IP set in the preset time periodThe intersection of the set of IP's used,
and the IP set used by the user n in the preset time period is the union of the IP set used by the user m in the preset time period.
2. The method of claim 1, wherein the calculating the enrollment-source aggregativeness score for each of the at least one connected subgraph comprises:
calculating a registered source aggregative score for each of the at least one connected subgraph by:
wherein the content of the first and second substances,
for registering the number of users whose source is i in each sub-graph,
for the number of users in each sub-graph,
and registering the number of sources in each subgraph.
3. The method of claim 1, wherein the calculating a registration time aggregativity score for each of the at least one connected subgraph comprises:
calculating a registration time aggregation for each of the at least one connected subgraph by the following formula;
wherein the content of the first and second substances,
is the number of users of any one sub-graph of said at least one together sub-graph,
the number of days from the registration time of the user i in any one of the at least one sub-image and the at least one sub-image to the current moment;
normalizing the registration time aggregations of each sub-graph by the following formula to obtain a registration time aggregations score of each sub-graph:
wherein the content of the first and second substances,
an aggregation of registration times for an ith sub-graph of the at least one connected sub-graph,
an aggregate score for the registration time of the ith sub-graph,
for registering a minimum value of temporal aggregations in the at least one connected subgraph,
registering a maximum value of time aggregations in the at least one connected subgraph.
4. The method of claim 1, wherein determining the aggregative composite score based on the IP aggregative score, the enrollment source aggregative score, and the enrollment time aggregative score comprises:
calculating the aggregative composite score by the formula:
wherein the content of the first and second substances,
for the aggregate composite score of each of the sub-graphs,
for the IP aggregability score of each of the subgraphs,
an aggregate score for the registered sources of each subgraph,
an aggregability score for the registration time of each sub-graph,
a weight coefficient for the IP aggregability score of each subgraph,
A weighting factor for the registered source aggregability score of each subgraph,
a weighting factor for the registration time aggregativity score for each sub-graph,
、
and
takes a value between 0 and 1, and
。
5. an apparatus for determining a risk account, comprising:
the system comprises a construction unit, a registration unit and a processing unit, wherein the construction unit is used for constructing an undirected graph structure corresponding to a live broadcast platform, and the undirected graph structure indicates the corresponding relation between a registered account in the live broadcast platform and registered equipment;
a first determining unit for determining at least one connected subgraph based on the undirected graph structure;
a second determining unit for determining an aggregate composite score for each of the at least one connected subgraph;
the third determining unit is used for determining the registered account corresponding to the sub-graph with the aggregative comprehensive score larger than a preset threshold value as a risk account;
the second determining unit is specifically configured to:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score;
said calculating a protocol IP aggregative score for interconnections between networks of each of said at least one connected subgraph comprises:
calculating an IP aggregability score for each of the at least one connected subgraph by the formula:
wherein the content of the first and second substances,
for the number of users in each sub-graph,
for the set of users in each of the sub-graphs,
an IP set used for a preset period for user m in each sub-graph,
for the IP set used by user n in each sub-graph within the preset time period,
for the intersection of the IP set used by the user n in the preset time period and the IP set used by the user m in the preset time period,
and the IP set used by the user n in the preset time period is the union of the IP set used by the user m in the preset time period.
6. An electronic device comprising a memory, a processor, wherein the processor is configured to implement the steps of the method of determining a risk account of any one of claims 1 to 4 when executing a computer management class program stored in the memory.
7. A computer-readable storage medium having stored thereon a computer management-like program, characterized in that: the computer management class program when executed by a processor implements the steps of the method of determining a risk account of any of claims 1 to 4.
8. A method of determining a risk account, comprising:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
determining the registered account corresponding to the subgraph with the aggregative comprehensive score larger than a preset threshold value as a risk account;
said determining an aggregate composite score for each of said at least one connected subgraph comprises:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score;
said calculating a registered source aggregability score for each of said at least one connected subgraph comprises:
calculating a registered source aggregative score for each of the at least one connected subgraph by:
wherein the content of the first and second substances,
for registering the number of users whose source is i in each sub-graph,
for the number of users in each sub-graph,
and registering the number of sources in each subgraph.
9. A method of determining a risk account, comprising:
constructing an undirected graph structure corresponding to a live broadcast platform, wherein the undirected graph structure indicates the corresponding relation between a registered account and registered equipment in the live broadcast platform;
determining at least one connected subgraph based on the undirected graph structure;
determining an aggregate composite score for each of the at least one connected subgraph;
determining the registered account corresponding to the subgraph with the aggregative comprehensive score larger than a preset threshold value as a risk account;
said determining an aggregate composite score for each of said at least one connected subgraph comprises:
computing a protocol IP aggregative score for interconnections between networks of each of the at least one connected subgraph;
computing a registered source aggregability score for each of the at least one connected subgraph;
computing a registration time aggregative score for each of the at least one connected subgraph;
determining the aggregative composite score based on the IP aggregative score, the registration source aggregative score, and the registration time aggregative score;
said calculating a registration time aggregability score for each of said at least one connected subgraph comprises:
calculating a registration time aggregation for each of the at least one connected subgraph by the following formula;
wherein the content of the first and second substances,
is the number of users of any one sub-graph of said at least one together sub-graph,
the number of days from the registration time of the user i in any one of the at least one sub-image and the at least one sub-image to the current moment;
normalizing the registration time aggregations of each sub-graph by the following formula to obtain a registration time aggregations score of each sub-graph:
wherein the content of the first and second substances,
an aggregation of registration times for an ith sub-graph of the at least one connected sub-graph,
an aggregate score for the registration time of the ith sub-graph,
for registering a minimum value of temporal aggregations in the at least one connected subgraph,
registering for the at least one connected subgraphMaximum value of time aggregations.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811359082.3A CN109460930B (en) | 2018-11-15 | 2018-11-15 | Method for determining risk account and related equipment |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201811359082.3A CN109460930B (en) | 2018-11-15 | 2018-11-15 | Method for determining risk account and related equipment |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN109460930A CN109460930A (en) | 2019-03-12 |
| CN109460930B true CN109460930B (en) | 2021-11-26 |
Family
ID=65610585
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201811359082.3A Active CN109460930B (en) | 2018-11-15 | 2018-11-15 | Method for determining risk account and related equipment |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109460930B (en) |
Families Citing this family (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN110324352B (en) * | 2019-07-11 | 2021-10-15 | 武汉斗鱼网络科技有限公司 | Method and device for identifying batch registered account groups |
| CN111340612B (en) * | 2020-02-25 | 2022-12-06 | 支付宝(杭州)信息技术有限公司 | Account risk identification method and device and electronic equipment |
| CN112839027B (en) * | 2020-12-16 | 2023-08-01 | 贝壳技术有限公司 | User group identification method, device, electronic equipment and storage medium |
Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106301978A (en) * | 2015-05-26 | 2017-01-04 | 阿里巴巴集团控股有限公司 | The recognition methods of gang member account, device and equipment |
| CN107592296A (en) * | 2017-08-02 | 2018-01-16 | 阿里巴巴集团控股有限公司 | The recognition methods of rubbish account and device |
| CN108052543A (en) * | 2017-11-23 | 2018-05-18 | 北京工业大学 | A kind of similar account detection method of microblogging based on map analysis cluster |
| CN108171519A (en) * | 2016-12-07 | 2018-06-15 | 阿里巴巴集团控股有限公司 | The processing of business datum, account recognition methods and device, terminal |
| CN108295476A (en) * | 2018-03-06 | 2018-07-20 | 网易（杭州）网络有限公司 | The method and apparatus for determining abnormal interactive account |
| CN108322473A (en) * | 2018-02-12 | 2018-07-24 | 北京京东金融科技控股有限公司 | User behavior analysis method and apparatus |
| CN108418825A (en) * | 2018-03-16 | 2018-08-17 | 阿里巴巴集团控股有限公司 | Risk model training, rubbish account detection method, device and equipment |
| CN108429718A (en) * | 2017-02-13 | 2018-08-21 | 腾讯科技（深圳）有限公司 | Account recognition methods and device |
| CN108734380A (en) * | 2018-04-08 | 2018-11-02 | 阿里巴巴集团控股有限公司 | Adventure account determination method, device and computing device |
Family Cites Families (1)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20170374076A1 (en) * | 2016-06-28 | 2017-12-28 | Viewpost Ip Holdings, Llc | Systems and methods for detecting fraudulent system activity |
-
2018
- 2018-11-15 CN CN201811359082.3A patent/CN109460930B/en active Active
Patent Citations (9)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN106301978A (en) * | 2015-05-26 | 2017-01-04 | 阿里巴巴集团控股有限公司 | The recognition methods of gang member account, device and equipment |
| CN108171519A (en) * | 2016-12-07 | 2018-06-15 | 阿里巴巴集团控股有限公司 | The processing of business datum, account recognition methods and device, terminal |
| CN108429718A (en) * | 2017-02-13 | 2018-08-21 | 腾讯科技（深圳）有限公司 | Account recognition methods and device |
| CN107592296A (en) * | 2017-08-02 | 2018-01-16 | 阿里巴巴集团控股有限公司 | The recognition methods of rubbish account and device |
| CN108052543A (en) * | 2017-11-23 | 2018-05-18 | 北京工业大学 | A kind of similar account detection method of microblogging based on map analysis cluster |
| CN108322473A (en) * | 2018-02-12 | 2018-07-24 | 北京京东金融科技控股有限公司 | User behavior analysis method and apparatus |
| CN108295476A (en) * | 2018-03-06 | 2018-07-20 | 网易（杭州）网络有限公司 | The method and apparatus for determining abnormal interactive account |
| CN108418825A (en) * | 2018-03-16 | 2018-08-17 | 阿里巴巴集团控股有限公司 | Risk model training, rubbish account detection method, device and equipment |
| CN108734380A (en) * | 2018-04-08 | 2018-11-02 | 阿里巴巴集团控股有限公司 | Adventure account determination method, device and computing device |
Also Published As
| Publication number | Publication date |
|---|---|
| CN109460930A (en) | 2019-03-12 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US9679074B2 (en) | Social genome | |
| CN109460930B (en) | Method for determining risk account and related equipment | |
| US10642867B2 (en) | Clustering based on a directed graph | |
| CN108985954B (en) | Method for establishing association relation of each identifier and related equipment | |
| CN106469276B (en) | Type identification method and device of data sample | |
| CN109255371B (en) | Method for determining false attention user of live broadcast platform and related equipment | |
| CN104580385A (en) | Method and device expanding user relationship chain | |
| US11570214B2 (en) | Crowdsourced innovation laboratory and process implementation system | |
| TW202123118A (en) | Relation network construction method and device based on privacy protection | |
| CN104915359B (en) | Theme label recommended method and device | |
| CN111768258A (en) | Method, device, electronic equipment and medium for identifying abnormal order | |
| US11074652B2 (en) | System and method for model-based prediction using a distributed computational graph workflow | |
| CN105335368B (en) | A kind of product clustering method and device | |
| CN111669379B (en) | Behavior abnormity detection method and device | |
| KR102086936B1 (en) | User data sharing method and device | |
| CN111754241A (en) | User behavior perception method, device, equipment and medium | |
| CN109784403B (en) | Method for identifying risk equipment and related equipment | |
| CN110222297B (en) | Identification method of tag user and related equipment | |
| CN109947983A (en) | Video recommendation method, system, terminal and computer readable storage medium | |
| CN112291277B (en) | Malicious software detection method, device, equipment and storage medium | |
| JP6608061B2 (en) | Risk event recognition system, method, electronic apparatus and storage medium based on SNS information | |
| CN114157480A (en) | Method, device, equipment and storage medium for determining network attack scheme | |
| CN108076032A (en) | A kind of abnormal behaviour user identification method and device | |
| CN106779899A (en) | The recognition methods of malice order and device | |
| CN109905722B (en) | Method for determining suspected node and related equipment |
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 |