CN117708412A

CN117708412A - Enterprise dynamic pushing method and device, electronic equipment and readable medium

Info

Publication number: CN117708412A
Application number: CN202311431851.7A
Authority: CN
Inventors: 姜琳杰; 高建磊; 赛哲锋
Original assignee: Lingxi Technology Co ltd
Current assignee: Lingxi Technology Co ltd
Priority date: 2023-10-31
Filing date: 2023-10-31
Publication date: 2024-03-15

Abstract

The embodiment of the disclosure discloses an enterprise dynamic pushing method, an enterprise dynamic pushing device, electronic equipment and a readable medium. One embodiment of the method comprises the following steps: acquiring user information, enterprise dynamics of a target enterprise and an enterprise information mapping table of the target enterprise; dynamically dividing an enterprise into at least one message list to be pushed according to an enterprise information mapping table; selecting at least one target type list from at least one message list to be pushed according to the user setting type information, wherein the target type list comprises at least one target message; determining the preference degree of a target user for the target message according to the user history information; and selecting a preset number of target messages to be sent to the target users according to the preference degree of the target users for the target messages. The implementation combines the types focused by the user, realizes dynamic and refined pushing of enterprises, further reduces the retrieval and inquiry time of the user and improves the experience of the user.

Description

Enterprise dynamic pushing method and device, electronic equipment and readable medium

Technical Field

Embodiments of the present disclosure relate to the field of computer technology, and in particular, to an enterprise dynamic pushing method, an apparatus, an electronic device, and a computer readable medium.

Background

The dynamic information of the concerned enterprises is acquired by the enterprises or individual users through information retrieval in daily work. The type of the enterprise dynamic information comprises information such as enterprise business change, management risk, supervision risk, judicial risk and the like.

When the enterprise concerned by the user has newly added dynamic information, all the newly added dynamic information is sent to the user, so that the pushing purpose is achieved. There are three problems with this push approach: the first is that the pushed enterprise dynamic information is too much, and the user can not quickly find the dynamic content focused on; secondly, the type of the enterprise dynamic information is not refined, the purpose of accurately distinguishing the enterprise dynamic information cannot be achieved, and a user also needs to waste a large amount of time to read the content so as to determine the tendency of the enterprise dynamic content; thirdly, the dynamic information of the enterprise is ordered without combining with the reading habit of the user, so that the experience of the user is reduced.

Disclosure of Invention

The disclosure is in part intended to introduce concepts in a simplified form that are further described below in the detailed description. The disclosure is not intended to identify key features or essential features of the claimed subject matter, nor is it intended to be used to limit the scope of the claimed subject matter.

Some embodiments of the present disclosure propose an enterprise dynamic pushing method, apparatus, electronic device, and computer readable medium to solve the technical problems mentioned in the background section above.

In a first aspect, some embodiments of the present disclosure provide an enterprise dynamic pushing method, including: acquiring user information, enterprise dynamics of a target enterprise and an enterprise information mapping table of the target enterprise, wherein the user information comprises user history information and user setting type information; dynamically dividing the enterprise into at least one message list to be pushed according to the enterprise information mapping table; selecting at least one target type list from the at least one message list to be pushed according to the user setting type information, wherein the target type list comprises at least one target message; for each target message of each target type list in the at least one target type list, determining the preference degree of the target user for the target message according to the user history information; and selecting a predetermined number of target messages to be sent to the target users according to the preference degree of the target users for the target messages.

In a second aspect, some embodiments of the present disclosure provide an enterprise dynamic pushing apparatus, comprising: the system comprises an acquisition unit, a target enterprise, an enterprise setting unit and a storage unit, wherein the acquisition unit is configured to acquire user information, enterprise dynamics of the target enterprise and an enterprise information mapping table of the target enterprise, and the user information comprises user history information and user setting type information; the dividing unit is configured to divide the enterprise into at least one message list to be pushed dynamically according to the enterprise information mapping table; a selecting unit configured to select at least one target type list from the at least one message list to be pushed according to the user setting type information, where the target type list includes at least one target message; a determining unit configured to determine, for each target message of each target type list in the at least one target type list, a preference degree of a target user for the target message according to the user history information; and the sending unit is configured to select a predetermined number of target messages to send to the target users according to the preference degree of the target users for the target messages.

In a third aspect, an embodiment of the present application provides an electronic device, where the network device includes: one or more processors; a storage means for storing one or more programs; the one or more programs, when executed by the one or more processors, cause the one or more processors to implement the method as described in any of the implementations of the first aspect.

In a fourth aspect, embodiments of the present application provide a computer readable medium having stored thereon a computer program which, when executed by a processor, implements a method as described in any of the implementations of the first aspect.

One of the above embodiments of the present disclosure has the following advantageous effects: firstly, extracting more refined labels (or types) based on dynamic content of enterprises, classifying a large number of enterprise dynamics, then dividing the enterprise dynamic content more accurately, combining the types focused by users to perform refined pushing, and meanwhile, based on content read by the historic users, ranking the content interested by the users, selecting the content interested by the users to push, thereby reducing user searching and inquiring time and improving user experience.

Drawings

The above and other features, advantages, and aspects of embodiments of the present disclosure will become more apparent by reference to the following detailed description when taken in conjunction with the accompanying drawings. The same or similar reference numbers will be used throughout the drawings to refer to the same or like elements. It should be understood that the figures are schematic and that elements and components are not necessarily drawn to scale.

FIG. 1 is a schematic diagram of an application scenario of an enterprise dynamic push method according to some embodiments of the present disclosure;

FIG. 2 is a flow chart of some embodiments of an enterprise dynamic push method according to the present disclosure;

FIG. 3 is a schematic diagram of some embodiments of an enterprise dynamic pushing apparatus in accordance with the present disclosure;

fig. 4 is a schematic structural diagram of an electronic device suitable for use in implementing some embodiments of the present disclosure.

Detailed Description

Embodiments of the present disclosure will be described in more detail below with reference to the accompanying drawings. While certain embodiments of the present disclosure are shown in the drawings, it should be understood that the present disclosure may be embodied in various forms and should not be construed as limited to the embodiments set forth herein. Rather, these embodiments are provided so that this disclosure will be thorough and complete. It should be understood that the drawings and embodiments of the present disclosure are for illustration purposes only and are not intended to limit the scope of the present disclosure.

It should be noted that, for convenience of description, only the portions related to the present invention are shown in the drawings. Embodiments of the present disclosure and features of embodiments may be combined with each other without conflict.

It should be noted that the terms "first," "second," and the like in this disclosure are merely used to distinguish between different devices, modules, or units and are not used to define an order or interdependence of functions performed by the devices, modules, or units.

It should be noted that references to "one", "a plurality" and "a plurality" in this disclosure are intended to be illustrative rather than limiting, and those of ordinary skill in the art will appreciate that "one or more" is intended to be understood as "one or more" unless the context clearly indicates otherwise.

The names of messages or information interacted between the various devices in the embodiments of the present disclosure are for illustrative purposes only and are not intended to limit the scope of such messages or information.

The present disclosure will be described in detail below with reference to the accompanying drawings in conjunction with embodiments.

Fig. 1 is a schematic diagram of an application scenario of an enterprise dynamic pushing method according to some embodiments of the present disclosure.

As shown in fig. 1, the server 101 may obtain user information 102, enterprise dynamics 103 of a target enterprise, and an enterprise information mapping table 104 of the target enterprise, where the user information includes user history information 105 and user setting type information 106, then divide the enterprise dynamics 103 into at least one to-be-pushed message list 107 according to the enterprise information mapping table 104, then select at least one target type list 108 from the at least one to-be-pushed message list 107 according to the user setting type information 106, where the target type list 108 includes at least one target message 109, then determine a preference 110 of the target user for the target message 109 according to the user history information 105, and finally select a predetermined number of target messages 109 according to the preference 110 of the target user for the target message 109 and send the selected target message 109 to the target user.

It will be appreciated that an enterprise dynamic pushing method may be performed by a terminal device, or may also be performed by the server 101, where the main execution body of the method may further include a device formed by integrating the terminal device with the server 101 through a network, or may also be performed by various software programs. The terminal device may be, among other things, various electronic devices with information processing capabilities including, but not limited to, smartphones, tablet computers, electronic book readers, laptop and desktop computers, and the like. The execution body may be embodied as a server 101, software, or the like. When the execution subject is software, the execution subject can be installed in the electronic device enumerated above. It may be implemented as a plurality of software or software modules, for example, for providing distributed services, or as a single software or software module. The present invention is not particularly limited herein.

It should be understood that the number of servers in fig. 1 is merely illustrative. There may be any number of servers, as desired for implementation.

With continued reference to fig. 2, a flow 200 of some embodiments of an enterprise dynamic pushing method according to the present disclosure is shown. The enterprise dynamic pushing method comprises the following steps:

step 201, obtaining user information, enterprise dynamics of a target enterprise, and an enterprise information mapping table of the target enterprise.

In some embodiments, an execution body of the enterprise dynamic push method (for example, a server shown in fig. 1) may acquire, through a wired connection manner or a wireless connection manner, user information, enterprise dynamics of a target enterprise, and an enterprise information mapping table of the target enterprise, where the user information includes user history information and user setting type information. It should be noted that the wireless connection may include, but is not limited to, 3G/4G connections, wiFi connections, bluetooth connections, wiMAX connections, zigbee connections, UWB (ultra wideband) connections, and other now known or later developed wireless connection means.

Specifically, the execution body may obtain an enterprise dynamic classification mapping table, enterprise dynamic information, enterprise dynamic setting information and user reading information, where the enterprise dynamic classification mapping table is a mapping table of enterprise dynamic information and type; the enterprise dynamic information comprises enterprise industrial and commercial basic information, enterprise dynamic content, release time and the like; the enterprise dynamic setting information comprises the type of enterprise dynamic information set by a user; the user history information comprises the dynamic type, content, reading time, whether comments are made and whether praise is made of the enterprise read by the user; the execution body can acquire enterprise dynamic information through the web crawler, and construct an enterprise dynamic classification mapping table according to a keyword frequency statistics mode.

Step 202, dynamically dividing the enterprise into at least one message list to be pushed according to the enterprise information mapping table.

In some embodiments, the executing entity (e.g., the server shown in fig. 1) may dynamically divide the enterprise into at least one message list to be pushed based on the enterprise information mapping table obtained in step 201.

In some optional implementations of some embodiments, the executing entity may obtain a second-level tag and a third-level tag under a dynamic type in the enterprise information mapping table, where the enterprise information mapping table is used to characterize the enterprise dynamic and a dynamic type corresponding to the enterprise dynamic, and the second-level tag corresponds to at least one third-level tag; extracting keywords in the enterprise dynamics; matching the keywords with the secondary labels and the tertiary labels to obtain secondary label matching times and tertiary label matching times; selecting the type with the highest matching frequency of the key word and the secondary label as the secondary classification type of the enterprise dynamic information; selecting the type with the highest matching frequency of the keyword and the three-level label as the three-level classification type of the enterprise dynamic information; traversing the secondary classification type and the tertiary classification type, and determining the final dynamic hierarchical corresponding relation of the enterprise based on the following rules:

x (p) > y (p), and emptying the three-level tag;

x (p) < y (p), changing the secondary label into a secondary label corresponding to the tertiary label;

x (p) =y (p), and the secondary label is changed into a secondary label corresponding to the tertiary label;

x (p) =0, and deleting the secondary label of the enterprise dynamic type;

y (p) =0, and deleting the three-level label of the enterprise dynamic type;

wherein x (p) represents the number of secondary label matching times of the enterprise dynamic type;

y (p) represents the dynamic three-level label matching times of the enterprise;

and dynamically dividing the enterprise into at least one message list to be pushed according to the hierarchical corresponding relation.

Specifically, a first-level label (dynamic type of enterprises), a second-level label and a third-level label are constructed, and industrial and commercial information is taken as an example: constructing a primary label (dynamic type of enterprise) industrial and commercial change (number zb_gsbg, core keyword: industrial and commercial change, etc.), and constructing a secondary label: stakeholder change (number zb_gsbg_001, core keywords: stakeholder change, stakeholder adjustment, etc.), actual controller change (number zb_gsbg_002, core keywords: actual controller change, etc.), registered address change (number zb_gsbg_003), registered capital change (number zb_gsbg_004), three-level index is constructed: stock descent (number zb_gsbg_001_001), stock ascent (number zb_gsbg_001_002), stock withdrawal (number zb_gsbg_001_003), stock addition (number zb_gsbg_001_004), indoor migration (number zb_gsbg_003_001), intra-provincial migration (number zb_gsbg_003_002), extra-provincial migration (number zb_gsbg_003_003_003), fund addition (number zb_gsbg_004_001), and fund subtraction (number zb_gsbg_004_002).

After the enterprise dynamic information is obtained, core keywords are extracted by utilizing an algorithm according to the information such as the title, keywords, content, release time and the like of the enterprise dynamic information, the keywords in the enterprise dynamic information are matched with the keywords corresponding to the second level and the third level of the enterprise information mapping table, and the dynamic types meeting the conditions are proposed for the second level and the third level, so that the enterprise dynamic content can be more accurately divided, the types focused by users can be combined, and the users can be pushed in a refined mode, so that the first technical problem and the second technical problem in the background technology are solved: the first is that the pushed enterprise dynamic information is too much, and the user can not quickly find the dynamic content focused on; secondly, the type of the enterprise dynamic information is not refined, the purpose of accurately distinguishing the enterprise dynamic information cannot be achieved, and a user also needs to waste a large amount of time to read the content so as to determine the tendency of the enterprise dynamic content.

Step 203, selecting at least one target type list from the at least one message list to be pushed according to the user setting type information, wherein the target type list comprises at least one target message.

In some embodiments, the executing body may select at least one target type list from the at least one message list to be pushed according to the user setting type information, where the target type list includes at least one target message.

Step 204, for each target message in each target type list in the at least one target type list, determining a preference degree of the target user for the target message according to the user history information.

In some embodiments, for each target message in each target type list in the at least one target type list, the executing entity may determine a preference degree of the target user for the target message according to the user history information.

In some optional implementations of some embodiments, the executing entity may determine the preference level of the target message according to the following formula: m= Σ (h1×t+h2×c+h3×d), where m represents the preference degree of the target message; t represents the expected time of reading the target message by the target user, 0< t <1; c represents whether the user history information is commented on a similar message with the target message; d represents whether the user history information is praised by a similar message to the target message; h1, h2, h3 represent different preset weights, h1+h2+h3=1. Based on the above, the user interestingness for each dynamic is calculated. And classifying the dynamic contents according to the classified contents of the enterprise information mapping table, and sorting according to the scores.

And finally, sorting the content to be pushed according to the content score to form a personalized push list.

In some alternative implementations of some embodiments, the estimated time for the target user to read the target message is determined according to the following user-reading time distribution probability function:

wherein μ represents a preset constant determined according to the type of the above-mentioned target message;

sigma 2 represents a predetermined constant determined according to the type of the target message.

Specifically, the average reading speed of a default average person is R, each piece of dynamic information is based on the total content, and the estimated time for completing the dynamic reading is calculated through the average reading speed. User actual reading time = dynamic content page closing time-starting time after page loading is completed, wherein R is 300-500 words/min, μ, σ -2 of different dynamic content correspond to different normal distributions. Taking the example of a user reading enterprise business changing content: μ=400, σ=100, and thus, can be set in different σs, the value of the score corresponding to the user reading time, i.e. t, is typically 0< t <1.

Aiming at personalized push list data, combining the reading time required by enterprise dynamics and the reading time of articles in user habits to find dynamic information conforming to the reading time of the users, thereby avoiding the situation that the users have no patience to read the whole text due to overlong articles, and in addition, avoiding the problem that the user experience is poor when the information in the too short articles is less, forming a personalized push list for each user, and further solving the problems II and III in the background art: secondly, the type of the enterprise dynamic information is not refined, the purpose of accurately distinguishing the enterprise dynamic information cannot be achieved, and a user also needs to waste a large amount of time to read the content so as to determine the tendency of the enterprise dynamic content; thirdly, the dynamic information of the enterprise is ordered without combining with the reading habit of the user, so that the experience of the user is reduced.

Step 205, selecting a predetermined number of target messages to send to the target users according to the preference degree of the target users for the target messages.

In some embodiments, the executing entity may select a predetermined number of target messages to send to the target user according to the preference of the target user for the target messages.

Specifically, K1 target messages are generally selected, and K1 takes a number within 20, typically 15.

With further reference to fig. 3, as an implementation of the method illustrated in the foregoing figures, the present disclosure provides some embodiments of an enterprise dynamic pushing apparatus, which apparatus embodiments correspond to those illustrated in fig. 2, and which apparatus is particularly applicable to various electronic devices.

As shown in fig. 3, an enterprise dynamic pushing apparatus 300 of some embodiments includes: an acquisition unit 301, a segmentation unit 302, a selection unit 303, a determination unit 304, and a transmission unit 305. An obtaining unit 301 configured to obtain user information, enterprise dynamics of a target enterprise, and an enterprise information mapping table of the target enterprise, where the user information includes user history information and user setting type information; a dividing unit 302 configured to dynamically divide the enterprise into at least one message list to be pushed according to the enterprise information mapping table; a selecting unit 303 configured to select at least one target type list from the at least one message list to be pushed according to the user setting type information, where the target type list includes at least one target message; a determining unit 304 configured to determine, for each target message of each target type list in the at least one target type list, a preference degree of the target user for the target message according to the user history information; and a transmitting unit 305 configured to select a predetermined number of target messages to be transmitted to the target user according to the preference degree of the target user for the target messages.

In an alternative implementation of some embodiments, the determining unit is further configured to: determining the preference degree of the target message according to the following formula: m= Σ (h1×t+h2×c+h3×d), where m represents the preference degree of the target message; t represents the expected time of reading the target message by the target user, 0< t <1; c represents whether the user history information is commented on a similar message with the target message; d represents whether the user history information is praised by a similar message to the target message; h1, h2, h3 represent different preset weights, h1+h2+h3=1.

In an alternative implementation of some embodiments, the estimated time for the target user to read the target message is determined according to the following user-reading time distribution probability function:

wherein μ represents a preset constant determined according to the type of the above-mentioned target message; sigma 2 represents a predetermined constant determined according to the type of the target message.

In an alternative implementation of some embodiments, the above-mentioned segmentation unit is further configured to: acquiring a secondary label and a tertiary label under a dynamic type in the enterprise information mapping table, wherein the enterprise information mapping table is used for representing the enterprise dynamic and the dynamic type corresponding to the enterprise dynamic, and the secondary label corresponds to at least one tertiary label; extracting keywords in the enterprise dynamics; matching the keywords with the secondary labels and the tertiary labels to obtain secondary label matching times and tertiary label matching times; selecting the type with the highest matching frequency of the key word and the secondary label as the secondary classification type of the enterprise dynamic information; selecting the type with the highest matching frequency of the keyword and the three-level label as the three-level classification type of the enterprise dynamic information; traversing the secondary classification type and the tertiary classification type, and determining the final dynamic hierarchical corresponding relation of the enterprise based on the following rules: x (p) > y (p), and emptying the three-level tag; x (p) < y (p), changing the secondary label into a secondary label corresponding to the tertiary label; x (p) =y (p), and the secondary label is changed into a secondary label corresponding to the tertiary label; x (p) =0, deleting the secondary label of the enterprise dynamic type, y (p) =0, deleting the tertiary label of the enterprise dynamic type, wherein x (p) represents the matching times of the secondary label of the enterprise dynamic type; y (p) represents the dynamic three-level label matching times of the enterprise; and dynamically dividing the enterprise into at least one message list to be pushed according to the hierarchical corresponding relation.

It will be appreciated that the elements described in the apparatus 300 correspond to the various steps in the method described with reference to fig. 2. Thus, the operations, features and resulting benefits described above with respect to the method are equally applicable to the apparatus 300 and the units contained therein, and are not described in detail herein.

Referring now to fig. 4, a schematic diagram of an electronic device (e.g., server in fig. 1) 400 suitable for use in implementing some embodiments of the present disclosure is shown. The electronic device shown in fig. 4 is merely an example and should not impose any limitations on the functionality and scope of use of embodiments of the present disclosure.

As shown in fig. 4, the electronic device 400 may include a processing means (e.g., a central processing unit, a graphics processor, etc.) 401, which may perform various suitable actions and processes according to a program stored in a Read Only Memory (ROM) 402 or a program loaded from a storage means 408 into a Random Access Memory (RAM) 403. In the RAM 403, various programs and data necessary for the operation of the electronic device 400 are also stored. The processing device 401, the ROM 402, and the RAM 403 are connected to each other by a bus 404. An input/output (I/O) interface 405 is also connected to bus 404.

In general, the following devices may be connected to the I/O interface 405: input devices 406 including, for example, a touch screen, touchpad, keyboard, mouse, camera, microphone, accelerometer, gyroscope, etc.; an output device 407 including, for example, a Liquid Crystal Display (LCD), a speaker, a vibrator, and the like; and a communication device 409. The communication means 409 may allow the electronic device 400 to communicate with other devices wirelessly or by wire to exchange data. While fig. 4 shows an electronic device 400 having various means, it is to be understood that not all of the illustrated means are required to be implemented or provided. More or fewer devices may be implemented or provided instead. Each block shown in fig. 4 may represent one device or a plurality of devices as needed.

In particular, according to some embodiments of the present disclosure, the processes described above with reference to flowcharts may be implemented as computer software programs. For example, some embodiments of the present disclosure include a computer program product comprising a computer program embodied on a computer readable medium, the computer program comprising program code for performing the method shown in the flow chart. In such embodiments, the computer program may be downloaded and installed from a network via communications device 409, or from storage 408, or from ROM 402. The above-described functions defined in the methods of some embodiments of the present disclosure are performed when the computer program is executed by the processing device 401.

It should be noted that, in some embodiments of the present disclosure, the computer readable medium may be a computer readable signal medium or a computer readable storage medium, or any combination of the two. The computer readable storage medium can be, for example, but not limited to, an electronic, magnetic, optical, electromagnetic, infrared, or semiconductor system, apparatus, or device, or a combination of any of the foregoing. More specific examples of the computer-readable storage medium may include, but are not limited to: an electrical connection having one or more wires, a portable computer diskette, a hard disk, a Random Access Memory (RAM), a read-only memory (ROM), an erasable programmable read-only memory (EPROM or flash memory), an optical fiber, a portable compact disc read-only memory (CD-ROM), an optical storage device, a magnetic storage device, or any suitable combination of the foregoing. In some embodiments of the present disclosure, a computer readable storage medium may be any tangible medium that can contain, or store a program for use by or in connection with an instruction execution system, apparatus, or device. In some embodiments of the present disclosure, however, the computer-readable signal medium may comprise a data signal propagated in baseband or as part of a carrier wave, with the computer-readable program code embodied therein. Such a propagated data signal may take any of a variety of forms, including, but not limited to, electro-magnetic, optical, or any suitable combination of the foregoing. A computer readable signal medium may also be any computer readable medium that is not a computer readable storage medium and that can communicate, propagate, or transport a program for use by or in connection with an instruction execution system, apparatus, or device. Program code embodied on a computer readable medium may be transmitted using any appropriate medium, including but not limited to: electrical wires, fiber optic cables, RF (radio frequency), and the like, or any suitable combination of the foregoing.

In some implementations, the clients, servers may communicate using any currently known or future developed network protocol, such as HTTP (HyperText Transfer Protocol ), and may be interconnected with any form or medium of digital data communication (e.g., a communication network). Examples of communication networks include a local area network ("LAN"), a wide area network ("WAN"), the internet (e.g., the internet), and peer-to-peer networks (e.g., ad hoc peer-to-peer networks), as well as any currently known or future developed networks.

The computer readable medium may be contained in the electronic device; or may exist alone without being incorporated into the electronic device. The computer readable medium carries one or more programs which, when executed by the electronic device, cause the electronic device to: acquiring user information, enterprise dynamics of a target enterprise and an enterprise information mapping table of the target enterprise, wherein the user information comprises user history information and user setting type information; dynamically dividing the enterprise into at least one message list to be pushed according to the enterprise information mapping table; selecting at least one target type list from the at least one message list to be pushed according to the user setting type information, wherein the target type list comprises at least one target message; for each target message of each target type list in the at least one target type list, determining the preference degree of the target user for the target message according to the user history information; and selecting a predetermined number of target messages to be sent to the target users according to the preference degree of the target users for the target messages.

Computer program code for carrying out operations for some embodiments of the present disclosure may be written in one or more programming languages, including an object oriented programming language such as Java, smalltalk, C ++ and conventional procedural programming languages, such as the "C" programming language or similar programming languages. The program code may execute entirely on the user's computer, partly on the user's computer, as a stand-alone software package, partly on the user's computer and partly on a remote computer or entirely on the remote computer or server. In the case of a remote computer, the remote computer may be connected to the user's computer through any kind of network, including a Local Area Network (LAN) or a Wide Area Network (WAN), or may be connected to an external computer (for example, through the Internet using an Internet service provider).

The flowcharts and block diagrams in the figures illustrate the architecture, functionality, and operation of possible implementations of systems, methods and computer program products according to various embodiments of the present disclosure. In this regard, each block in the flowchart or block diagrams may represent a module, segment, or portion of code, which comprises one or more executable instructions for implementing the specified logical function(s). It should also be noted that, in some alternative implementations, the functions noted in the block may occur out of the order noted in the figures. For example, two blocks shown in succession may, in fact, be executed substantially concurrently, or the blocks may sometimes be executed in the reverse order, depending upon the functionality involved. It will also be noted that each block of the block diagrams and/or flowchart illustration, and combinations of blocks in the block diagrams and/or flowchart illustration, can be implemented by special purpose hardware-based systems which perform the specified functions or acts, or combinations of special purpose hardware and computer instructions.

The units described in some embodiments of the present disclosure may be implemented by means of software, or may be implemented by means of hardware. The described units may also be provided in a processor, for example, described as: a processor includes an acquisition unit, a segmentation unit, a selection unit, a determination unit, and a transmission unit. The names of these units do not limit the unit itself in some cases, and for example, the acquisition unit may also be described as "a unit that acquires user information including user history information and user setting type information", an enterprise dynamic of a target enterprise, an enterprise information mapping table of a target enterprise ".

The functions described above herein may be performed, at least in part, by one or more hardware logic components. For example, without limitation, exemplary types of hardware logic components that may be used include: a Field Programmable Gate Array (FPGA), an Application Specific Integrated Circuit (ASIC), an Application Specific Standard Product (ASSP), a system on a chip (SOC), a Complex Programmable Logic Device (CPLD), and the like.

The foregoing description is only of the preferred embodiments of the present disclosure and description of the principles of the technology being employed. It will be appreciated by those skilled in the art that the scope of the invention in the embodiments of the present disclosure is not limited to the specific combination of the above technical features, but encompasses other technical features formed by any combination of the above technical features or their equivalents without departing from the spirit of the invention. Such as the above-described features, are mutually substituted with (but not limited to) the features having similar functions disclosed in the embodiments of the present disclosure.

Claims

1. An enterprise dynamic pushing method, comprising:

acquiring user information, enterprise dynamics of a target enterprise and an enterprise information mapping table of the target enterprise, wherein the user information comprises user history information and user setting type information;

dynamically dividing the enterprise into at least one message list to be pushed according to the enterprise information mapping table, including: acquiring a secondary label and a tertiary label under a dynamic type in the enterprise information mapping table, wherein the enterprise information mapping table is used for representing the enterprise dynamic and the dynamic type corresponding to the enterprise dynamic, and the secondary label corresponds to at least one tertiary label; extracting keywords in the enterprise dynamics; matching the keywords with the secondary labels and the tertiary labels to obtain secondary label matching times and tertiary label matching times; selecting the type with the largest matching times of the keyword and the secondary label as the secondary classification type of the enterprise dynamic information; selecting the type with the highest matching frequency of the keyword and the three-level label as the three-level classification type of the enterprise dynamic information; traversing the secondary classification type and the tertiary classification type, and determining the final dynamic hierarchical correspondence of the enterprise based on the following rules: x (p) > y (p), and emptying the tertiary tag; x (p) < y (p), changing the secondary label into a secondary label corresponding to the tertiary label; x (p) =y (p), changing the secondary label into a secondary label corresponding to the tertiary label; x (p) =0, deleting the secondary label of the enterprise dynamic type, y (p) =0, deleting the tertiary label of the enterprise dynamic type, wherein x (p) represents the matching times of the secondary label of the enterprise dynamic type; y (p) represents the dynamic three-level tag matching times of the enterprise; dynamically dividing the enterprise into at least one message list to be pushed according to the hierarchical corresponding relation;

selecting at least one target type list from the at least one message list to be pushed according to the user setting type information, wherein the target type list comprises at least one target message;

for each target message of each target type list in the at least one target type list, determining the preference degree of a target user for the target message according to the user history information;

and selecting a preset number of target messages to send to the target users according to the preference degree of the target users for the target messages.

2. The method of claim 1, wherein the determining the preference of the target user for the target message based on the user history information comprises:

determining the preference degree of the target message according to the following formula:

m= Σ (h1×t+h2×c+h3×d), where m represents the preference of the target message;

t represents the expected time of the target user reading the target message, 0< t <1;

c represents whether similar messages with the target message in the user history information are commented;

d represents whether similar messages to the target message in the user history information are praise or not;

h1, h2, h3 represent different preset weights, h1+h2+h3=1.

3. The method of claim 2, wherein the predicted time for the target user to read the target message is determined according to the following user-read time distribution probability function:

，

wherein μ represents a preset constant determined according to the type of the target message;

sigma 2 represents a preset constant determined according to the type of the target message.

4. An enterprise dynamic pushing apparatus, comprising:

the system comprises an acquisition unit, a target enterprise generation unit and a storage unit, wherein the acquisition unit is configured to acquire user information, enterprise dynamics of the target enterprise and an enterprise information mapping table of the target enterprise, wherein the user information comprises user history information and user setting type information;

a dividing unit configured to dynamically divide the enterprise into at least one message list to be pushed according to the enterprise information mapping table, including: acquiring a secondary label and a tertiary label under a dynamic type in the enterprise information mapping table, wherein the enterprise information mapping table is used for representing the enterprise dynamic and the dynamic type corresponding to the enterprise dynamic, and the secondary label corresponds to at least one tertiary label; extracting keywords in the enterprise dynamics; matching the keywords with the secondary labels and the tertiary labels to obtain secondary label matching times and tertiary label matching times; selecting the type with the largest matching times of the keyword and the secondary label as the secondary classification type of the enterprise dynamic information; selecting the type with the highest matching frequency of the keyword and the three-level label as the three-level classification type of the enterprise dynamic information; traversing the secondary classification type and the tertiary classification type, and determining the final dynamic hierarchical correspondence of the enterprise based on the following rules: x (p) > y (p), and emptying the tertiary tag; x (p) < y (p), changing the secondary label into a secondary label corresponding to the tertiary label; x (p) =y (p), changing the secondary label into a secondary label corresponding to the tertiary label; x (p) =0, deleting the secondary label of the enterprise dynamic type, y (p) =0, deleting the tertiary label of the enterprise dynamic type, wherein x (p) represents the matching times of the secondary label of the enterprise dynamic type; y (p) represents the dynamic three-level tag matching times of the enterprise; dynamically dividing the enterprise into at least one message list to be pushed according to the hierarchical corresponding relation;

a selecting unit configured to select at least one target type list from the at least one message list to be pushed according to the user setting type information, wherein the target type list comprises at least one target message;

a determining unit configured to determine, for each target message of each target type list in the at least one target type list, a preference degree of a target user for the target message according to the user history information;

and the sending unit is configured to select a preset number of target messages to send to the target users according to the preference degree of the target users for the target messages.

5. The apparatus of claim 4, wherein the determining unit is further configured to:

h1, h2, h3 represent different preset weights, h1+h2+h3=1.

6. The apparatus of claim 5, wherein the predicted time for the target user to read the target message is determined according to the following user-read time distribution probability function:

，

7. An electronic device, comprising:

one or more processors;

a storage device having one or more programs stored thereon,

when executed by the one or more processors, causes the one or more processors to implement the method of any of claims 1-3.

8. A computer readable medium having stored thereon a computer program, wherein the program when executed by a processor implements the method of any of claims 1-3.