CN108648017A - It is easy to user demand matching process, device, equipment and the storage medium of extension - Google Patents
It is easy to user demand matching process, device, equipment and the storage medium of extension Download PDFInfo
- Publication number
- CN108648017A CN108648017A CN201810457743.XA CN201810457743A CN108648017A CN 108648017 A CN108648017 A CN 108648017A CN 201810457743 A CN201810457743 A CN 201810457743A CN 108648017 A CN108648017 A CN 108648017A
- Authority
- CN
- China
- Prior art keywords
- information
- user
- node
- logic
- consigner
- Prior art date
- Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
- Granted
Links
Classifications
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q30/00—Commerce
- G06Q30/02—Marketing; Price estimation or determination; Fundraising
- G06Q30/0201—Market modelling; Market analysis; Collecting market data
- G06Q30/0202—Market predictions or forecasting for commercial activities
-
- G—PHYSICS
- G06—COMPUTING; CALCULATING OR COUNTING
- G06Q—INFORMATION AND COMMUNICATION TECHNOLOGY [ICT] SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES; SYSTEMS OR METHODS SPECIALLY ADAPTED FOR ADMINISTRATIVE, COMMERCIAL, FINANCIAL, MANAGERIAL OR SUPERVISORY PURPOSES, NOT OTHERWISE PROVIDED FOR
- G06Q40/00—Finance; Insurance; Tax strategies; Processing of corporate or income taxes
- G06Q40/03—Credit; Loans; Processing thereof
Abstract
The invention discloses a kind of user demand matching process being easy to extension comprising following steps：The entrusted information for receiving consigner, by the entrusted information according to keyword construction logic tree；User information is acquired, qualification information corresponding with leaf node in the logic tree in the user information is extracted；According to the qualification information from the leaf node of logic tree, logic tree is traversed, target user is obtained, the target user is logic root vertex operation result corresponding user when being true；The user information of the target user is sent to consigner.The invention also discloses a kind of user demand coalignment, electronic equipment and storage mediums being easy to extension.The present invention according to its keyword construction logic tree, when the entrusted information i.e. keyword that changes changes, is directly adjusted correspondingly on logic tree without rebuilding Matching Model again by the entrusted information of consigner, autgmentability is strong, meanwhile speed is fast, it is efficient.
Description
Technical field
The present invention relates to field of information processing, specially a kind of user demand matching process, device, electronics being easy to extension
Equipment and storage medium.
Background technology
In the side of accepting commission of advertising agency, such as credit agency entrusts, and is believed associated user according to entrusted information
During breath is sent to consigner, if the entrusted information of consigner changes, matching condition or mould are rebuild
Type, autgmentability is poor, and efficiency is low.
Invention content
Present invention aims at provide a kind of user demand matching process, device, electronic equipment and storage being easy to extension
Medium.The user demand matching process for being easy to extension can be inserted into logic at any time according to the entrusted information change conditions of consigner
Matching Model is adjusted in tree, is easy to extend, information matches efficiency is provided.
In order to achieve the above object, technical scheme of the present invention has：
A kind of user demand matching process being easy to extension comprising following steps：
The entrusted information for receiving consigner, by the entrusted information according to keyword construction logic tree；
User information is acquired, qualification letter corresponding with leaf node in the logic tree in the user information is extracted
Breath；
According to the qualification information from the leaf node of logic tree, logic tree is traversed, target user, the target are obtained
User is logic root vertex operation result corresponding user when being true；
The user information of the target user is sent to consigner.
Preferably, the entrusted information is arranged into formation condition information and logical message, conditional information is patrolled with corresponding
It is associated to collect information；
Using conditional information as the leaf node of logic tree, using logical message as the upper layer node of leaf node；
According to the leaf node and associated upper layer node construction logic tree.
Preferably, the upper layer node includes the i-th father node and root node, and 1≤i≤n, the 1st father node is leaf node
Father node, i+1 father node be the i-th father node father node, root node be the n-th father node father node.
Preferably, the n=2, wherein the 1st father node is logic or operation information, and the 2nd father node is logic and operation
Information, root node are logic or operation.
Preferably, the target user is logic root vertex operation result corresponding user when being true, including：
The logic and operation information of any one 2nd father node is true；
The logic or operation information of corresponding all 1st father nodes of any one 2nd father node are true.
Preferably, the consigner is multiple, when the logic tree requirement for meeting at least two consigners there are a user
When, i.e., when at least two consigners correspond to the same target user, a kind of execution in the following way：
The user information of the same target user is sent to all corresponding consigners；
The user information of the same target user is sent to one or more of preset corresponding consigner.
Preferably, when, there are when competitive relation, only sending the same target user's at least two consigner
One of in user information at least two consigner with competitive relation.
A kind of user demand coalignment being easy to extension comprising：
Receiving module, the entrusted information for receiving consigner, by the entrusted information according to keyword construction logic tree；
Acquisition module, for acquiring user information, extract in the user information with leaf node phase in the logic tree
Corresponding qualification information；
Spider module, for from the leaf node of logic tree, traversing logic tree according to the qualification information, obtaining target
User, the target user is logic root vertex operation result corresponding user when being true；
Sending module, for the user information of the target user to be sent to consigner.
A kind of electronic equipment comprising processor, storage medium and computer program, the computer program are stored in
In storage medium, the computer program realizes the above-mentioned user demand matching process for being easy to extension when being executed by processor.
A kind of computer readable storage medium, is stored thereon with computer program, and the computer program is held by processor
The above-mentioned user demand matching process for being easy to extension is realized when row.
A kind of user demand matching process, device, electronic equipment and storage medium being easy to extension of the present invention, relatively
In the prior art, the present invention has the following technical effects：
The present invention by the entrusted information of consigner according to its keyword construction logic tree, when entrusted information changes i.e.
Keyword changes (increase, reduction, the change etc. that include keyword), be directly adjusted correspondingly on logic tree without
Matching Model must be rebuild again, autgmentability is strong, meanwhile, speed is fast, efficient.
Description of the drawings
Fig. 1 is the flow chart of the user demand matching process for being easy to extension of the embodiment of the present invention one；
Fig. 2 is the logic tree schematic diagram of the embodiment of the present invention one；
Fig. 3 is the structure diagram of the user demand coalignment for being easy to extension of the embodiment of the present invention two；
Fig. 4 is the structure diagram of the electronic equipment of the embodiment of the present invention three.
Specific implementation mode
Be described with reference to the drawings the present invention it is a kind of be easy to extension user demand matching process, device, electronic equipment and
Storage medium is described in detail, protection scope of the present invention to be explained and illustrated.
Embodiment one
It please refers to shown in Fig. 1, a kind of user demand matching process being easy to extension passes through electronic equipment (including software
With/and hardware) realize, specifically include following steps：
110, the entrusted information for receiving consigner, by the entrusted information according to keyword construction logic tree.
Consigner can be the arbitrary associated agency for having want advertisement, can be individual can also be unit.Consigner
Main purpose be to look for the user with its corresponding product or information, there is user of its corresponding product or information to be denoted as this
The target user of consigner.
After receiving entrusted information, entrusted information is refined accordingly, extracts keyword, the extraction of keyword is generally
Logical message and the forward and backward corresponding conditional information of logical message, the conditional information before and after logical message are with the logical message
Related information simplifies conditional information, as the leaf node of logic tree, the i.e. node of the logic tree bottom, the bottom
Node constitutes the core layer for obtaining target user, and conditional information for example includes and the relevant location of user information, age, duty
Industry, house property situation, vehicle possess situation, income situation etc., and logical message is mainly logic and operation information and logic or operation
Information.
According to the leaf node and associated upper layer node construction logic tree.Such as entrusted information includes：Location
For Guangzhou or Shenzhen, and the age is 22-25 Sui, while having house property, then the conditional information that the entrusted information includes has Guangzhou, depth
Ditch between fields, 22-25 Sui, have a room, logical message include with the relevant logic in Guangzhou and Shenzhen or operation information, and Guangzhou or Shenzhen, and
And the age is 22-25 Sui, while having house property homogeneously associated logic and operation information, can be leaf section in the logic tree of structure
Point be Guangzhou, Shenzhen, 22-25 Sui, have a room, Guangzhou, Shenzhen father node be logic or operation information, the logic or operation are believed
Breath, 22-25 Sui, have room father node be logic and operation information, certainly, in order to uniformly, can be by the father of single leaf node
Node sets are logic or operation information, in order to extend, for example, 22-25 Sui father node is set as logic or operation letter
Breath, the father node of 22-25 Sui father node are only above-mentioned logic and operation information.
Here upper layer node includes the i-th father node and root node, and 1≤i≤n, the 1st father node is that the father of leaf node saves
Point, i+1 father node are the father node of the i-th father node, and root node is the father node of the n-th father node.For example, in above-mentioned example,
Upper layer node may include 3 the 1st father nodes and 1 root node, and 3 the 1st father nodes are the father node in Guangzhou, Shenzhen respectively
(logic or operation information), 22-25 Sui father node (logic or operation information) and father node (logic or the operation letter for having room
Breath), which is the father node of 3 the 1st father nodes.
In preferred embodiments of the present invention, n can be set as to 2, i.e., entire logic tree shares four layers, is leaf respectively
Node, the 1st father node of the father node composition of leaf node, the 2nd father node of the father node composition of the 1st father node, the 2nd father section
The father node of point is root node.
Wherein, leaf node is each conditional information, and each conditional information represents the interior of aspect related to user
Hold, the description of the content of the 1st father node aspect related to user, the 2nd father node is the description to certain a kind of user, root node
The as set of multiclass people.
Therefore, the 1st father node is logic or operation information (or), for example the age, there are two leaf node 21-30 Sui and 41-
50 years old, corresponding 1st father node of the two be logic or operation information, then user qualification information meet two leaf node 21-
In 30 years old and 41-50 Sui any one when, the operation result of the 1st father node is as true, equally, for geographical location, occupation class
Type meaning is similar therewith.
2nd father node is logical AND budget information (and), then will all child nodes of the 2nd father node (i.e. the 1st father section
Point) operation result be true, then the operation result of the 2nd father node is just true, and the 2nd father node can be as the face of one kind people
It is ripe, for example that the 2nd father node on the left side indicates in Fig. 2 is user's (user is corporate boss) that tier 2 cities meet age requirement,
That the 2nd father node on the right indicates is the user that a line city meets age requirement (user is working clan).
Root node is logic or operation information (or), is exactly the set of the multiclass people of the 2nd father node, as long as wherein arbitrary the
The operation result of 2 father nodes is true, then the budget result of the root node is as true.
120, user information is acquired, qualification corresponding with leaf node in the logic tree in the user information is extracted
Information.
Include the basic information and identification information of user, the contact method of identification information such as user in user information
Deng extracting corresponding with leaf node information from basic information and be used as qualification information, each qualification information representative, which traverses, patrols
Collect a dimension for tree.If including the unrelated content of leaf node information in basic information, it can not consider, if base
Do not include the relevant content of leaf node information in plinth information, then ignores this partial content.Such as certain user's A age is 25 years old,
It is a corporate boss, 20,000 yuan of monthly income, location is Zhengzhou City, certain user B is 55 years old and corporate boss, in Wuhan City, then
Two users are with the relevant qualification information of leaf node in logic tree shown in Fig. 2：User A：25 years old, corporate boss, Zheng
State city；Certain user B：55 years old, corporate boss, Wuhan City.
130, according to the qualification information from the leaf node of logic tree, logic tree is traversed, target user is obtained, it is described
Target user is logic root vertex operation result corresponding user when being true.
By in the qualification information input to logic tree of each user, logic tree is begun stepping through from the leaf node of logic tree,
The root node to logic tree is calculated always from the leaf node of logic tree, since root node is logical operation information, then works as root
When the result of calculation of node is true, then corresponding user hits the logic tree, and it is corresponding that this user meets the logic tree
The user of consigner's condition, the i.e. target user of consigner.
Assuming that logic tree shown in Fig. 2 is according to consigner's X structures, according to the qualification information of above-mentioned user A：25 years old, enterprise
Owner, Zhengzhou City have hit logic tree " 21-30 ", " corporate boss " " Zhengzhou " these three leaf nodes of consigner X, then using
Family A is true in the logic or operation result of the 1st father node, then its corresponding 2nd father node is also true, then final root node
Operation result be also it is true, i.e. user A be consigner X target user, each operation be it is true and hit leaf node portion
Point indicated with shade, and the qualification information of user B：55 years old, corporate boss, Wuhan City did not hit the leaf section at any age
Point, so the logical consequence of corresponding 1st father node of its age dimension is false, then the 2nd father node operation result is also false, root section
Point result of calculation is similarly false, then user B mismatches the logic tree, is not the target user of consigner X.
140, the user information of the target user is sent to consigner.
According to the entrusted information of consigner, when finding its corresponding target user, the user information of target user is sent
To consigner, the user information for being sent to consigner can be all information, can also be only so that consigner checks
Identification information, i.e. contact method are got in touch for consigner and target user.
When receiving the entrusted information of multiple consigners simultaneously, then construction logic respectively can be carried out to multiple consigner
Then tree-model goes collected user information to match multiple logic tree-model, such result may be：
Each user only matches one of logic tree module, then the user information of the user is sent to counterlogic tree
Consigner.
When one user matches the logic tree requirement of at least two consigners in multiple consigner, i.e., at least two commissions
When the corresponding same target user in side, a kind of execution that method that user information occurs can be in the following way：
1, the user information of the same target user is sent to all corresponding consigners.As long as i.e. user information is full
The logic tree of sufficient consigner either corresponds to several logic trees, then the user information is sent to all matched logic trees
Corresponding consigner, in the manner, it is possible to which there are certain competitive relations in corresponding at least two consigner, then only will
The user information sends these one of consigners with competitive relation, for example, user A meets consigner X, consigner Y respectively
And the logic tree of consigner Z then will when competitive relation is not present in the logic tree of consigner X, consigner Y and consigner Z
The user information of user A is sent respectively to consigner X, consigner Y and consigner Z, if deposited between consigner X, consigner Y
In competitive relation, then the user information of user A is sent respectively to consigner X or consigner Y while being also sent to consigner Z,
As for consigner X or consigner Y is sent to, the priority of required time can be proposed according to the two, first carries and first obtaining, or according to two
The service charge that person provides, in such a way that the high person of valence must wait.
2, the user information of the same target user is sent to one or more of preset corresponding consigner,
If being provided with pre-defined rule, such as the time is proposed according to demand, propose that the one or more of demand first obtain at first, or according to
The service charge of offer is how much, provide most service charges it is one or more first etc. modes.
Assuming that there are N number of consigner, each consigner averagely has M leaf node, the qualification information of a user to have K
Dimension, then the time complexity that user's qualification looks for leaf node is O (K*N*M), the then leaf by finding
Node carries out gradually logical operation to root node, finds matched logic tree.
The present invention can build corresponding logic tree to each consigner, and be adjusted at any time to logic tree as needed
It is whole, it is used for other consigners after can also being adjusted to the logic tree of some consigner, there is higher autgmentability, processing
Speed is fast, efficient.
Embodiment two
Embodiment two discloses a kind of user demand coalignment being easy to extension of corresponding above-described embodiment, is above-mentioned reality
The virtual device structure for applying example, please refers to shown in Fig. 3, including：
Receiving module 210, the entrusted information for receiving consigner, by the entrusted information according to keyword construction logic
Tree；
Acquisition module 220, for acquiring user information, extract in the user information with leaf node in the logic tree
Corresponding qualification information；
Spider module 230, for from the leaf node of logic tree, traversing logic tree according to the qualification information, obtaining
Target user, the target user is logic root vertex operation result corresponding user when being true；
Sending module 240, for the user information of the target user to be sent to consigner.
Further, the entrusted information is arranged into formation condition information and logical message, by conditional information with it is corresponding
Logical message is associated；Using conditional information as the leaf node of logic tree, saved logical message as the upper layer of leaf node
Point；According to the leaf node and associated upper layer node construction logic tree.
Further, the upper layer node includes the i-th father node and root node, and 1≤i≤n, the 1st father node is leaf section
The father node of point, i+1 father node are the father node of the i-th father node, and root node is the father node of the n-th father node.The n=2,
Wherein, the 1st father node is logic or operation information, and the 2nd father node is logic and operation information, and root node is logic or operation.
Further, the target user is logic root vertex operation result corresponding user when being true, including：Arbitrarily
The logic and operation information of one the 2nd father node is true；The logic of corresponding all 1st father nodes of any one 2nd father node
Or operation information is true.
Preferably, the consigner is multiple, when the logic tree requirement for meeting at least two consigners there are a user
When, i.e., when at least two consigners correspond to the same target user, a kind of execution in the following way：
The user information of the same target user is sent to all corresponding consigners；
The user information of the same target user is sent to one or more of preset corresponding consigner.
Preferably, when, there are when competitive relation, only sending the same target user's at least two consigner
One of in user information at least two consigner with competitive relation.
Embodiment three
Fig. 4 is the structural schematic diagram for a kind of electronic equipment that the embodiment of the present invention three provides, as shown in figure 4, the electronics is set
Standby includes processor 310, memory 320, input unit 330 and output device 340；The number of processor 310 in computer equipment
Amount can be one or more, in Fig. 4 by taking a processor 310 as an example；Processor 310, memory 320 in electronic equipment,
Input unit 330 can be connected with output device 340 by bus or other modes, in Fig. 4 for being connected by bus.
Memory 320 is used as a kind of computer readable storage medium, can be used for storing software program, computer can perform journey
Sequence and module, such as the corresponding program instruction of the user demand matching process/module (example for being easy to extension in the embodiment of the present invention
Such as, receiving module 210, acquisition module 220, spider module 230 and the transmission mould being easy in the user demand coalignment of extension
Block 240).Processor 310 is stored in software program, instruction and module in memory 320 by operation, to execute electronics
The above-mentioned user demand matching process for being easy to extension is realized in the various function application of equipment and data processing.
Memory 320 can include mainly storing program area and storage data field, wherein storing program area can store operation system
Application program needed for system, at least one function；Storage data field can be stored uses created data etc. according to terminal.This
Outside, memory 320 may include high-speed random access memory, can also include nonvolatile memory, for example, at least one
Disk memory, flush memory device or other non-volatile solid state memory parts.In some instances, memory 320 can be into one
Step includes the memory remotely located relative to processor 310, these remote memories can be set by network connection to electronics
It is standby.The example of above-mentioned network includes but not limited to internet, intranet, LAN, mobile radio communication and combinations thereof.
Input unit 330 can be used for receiving the subscriber identity information of input.Output device 340 may include the displays such as display screen
Equipment.
Example IV
The embodiment of the present invention four also provides a kind of storage medium including computer executable instructions, and the computer can be held
Row instruction by computer processor when being executed for executing a kind of user demand matching process being easy to extension, this method packet
It includes：
The entrusted information for receiving consigner is adopted, by the entrusted information according to keyword construction logic tree；
User information is acquired, qualification letter corresponding with leaf node in the logic tree in the user information is extracted
Breath；
According to the qualification information from the leaf node of logic tree, logic tree is traversed, target user, the target are obtained
User is logic root vertex operation result corresponding user when being true；
The user information of the target user is sent to consigner.
Certainly, a kind of storage medium including computer executable instructions that the embodiment of the present invention is provided, computer
Executable instruction is not limited to the described above method operation, can also be performed that any embodiment of the present invention provided based on being easy to expand
Relevant operation in the user demand matching process of exhibition.
By the description above with respect to embodiment, it is apparent to those skilled in the art that, the present invention
It can be realized by software and required common hardware, naturally it is also possible to which by hardware realization, but the former is more in many cases
Good embodiment.Based on this understanding, technical scheme of the present invention substantially in other words contributes to the prior art
Part can be expressed in the form of software products, which can be stored in computer readable storage medium
In, such as the floppy disk of computer, read-only memory (Read-Only Memory, ROM), random access memory (Random
Access Memory, RAM), flash memory (FLASH), hard disk or CD etc., including some instructions use so that an electronic equipment
(can be mobile phone, personal computer, server or the network equipment etc.) executes each embodiment the method for the present invention.
It is worth noting that, in the above-mentioned embodiment based on the user demand coalignment for being easy to extension, included is each
A unit and module are only divided according to function logic, but are not limited to above-mentioned division, as long as phase can be realized
The function of answering；In addition, the specific name of each functional unit is also only to facilitate mutually differentiation, is not limited to this hair
Bright protection domain.
According to the disclosure and teachings of the above specification, those skilled in the art in the invention can also be to above-mentioned embodiment party
Formula is changed and is changed.Therefore, the invention is not limited in specific implementation modes disclosed and described above, to the present invention's
Some modifications and changes should also be as falling into the scope of the claims of the present invention.In addition, although being used in this specification
Some specific terms, these terms are merely for convenience of description, does not limit the present invention in any way.
Claims (10)
1. a kind of user demand matching process being easy to extension, which is characterized in that it includes the following steps：
The entrusted information for receiving consigner, by the entrusted information according to keyword construction logic tree；
User information is acquired, qualification information corresponding with leaf node in the logic tree in the user information is extracted；
According to the qualification information from the leaf node of logic tree, logic tree is traversed, target user, the target user are obtained
Corresponding user when for logic root vertex operation result being true；
The user information of the target user is sent to consigner.
2. the user demand matching process according to claim 1 for being easy to extension, which is characterized in that described by the commission
Information includes according to keyword construction logic tree：
The entrusted information is arranged into formation condition information and logical message, conditional information is related to corresponding logical message
Connection；
Using conditional information as the leaf node of logic tree, using logical message as the upper layer node of leaf node；
According to the leaf node and associated upper layer node construction logic tree.
3. the user demand matching process according to claim 2 for being easy to extension, which is characterized in that the upper layer node packet
The i-th father node and root node, 1≤i≤n are included, the 1st father node is the father node of leaf node, and i+1 father node saves for the i-th father
The father node of point, root node are the father node of the n-th father node.
4. the user demand matching process according to claim 3 for being easy to extension, which is characterized in that the n=2, wherein
1st father node is logic or operation information, and the 2nd father node is logic and operation information, and root node is logic or operation.
5. the user demand matching process according to claim 4 for being easy to extension, which is characterized in that the target user is
Logic root vertex operation result corresponding user when being true, including：
The logic and operation information of any one 2nd father node is true；
The logic or operation information of corresponding all 1st father nodes of any one 2nd father node are true.
6. the user demand matching process according to claim 1 for being easy to extension, which is characterized in that the consigner is more
A, when the logic tree for meeting at least two consigners there are a user requires, i.e., at least two consigners correspond to same
When target user, a kind of execution in the following way：
The user information of the same target user is sent to all corresponding consigners；
The user information of the same target user is sent to one or more of preset corresponding consigner.
7. the user demand matching process according to claim 6 for being easy to extension, which is characterized in that when described at least two
There are when competitive relation, only send the user information of the same target user to the institute with competitive relation in consigner
One of state at least two consigners.
8. a kind of user demand coalignment being easy to extension, which is characterized in that it includes：
Receiving module, the entrusted information for receiving consigner, by the entrusted information according to keyword construction logic tree；
Acquisition module extracts corresponding with leaf node in the logic tree in the user information for acquiring user information
Qualification information；
Spider module obtains target use for from the leaf node of logic tree, traversing logic tree according to the qualification information
Family, the target user is logic root vertex operation result corresponding user when being true；
Sending module, for the user information of the target user to be sent to consigner.
9. a kind of electronic equipment comprising processor, storage medium and computer program, the computer program are stored in
In storage media, which is characterized in that realize claim 1 to 7 any one of them when the computer program is executed by processor
It is easy to the user demand matching process of extension.
10. a kind of computer readable storage medium, is stored thereon with computer program, which is characterized in that the computer program
Realize that claim 1 to 7 any one of them is easy to the user demand matching process of extension when being executed by processor.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810457743.XA CN108648017B (en) | 2018-05-14 | 2018-05-14 | User requirement matching method, device, equipment and storage medium easy to expand |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810457743.XA CN108648017B (en) | 2018-05-14 | 2018-05-14 | User requirement matching method, device, equipment and storage medium easy to expand |
Publications (2)
| Publication Number | Publication Date |
|---|---|
| CN108648017A true CN108648017A (en) | 2018-10-12 |
| CN108648017B CN108648017B (en) | 2022-04-08 |
Family
ID=63755249
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810457743.XA Active CN108648017B (en) | 2018-05-14 | 2018-05-14 | User requirement matching method, device, equipment and storage medium easy to expand |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN108648017B (en) |
Cited By (3)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109308292A (en) * | 2018-11-27 | 2019-02-05 | 北京京东尚科信息技术有限公司 | Crowd orients method for digging, device and computer readable storage medium |
| CN109636438A (en) * | 2018-10-31 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of virtual resource operation system, the treating method and apparatus of virtual resource |
| CN110704699A (en) * | 2019-09-06 | 2020-01-17 | 中国平安财产保险股份有限公司 | Data image construction method and device, computer equipment and storage medium |
Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN105677929A (en) * | 2016-03-31 | 2016-06-15 | 比美特医护在线（北京）科技有限公司 | Information recommendation method and device |
| US20160343000A1 (en) * | 2014-01-24 | 2016-11-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and Service Center for Assisting a Customer to Navigate a Service |
| CN106776888A (en) * | 2016-11-30 | 2017-05-31 | 北京赛迈特锐医疗科技有限公司 | Intelligence structure search system and its searching method |
| CN106845991A (en) * | 2015-12-04 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of rules process method and equipment |
| CN106933889A (en) * | 2015-12-31 | 2017-07-07 | 华为技术有限公司 | For regular collocation method, display methods and the client screened |
-
2018
- 2018-05-14 CN CN201810457743.XA patent/CN108648017B/en active Active
Patent Citations (5)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20160343000A1 (en) * | 2014-01-24 | 2016-11-24 | Telefonaktiebolaget Lm Ericsson (Publ) | Method and Service Center for Assisting a Customer to Navigate a Service |
| CN106845991A (en) * | 2015-12-04 | 2017-06-13 | 阿里巴巴集团控股有限公司 | A kind of rules process method and equipment |
| CN106933889A (en) * | 2015-12-31 | 2017-07-07 | 华为技术有限公司 | For regular collocation method, display methods and the client screened |
| CN105677929A (en) * | 2016-03-31 | 2016-06-15 | 比美特医护在线（北京）科技有限公司 | Information recommendation method and device |
| CN106776888A (en) * | 2016-11-30 | 2017-05-31 | 北京赛迈特锐医疗科技有限公司 | Intelligence structure search system and its searching method |
Cited By (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN109636438A (en) * | 2018-10-31 | 2019-04-16 | 阿里巴巴集团控股有限公司 | A kind of virtual resource operation system, the treating method and apparatus of virtual resource |
| CN109636438B (en) * | 2018-10-31 | 2023-09-12 | 创新先进技术有限公司 | Virtual resource service system, virtual resource processing method and device |
| CN109308292A (en) * | 2018-11-27 | 2019-02-05 | 北京京东尚科信息技术有限公司 | Crowd orients method for digging, device and computer readable storage medium |
| CN110704699A (en) * | 2019-09-06 | 2020-01-17 | 中国平安财产保险股份有限公司 | Data image construction method and device, computer equipment and storage medium |
Also Published As
| Publication number | Publication date |
|---|---|
| CN108648017B (en) | 2022-04-08 |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN103024017B (en) | A kind of social networks important goal and Community Group recognition methods | |
| WO2018153292A1 (en) | Method for generating social circle, and apparatus and storage medium | |
| CN108648017A (en) | It is easy to user demand matching process, device, equipment and the storage medium of extension | |
| CN102710755A (en) | Data mining method of terminal user social network, correlation method, device and system | |
| CN103916306A (en) | Method and device for achieving instant communication | |
| DE112020002782T5 (en) | PERSONAL PUBLIC SERVICE IDENTIFIERS | |
| CN113179206A (en) | Session display method, session acquisition method, device, equipment, system and medium | |
| CN106055630A (en) | Log storage method and device | |
| CN106570014A (en) | Method and device for determining home attribute information of user | |
| CN108876081B (en) | Virtual room allocation method, device, storage medium and processor | |
| CN103745014A (en) | False and true mapping method and system of social network users | |
| CN106846034A (en) | Share generation method, device and the electronic equipment of the page | |
| CN108984588A (en) | A kind of data processing method and device | |
| CN103312590A (en) | Method, device, receiving terminal, transmitting terminal and equipment for group communication | |
| CN107832440A (en) | A kind of data digging method, device, server and computer-readable recording medium | |
| CN106657613A (en) | Instant messaging group management method | |
| CN104166581B (en) | A kind of virtual method towards increment manufacturing equipment | |
| CN103414756B (en) | A kind of task distribution method, distribution node and system | |
| CN104486726B (en) | A kind of user of protection looks forward to the prospect the extensive method in road network environment position of location privacy | |
| CN107277640A (en) | Interactive approach, device and storage medium based on live platform | |
| CN103577481A (en) | Advertising data search method and device | |
| CN109034938A (en) | Information quickly screens matching process, device, electronic equipment and storage medium | |
| CN102999581B (en) | Measure data access and real-time ordering system for business large user | |
| Kharzraee et al. | Social media: The new opiate of the masses? | |
| CN110209368A (en) | A kind of government affairs policy methods of exhibiting and system |
Legal Events
| Date | Code | Title | Description |
|---|---|---|---|
| PB01 | Publication | ||
| PB01 | Publication | ||
| SE01 | Entry into force of request for substantive examination | ||
| SE01 | Entry into force of request for substantive examination | ||
| TA01 | Transfer of patent application right | ||
| TA01 | Transfer of patent application right |
Effective date of registration: 20190925 Address after: 510000 Guangdong, Guangzhou, Tianhe District, Tianhe Road, 228, No. 1001, lifts 1001 (natural layer 901) Applicant after: Guangdong entley information Polytron Technologies Inc Applicant after: Guangzhou Yidili Information Technology Co., Ltd. Address before: 510000 Guangdong, Guangzhou, Tianhe District, Tianhe Road, 228, No. 1001, lifts 1001 (natural layer 901) Applicant before: Guangdong entley information Polytron Technologies Inc |
|
| GR01 | Patent grant | ||
| GR01 | Patent grant |