Search engine hot word analytical algorithm

An analysis algorithm and search engine technology, which is applied in the field of search engine hot word analysis algorithm, can solve the problems of reduced availability of calculation results and unsatisfactory results, and achieve the effects of improving effectiveness and reliability, improving anti-interference ability, and strong usability

Active Publication Date: 2014-10-22
南京烽火星空通信发展有限公司
View PDF4 Cites 0 Cited by
  • Summary
  • Abstract
  • Description
  • Claims
  • Application Information

AI Technical Summary

Problems solved by technology

[0011] Obviously, the result calculated by the existing algorithm is not ideal
For a set of word data, after calculation by

Method used

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
View more

Image

Smart Image Click on the blue labels to locate them in the text.
Viewing Examples
Smart Image
  • Search engine hot word analytical algorithm
  • Search engine hot word analytical algorithm
  • Search engine hot word analytical algorithm

Examples

Experimental program
Comparison scheme
Effect test

Example Embodiment

[0020] The search engine hot word analysis algorithm described in this patent application consists of two parts: horizontal and vertical. The horizontal part deals with the number of occurrences of words, expressed as Where x 1 ≥1, x 2 ≥0, a>0, x 1 Is the number of occurrences of the word in the nearest period of two adjacent periods, x 2 Is the number of times the word appears in the earlier period, and a is the base. The graph of this function is monotonically increasing.

[0021] for Meet condition x 1 ≥1, x2≥0, a>0, regardless of x 1 And x 2 How to change, the horizontal part can calculate the result. If the word has not appeared in the earlier cycle, it is a new word that only appeared in the recent cycle, pass In the calculation of, there will be no situation where the calculation result cannot be obtained because the denominator is 0, so that it can avoid the situation that valid words have no calculation result.

[0022] in In, a is unchanged, if the number of times th...

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

PUM

No PUM Login to view more

Abstract

The invention discloses a search engine hot word analytical algorithm which is composed of a transverse part and a longitudinal part. The transverse part is used for processing the number of search times of words in two adjacent cycles and is shown as (x1+a)/(x1+x2+2a), wherein x1 is the number of times of the words occurring in the recent cycle, x2 is the number of times of the words occurring in the early cycle, and a is a cardinality number larger than 0. The longitudinal part selects a function to process a balance factor M, wherein the function has the monotone increasing character, and the function value of the function in a zone larger than 0 is larger than 0. M can be the number of unrepeated IPs or the number of unrepeated radiuses or the number of user identification cards of internet users who search the words. The result of the horizontal part is multiplied by the result of the longitudinal part, and a final hot word analyzing result can be obtained. By means of the search engine hot word analytical algorithm, the validity and reliability of the search engine hot word scoring algorithm can be obviously improved, the anti-interference capability of the algorithm is improved, and therefore the rational result high in availability is obtained.

Description

technical field [0001] The application belongs to the field of information technology, and relates to a search engine hot word analysis algorithm. Background technique [0002] Hot words refer to words that have been searched by a large number of Internet users through search engines within a certain period of time. Compared with non-hot words, hot words have a higher number of searches. Generally, hot words can be obtained by processing the number of occurrences of words in two adjacent periods through a series of methods, and filtering the processing results. The processed result is called keyword score, and the processing method is called keyword score algorithm. [0003] The existing keyword scoring algorithm is to subtract the number of times the term was searched in the earlier period from the number of times the term was searched in the recent period, and then divide it by a base number, which can be the number of times the term was searched in the recent period The...

Claims

the structure of the environmentally friendly knitted fabric provided by the present invention; figure 2 Flow chart of the yarn wrapping machine for environmentally friendly knitted fabrics and storage devices; image 3 Is the parameter map of the yarn covering machine
Login to view more

Application Information

Patent Timeline
no application Login to view more
IPC IPC(8): G06F17/30
CPCG06F16/30G06F16/951
Inventor 沈晓龙王峥李翔丁飞达
Owner 南京烽火星空通信发展有限公司
Who we serve
  • R&D Engineer
  • R&D Manager
  • IP Professional
Why Eureka
  • Industry Leading Data Capabilities
  • Powerful AI technology
  • Patent DNA Extraction
Social media
Try Eureka
PatSnap group products

Browse by: Latest US Patents, China's latest patents, Technical Efficacy Thesaurus, Application Domain, Technology Topic.

© 2024 PatSnap. All rights reserved.Legal|Privacy policy|Modern Slavery Act Transparency Statement|Sitemap