CN112181527A

CN112181527A - Method and device for processing jump data of small program and server

Info

Publication number: CN112181527A
Application number: CN202011062813.5A
Authority: CN
Inventors: 程婧晨; 王菁菁
Original assignee: Alipay Hangzhou Information Technology Co Ltd
Current assignee: Alipay Hangzhou Information Technology Co Ltd
Priority date: 2020-09-30
Filing date: 2020-09-30
Publication date: 2021-01-05
Anticipated expiration: 2040-09-30
Also published as: CN112181527B

Abstract

The specification provides a method, a device and a server for processing jump data of an applet. The method comprises the steps of firstly constructing and obtaining a undirected jump relation graph based on jump behaviors among small programs by acquiring and according to jump data of the small programs; determining an applet group with relevance from a plurality of applets distributed on a target application according to the undirected jump relation graph, and constructing a corresponding directed jump relation graph aiming at the applet group; and further, specific data processing can be carried out on the small programs in the small program group according to the directed jump relation graph. Therefore, more fine and comprehensive small program jumping information can be obtained by constructing and using the undirected jumping relation graph and the directed jumping relation graph, and data processing related to the small program can be accurately carried out according to the small program jumping information.

Description

Method and device for processing jump data of small program and server

Technical Field

The present specification belongs to the field of internet technologies, and in particular, to a method, an apparatus, and a server for processing jump data of an applet.

Background

Many port applications support users running business services provided using applets deployed in the application and support the operation of a user to jump from one applet to another. The applet can be developed and laid by a port application party or developed and laid by a third party.

Currently, a method for mining and obtaining relatively fine and comprehensive jump information of an applet and accurately performing data processing related to the applet according to the jump information of the applet is needed.

Disclosure of Invention

The present specification provides a method, an apparatus, and a server for processing jump data of an applet, so as to mine and obtain relatively fine and comprehensive jump information of the applet, and accurately perform data processing related to the applet according to the jump information of the applet.

The method, the device and the server for processing the jump data of the applet, which are provided by the specification, are realized as follows:

a method for processing jump data of an applet comprises the following steps: acquiring jump data of the small program; constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and processing data related to the small program according to the directed jump relation graph.

A method for processing jump data of an applet comprises the following steps: acquiring jump data of the small program; constructing a directional jump relational graph according to the jump data of the small program; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to one applet respectively, and two nodes corresponding to the applets with jump behaviors are connected through directed line segments; and processing data related to the small program according to the directed jump relation graph.

A method for processing jump data comprises the following steps: acquiring jump data of a data object; constructing a directed jump relational graph according to the jump data of the data object; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to a data object, and two nodes corresponding to the data objects with jump behaviors are connected through directed line segments; and processing data related to the data object according to the directed jump relation graph.

An apparatus for processing jump data of an applet, comprising: the acquisition module is used for acquiring jump data of the applet; the first construction module is used for constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; the determining module is used for determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; the second construction module is used for constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and the processing module is used for processing data related to the small program according to the directed jump relation graph.

A server comprising a processor and a memory for storing processor-executable instructions that when executed by the processor enable fetching of jump data for an applet; constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and processing data related to the small program according to the directed jump relation graph.

According to the method, the device and the server for processing the jumping data of the small programs, a multidirectional jumping relation graph based on jumping behaviors among the small programs is firstly constructed and obtained by obtaining and according to the jumping data of the small programs; determining an applet group with relevance from a plurality of applets distributed on a target application according to the undirected jump relation graph, and respectively constructing corresponding directed jump relation graphs aiming at the applet group; furthermore, specific data processing can be performed on the applets in the applet group according to the directed jump relation graph. Therefore, the method can excavate and obtain more fine and comprehensive skip information of the small program by constructing and using the undirected skip relation graph and the directed skip relation graph to carry out corresponding processing, and accurately carry out data processing related to the small program according to the skip information of the small program.

Drawings

In order to more clearly illustrate the embodiments of the present specification, the drawings needed to be used in the embodiments will be briefly described below, and the drawings in the following description are only some of the embodiments described in the present specification, and it is obvious to those skilled in the art that other drawings can be obtained according to the drawings without any creative effort.

Fig. 1 is a schematic diagram of an embodiment of a structural composition of a system to which a method for processing jump data of an applet provided in an embodiment of the present specification is applied;

FIG. 2 is a flowchart illustrating a method for processing jump data of an applet according to an embodiment of the present disclosure;

FIG. 3 is a diagram illustrating an embodiment of a method for processing jump data of an applet, according to an exemplary scenario, provided by an embodiment of the present disclosure;

FIG. 4 is a diagram illustrating an embodiment of a method for processing jump data of an applet, according to an exemplary scenario, provided by an embodiment of the present disclosure;

FIG. 5 is a diagram illustrating an embodiment of a method for processing jump data of an applet, according to an exemplary scenario, provided by an embodiment of the present disclosure;

FIG. 6 is a diagram illustrating an embodiment of a method for processing jump data of an applet, according to an exemplary scenario, provided by an embodiment of the present disclosure;

FIG. 7 is a diagram illustrating an embodiment of a method for processing jump data of an applet, according to an exemplary scenario, provided by an embodiment of the present disclosure;

FIG. 8 is a flowchart illustrating a method for processing jump data of an applet according to an embodiment of the present disclosure;

FIG. 9 is a flowchart illustrating a method for processing jump data according to an embodiment of the present disclosure;

FIG. 10 is a schematic structural component diagram of a server provided in an embodiment of the present description;

fig. 11 is a schematic structural diagram of a device for processing jump data of an applet according to an embodiment of the present specification.

Detailed Description

In order to make those skilled in the art better understand the technical solutions in the present specification, the technical solutions in the embodiments of the present specification will be clearly and completely described below with reference to the drawings in the embodiments of the present specification, and it is obvious that the described embodiments are only a part of the embodiments of the present specification, and not all of the embodiments. All other embodiments obtained by a person skilled in the art based on the embodiments in the present specification without any inventive step should fall within the scope of protection of the present specification.

The embodiment of the specification provides a method for processing jump data of an applet. The method for processing the jump data of the small program can be particularly applied to a system comprising a server and a plurality of terminal devices.

In particular, reference may be made to FIG. 1. The server may be a server disposed on a data processing system side of the target application. Wherein the target application allows access to the applet from inside the target application party or from outside the target application party (e.g., a third party); and enables a user to trigger, run an applet in a target application, and perform a jump from one applet to another applet.

The terminal device may be specifically a terminal device that is disposed on a user side and is installed with a target application. Wherein, a plurality of applets can be laid in the target application. In addition, a data acquisition unit can be arranged in the target application installed on the terminal device and used for acquiring operation records of the small programs operated by the user in the target application.

Specifically, the server is connected to terminal devices used by different users (e.g., user 1, user 2, user 3, etc.) in a wired or wireless manner. The server can acquire the operation records of different users acquired by the data acquisition unit through the terminal equipment.

The server can extract a plurality of jump relation pairs according to the operation records; and determining the user triggering times of each of the plurality of jump relation pairs through data statistics. Each jump relation pair in the plurality of jump relation pairs comprises identification information of a small jump program and identification information of a small jump program. Each jump relationship corresponds to a basic jump path which indicates a jump from the start-jump applet to the jump applet. For example, applet a (take-off applet) jumps to applet B (jump applet). The server can determine the plurality of jump relation pairs and the user triggering times of the jump relation pairs as jump data of the applet.

Further, the server can construct a undirected jump relation graph according to the jump data of the small program. The undirected jump relation graph may specifically include a plurality of first nodes, each of the first nodes corresponds to an applet arranged in the target application, and two first nodes corresponding to the applet having a jump behavior may be connected by a undirected line segment. Specifically, the first node in the undirected jump relation graph may be represented by using identification information of a corresponding applet. The plurality of first nodes in the undirected jump relation graph can overlay applets deployed in the target application.

The server can determine the small program group according to the undirected jump relation graph. And the first nodes corresponding to the applets in the applet group are directly or indirectly connected by line segments in the undirected jump relation graph. Correspondingly, the applets belonging to the same applet group have direct or indirect jump behaviors, and have certain relevance with each other.

The server can construct a corresponding directed jump relation graph aiming at the small program group according to the jump data of the small program. The directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments. The plurality of second nodes in the directed jump relation graph can cover the applets in the corresponding applet group.

Furthermore, the server can dig out the more fine and comprehensive skip information of the small programs in the small program group through the graph attribute calculation and other modes according to the directed skip relation graph; and the data processing related to the small program is more accurately and effectively carried out according to the jump information of the small program.

For example, the server may detect an applet with a jump loss risk, so as to prompt and assist a corresponding applet opener to adjust a jump path of the applet, thereby improving user experience. For another example, a risk group with a malicious drainage risk may be detected and marked, and risk prompt information for the risk group may be generated. For example, the small program responsible for traffic distribution, which has a large traffic and is frequently used by the user, in the small program group may be detected, and the promotion information may be purposefully released on the small program, so as to utilize the traffic resource of the small program, improve the release effect of the promotion information, and so on.

In this embodiment, the server may specifically include a background server that is applied to a data processing system side and is capable of implementing functions such as data transmission and data processing. Specifically, the server may be, for example, an electronic device having data operation, storage function and network interaction function. Alternatively, the server may be a software program running in the electronic device and providing support for data processing, storage and network interaction. In this embodiment, the number of servers included in the server is not particularly limited. The server may specifically be one server, or may also be several servers, or a server cluster formed by several servers.

In this embodiment, the terminal device may specifically include a front-end device that is applied to a user side and can implement functions such as data acquisition and data transmission. Specifically, the terminal device may be, for example, a desktop computer, a tablet computer, a notebook computer, a smart phone, a digital assistant, a smart wearable device, and the like. Alternatively, the terminal device may be a software application capable of running in the electronic device. For example, it may be some APP running on a cell phone, etc.

Referring to fig. 2, an embodiment of the present disclosure provides a method for processing jump data of an applet. The method is particularly applied to the server side. In particular implementations, the method may include the following.

S201: and acquiring jump data of the applet.

In some embodiments, the applet may be specifically understood as an application that can be used without downloading and installation. The applet may be specifically laid in an application (e.g., a port APP), and a user may perform a corresponding operation in the application to trigger the use of the applet in the application without independent development. Wherein different applets can typically provide different business services, each applet can typically satisfy one or more simpler underlying applications.

Furthermore, a jump interface or jump link pointing to another applet can be set in the above applet. The user can jump directly into another applet pointed to by the jump interface or the jump link by triggering the jump interface or the jump link in the current applet.

It should be noted that, in addition to being applied to the jump data processing of the applet, the method for processing jump data of the applet provided in the embodiment of the present specification may be further extended to be applied to the processing of jump data of other data objects, for example, the jump data processing of a plug-in, the jump data processing of a page, and the like, according to specific situations.

Specifically, for example, after the user clicks to enter the X-bank application, the user may click an icon link for life payment in a main interface of the X-bank application to enter an operation interface of the life payment applet. And in the operation interface of the life payment small program, the user can click on the icon link of the electric charge inquiry, so that the user can jump from the life payment small program to the electric charge inquiry small program and enter the operation interface of the electric charge inquiry small program. At this time, it can be considered that a jump behavior occurs between the life payment applet and the electricity fee inquiry applet. The user can access the electric charge inquired in the month in the operation interface of the electric charge inquiry small program and obtain the service provided by the electric charge inquiry small program.

In some embodiments, the applet may be specifically a plurality of applets distributed in the same target application. For example, the total small programs such as a life payment small program, an electric charge inquiry small program, and an electric charge payment small program are laid in the X treasure application. The target application may be a relatively large-scale port application or platform application.

In some embodiments, the jump data of the applet may specifically include a plurality of jump relation pairs and a user trigger number of the plurality of jump relation pairs.

The jumping relationship pair may specifically include identification information of a jumping applet (also referred to as a parent applet) and identification information of a jumping applet (also referred to as a child applet). Each jump relation pair can correspond to a basic jump path for representing jump behavior from a take-off applet to a jump applet based on one side of the applet. In addition, in the basic jump path, there is no other intermediate applet except for the start applet and the jump applet.

For example, the user performs the following operations on a mobile phone: jumping from the applet A to the applet B can be recorded as a jump relation pair corresponding to a basic jump path, and is represented as: a to B. Wherein, A is the identification information of the small jump program, and B is the identification information of the small jump program.

For some small programs that support inter-hopping, the user can also do the following: jump from applet B back to applet a. Can be recorded as another jump relation pair corresponding to another basic jump path, and is expressed as: b to A. Wherein, B is the identification information of the small jump program, and A is the identification information of the small jump program.

Of course, the above-listed representation of the jump relation pair is only a schematic illustration. In specific implementation, according to specific situations and processing requirements, other suitable representation manners can be adopted to represent the jump relationship pair.

The user trigger times (which may also be referred to as user _ cnt) of the jump relationship pair may be specifically understood as the cumulative times for jumping the jump path corresponding to the jump relationship pair from the start applet to the jump applet based on the user at the user side. For example, it is counted that a total of 5 users jump from applet a to applet B in different users within a certain time period according to the operation records, and accordingly, the user trigger times of jumping relationship from a to B can be recorded as 5.

In some embodiments, when implemented, the server may first collect, by the data collection unit, operation records of a large number of users operating the applet in the target application for a time period (e.g., a current time period). And then extracting two small programs with jump behaviors according to the operation records, and establishing a corresponding jump relation pair. Meanwhile, data statistics can be carried out according to the operation records, and the user triggering times of each jump relation pair are determined. And then a plurality of jump relation pairs with jump behaviors and the user triggering times of the plurality of jump relation pairs can be obtained as the jump data of the small program.

Specifically, for example, referring to fig. 3, the server may determine the jump data of the applet according to the operation record. Wherein, a certain jump relation pair in the jump data of the applet can be expressed as: a jump applet a, a jump applet B (or, a to B).

S202: constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments.

In some embodiments, referring to fig. 4, in specific implementation, a corresponding undirected jump relation graph including all applets deployed in a target application may be constructed according to jump data of the applets.

In some embodiments, the undirected jump relation graph may be specifically understood as a graph including a plurality of first nodes corresponding to a plurality of applets deployed in the target application; and a graph model which is formed by connecting first nodes corresponding to two applets with jump behaviors in a jump relation pair by using a non-directional line segment without considering the jump direction. In particular, reference may be made to FIG. 5.

In some embodiments, the constructing of the undirected jump relation graph according to the jump data of the applet may include the following steps: setting first nodes respectively corresponding to the applets according to the identification information of the applets; determining two first nodes with jump behaviors according to the jump data of the small program; and connecting the two first nodes with the jump behavior by using a undirected line segment to obtain the undirected jump relation graph.

The identification information of the applet may be specifically understood as identification information that can indicate the corresponding applet and distinguish other applets. Such as the name of the applet, the number of the applet, the ID of the applet, etc.

In some embodiments, the corresponding node may be marked in the graph as the first node corresponding to the applet, based on the identification information of the applet. For example, a node marked with identification information a may be set in the graph as a first node corresponding to the applet a.

Furthermore, a jump relation pair can be obtained from jump data of the applet, and two first nodes with jump behaviors are determined according to the jump relation pair. And connecting the two first nodes with the jump behavior by using a non-directional line segment without considering the specific jump direction. Wherein, the weights of different undirected line segments in the undirected jump relation graph are the same.

Referring to FIG. 5, for example, the following may be paired according to a jump relationship: c to B, a line segment without an arrow may be used as a non-directional segment to connect the first node C with the first node B. As another example, according to the jump relationship pair: a line segment with the same width (i.e. the same weight) as the line segment between the first node C and the first node B and without an arrow may be used as a non-directional line segment to connect the first node a and the first node B.

S203: determining an applet group according to the undirected jump relation graph; and the first nodes corresponding to the small programs in the small program group are directly or indirectly connected.

In some embodiments, the above applet group may be specifically understood as a combination of applets having relevance based on jump behaviors. The first nodes corresponding to the applets belonging to the same applet group are directly or indirectly connected by line segments in the undirected jump relation graph. For example, in fig. 5, the first node a and the first node B are directly connected by the line segment 1 therebetween. Therefore, it can be determined that the applets corresponding to the first node a and the first node B belong to the same applet group (which can be denoted as applet group 1). Although there is no line segment directly connected between the first node a and the first node C, the first node a and the first node C are indirectly connected through the first node B by the line segment 1 and the line segment 2. Therefore, it can be determined that the applets corresponding to the first node a and the first node C also belong to the same applet group.

In some embodiments, referring to fig. 4, in implementation, a plurality of related applets may be determined from a plurality of applets deployed in the target application, and combined into one applet group, so as to obtain a plurality of applet groups. For example, the applet group 1, the applet group 2 and the applet group 3 in fig. 5. The association can be understood as that the first nodes corresponding to the applets are connected directly or indirectly by line segments.

Therefore, the small program group can be used as a processing unit subsequently, and the relationship among the small programs in the small program group is further analyzed and processed, so that finer and comprehensive small program jump information can be obtained by mining.

In some embodiments, when the first applet group is determined according to the undirected jump relation graph, any one first node in the undirected jump relation graph may be specifically used as a traversed starting node, other first nodes except the starting node in the undirected jump relation graph are traversed, and a first node directly or indirectly connected to the starting node through an undirected line segment is found as a group node having an association with the starting node. And dividing the small programs corresponding to the starting node and the small programs corresponding to the group node of the starting node into a first small program group.

After the first applet group is determined according to the method, if the undirected jump relation graph has other nodes which are not divided to carry out the first applet group, other applet groups can be further determined.

Specifically, for example, the current applet group is determined, and the current applet group may be determined according to the undirected jump relation diagram in the following manner: taking a current node which is not currently divided into the small program group in the undirected jump relation graph as a starting node for traversing, traversing other first nodes which are not currently divided into the small program group except the current node in the undirected jump relation graph, and finding out the first node which is directly or indirectly connected with the current node through a undirected line segment as a group node of the current node; and dividing the small programs corresponding to the current node and the small programs corresponding to the group nodes of the current node into a current small program group.

By the method, all the first nodes in the undirected jump relation graph are divided. Therefore, the multiple applets distributed in the target application can be divided into one or more different applet groups according to the undirected jump relation graph.

S204: constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments.

In some embodiments, a corresponding directed jump relation graph may be constructed for each applet group, so as to obtain a plurality of directed jump relation graphs. For example, there are a directed jump relation diagram 1 (corresponding to the applet group 1), a directed jump relation diagram 2 (corresponding to the applet group 2), a directed jump relation diagram 3 (corresponding to the applet group 3), and the like.

In some embodiments, the directed jump relation graph may be specifically understood as a graph including second nodes corresponding to all applets in an applet group; and the jump direction is considered, and a directed line segment is used for connecting second nodes corresponding to two applets with jump behaviors in the jump relation pair. In particular, reference may be made to FIG. 6.

In some embodiments, the directed jump relation graph may specifically correspond to an applet group, and the jump relation between applets in the corresponding applet group may be finely and comprehensively depicted by the directed jump relation graph.

In some embodiments, the above-mentioned constructing a corresponding directed jump relation graph for the applet group may be implemented specifically by taking constructing a directed jump relation graph corresponding to the current applet group as an example, and constructing a directed jump relation graph corresponding to the current applet group according to the following manner: setting a corresponding second node according to the identification information of the small programs contained in the current small program group; screening out an associated jump relation pair associated with the current small program group and the user triggering times of the associated jump relation pair from the jump data of the small program; determining two second nodes with the jump behavior and the connection direction of the line segment between the two second nodes with the jump behavior according to the associated jump relationship pair; determining the weight of the line segment between the two second nodes with the jump behavior according to the user triggering times of the associated jump relation pair; and connecting the two second nodes with the jump behavior by using corresponding directed line segments according to the connecting direction of the line segments and the weights of the line segments to obtain a directed jump relational graph.

In some embodiments, the corresponding nodes may be marked in the graph according to the identification information of the applets included in the current applet group to obtain a plurality of second nodes.

Further, the associated jump relation pair associated with the current applet group and the user triggering times of the associated jump relation pair may be obtained from the jump data of the applet. The above-mentioned associated jump relationship pair associated with the current applet group may be specifically understood as a jump relationship pair including at least one applet in the current applet group.

Specifically, when the directed jump relation graph is constructed, according to the corresponding basic jump path of the jump relation pair, a line segment carrying an arrow pointing to a jump node is used as a directed line segment to connect two second nodes having a jump behavior.

Wherein, in the directed jump relation graph, the weights of different directed line segments can be different. The weight of the directed line segment can be specifically determined according to the user triggering times of the corresponding jump relation pair.

Specifically, referring to fig. 6, for example, according to the jump relationship pair: c to B (i.e. jump from applet C to applet B), the connection direction is determined from C to B, and a line segment carrying an arrow pointing to the second node B may be used as a directed line segment to connect the second node C and the second node B. Further, the width of the directional line segment (the weight corresponding to the directional line segment) may be determined according to the number of times of user triggering of the jump relation pair C to B.

As another example, according to the jump relationship pair: and a to B, B to a (i.e. the applet a and the applet B hop with each other), determining that the connection direction is from a to B, and from B to a, and further, connecting the second node a and the second node B by using a line segment carrying two arrows respectively pointing to the second node a and the second node B as a directed line segment. Further, the width of the directional line segment may be determined according to the sum of the user triggering times of the two jump relation pairs of a to B and B to a.

Of course, the above-listed example of using the width of a directional line segment to represent the weight of the directional line segment is only a schematic illustration. In particular, other graphical features (e.g., length, color, etc.) of the directed line segment may be used to represent the weight of the directed line segment, as the case may be.

In some embodiments, when the weight of the current directed line segment is specifically determined, the maximum value and the minimum value of the triggering times can be determined according to the user triggering times of each jump relation pair; and determining corresponding weight according to the user triggering times of the jump relation pair corresponding to the current directed line segment and the maximum value and the minimum value of the triggering times.

Specifically, the weight of the current directed line segment may be calculated according to the following equation:

wherein, Y may specifically be represented as a weight of the current directed line segment, X may specifically be represented as a number of triggers of a user of the jump relation pair corresponding to the current directed line segment, and X_maxIt can be expressed in particular as the maximum value of the number of triggers, X_minAnd may specifically be expressed as a minimum number of triggers. a and b may be specifically expressed as preset constants.

According to the method, the corresponding directed jump relation graph can be respectively constructed and obtained for each applet group.

S205: and processing data related to the small program according to the directed jump relation graph.

In some embodiments, in a specific implementation, the relationship between the applets in one applet group may be specifically analyzed and processed according to the directed jump relationship diagram, so as to mine relatively fine and comprehensive skip information of the applets. Furthermore, various data processing related to the small program can be accurately carried out according to the jump information of the small program.

For example, whether the applet has a jump loss risk or not can be detected according to the directed jump relation graph; or detecting whether malicious drainage risks exist in the applet group according to the directed jump relation graph; or the target small program with larger flow and responsible for flow distribution can be found according to the directed jump relation graph, and further promotion information and the like can be put in the target small program. Of course, the above-listed data processing related to the applet is only an illustrative description. In specific implementation, according to specific situations and processing requirements, other data processing related to the applet than those listed above may be performed. The present specification is not limited to these.

In some embodiments, the above-mentioned data processing related to the applet according to the directed jump relation graph may include the following contents in specific implementation: and calculating preset graph attribute parameters of each second node in the directed jump relational graph according to the directed jump relational graph. The preset graph attribute parameters comprise an intermediate centrality parameter and/or a degree centrality parameter. And processing data related to the small program according to the preset map attribute parameters.

In some embodiments, the preset graph attribute parameter may be specifically understood as a graph attribute parameter determined by a graph attribute recognition (or calculation) process based on the directed jump relation graph, and the graph attribute parameter may reflect jump information of the applet.

In some embodiments, the preset map attribute parameters may specifically include an intermediary centrality parameter and/or a degree centrality parameter.

The above-mentioned middle centrality parameter (betweenness centrality) may be specifically understood as an indication parameter for characterizing the importance degree of the applet corresponding to the node in the applet group. Generally, the larger the value of the intermediate centrality parameter of a node is, the more the number of paths of the shortest jump path required to pass through the applet corresponding to the node is, the more difficult it is for the user to jump to the destination applet by bypassing the applet, and accordingly, the higher the importance degree of the applet in the applet group is.

The foregoing centrality parameter (Degree) may be specifically understood as an indication parameter for characterizing the extent of the applet corresponding to the node in the applet group. Generally, the larger the value of the centrality parameter of a node is, the larger the number of other applets directly connected to the applet corresponding to the node is, and accordingly, the larger the scope of the applet is.

In some embodiments, the intermediary centrality parameter of the second node may be determined according to the following equation:

wherein, C_B(i) Which may be expressed in particular as the mediation centrality parameter, σ, of the second node numbered i_st(i) Specifically, the number of paths, σ, of the shortest jump path passing through the second node with the number i, where s is the jump starting node and t is the destination jump node_stSpecifically, s is taken as a jump node, t is the number of paths of the shortest jump path of the target jump node, and V is a second node set in the directed jump relation graph.

In some embodiments, the above-mentioned take-off node s may also be referred to as a start node, corresponding to a start applet. The destination hop node t may also be referred to as a destination node, corresponding to a destination applet. The destination applet may be specifically understood as an applet that the user finally wants to jump to, and the start applet may be specifically understood as an applet that is started in the process of jumping to the destination applet by the user. Further, the process of jumping from the starting applet to the destination applet can be denoted as a jump path. A simpler jump path may contain only one basic jump path. While a more complex jump path may be a combination of multiple basic jump paths.

In some embodiments, the centrality parameter of the second node may specifically be determined according to the following equation:

D(i)＝son_cnt+parent_cnt

d (i) may specifically be a centrality parameter of the second node numbered i, son _ cnt may specifically be the number of hop nodes connected to the second node numbered i, and parent _ cnt may specifically be the number of hop nodes connected to the second node numbered i.

In some embodiments, the above listed parameters of center-of-intermediation, center-of-measure, are only illustrative. In specific implementation, according to specific situations, for example, other graph attribute parameters such as the weight of the directed line segment connecting the second node may be used as preset graph attribute parameters to perform data processing related to the applet.

In some embodiments, the above-mentioned data processing related to the applet is performed according to the preset map attribute parameter, and the specific implementation may include the following contents.

S1: and determining a second node with the maximum value of the preset graph attribute parameters in the directed jump relation graph as a concerned node.

S2: and determining the maximum value of the layer number of the jump path passing through the concerned node according to the directed jump relation graph.

S3: and comparing the maximum value of the layer number of the jump path passing through the concerned node with a preset layer number threshold value to obtain a corresponding comparison result.

S4: and according to the comparison result, determining that the small program corresponding to the concerned node has a jump loss risk under the condition that the maximum value of the layer number of the jump path passing through the concerned node is determined to be greater than or equal to a preset layer number threshold value.

In some embodiments, the intermediate centrality parameter of the second node may be used alone, or the degree centrality parameter may be used as the preset map attribute parameter. In some cases where the accuracy requirement is relatively high, a combination of the intermediate centrality parameter and the degree centrality parameter of the second node may also be used as the preset map attribute parameter.

In some embodiments, the applet corresponding to the node of interest determined in the above manner may be understood as an applet having a relatively high probability that a user in the applet group will jump to and have a relatively large influence on the user.

In some embodiments, a specific jump path can be restored more accurately according to the directed jump relation graph. The jump path may be specifically understood as a path that jumps from an initial applet (the corresponding second node may be referred to as an initial node) where the user is currently located to a destination applet (the corresponding second node may be referred to as a destination node) that is finally expected to be reached. In general, the jump path may be a combination of one or more basic jump paths.

The number of layers of the jump path may be specifically understood as the number of nodes, other than the start node and the destination node, that a user needs to jump from the start node to the final destination node in the directed jump relation graph.

For example, if the user can directly take off the jump from the starting node and jump to the required destination node, other nodes do not need to be jumped in the middle, and the layer number of the jumped path is 0.

If the user needs to jump from the initial node to an intermediate node; then jumping to the final destination node by the intermediate node, wherein the layer number of the jumping path is 1. And so on.

Generally, the larger the number of layers of a hop path and the deeper the hop path are, the more the number of intermediate nodes to be jumped from a starting node to a final destination node by a user is, the larger the amount of information the user needs to process is, and the higher the operation cost of the user is. In contrast, the user is also more likely to get lost, with a higher risk of losing.

For example, when a user jumps from node 1, 10 nodes are jumped in the middle, but the user does not jump to the applet corresponding to the node 2 that the user wants, the user may doubtful the jump process due to multiple tedious jumpers, even think that the user's account number or the applet is unsafe, and directly quit the applet. In addition, the multiple jumps not only do not jump to the destination applet desired by the user, but also cause the user to be interfered by the applets corresponding to a large number of intermediate nodes, and cause the user to lose direction. Based on the above situation, there is a high probability that the user cannot successfully insist on jumping to the applet corresponding to the number 2 node that the user wants to reach, which affects the user experience.

The specific value of the preset layer number threshold can be determined according to the average value of the jump times that the user is willing to tolerate. The specification does not limit the specific value of the preset layer number threshold.

In some embodiments, whether the applet corresponding to the concerned node has a jump risk or not can be detected according to the number of layers of the jump path, and then whether the problem that the user gets lost or not and the use experience of the user is influenced or not can be judged in the process that the user jumps to the destination applet through the jump path of the concerned node.

In some embodiments, if it is determined that the maximum value of the number of layers of the jump path passing through the concerned node is greater than or equal to the preset number of layers threshold, the server may determine that the applet corresponding to the concerned node has a jump loss risk, based on that the current jump path passing through the concerned node may affect the use experience of the user, and subsequently, the jump logic relating to the concerned node needs to be adjusted to also improve the use experience of the user.

In contrast, if it is determined that the maximum value of the layer number of the jump path passing through the concerned node is smaller than the preset layer number threshold, the server may determine that the applet corresponding to the concerned node does not have a risk of losing jump, and based on the current jump path passing through the concerned node, the use experience of the user is not affected.

In some embodiments, after determining that the applet corresponding to the concerned node has a risk of losing a jump, when the method is implemented, the method may further include: and generating adjustment prompt information aiming at the concerned node. And sending the adjustment prompt information to a first program developer of the small program corresponding to the concerned node so as to prompt the first program developer to adjust a jump path related to the small program.

In some embodiments, the server may generate and send corresponding adjustment prompt information to a program developer (denoted as a first program developer) of the applet, when it is determined that the applet corresponding to the concerned node has a risk of losing jumps, so as to prompt that a path depth of at least one challenging path existing in jump paths of the first program developer flowing through the concerned node is too deep, which is easy to lose in a user jump process and affects user experience.

Correspondingly, the first program developer can receive and adjust the jump path of the jump path related to the concerned node in a targeted manner according to the adjustment prompt information, so that the risk of user loss is reduced, and the use experience of the user is improved.

In the embodiment, a undirected jump relation graph based on jump behaviors among small programs is constructed and obtained firstly by acquiring and according to jump data of the small programs; determining small program groups with relevance according to the undirected jump relation graph, and respectively constructing corresponding directed jump relation graphs aiming at the small program groups; furthermore, specific data processing can be performed on the applets in the applet group according to the directed jump relation graph. Therefore, more fine and comprehensive small program jumping information can be obtained by constructing and using the undirected jumping relation graph and the directed jumping relation graph, and data processing related to the small program can be accurately carried out according to the small program jumping information.

In some embodiments, after determining that the applet corresponding to the concerned node has a risk of losing a jump, when the method is implemented, the method may further include: generating adjustment prompt information aiming at the concerned node; and sending the adjustment prompt information to a first program developer of the small program corresponding to the concerned node so as to prompt the first program developer to adjust a jump path related to the small program.

In some embodiments, the data processing related to the applet is performed according to the preset map attribute parameter, and the specific implementation may further include the following contents. And determining the business relationship between the applets in the applet group corresponding to the directed jump relation graph according to the intermediate parameter and/or the degree centrality parameter of the second node in the directed jump relation graph.

In some embodiments, the business relationship between the applets in the applet group may specifically include: a traffic distribution inlet, a traffic transmission channel, a function server, etc.

The functional server may be specifically understood as a destination applet in the applet group, which is responsible for providing a specific functional service for a user. For example, an electric charge payment applet, a hotel reservation applet, etc. The traffic distribution entry may be specifically understood as an applet in an applet group responsible for traffic distribution. The traffic distribution entry is often used as an applet for a user to jump to a starting node in a jump path of a desired functional server. Such as a life payment applet, a travel-by-location integrated services platform applet, etc. The traffic transmission channel may be specifically understood as an applet in the applet group responsible for transit. The traffic transmission channel is often used as a transit node in the process that a user jumps from a traffic distribution entry to a functional server, and is responsible for transmitting the user introduced through the traffic distribution entry to the corresponding functional server. For example, an electricity fee inquiry applet, a hotel service applet somewhere, etc.

In some embodiments, in a specific implementation, after determining a business relationship between applets in an applet group corresponding to the directed jump relationship graph, the method may further include: determining the ecological relationship of the small programs in the small program group according to the business relationship among the small programs in the small program group; and determining the service tasks of the applets in the applet group according to the ecological relationship of the applets in the applet group, and further selecting and utilizing the corresponding applets in a more targeted manner to perform related data processing so as to improve the use experience of a user and/or improve the operation effect of the applets and the like.

In some embodiments, the method, when implemented, may further include: and determining the small program responsible for traffic distribution in the small program group corresponding to the directed jump relation graph as a target small program according to the intermediate parameter and/or the degree-centrality parameter of the second node in the directed jump relation graph.

In some embodiments, in specific implementation, an applet responsible for traffic distribution in an applet group corresponding to a second node with the largest value of the intermediate parameter and/or the degree-centrality parameter may be determined from a plurality of second nodes included in the directed jump relation graph according to the intermediate parameter and/or the degree-centrality parameter of the second node, and the applet is used as the target applet. For example, traffic distribution portals in the applet group.

In some embodiments, considering that the target applet serves as a traffic distribution entry in the applet group, the traffic of the user flowing through is often relatively large, and in order to effectively utilize the traffic resource of the target applet, the method may further include the following steps: and putting promotion information on the target small program.

Therefore, the flow resources of the small programs at the flow distribution inlet in the small program group can be effectively utilized to release the promotion information, so that the promotion information can cover more users and better promotion and release effects can be obtained.

In some embodiments, after constructing the corresponding directed jump relation graph for the applet group, the distribution may further include the following when implementing the distribution: detecting whether a newly added directed jump relation graph exists in the directed jump relation graph; under the condition that the newly added directed jump relational graph is determined to exist, determining a mesopic parameter and/or a degree centrality parameter of a second node in the newly added directed jump relational graph and a graphic feature in the newly added directed jump relational graph; and determining whether the small program group corresponding to the newly added directed jump relational graph has malicious drainage risk or not according to the intermediate parameter and/or the degree centrality parameter of the second node in the newly added directed jump relational graph and the graph characteristics in the newly added directed jump relational graph.

In some embodiments, considering that some program developers can construct a plurality of group applets for some purposes, and design corresponding jump paths, the group applets jump users with different traffic inlets into a designated applet in an attractive manner, so that malicious drainage is formed, the use experience of the users is influenced, and even the data security of the users is threatened. Based on the above situation, the method provided by the embodiment of the present specification can identify the risk group in time when the malicious drainage risk is found.

In some embodiments, after the server constructs and obtains the directed jump relation graph corresponding to the current time period for the applet group, the directed jump relation graph of the time period before the current time period may also be obtained. And comparing the directed jump relational graph of the current time period with the directed jump relational graph of the previous time period to detect whether a directed jump relational graph newly added in the current time period exists or not. Under the condition that the existence of the newly added directed jump relation graph is detected, corresponding data processing can be further carried out on the newly added directed jump relation graph so as to determine whether a malicious drainage risk exists in an applet group corresponding to the directed jump relation graph.

In some embodiments, for the newly added directed jump relation graph, a mesopic parameter and/or a centrality parameter of a second node in the newly added directed jump relation graph may be determined respectively; and meanwhile, corresponding graphic features can be determined according to the newly added directed jump relation graph. The graph feature may be specifically understood as a shape feature of a graph formed by a second node and a directed line segment in the newly added directed jump relation graph.

In some embodiments, in a specific implementation, a second node with the largest value of the intermediate parameter and/or the degree-centrality parameter may be screened from the plurality of second nodes as a central node according to the intermediate parameter and/or the degree-centrality parameter of the second node in the newly added directed jump relation graph.

Further, as shown in fig. 7, according to the newly added directed jump relation graph, the shape feature of the graph constructed by the central node and the surrounding second nodes is determined as the graph feature of the newly added directed jump relation graph. And matching the graph characteristics of the newly added directed jump relation graph with preset risk graph characteristics. And determining whether the small program group corresponding to the newly added directed jump relation graph has malicious drainage risks or not according to the matching result.

And if the matching degree of the graphic features of the newly added directed jump relation graph and the preset risk graphic features is determined to be higher than the preset matching degree threshold value according to the matching result, the fact that the small program group corresponding to the newly added directed jump relation graph has malicious drainage risk can be determined. On the contrary, if the matching degree of the graphic features of the newly added directed jump relational graph and the preset risk graphic features is determined to be lower and less than or equal to the preset matching degree threshold according to the matching result, the small program group corresponding to the newly added directed jump relational graph can be determined not to have malicious drainage risk.

The preset graphic features may specifically include: the central node and a plurality of surrounding second nodes form a radiation shape (for example, a star shape, a Chinese character 'mi' shape and the like); and the arrows of the directional line segments between the surrounding plurality of second nodes and the center node point to the center node. As can be seen in fig. 7.

In some embodiments, after determining that the applet group corresponding to the newly added directed jump relation graph has a malicious drainage risk, when the method is implemented specifically, the method may further include the following steps: marking the small program groups with malicious drainage risks as risk groups; generating risk hint information for the risk group.

In some embodiments, the server may send the risk prompt information to the user, and in time prompt the user to the applet group with malicious drainage risk, so that the user experience on the user side may be effectively protected. Meanwhile, the service can also generate and send a warning prompt to the program developer of the risk group to remind the program developer of the risk group to adjust the jump path of the risk group in time and eliminate the behavior of malicious drainage.

In some embodiments, during specific implementation, the number of directed line segments included in a path appearing in a graph can be determined according to a directed jump relation graph; determining the number of layers of the path according to the number of directed line segments contained in the path; further, according to the number of layers of the path, the service depth provided by the small program on the path and the operation cost of the user during use can be determined; and the service depth and the operation cost when the user uses are integrated to evaluate the reasonability of the jump logic of the small program on the path; and guiding a program developer to perform targeted adjustment according to the evaluation result so as to improve the use experience of the user when jumping to the applet.

The jump path may be specifically understood as a jump path from an initial applet corresponding to an initial node to a destination applet corresponding to a destination node expected to be reached. The jump path may specifically include a basic jump path corresponding to one jump relationship pair, or may include a combination of multiple basic jump paths corresponding to multiple jump relationship pairs.

In some embodiments, the preset graph attribute parameters may specifically further include a weight of a directed line segment.

In some embodiments, the weight of the directional line segment may be specifically used to characterize a jump requirement strength of a user of a jump path corresponding to the directional line segment. Specifically, if the weighted value of one directed line segment is larger, the strength of the skipping requirement of the user of the skipping path corresponding to the directed line segment is larger; accordingly, the greater the probability that the user trigger will be used to the jump path. Conversely, if the weight value of one directed line segment is smaller, the strength of the jumping requirement of the user of the jumping path corresponding to the directed line segment is smaller; accordingly, the smaller the probability that the user triggers the use of the jump path.

In some embodiments, the above processing data related to the applet according to the directed jump relation graph may further include the following contents in specific implementation: acquiring and determining the jumping demand intensity of a user between applets corresponding to two nodes connected with the directed line segment according to the weight of the directed line segment in the directed jumping relation graph; screening directed line segments with the skipping requirement strength of the user larger than a preset strength threshold value from the directed line segments to serve as target line segments according to the skipping requirement strength of the user; and releasing popularization information on the jump path indicated by the jump relation pair corresponding to the target line segment. The jumping path corresponding to the target line segment is a jumping path with high user triggering and using probability due to high user jumping requirement strength.

In some embodiments, the promotion information is put on the jump path corresponding to the target line segment in a targeted manner, so that the user has a higher probability of obtaining the promotion information, and the putting effect of the promotion information can be further improved.

As can be seen from the above, in the method for processing skip data of applets provided in the embodiments of the present specification, a undirected skip relation graph based on skip behaviors between applets is constructed and obtained by first obtaining and according to the skip data of the applets; determining an applet group with relevance from a plurality of applets distributed in the target application according to the undirected jump relation graph, and constructing a corresponding directed jump relation graph aiming at the applet group; and further, specific data processing can be carried out on the small programs in the small program group according to the directed jump relation graph. Therefore, more fine and comprehensive small program jumping information can be obtained by constructing and using the undirected jumping relation graph and the directed jumping relation graph, and data processing related to the small program can be accurately carried out according to the small program jumping information.

An embodiment of the present specification further provides a risk detection method for an applet group, including: acquiring jump data of the small program; constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and detecting whether the small program group has corresponding risks according to the directed jump relation graph.

In some embodiments, the detecting whether there is a corresponding risk in the applet group according to the directed jump relation graph may include: determining preset graph attribute parameters of a second node in the directed relation graph and graph features in the directed relation graph according to the directed jump relation graph; and determining whether a small program group corresponding to the directed jump relation graph has a malicious drainage risk or not according to preset graph attribute parameters of a second node in the directed relation graph and graph features in the directed relation graph. The preset map attribute parameters comprise an intermediary centrality parameter and/or a degree centrality parameter and the like.

In some embodiments, the detecting whether there is a corresponding risk in the applet group according to the directed jump relation graph may include: determining preset map attribute parameters in the directed jump relation map and the layer number of jump paths according to the directed jump relation map; determining a second node with the maximum value of preset graph attribute parameters in the directed jump relation graph as a concerned node; determining the maximum value of the layer number of the jump path passing through the concerned node according to the directed jump relation graph; comparing the maximum value of the layer number of the jump path passing through the concerned node with a preset layer number threshold value to obtain a corresponding comparison result; and according to the comparison result, determining that the small program group in which the small program corresponding to the concerned node is located has a jump loss risk under the condition that the maximum value of the layer number of the jump path passing through the concerned node is determined to be greater than or equal to a preset layer number threshold value.

Referring to fig. 8, another method for processing jump data of an applet is further provided in the embodiments of the present disclosure. When the method is implemented, the following contents may be included.

S801: and acquiring jump data of the applet.

S802: constructing a directional jump relational graph according to the jump data of the small program; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to one applet respectively, and two nodes corresponding to the applets with jump behaviors are connected through directed line segments.

S803: and processing data related to the small program according to the directed jump relation graph.

In some embodiments, the undirected jump relation graph may not be constructed, and only the directed jump relation graph may be constructed in the above manner. The method may include dividing an applet having a relationship from a plurality of applets installed in a target application as an applet group according to a directed jump relation graph to obtain a plurality of applet groups. And processing data related to the small program by taking the small program group as a processing unit according to the directed jump relation graph.

The present specification further provides a method for processing jump data, which can be specifically referred to as fig. 9. The method may be embodied as follows.

S901: and acquiring jump data of the data object.

S902: constructing a directed jump relational graph according to the jump data of the data object; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to a data object, and two nodes corresponding to the data objects with jump behaviors are connected through directed line segments.

S903: and processing data related to the data object according to the directed jump relation graph.

In some embodiments, the data object may specifically include at least one of: page objects, plug-in objects, applet objects, and the like. Of course, it should be noted that the above listed data objects are only schematic illustrations. In the specific implementation, other suitable data objects may be introduced according to specific situations. The present specification is not limited to these.

In some embodiments, for the processing of the jump data of the data object, a corresponding undirected jump relation graph and a directed jump relation graph may also be respectively constructed, and then the undirected jump relation graph and the directed jump relation graph are utilized to perform the related data processing more finely.

Specifically, skip data of the data object can be acquired; constructing a undirected jump relation graph according to the jump data of the data object; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to a data object, and two first nodes corresponding to the data objects with jump behaviors are connected through undirected line segments; determining a data object group according to the undirected jump relation graph; wherein, the first nodes corresponding to the data objects in the data object group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the data object group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one data object in the data object group, and two second nodes corresponding to the data objects with jump behaviors are connected through directed line segments; and processing data related to the data object according to the directed jump relation graph.

Embodiments of the present specification further provide a server, including a processor and a memory for storing processor-executable instructions, where the processor, when implemented, may perform the following steps according to the instructions: acquiring jump data of the small program; constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and processing data related to the small program according to the directed jump relation graph.

In order to more accurately complete the above instructions, referring to fig. 10, the present specification further provides another specific server, wherein the server includes a network communication port 1001, a processor 1002 and a memory 1003, and the above structures are connected by an internal cable, so that the structures can perform specific data interaction.

The network communication port 1001 may be specifically configured to acquire jump data of an applet.

The processor 1002 may be specifically configured to construct a undirected jump relation graph according to jump data of the applet; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and processing data related to the small program according to the directed jump relation graph.

The memory 1003 may be specifically configured to store a corresponding instruction program.

In this embodiment, the network communication port 1001 may be a virtual port that is bound to different communication protocols, so that different data can be sent or received. For example, the network communication port may be a port responsible for web data communication, a port responsible for FTP data communication, or a port responsible for mail data communication. In addition, the network communication port can also be a communication interface or a communication chip of an entity. For example, it may be a wireless mobile network communication chip, such as GSM, CDMA, etc.; it can also be a Wifi chip; it may also be a bluetooth chip.

In this embodiment, the processor 1002 may be implemented in any suitable manner. For example, the processor may take the form of, for example, a microprocessor or processor and a computer-readable medium that stores computer-readable program code (e.g., software or firmware) executable by the (micro) processor, logic gates, switches, an Application Specific Integrated Circuit (ASIC), a programmable logic controller, an embedded microcontroller, and so forth. The description is not intended to be limiting.

In this embodiment, the memory 1003 may include multiple layers, and in a digital system, the memory may be any memory as long as binary data can be stored; in an integrated circuit, a circuit without a physical form and with a storage function is also called a memory, such as a RAM, a FIFO and the like; in the system, the storage device in physical form is also called a memory, such as a memory bank, a TF card and the like.

The embodiment of the present specification further provides a computer storage medium of a jump data processing method based on the above small program, where the computer storage medium stores computer program instructions, and when the computer program instructions are executed, the computer storage medium implements: acquiring jump data of the small program; constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments; determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected; constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments; and processing data related to the small program according to the directed jump relation graph.

In this embodiment, the storage medium includes, but is not limited to, a Random Access Memory (RAM), a Read-Only Memory (ROM), a Cache (Cache), a Hard Disk Drive (HDD), or a Memory Card (Memory Card). The memory may be used to store computer program instructions. The network communication unit may be an interface for performing network connection communication, which is set in accordance with a standard prescribed by a communication protocol.

In this embodiment, the functions and effects specifically realized by the program instructions stored in the computer storage medium can be explained by comparing with other embodiments, and are not described herein again.

Referring to fig. 11, in a software level, an embodiment of the present specification further provides a device for processing jump data of an applet, where the device may specifically include the following structural modules.

The obtaining module 1101 may be specifically configured to obtain jump data of an applet.

The first constructing module 1102 may be specifically configured to construct a undirected jump relation graph according to the jump data of the applet; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments.

The determining module 1103 may be specifically configured to determine an applet group according to the undirected jump relation graph; and the first nodes corresponding to the small programs in the small program group are directly or indirectly connected.

A second constructing module 1104, which may be specifically configured to construct a corresponding directed jump relation graph for the applet group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments.

The processing module 1105 may be specifically configured to perform data processing related to the applet according to the directed jump relation graph.

In some embodiments, the obtaining module 1101 may be configured to collect an operation record of an applet operated by a user in a target application; the target application is provided with a plurality of small programs; extracting a plurality of jump relation pairs according to the operation record; the jumping relation pair comprises identification information of a small jumping program and identification information of a small jumping program; counting the user triggering times of the plurality of jump relation pairs according to the operation record; and determining the plurality of jump relation pairs and the user triggering times of the plurality of jump relation pairs as jump data of the applet.

In some embodiments, when the first building module 1102 is implemented, it may be configured to set a first node corresponding to an applet according to identification information of the applet; determining two first nodes with jump behaviors according to the jump data of the small program; and connecting the two first nodes with the jump behavior by using a undirected line segment to obtain the undirected jump relation graph.

In some embodiments, the determining module 1103 may specifically determine the current applet group according to the undirected jump relation graph in the following manner: taking a current node which is not currently divided into the small program group in the undirected jump relational graph as a starting point of traversal, traversing other first nodes which are not currently divided into the small program group except the current node in the undirected jump relational graph, and finding out the first node which is directly or indirectly connected with the current node through an undirected line segment as a group node of the current node; and dividing the small programs corresponding to the current node and the small programs corresponding to the group nodes of the current node into a current small program group.

In some embodiments, the second building module 1104, when implemented, may be configured to build a directed jump relation graph corresponding to the current applet group according to the following manner: setting a corresponding second node according to the identification information of the small programs contained in the current small program group; screening out an associated jump relation pair associated with the current small program group and the user triggering times of the associated jump relation pair from the jump data of the small program; determining two second nodes with the jump behavior and the connection direction of the line segment between the two second nodes with the jump behavior according to the associated jump relationship pair; determining the weight of the line segment between the two second nodes with the jump behavior according to the user triggering times of the associated jump relation pair; and connecting the two second nodes with the jump behavior by using corresponding directed line segments according to the connecting direction of the line segments and the weights of the line segments to obtain a directed jump relational graph.

In some embodiments, the processing module 1105, when implemented, may include the following structural units:

the calculation unit may be specifically configured to calculate, according to the directed jump relation graph, preset graph attribute parameters of each second node in the directed jump relation graph; the preset graph attribute parameters comprise an intermediary centrality parameter and/or a degree centrality parameter;

the processing unit may be specifically configured to perform data processing related to the applet according to the preset map attribute parameter.

In some embodiments, the processing unit, when implemented specifically, may be configured to determine, as a node of interest, a second node in the directed jump relation graph, where a preset graph attribute parameter has a maximum value; determining the maximum value of the layer number of the jump path passing through the concerned node according to the directed jump relation graph; comparing the maximum value of the layer number of the jump path passing through the concerned node with a preset layer number threshold value to obtain a corresponding comparison result; and according to the comparison result, determining that the small program corresponding to the concerned node has a jump loss risk under the condition that the maximum value of the layer number of the jump path passing through the concerned node is determined to be greater than or equal to a preset layer number threshold value.

In some embodiments, when the processing module 1105 is implemented specifically, after determining that the applet corresponding to the concerned node has a risk of losing a jump, the processing module may further be configured to generate an adjustment prompt message for the concerned node; and sending the adjustment prompt information to a first program developer of the small program corresponding to the concerned node so as to prompt the first program developer to adjust a jump path related to the small program.

In some embodiments, when implemented specifically, the processing unit may be further configured to determine, according to a mesopic parameter and/or a centrality parameter of a second node in the directed jump relation graph, a business relationship between applets in an applet group corresponding to the directed jump relation graph.

In some embodiments, when implemented specifically, the processing unit may be further configured to determine, according to a mesopic parameter and/or a centrality parameter of a second node in the directed jump relation graph, an applet in charge of traffic distribution in an applet group corresponding to the directed jump relation graph, to be used as the target applet.

In some embodiments, the processing unit, when implemented in detail, may be further configured to deliver promotional information on the target applet.

In some embodiments, when implemented specifically, the processing unit may be further configured to detect whether a newly added directed jump relation graph exists in the directed jump relation graph after constructing a corresponding directed jump relation graph for the applet group; under the condition that the newly added directed jump relational graph is determined to exist, determining a mesopic parameter and/or a degree centrality parameter of a second node in the newly added directed jump relational graph and a graphic feature in the newly added directed jump relational graph; and determining whether the small program group corresponding to the newly added directed jump relational graph has malicious drainage risk or not according to the intermediate parameter and/or the degree centrality parameter of the second node in the newly added directed jump relational graph and the graph characteristics in the newly added directed jump relational graph.

In some embodiments, the processing unit, when implemented specifically, may be further configured to mark, after determining that a malicious flow guiding risk exists in an applet group corresponding to the newly added directed jump relation graph, the applet group having the malicious flow guiding risk as a risk group; generating risk hint information for the risk group.

It should be noted that, the units, devices, modules, etc. illustrated in the above embodiments may be implemented by a computer chip or an entity, or implemented by a product with certain functions. For convenience of description, the above devices are described as being divided into various modules by functions, and are described separately. It is to be understood that, in implementing the present specification, functions of each module may be implemented in one or more pieces of software and/or hardware, or a module that implements the same function may be implemented by a combination of a plurality of sub-modules or sub-units, or the like. The above-described embodiments of the apparatus 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.

As can be seen from the above, the apparatus for processing skip data of an applet provided in the embodiments of the present specification may obtain finer and more comprehensive skip information of the applet by constructing and using the skip relation graph, and accurately perform data processing related to the applet according to the skip information of the applet.

An embodiment of the present specification further provides another apparatus for processing jump data of an applet, including: the acquisition module is used for acquiring jump data of the applet; the construction module is used for constructing a directional jump relational graph according to the jump data of the small program; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to one applet respectively, and two nodes corresponding to the applets with jump behaviors are connected through directed line segments; and the processing module is used for processing data related to the small program according to the directed jump relation graph.

Although the present specification provides method steps as described in the examples or flowcharts, additional or fewer steps may be included based on conventional or non-inventive means. The order of steps recited in the embodiments is merely one manner of performing the steps in a multitude of orders and does not represent the only order of execution. When an apparatus or client product in practice executes, it may execute sequentially or in parallel (e.g., in a parallel processor or multithreaded processing environment, or even in a distributed data processing environment) according to the embodiments or methods shown in the figures. The terms "comprises," "comprising," or any other variation thereof, are intended to cover a non-exclusive inclusion, such that a process, method, article, or apparatus that comprises a list of elements does not include only those elements but may include other elements not expressly listed or inherent to such process, method, article, or apparatus. Without further limitation, the presence of additional identical or equivalent elements in a process, method, article, or apparatus that comprises the recited elements is not excluded. The terms first, second, etc. are used to denote names, but not any particular order.

Those skilled in the art will also appreciate that, in addition to implementing the controller as pure computer readable program code, the same functionality can be implemented by logically programming method steps such that the controller is in the form of logic gates, switches, application specific integrated circuits, programmable logic controllers, embedded microcontrollers and the like. Such a controller may therefore be considered as a hardware component, and the means included therein for performing the various functions may also be considered as a structure within the hardware component. Or even means for performing the functions may be regarded as being both a software module for performing the method and a structure within a hardware component.

This description may be described in the general context of computer-executable instructions, such as program modules, being executed by a computer. Generally, program modules include routines, programs, objects, components, data structures, classes, etc. that perform particular tasks or implement particular abstract data types. The specification may also be practiced in distributed computing environments where tasks are performed by remote processing devices that are linked through a communications network. In a distributed computing environment, program modules may be located in both local and remote computer storage media including memory storage devices.

From the above description of the embodiments, it is clear to those skilled in the art that the present specification can be implemented by software plus necessary general hardware platform. With this understanding, the technical solutions in the present specification may be essentially embodied in the form of a software product, which may be stored in a storage medium, such as a ROM/RAM, a magnetic disk, an optical disk, etc., and includes several instructions for enabling a computer device (which may be a personal computer, a mobile terminal, a server, or a network device, etc.) to execute the methods described in the embodiments or some parts of the embodiments in the present specification.

The embodiments in the present specification are described in a progressive manner, and the same or similar parts among the embodiments are referred to each other, and each embodiment focuses on the differences from the other embodiments. The description is operational with numerous general purpose or special purpose computing system environments or configurations. For example: personal computers, server computers, hand-held or portable devices, tablet-type devices, multiprocessor systems, microprocessor-based systems, set top boxes, programmable electronic devices, network PCs, minicomputers, mainframe computers, distributed computing environments that include any of the above systems or devices, and the like.

While the specification has been described with examples, those skilled in the art will appreciate that there are numerous variations and permutations of the specification that do not depart from the spirit of the specification, and it is intended that the appended claims include such variations and modifications that do not depart from the spirit of the specification.

Claims

1. A method for processing jump data of an applet comprises the following steps:

acquiring jump data of the small program;

constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments;

determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected;

constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments;

and processing data related to the small program according to the directed jump relation graph.

2. The method of claim 1, the obtaining of jump data for an applet, comprising:

collecting operation records of operating the small programs in the target application by a user; the target application is provided with a plurality of small programs;

extracting a plurality of jump relation pairs according to the operation record; the jumping relation pair comprises identification information of a small jumping program and identification information of a small jumping program;

counting the user triggering times of the plurality of jump relation pairs according to the operation record;

and determining the plurality of jump relation pairs and the user triggering times of the plurality of jump relation pairs as jump data of the applet.

3. The method of claim 2, wherein constructing the undirected jump relation graph from jump data of the applet comprises:

setting a first node corresponding to the small program according to the identification information of the small program;

determining two first nodes with jump behaviors according to the jump data of the small program; and connecting the two first nodes with the jump behavior by using a undirected line segment to obtain the undirected jump relation graph.

4. The method of claim 2, wherein the determining a group of applets from the undirected jump relation graph comprises: determining a current small program group according to the undirected jump relation graph in the following mode:

taking a current node which is not currently divided into the small program group in the undirected jump relation graph as a starting node for traversing, traversing other first nodes which are not currently divided into the small program group except the current node in the undirected jump relation graph, and finding out the first node which is directly or indirectly connected with the current node through a undirected line segment as a group node of the current node;

and dividing the small programs corresponding to the current node and the small programs corresponding to the group nodes of the current node into a current small program group.

5. The method of claim 2, the building, for the applet group, a corresponding directed jump relationship graph, comprising: constructing a directed jump relation graph corresponding to the current applet group according to the following modes:

setting a corresponding second node according to the identification information of the small programs contained in the current small program group;

screening out an associated jump relation pair associated with the current small program group and the user triggering times of the associated jump relation pair from the jump data of the small program;

determining two second nodes with the jump behavior and the connection direction of the line segment between the two second nodes with the jump behavior according to the associated jump relationship pair;

determining the weight of the line segment between the two second nodes with the jump behavior according to the user triggering times of the associated jump relation pair;

and connecting the two second nodes with the jump behavior by using corresponding directed line segments according to the connecting direction of the line segments and the weights of the line segments to obtain a directed jump relational graph.

6. The method of claim 5, wherein the processing of data related to applets according to the directed jump relation graph comprises:

according to the directed jump relational graph, calculating preset graph attribute parameters of each second node in the directed jump relational graph; the preset graph attribute parameters comprise an intermediary centrality parameter and/or a degree centrality parameter;

and processing data related to the small program according to the preset map attribute parameters.

7. The method according to claim 6, wherein the performing data processing related to the applet according to the preset graph attribute parameters comprises:

determining a second node with the maximum value of preset graph attribute parameters in the directed jump relation graph as a concerned node;

determining the maximum value of the layer number of the jump path passing through the concerned node according to the directed jump relation graph;

comparing the maximum value of the layer number of the jump path passing through the concerned node with a preset layer number threshold value to obtain a corresponding comparison result;

and according to the comparison result, determining that the small program corresponding to the concerned node has a jump loss risk under the condition that the maximum value of the layer number of the jump path passing through the concerned node is determined to be greater than or equal to a preset layer number threshold value.

8. The method of claim 7, after determining that the applet corresponding to the node of interest is at risk of losing hops, the method further comprising:

generating adjustment prompt information aiming at the concerned node;

and sending the adjustment prompt information to a first program developer of the small program corresponding to the concerned node so as to prompt the first program developer to adjust a jump path related to the small program.

9. The method according to claim 6, wherein the performing data processing related to the applet according to the preset graph attribute parameters further comprises:

and determining the business relationship between the applets in the applet group corresponding to the directed jump relation graph according to the intermediate parameter and/or the degree centrality parameter of the second node in the directed jump relation graph.

10. The method of claim 9, further comprising:

and determining the small program responsible for flow distribution in the small program group corresponding to the directed jump relation graph as a target small program according to the intermediate parameter and/or the degree centrality parameter of the second node in the directed jump relation graph.

11. The method of claim 10, further comprising: and putting promotion information on the target small program.

12. The method of claim 6, after building a corresponding directed jump relationship graph for the applet group, the method further comprising:

detecting whether a newly added directed jump relation graph exists in the directed jump relation graph;

under the condition that the newly added directed jump relational graph is determined to exist, determining a mesopic parameter and/or a degree centrality parameter of a second node in the newly added directed jump relational graph and a graphic feature in the newly added directed jump relational graph;

and determining whether the small program group corresponding to the newly added directed jump relational graph has malicious drainage risk or not according to the intermediate parameter and/or the degree centrality parameter of the second node in the newly added directed jump relational graph and the graph characteristics in the newly added directed jump relational graph.

13. The method according to claim 12, after determining that the applet group corresponding to the newly-added directed jump relation graph has a malicious drainage risk, the method further comprising:

marking the small program groups with malicious drainage risks as risk groups;

generating risk hint information for the risk group.

14. A method for processing jump data of an applet comprises the following steps:

acquiring jump data of the small program;

constructing a directional jump relational graph according to the jump data of the small program; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to one applet respectively, and two nodes corresponding to the applets with jump behaviors are connected through directed line segments;

15. A method for processing jump data comprises the following steps:

acquiring jump data of a data object;

constructing a directed jump relational graph according to the jump data of the data object; the directed jump relational graph comprises a plurality of nodes, each node in the plurality of nodes corresponds to a data object, and two nodes corresponding to the data objects with jump behaviors are connected through directed line segments;

and processing data related to the data object according to the directed jump relation graph.

16. The method of claim 15, the data object comprising at least one of: page, plug-in, applet.

17. An apparatus for processing jump data of an applet, comprising:

the acquisition module is used for acquiring jump data of the applet;

the first construction module is used for constructing a undirected jump relation graph according to the jump data of the small program; the undirected jump relational graph comprises a plurality of first nodes, each first node in the plurality of first nodes corresponds to one applet respectively, and two first nodes corresponding to the applets with jump behaviors are connected through undirected segments;

the determining module is used for determining an applet group according to the undirected jump relation graph; wherein, the first nodes corresponding to the small programs in the small program group are directly or indirectly connected;

the second construction module is used for constructing a corresponding directed jump relation graph aiming at the small program group; the directed jump relational graph comprises a plurality of second nodes, each second node in the plurality of second nodes corresponds to one applet in the applet group, and two second nodes corresponding to the applets with jump behaviors are connected through directed line segments;

and the processing module is used for processing data related to the small program according to the directed jump relation graph.

18. A server comprising a processor and a memory for storing processor-executable instructions which, when executed by the processor, implement the steps of the method of any one of claims 1 to 13.