CN104239521B - The method for pushing and device of offline keyword - Google Patents

The method for pushing and device of offline keyword Download PDF

Info

Publication number
CN104239521B
CN104239521B CN201410475964.1A CN201410475964A CN104239521B CN 104239521 B CN104239521 B CN 104239521B CN 201410475964 A CN201410475964 A CN 201410475964A CN 104239521 B CN104239521 B CN 104239521B
Authority
CN
China
Prior art keywords
data
keyword
sequence
offline
index
Prior art date
Legal status (The legal status is an assumption and is not a legal conclusion. Google has not performed a legal analysis and makes no representation as to the accuracy of the status listed.)
Active
Application number
CN201410475964.1A
Other languages
Chinese (zh)
Other versions
CN104239521A (en
Inventor
杜德文
Current Assignee (The listed assignees may be inaccurate. Google has not performed a legal analysis and makes no representation or warranty as to the accuracy of the list.)
Beijing Gridsum Technology Co Ltd
Original Assignee
Beijing Gridsum Technology Co Ltd
Priority date (The priority date 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 date listed.)
Filing date
Publication date
Application filed by Beijing Gridsum Technology Co Ltd filed Critical Beijing Gridsum Technology Co Ltd
Priority to CN201410475964.1A priority Critical patent/CN104239521B/en
Publication of CN104239521A publication Critical patent/CN104239521A/en
Application granted granted Critical
Publication of CN104239521B publication Critical patent/CN104239521B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/951Indexing; Web crawling techniques

Landscapes

  • Engineering & Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Theoretical Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • General Physics & Mathematics (AREA)
  • Information Retrieval, Db Structures And Fs Structures Therefor (AREA)

Abstract

The invention discloses a kind of method for pushing and device of offline keyword.Wherein, the method for pushing of offline keyword includes:The data at destination application DLL are obtained, obtain the first data, wherein, destination application DLL is the interface for providing keyword;The data with default flag bit are searched from the first data, obtain the second data, wherein, the data with default flag bit are offline keyword;The data for meeting preset reference index in the second data are extracted, obtain the 3rd data;And determine offline keyword of the 3rd data for push.By the present invention, solve artificial lookup mode in the prior art and be difficult to find the crucial word problem for needing to push again from offline keyword, and then simplified labor workload, the effect for improving offline keyword lookup efficiency.

Description

The method for pushing and device of offline keyword
Technical field
The present invention relates to data processing field, in particular to a kind of method for pushing and device of offline keyword.
Background technology
After the dispensing plan of some keywords, unit are expired or deleted, keyword is just no longer launched.But no longer throw The keyword put is possible to do well during dispensing.This just needs to analyze the historical data of this kind of word, selects Optimal keyword is showed, recommends out, is reached the standard grade again for putting person's selection.Way is usually to utilize the side searched by hand at present Formula is carried out, but is deleted data due to history and belonged to search engine marketing (Search Engine Marketing, abbreviation SEM) The data that provider has deleted, therefore, it is not easy to find needs from offline keyword again by way of searching by hand The keyword of secondary push.
For being difficult to find the crucial word problem for needing to push again from offline keyword in correlation technique, at present still Effective solution is not proposed.
The content of the invention
It is a primary object of the present invention to provide a kind of method for pushing and device of offline keyword, to solve prior art In be difficult to find the crucial word problem for needing to push again from offline keyword.
A kind of according to an aspect of the invention, there is provided method for pushing of offline keyword.
Included according to the method for pushing of the offline keyword of the present invention:Obtain the number at destination application DLL According to, the first data are obtained, wherein, the destination application DLL is the interface for providing keyword;From the described first number The data with default flag bit are searched according to middle, obtain the second data, wherein, the data with the default flag bit are described Offline keyword;The data for meeting preset reference index in second data are extracted, obtain the 3rd data;And described in determining 3rd data are the offline keyword of push.
Further, the data for meeting preset reference index in second data are extracted, obtaining the 3rd data includes:Press Second data are ranked up according to the preset reference index, obtain data sequence;And the sequence from the data sequence Row head end or sequence end obtain one or more data, obtain the 3rd data.
Further, the preset reference index includes the first index and the second index, extracts full in second data The data of sufficient preset reference index, obtaining the 3rd data includes:The vector (xi, yi) of each second data is obtained, wherein, The first finger target value that xi is the second data i, the second finger target value that yi is the second data i;Calculate each The Euclidean distance of the vector of second data and default vectorial (x0, y0), wherein, x0 is the preset value of first index, Y0 is the preset value of second index;Calculate the similarity of each Euclidean distance;Counted according to the similarity to described second According to being ranked up, data sequence is obtained;And obtained from the sequence head end of the data sequence or sequence end one or more Data, obtain the 3rd data.
Further, according to formulaCalculate the similarity of each Euclidean distance, wherein, d for it is described it is European away from From s is the similarity.
Further, the data of preset reference index are met in second data are extracted, after obtaining the 3rd data, The method for pushing also includes:The current data at the destination application DLL is obtained, obtains the 4th data;Judge It whether there is identical data in 3rd data and the 4th data;And judging the 3rd data and described In the case of the identical data in four data being present, the identical data is deleted from the 3rd data, wherein it is determined that institute The offline keyword that the 3rd data are stated as push includes:It is determined that the 3rd data after the identical data are deleted to push away The offline keyword sent.
According to another aspect of the present invention, there is provided a kind of pusher of offline keyword.
Included according to the pusher of the offline keyword of the present invention:First acquisition unit, for obtaining intended application journey Data at sequence DLL, the first data are obtained, wherein, the destination application DLL connects for offer keyword Mouthful;Searching unit, for searching the data with default flag bit from first data, the second data are obtained, wherein, tool The data for having the default flag bit are the offline keyword;Extraction unit, meet in advance for extracting in second data If the data of reference index, obtain the 3rd data;And determining unit, for determine the 3rd data for push it is described under Line keyword.
Further, the extraction unit includes:First order module, for according to the preset reference index to described Second data are ranked up, and obtain data sequence;And first acquisition module, for the sequence head end from the data sequence or Sequence end obtains one or more data, obtains the 3rd data.
Further, the preset reference index includes the first index and the second index, and the extraction unit includes:Second Acquisition module, for obtaining the vector (xi, yi) of each second data, wherein, first finger that xi is the second data i Target value, the second finger target value that yi is the second data i;First computing module, for calculating each described second The Euclidean distance of the vector of data and default vectorial (x0, y0), wherein, x0 is the preset value of first index, and y0 is described The preset value of second index;Second computing module, for calculating the similarity of each Euclidean distance;Second order module, is used for Second data are ranked up according to the similarity, obtain data sequence;And the 3rd acquisition module, for from described The sequence head end of data sequence or sequence end obtain one or more data, obtain the 3rd data.
Further, second computing module is according to formulaThe similarity of each Euclidean distance is calculated, its In, d is the Euclidean distance, and s is the similarity.
Further, the pusher also includes:Second acquisition unit, for obtaining the destination application programming The current data of interface, obtain the 4th data;Judging unit, it is in the 3rd data and the 4th data for judging It is no identical data to be present;And unit is deleted, it is described for existing in the 3rd data and the 4th data are judged In the case of identical data, the identical data is deleted from the 3rd data, wherein, the determining unit is deleted for determination Except the 3rd data after the identical data are the offline keyword of push.
In the present invention, using the data obtained at destination application DLL, the first data are obtained, wherein, institute Destination application DLL is stated to provide the interface of keyword;Searched from first data with default flag bit Data, the second data are obtained, wherein, the data with the default flag bit are the offline keyword;Extract described second Meet the data of preset reference index in data, obtain the 3rd data;And determine the 3rd data for push it is described under Line keyword.By being obtained to the data at application programming interface, and then filtered out based on reference index and meet bar The data of part, it is such a to carry out data acquisition and screening using application programming interface as the offline keyword pushed again The mode of push, during being re-used to valuable data, the manual operation of complexity is eliminated, solves prior art In artificial lookup mode be difficult to find the crucial word problem for needing to push again from offline keyword, and then simplification Labor workload, the effect for improving offline keyword lookup efficiency.
Brief description of the drawings
The accompanying drawing for forming the part of the application is used for providing a further understanding of the present invention, schematic reality of the invention Apply example and its illustrate to be used to explain the present invention, do not form inappropriate limitation of the present invention.In the accompanying drawings:
Fig. 1 is the flow chart of the method for pushing of offline keyword according to embodiments of the present invention;And
Fig. 2 is the schematic diagram of the pusher of offline keyword according to embodiments of the present invention.
Embodiment
In order that those skilled in the art more fully understand the present invention program, below in conjunction with the embodiment of the present invention Accompanying drawing, the technical scheme in the embodiment of the present invention is clearly and completely described, it is clear that described embodiment is only The embodiment of a part of the invention, rather than whole embodiments.Based on the embodiment in the present invention, ordinary skill people The every other embodiment that member is obtained under the premise of creative work is not made, it should all belong to the model that the present invention protects Enclose.
It should be noted that term " first " in description and claims of this specification and above-mentioned accompanying drawing, " Two " etc. be for distinguishing similar object, without for describing specific order or precedence.It should be appreciated that so use Data can exchange in the appropriate case, so as to embodiments of the invention described herein can with except illustrating herein or Order beyond those of description is implemented.In addition, term " comprising " and " having " and their any deformation, it is intended that cover Cover it is non-exclusive include, be not necessarily limited to for example, containing the process of series of steps or unit, method, system, product or equipment Those steps or unit clearly listed, but may include not list clearly or for these processes, method, product Or the intrinsic other steps of equipment or unit.
In the case where not conflicting, the feature in embodiment and embodiment in the application can be mutually combined.Below will The present invention will be described in detail with reference to the accompanying drawings and embodiments.
Description below is done to technical term involved in the embodiment of the present invention:
Show number:The advertising display number of keyword setting time scope internal trigger;
Hits:Keyword setting time scope internal trigger advertising display and the user's hits obtained;
Clicking rate:Hits and displaying percentage, formula are expressed as in the range of keyword setting time:Clicking rate=click Number/displaying number * 100%;
Keyword quality score:Quality degree is the composite target for weighing keyword quality, main to reflect that netizen pushes away to participation Wide keyword and the degree of recognition of keyword intention.Influence factor includes the clicking rate of keyword, intention is write quality and (closed The correlation of keyword and intention) and account performance (clicking rates of other keywords in account entry-into-force time, account) etc.;
It is average to click on consumption:Average clicked price of certain keyword in the range of setting time is referred to, formula is expressed as: It is average to click on consumption=total cost/hits;
Conversion:Advertisement main web site is entered by paid promotion, advertiser wishes the behavior that user completes on its site, such as Complete a registration, buying a product, these are all conversions;Each conversion can correspond to advertiser's throwing by certain technology On the keyword put;
Conversion ratio:Conversion ratio can be conversion/hits or conversion/visit capacity by client definition.
Embodiment 1
According to embodiments of the present invention, there is provided it is a kind of can be real by method that the application device embodiment is practiced or carried out Example is applied, it is necessary to explanation, can be in the meter of such as one group computer executable instructions the flow of accompanying drawing illustrates the step of Performed in calculation machine system, although also, show logical order in flow charts, in some cases, can be with difference Shown or described step is performed in order herein.
According to embodiments of the present invention, there is provided a kind of method for pushing of offline keyword, below to institute of the embodiment of the present invention The method for pushing of the offline keyword provided does specific introduction:
Fig. 1 is the flow chart of the method for pushing of offline keyword according to embodiments of the present invention, as shown in figure 1, this method Including steps S102 to step S108:
S102:Obtain destination application DLL (Application Programming Interface, abbreviation API) the data at place, the first data are obtained, wherein, destination application DLL is provides the interface of keyword, in this hair In bright embodiment, destination application DLL can be the open platform API of SEM provider, and the data got include Material data with keyword and to keyword click on cost data of consumption etc., to destination application DLL The acquisition of the data at place, it can be that the data timing at destination application DLL is synchronized to local data base, make to obtain The local data and service end data taken is synchronous.
S104:The data with default flag bit are searched from the first data, obtain the second data, wherein, have default The data of flag bit are offline keyword, and the default flag bit can be when user deletes some keyword, to local data The mark of this keyword stored in storehouse.
S106:The data for meeting preset reference index in the second data are extracted, obtain the 3rd data, wherein, preset reference Index can be the condition filtered to offline keyword set up or is configured according to the setting instruction of user Index, preset reference index can be time interval, the addition time of keyword, quality degree, average click on consumption, conversion Deng.
S108:Determine offline keyword of the 3rd data for push, i.e. it is determined that the data for meeting preset reference index are to push away The offline keyword sent.
The method for pushing for the offline keyword that the embodiment of the present invention is provided, by the number at application programming interface According to being obtained, and then the data of the condition of satisfaction are filtered out based on reference index, it is such a as the offline keyword pushed again The mode of data acquisition and screening push is carried out using application programming interface, process is being re-used to valuable data In, the manual operation of complexity is eliminated, artificial lookup mode in the prior art is solved and is difficult to find need from offline keyword The crucial word problem to push again, and then simplified labor workload, the effect for improving offline keyword lookup efficiency Fruit.
Specifically, in the method for pushing for the offline keyword that the embodiment of the present invention is provided, extract full in the second data The data of sufficient preset reference index, obtaining the 3rd data can perform in such a way:
First, the second data are ranked up according to preset reference index, obtain data sequence, such as, preset reference refers to The click consumption of keyword is designated as, then the second data is ranked up according to the click consumption of each keyword, is obtained click and disappear Take keyword data sequence from big to small or from small to large.
Then, one or more data are obtained from the sequence head end of data sequence or sequence end, obtains the 3rd data, one As for, be to obtain to click on to consume higher keyword, then, if data sequence is according to clicking on consumption from big to small suitable Sequence arrangement, then one or more data are obtained from the sequence head end of data sequence, as the 3rd data, if data sequence is According to consumption from small to large tactic is clicked on, then one or more data are obtained from the sequence end of data sequence, made For the 3rd data, wherein, how many individual data are specifically obtained, but determined by the reference index value of preset reference index, preset The reference index value of reference index can be set according to being actually needed.
Further, in embodiments of the present invention, the quantity of preset reference index can be multiple, i.e. with multiple default Reference index is the screening according to progress keyword, below so that preset reference index includes the first index and the second index as an example, To illustrate the mode from the data of the second extracting data the 3rd:
The first step, the vector (xi, yi) of each second data is obtained, wherein, xi is the second data i the first index Value, the second finger target value that yi is the second data i, such as, the first index is consumed to click on, and the second index is quality degree, for For some keyword, the vector of the keyword is that it clicks on consumption value and quality angle value.
Second step, the Euclidean distance of the vector and default vectorial (x0, y0) of each second data is calculated, wherein, x0 the The preset value of one index, y0 are the preset value of the second index, between vectorial (xi, yi) and default vectorial (x0, y0) it is European away from From
3rd step, the similarity of each Euclidean distance is calculated, specifically, can be according to formulaCalculate each Europe The similarity of formula distance, wherein, d is Euclidean distance, and s is similarity.
4th step, the second data are ranked up according to similarity, obtain data sequence, specifically, can be according to similar Degree order from big to small is ranked up to the second data, obtains the keyword data sequence of similarity from big to small, or according to The order of similarity from small to large is ranked up to the second data, obtains the keyword data sequence of similarity from small to large.
5th steps, one or more data are obtained from the sequence head end of data sequence or sequence end, obtain the 3rd data, In general, similarity more levels off to 1, represent more similar with standard value, the quality of corresponding keyword is also better, then, In the embodiment of the present invention, the 3rd data got are then the higher keywords of similarity, then, if data sequence be according to Similarity from big to small tactic, then one or more data are obtained from the sequence head end of data sequence, as the 3rd Data, if data sequence is according to clicking on consumption from small to large tactic, obtained from the sequence end of data sequence One or more data are taken, as the 3rd data, wherein, how many individual data are specifically obtained, can be by the phase of preset reference index Determined like degree reference index value, the similarity reference index value of preset reference index can be set according to being actually needed.
Preferably, the data of preset reference index are met in the second data are extracted, after obtaining the 3rd data, the present invention The method for pushing of the offline keyword of embodiment also includes:The current data at destination application DLL is obtained, is obtained 4th data, i.e. obtain the keyword pushed during current launch;Judge in the 3rd data and the 4th data with the presence or absence of identical Data;In the case where identical data be present in judging the 3rd data and the 4th data, identical number is deleted from the 3rd data According to.Correspondingly, determine that the 3rd data include for the offline keyword of push:It is determined that the 3rd data after identical data are deleted to push away The offline keyword sent.
By the way that the 3rd data and the keyword during current launch are carried out into duplicate removal comparison, delete in offline keyword with working as Same keyword during preceding dispensing, realize and do not repeat to push after offline keyword is reached the standard grade.
Further, in embodiments of the present invention,, can be with after push is shown for the offline keyword determined Selected by user single or multiple, be then packaged the keyword selected by user, pass through what calling search engine provided API, a key submit keyword to reach the standard grade.
It should be noted that for foregoing each method embodiment, in order to be briefly described, therefore it is all expressed as a series of Combination of actions, but those skilled in the art should know, the present invention is not limited by described sequence of movement because According to the present invention, some steps can use other orders or carry out simultaneously.Secondly, those skilled in the art should also know Know, embodiment described in this description belongs to preferred embodiment, and involved action and module are not necessarily of the invention It is necessary.
Through the above description of the embodiments, those skilled in the art can be understood that according to above-mentioned implementation The method of example can add the mode of required general hardware platform to realize by software, naturally it is also possible to by hardware, but a lot In the case of the former be more preferably embodiment.Based on such understanding, technical scheme is substantially in other words to existing The part that technology contributes can be embodied in the form of software product, and the computer software product is stored in a storage In medium (such as ROM/RAM, magnetic disc, CD), including some instructions to cause a station terminal equipment (can be mobile phone, calculate Machine, server, or network equipment etc.) perform method described in each embodiment of the present invention.
Embodiment 2
According to embodiments of the present invention, a kind of offline pass for being used to implement the method for pushing of above-mentioned offline keyword is additionally provided The pusher of keyword, the pusher of the offline keyword are mainly used in performing what the above of the embodiment of the present invention was provided The method for pushing of offline keyword, the pusher of the offline keyword provided below the embodiment of the present invention are specific Jie Continue:
Fig. 2 is the schematic diagram of the pusher of offline keyword according to embodiments of the present invention, as shown in Fig. 2 this is offline The pusher of keyword mainly includes first acquisition unit 10, searching unit 20, extraction unit 30 and determining unit 40, its In:
First acquisition unit 10 is used to obtain destination application DLL (Application Programming Interface, abbreviation API) place data, obtain the first data, wherein, destination application DLL for provide keyword Interface, in embodiments of the present invention, destination application DLL can be the open platform API of SEM provider, obtain To data include the material data with keyword and to keyword click on the cost data etc. of consumption, to intended application The acquisition of data at Program Interfaces, can be that the data timing at destination application DLL is synchronized to local Database, make the local data of acquisition and service end data synchronous.
Searching unit 20 is used to search the data with default flag bit from the first data, obtains the second data, wherein, Data with default flag bit are offline keyword, the default flag bit can be when user deletes some keyword, it is right The mark of this keyword stored in local data base.
Extraction unit 30 is used to extract the data for meeting preset reference index in the second data, obtains the 3rd data, wherein, Preset reference index can be the condition filtered to offline keyword set up or be instructed according to the setting of user The index being configured, preset reference index can be that time interval, the addition time of keyword, quality degree, average click on disappear Take, change.
Determining unit 40 is used to determine offline keyword of the 3rd data for push, i.e. it is determined that meeting preset reference index Data for push offline keyword.
The pusher for the offline keyword that the embodiment of the present invention is provided, by the number at application programming interface According to being obtained, and then the data of the condition of satisfaction are filtered out based on reference index, it is such a as the offline keyword pushed again The mode of data acquisition and screening push is carried out using application programming interface, process is being re-used to valuable data In, the manual operation of complexity is eliminated, artificial lookup mode in the prior art is solved and is difficult to find need from offline keyword The crucial word problem to push again, and then simplified labor workload, the effect for improving offline keyword lookup efficiency Fruit.
Specifically, in embodiments of the present invention, preset reference index can be one or multiple, for default Reference index is the situation of one, and the first order module and first that extraction unit 30 mainly includes performing following functions obtains mould Block:
First order module is used to be ranked up the second data according to preset reference index, obtains data sequence, such as, Preset reference index is consumed for the click of keyword, then the second data is ranked up according to the click consumption of each keyword, Obtain clicking on the keyword data sequence of consumption from big to small or from small to large.
First acquisition module is used to obtain one or more data from the sequence head end of data sequence or sequence end, obtains 3rd data, it is however generally that, it is to obtain to click on to consume higher keyword, then, if data sequence is consumed according to click From big to small tactic, then one or more data are obtained from the sequence head end of data sequence, as the 3rd data, such as Fruit data sequence be according to clicking on consumption from small to large tactic, then from the sequence end of data sequence obtain one or Multiple data, as the 3rd data, wherein, how many individual data are specifically obtained, but by the reference index value of preset reference index To determine, the reference index value of preset reference index can be set according to being actually needed.
Below so that preset reference index includes the first index and the second index as an example, to illustrate the knot of extraction unit 30 Structure building form, mainly the second acquisition module including following functions, the first computing module, second calculate mould to extraction unit 30 Block, the second order module and the 3rd acquisition module:
Second acquisition module is used to obtain the vectors (xi, yi) of each second data, wherein, xi is the of the second data i One refers to target value, and yi refers to target value for the second of the second data i, such as, the first index is consumed to click on, and the second index is quality Degree, for some keyword, the vector of the keyword is that it clicks on consumption value and quality angle value.
First computing module is used for the Euclidean distance for the vector and default vectorial (x0, y0) for calculating each second data, Wherein, x0 is the preset value of the first index, and y0 is the preset value of the second index, wherein, x0 is the pre- of the first index If value, y0 is the preset value of the second index, and vectorial (xi, yi) is with presetting the Euclidean distance between vectorial (x0, y0)
Second computing module is used for the similarity for calculating each Euclidean distance, specifically, can be according to formulaMeter The similarity of each Euclidean distance is calculated, wherein, d is Euclidean distance, and s is similarity.
Second order module is used to be ranked up the second data according to similarity, obtains data sequence, specifically, can be with The second data are ranked up according to the order of similarity from big to small, obtain the keyword data sequence of similarity from big to small Row, or the second data are ranked up according to the order of similarity from small to large, obtain the keyword number of similarity from small to large According to sequence.
3rd acquisition module is used to obtain one or more data from the sequence head end of data sequence or sequence end, obtains 3rd data, it is however generally that, similarity more levels off to 1, represents more similar with standard value, and the quality of corresponding keyword is also got over It is good, then, in embodiments of the present invention, the 3rd data got are then the higher keywords of similarity, then, if data Sequence is according to similarity from big to small tactic, then obtains one or more numbers from the sequence head end of data sequence According to as the 3rd data, if data sequence is according to clicking on consumption from small to large tactic, from data sequence Sequence end obtains one or more data, as the 3rd data, wherein, how many individual data are specifically obtained, can be by default ginseng The similarity reference index value of index is examined to determine, the similarity reference index value of preset reference index can be according to being actually needed Setting.
Preferably, the pusher for the offline keyword that the embodiment of the present invention is provided also includes second acquisition unit, sentenced Disconnected unit and deletion unit, the data of preset reference index are met in extraction unit 30 extracts the second data, obtain the 3rd number According to afterwards, second acquisition unit is used to obtain the current data at destination application DLL, obtains the 4th data, i.e. Obtain the keyword pushed during current launch;Judging unit is used to judge in the 3rd data and the 4th data with the presence or absence of identical Data;Delete unit to be used in the case where identical data be present in judging the 3rd data and the 4th data, from the 3rd data Middle deletion identical data.Correspondingly, determining unit 40 is used to determine that the 3rd data after deletion identical data are the offline of push Keyword.
By the way that the 3rd data are carried out into duplicate removal comparison with the keyword pushed during current launch, delete in offline keyword With the same keyword during current launch, realize and do not repeat to push after offline keyword is reached the standard grade.
Further, in embodiments of the present invention,, can be with after push is shown for the offline keyword determined Selected by user single or multiple, be then packaged the keyword selected by user, pass through what calling search engine provided API, a key submit keyword to reach the standard grade.
As can be seen from the above description, the present invention is realized during being re-used to valuable data, is saved The manual operation of complexity has been gone, reached simplified labor workload, improved the effect of offline keyword lookup efficiency.
Obviously, those skilled in the art should be understood that above-mentioned each module of the invention or each step can be with general Computing device realize that they can be concentrated on single computing device, or be distributed in multiple computing devices and formed Network on, alternatively, they can be realized with the program code that computing device can perform, it is thus possible to they are stored Performed in the storage device by computing device, either they are fabricated to respectively each integrated circuit modules or by they In multiple modules or step be fabricated to single integrated circuit module to realize.So, the present invention is not restricted to any specific Hardware and software combines.
The preferred embodiments of the present invention are the foregoing is only, are not intended to limit the invention, for the skill of this area For art personnel, the present invention can have various modifications and variations.Within the spirit and principles of the invention, that is made any repaiies Change, equivalent substitution, improvement etc., should be included in the scope of the protection.

Claims (10)

  1. A kind of 1. method for pushing of offline keyword, it is characterised in that including:
    The data at destination application DLL are obtained, obtain the first data, wherein, the destination application programming connects Mouth is the interface for providing keyword;
    The data with default flag bit are searched from first data, obtain the second data, wherein, there is the pre- bidding The data of will position are the offline keyword, and the default flag bit is when deleting some keyword, in local data base The mark of this keyword stored;
    The data for meeting preset reference index in second data are extracted, obtain the 3rd data;And determine the 3rd number According to the offline keyword for push.
  2. 2. method for pushing according to claim 1, it is characterised in that meet that preset reference refers in extraction second data Target data, obtaining the 3rd data includes:
    Second data are ranked up according to the preset reference index, obtain data sequence;And
    One or more data are obtained from the sequence head end of the data sequence or sequence end, obtain the 3rd data.
  3. 3. method for pushing according to claim 1, it is characterised in that the preset reference index includes the first index and the Two indexs, the data for meeting preset reference index in second data are extracted, obtaining the 3rd data includes:
    The vector (xi, yi) of each second data is obtained, wherein, the first finger target value that xi is the second data i, yi Described second for the second data i refers to target value;
    The vectorial Euclidean distance with default vectorial (x0, y0) of each second data is calculated, wherein, x0 is the described first finger Target preset value, y0 are the preset value of second index;
    Calculate the similarity of each Euclidean distance;
    Second data are ranked up according to the similarity, obtain data sequence;And
    One or more data are obtained from the sequence head end of the data sequence or sequence end, obtain the 3rd data.
  4. 4. method for pushing according to claim 3, it is characterised in that according to formulaCalculate each Euclidean distance Similarity, wherein, d is the Euclidean distance, and s is the similarity.
  5. 5. method for pushing according to claim 1, it is characterised in that meet preset reference in second data are extracted The data of index, after obtaining the 3rd data, the method for pushing also includes:
    The current data at the destination application DLL is obtained, obtains the 4th data;
    Judge to whether there is identical data in the 3rd data and the 4th data;And
    In the case where the identical data be present in judging the 3rd data and the 4th data, from the described 3rd number The identical data is deleted according to middle,
    Wherein it is determined that the 3rd data include for the offline keyword of push:It is determined that after deleting the identical data 3rd data are the offline keyword of push.
  6. A kind of 6. pusher of offline keyword, it is characterised in that including:
    First acquisition unit, for obtaining the data at destination application DLL, the first data are obtained, wherein, it is described Destination application DLL is the interface for providing keyword;
    Searching unit, for searching the data with default flag bit from first data, the second data are obtained, wherein, Data with the default flag bit are the offline keyword, the default flag bit be when deleting some keyword, To the mark of this keyword stored in local data base;
    Extraction unit, meet the data of preset reference index in second data for extracting, obtain the 3rd data;And
    Determining unit, for determining the offline keyword of the 3rd data for push.
  7. 7. pusher according to claim 6, it is characterised in that the extraction unit includes:
    First order module, for being ranked up according to the preset reference index to second data, obtain data sequence; And
    First acquisition module, one or more data are obtained for the sequence head end from the data sequence or sequence end, are obtained To the 3rd data.
  8. 8. pusher according to claim 6, it is characterised in that the preset reference index includes the first index and the Two indexs, the extraction unit include:
    Second acquisition module, for obtaining the vector (xi, yi) of each second data, wherein, xi for the second data i institute State the first finger target value, the second finger target value that yi is the second data i;
    First computing module, the Euclidean distance of vector and default vectorial (x0, y0) for calculating each second data, its In, x0 is the preset value of first index, and y0 is the preset value of second index;
    Second computing module, for calculating the similarity of each Euclidean distance;
    Second order module, for being ranked up according to the similarity to second data, obtain data sequence;And
    3rd acquisition module, obtained for the sequence head end from the data sequence or sequence end one or more
    Data, obtain the 3rd data.
  9. 9. pusher according to claim 8, it is characterised in that second computing module is according to formulaMeter The similarity of each Euclidean distance is calculated, wherein, d is the Euclidean distance, and s is the similarity.
  10. 10. pusher according to claim 6, it is characterised in that the pusher also includes:
    Second acquisition unit, for obtaining the current data at the destination application DLL, obtain the 4th data;
    Judging unit, for judging to whether there is identical data in the 3rd data and the 4th data;And
    Unit is deleted, for the identical data be present in the 3rd data and the 4th data are judged Under, the identical data is deleted from the 3rd data, wherein, the determining unit is used to determine to delete the identical data The 3rd data afterwards are the offline keyword of push.
CN201410475964.1A 2014-09-17 2014-09-17 The method for pushing and device of offline keyword Active CN104239521B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201410475964.1A CN104239521B (en) 2014-09-17 2014-09-17 The method for pushing and device of offline keyword

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201410475964.1A CN104239521B (en) 2014-09-17 2014-09-17 The method for pushing and device of offline keyword

Publications (2)

Publication Number Publication Date
CN104239521A CN104239521A (en) 2014-12-24
CN104239521B true CN104239521B (en) 2017-11-14

Family

ID=52227580

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201410475964.1A Active CN104239521B (en) 2014-09-17 2014-09-17 The method for pushing and device of offline keyword

Country Status (1)

Country Link
CN (1) CN104239521B (en)

Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101620625A (en) * 2009-07-30 2010-01-06 腾讯科技(深圳)有限公司 Method, device and search engine for sequencing searching keywords
CN101957857A (en) * 2010-09-30 2011-01-26 华为终端有限公司 Automatic information push method and server

Family Cites Families (1)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
KR20130038723A (en) * 2011-10-10 2013-04-18 삼성전자주식회사 Method and system for searching using keyword

Patent Citations (2)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN101620625A (en) * 2009-07-30 2010-01-06 腾讯科技(深圳)有限公司 Method, device and search engine for sequencing searching keywords
CN101957857A (en) * 2010-09-30 2011-01-26 华为终端有限公司 Automatic information push method and server

Also Published As

Publication number Publication date
CN104239521A (en) 2014-12-24

Similar Documents

Publication Publication Date Title
CN104298719B (en) Category division, advertisement placement method and the system of user is carried out based on Social behaviors
CN102184230B (en) The methods of exhibiting of a kind of Search Results and device
CN103365904B (en) A kind of advertising message searching method and system
CN102541893B (en) Key word analysis method and device
US9626448B2 (en) System and/or method for linking network content
WO2014110141A2 (en) Method and apparatus for composing search phrases, distributing ads and searching product information
CN104881504B (en) A kind of information search method and device
CN101510856A (en) Method and apparatus for extracting member relation loop in SNS network
CN110135895A (en) Advertisement placement method, device, equipment and storage medium
CN106326413A (en) Personalized video recommending system and method
CN106709033A (en) Business multimedia data processing method and device
CN109727052A (en) Keyword determines method and device
CN105989107A (en) Application recommendation method and device
CN107590691A (en) A kind of information issuing method and device, storage medium, terminal
CN101963979A (en) Cloud computing-based search suggestion providing method and equipment
CN107659849A (en) A kind of method and system for recommending program
CN108334528A (en) A kind of information recommendation method and device
CN105989114A (en) Collection content recommendation method and terminal
CN101308507B (en) Internet information issue and search method
CN104933149B (en) A kind of information search method and device
CN109992729A (en) A kind of tourism strategy recommended method
CN109688217A (en) A kind of information push method, device and electronic equipment
CN108810577A (en) A kind of construction method, device and the electronic equipment of user's portrait
CN108960914A (en) Accurate information method for pushing, system and equipment
CN104239521B (en) The method for pushing and device of offline keyword

Legal Events

Date Code Title Description
C06 Publication
PB01 Publication
C10 Entry into substantive examination
SE01 Entry into force of request for substantive examination
GR01 Patent grant
GR01 Patent grant
PE01 Entry into force of the registration of the contract for pledge of patent right
PE01 Entry into force of the registration of the contract for pledge of patent right

Denomination of invention: Off-line keyword pushing method and device

Effective date of registration: 20190531

Granted publication date: 20171114

Pledgee: Shenzhen Black Horse World Investment Consulting Co.,Ltd.

Pledgor: BEIJING GRIDSUM TECHNOLOGY Co.,Ltd.

Registration number: 2019990000503

CP02 Change in the address of a patent holder
CP02 Change in the address of a patent holder

Address after: 100083 No. 401, 4th Floor, Haitai Building, 229 North Fourth Ring Road, Haidian District, Beijing

Patentee after: BEIJING GRIDSUM TECHNOLOGY Co.,Ltd.

Address before: 100086 Beijing city Haidian District Shuangyushu Area No. 76 Zhichun Road cuigongfandian 8 layer A

Patentee before: BEIJING GRIDSUM TECHNOLOGY Co.,Ltd.

PP01 Preservation of patent right
PP01 Preservation of patent right

Effective date of registration: 20240604

Granted publication date: 20171114