Summary of the invention
For the drawbacks described above of prior art, the technical problem to be solved is how to release optimal searching algorithm, so that user obtains preferably retrieves experience.
For achieving the above object, on the one hand, the present invention provides a kind of searching algorithm assessment recommendation method, and the method comprises the steps:
S1, according to retrieval background information determine evaluation condition;
S2, according to evaluation condition, each searching algorithm is estimated;
S3, acquisition optimal searching algorithm carry out retrieval and calculate, and draw retrieval result.
Preferably, in step s 2, the result ranking in certain time is added up according to search condition, and draw legitimate reading, draw retrieval result respectively according to each retrieval resulting algorithm, the retrieval result of each searching algorithm and legitimate reading are compared, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, in step s 2, retrieve result according to one and obtain the first list, the second list is obtained according to legitimate reading, first list includes some records, and the second list includes some records, contrasts the first list and the second list, according to the record existed only in the first list, the record existed only in the second list and existence simultaneously and the record in the first list and the second list, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, in step s 2, described prediction score RS computing formula is:
By the record addition that do not occur in the first list in the second list to the first list, and obtain the 3rd list;
Definition prediction score RS, obtains optimal searching algorithm according to prediction score RS, and described detection score RS computing formula is:
Wherein, k is the record number of the second list;M is the record number of the 3rd list;HjIt is the score of jth record, t in the 3rd listjFor being concurrently present in the score of the record of the first list and the second list;FjThe score of the record of the second list it is not present in for being present in the first list;IjThe score of the record of the second list it is present in for being not present in the first list.
Preferably, described tjBeing multiplied by a coefficient equal to corresponding record at the absolute value of the first list and the difference of secondary series list sorting position, described coefficient confirms according to evaluation condition.
Preferably, described fj=A (m+1), described ij=B (m+1), wherein A, B confirm according to evaluation condition respectively.
On the other hand, the present invention provides a kind of searching algorithm assessment commending system, and this system includes:
Determine module, for determining evaluation condition according to retrieval background information;
Evaluation module, for being estimated each searching algorithm according to evaluation condition;
Recommending module, is used for obtaining optimal searching algorithm and carries out retrieval calculating, and draw retrieval result.
Preferably, described evaluation module, add up the result ranking in certain time according to search condition, and draw legitimate reading, draw retrieval result respectively according to each retrieval resulting algorithm,
Retrieve result according to one and obtain the first list, the second list is obtained according to legitimate reading, first list includes some records, second list includes some records, contrast the first list and the second list, according to the record existed only in the first list, the record existed only in the second list and existence simultaneously and the record in the first list and the second list, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, described evaluation module, by the record addition that do not occur in the first list in the second list to the first list, and obtain the 3rd list;Definition prediction score RS, obtains optimal searching algorithm according to prediction score RS, and described detection score RS computing formula is:
Wherein, k is the record number of the second list;M is the record number of the 3rd list;HjIt it is the score of jth record in the 3rd list;TjFor being concurrently present in the score of the record of the first list and the second list;FjThe score of the record of the second list it is not present in for being present in the first list;IjThe score of the record of the second list it is present in for being not present in the first list.
Preferably, described tjBeing multiplied by a coefficient equal to corresponding record at the absolute value of the first list and the difference of secondary series list sorting position, described coefficient confirms according to evaluation condition;Described fj=A (m+1), described ij=B (m+1), wherein A, B confirm according to evaluation condition respectively.
The invention provides a kind of to predict the appraisal procedure and system that ordered queue is the mining algorithm of output, the application scenarios of the present invention is usable in the internet arenas such as recommendation and the prediction of assessment commodity, or other have the non-internet field that similar tolerance needs;The technical program quality of the size comprehensive assessment prediction algorithm of one numerical value, and release optimal searching algorithm, so that user obtains preferably retrieves experience;Reduce the visit capacity of server simultaneously.
Detailed description of the invention
For making those skilled in the art be more fully understood that technical scheme, below in conjunction with the drawings and specific embodiments, the present invention is described in further detail.
Fig. 1 is the schematic flow sheet of the searching algorithm assessment recommendation method in embodiments of the invention one, as it is shown in figure 1, this searching algorithm assessment recommendation method includes step:
S1, according to retrieval background information determine evaluation condition;
S2, according to evaluation condition, each searching algorithm is estimated;
S3, acquisition optimal searching algorithm carry out retrieval and calculate, and draw retrieval result.
Preferably, in step s 2, the result ranking in certain time is added up according to search condition, and draw legitimate reading, draw retrieval result respectively according to each retrieval resulting algorithm, the retrieval result of each searching algorithm and legitimate reading are compared, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, in step s 2, retrieve result according to one and obtain the first list, the second list is obtained according to legitimate reading, first list includes some records, and the second list includes some records, contrasts the first list and the second list, according to the record existed only in the first list, the record existed only in the second list and existence simultaneously and the record in the first list and the second list, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, in step s 2, retrieve result according to one and obtain the first list, the second list is obtained according to legitimate reading, first list includes some records, and the second list includes some records, contrasts the first list and the second list, according to the record existed only in the first list, the record existed only in the second list and existence simultaneously and the record in the first list and the second list, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, tjBeing multiplied by a coefficient equal to corresponding record at the absolute value of the first list and the difference of secondary series list sorting position, coefficient confirms according to evaluation condition.
Preferably, fj=A (m+1), ij=B (m+1), wherein A, B confirm according to evaluation condition respectively.
Relevant technical staff in the field will be understood that, corresponding with the method for the present invention, the present invention also includes a kind of searching algorithm assessment commending system simultaneously, with said method step correspondingly, as shown in Figure 2, this system comprises determining that module 201, for determining evaluation condition according to retrieval background information;Evaluation module 202, for being estimated each searching algorithm according to evaluation condition;Recommending module 203, is used for obtaining optimal searching algorithm and carries out retrieval calculating, and draw retrieval result.
Preferably, evaluation module 202, add up the result ranking in certain time according to search condition, and draw legitimate reading, add up the result ranking in certain time according to search condition, and draw legitimate reading, draw retrieval result respectively according to each retrieval resulting algorithm,
Retrieve result according to one and obtain the first list, the second list is obtained according to legitimate reading, first list includes some records, second list includes some records, contrast the first list and the second list, according to the record existed only in the first list, the record existed only in the second list and existence simultaneously and the record in the first list and the second list, analyze retrieval result and the immediate searching algorithm of legitimate reading.
Preferably, the record addition that do not occur in the first list in the second list to the first list, and is obtained the 3rd list by evaluation module 202;Definition prediction score RS, obtains optimal searching algorithm according to prediction score RS, and described detection score RS computing formula is:
Wherein, k is the record number of the second list;M is the record number of the 3rd list;HjIt it is the score of jth record in the 3rd list;TjFor being concurrently present in the score of the record of the first list and the second list;FjThe score of the record of the second list it is not present in for being present in the first list;IjThe score of the record of the second list it is present in for being not present in the first list;TjBeing multiplied by a coefficient equal to corresponding record at the absolute value of the first list and the difference of secondary series list sorting position, described coefficient confirms according to evaluation condition;Described fj=A (m+1), described ij=B (m+1), wherein A, B confirm according to evaluation condition respectively.
Wherein, the value of RS is the smaller the better, if predicting the outcome right-on words, the value of RS is 0;K is the number of commodity in real commodity queue;M is all of commodity in prediction queue and true queue;HjBeing the sequence score of jth commodity, point three kinds of situations are as follows: correctly predicted is designated as tj, error prediction be designated as fj, it does not have what be predicted to is designated as ij;TjRepresenting that jth commodity are to simultaneously appear in the correct commodity of prediction in two queues, it is equal to the absolute value of these commodity sorting position in prediction queue with the difference of these commodity sorting position in true queue;FjRepresent that jth commodity are not in true queue, but occur in prediction queue, fj=A (m+1);IjRepresent that jth commodity are not in prediction queue, but occur in true queue, ij=B (m+1).According to evaluation condition, it is determined that coefficient A, B.
If A=1;B=1;
It is assumed that real commodity queue is T=(B, D, C, E), it was predicted that commodity queue be P=(A, B, C);For queue T and P, then k=4;M=5 (commodity A, B, C, D, E);H1=6 (commodity A is misjudged);H2=1 (commodity B position in P is 2, and the position in T is 1);H3=0 (commodity C position in T is 3, and position is 3 in P);H4=6 (commodity D do not have predicted out);H5=6 (commodity E do not have predicted out);RS=19/4=4.75.
It is assumed that real commodity queue is T=(D, F, E), it was predicted that commodity queue be P=(E, C, F);So k=3;M=4 (commodity E, C, F, D);H1=2 (commodity E position in P is 1, and position is 3 in T);H2=5 (commodity C is misjudged);H3=1 (commodity F position in P is 3, and position is 2 in T);H4=4 (commodity D do not have predicted out);RS=12/3=4.
Finally, release preferably search method, to provide retrieval to recommend.The application scenarios of the present invention is usable in the internet arenas such as recommendation and the prediction of assessment commodity, or other have the non-internet field that similar tolerance needs.The technical program quality of the size comprehensive assessment prediction algorithm of one numerical value, and release optimal searching algorithm, so that user obtains preferably retrieves experience;Reduce the visit capacity of server simultaneously.
It is understood that the principle that is intended to be merely illustrative of the present of embodiment of above and the illustrative embodiments that adopts, but the invention is not limited in this.For those skilled in the art, without departing from the spirit and substance in the present invention, it is possible to make various modification and improvement, these modification and improvement are also considered as protection scope of the present invention.