CN109034895A - A kind of search result methods of marking and system - Google Patents
A kind of search result methods of marking and system Download PDFInfo
- Publication number
- CN109034895A CN109034895A CN201810811991.XA CN201810811991A CN109034895A CN 109034895 A CN109034895 A CN 109034895A CN 201810811991 A CN201810811991 A CN 201810811991A CN 109034895 A CN109034895 A CN 109034895A
- Authority
- CN
- China
- Prior art keywords
- scoring
- search result
- key message
- newest
- final
- 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.)
- Pending
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/0241—Advertisements
- G06Q30/0273—Determination of fees for advertising
- G06Q30/0275—Auctions
-
- 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/0241—Advertisements
- G06Q30/0242—Determining effectiveness of advertisements
- G06Q30/0245—Surveys
-
- 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/0241—Advertisements
- G06Q30/0251—Targeted advertisements
- G06Q30/0255—Targeted advertisements based on user history
- G06Q30/0256—User search
Abstract
The present invention provides a kind of search result methods of marking and system.The method comprising the steps of S11: second scoring of the user to search result is received；Step S12: handling search result, and the newest final scoring of search result is calculated according to the first scoring of the search result stored in the second scoring or the second scoring and block chain network；Wherein, the first scoring is that the final scoring of the last of the search result obtained is calculated by step S11 and step S12.The methods of marking and system calculate the second scoring of search result and the first scoring the second scoring of search result or user the newest final scoring for obtaining searching results based on user, user can be made to obtain more objective believable search result scoring, so that user be avoided to be showed the influence of search result according to the potential scoring of advertisement bidding by search server.
Description
Technical field
The present invention relates to fields of communication technology, and in particular, to a kind of search result methods of marking and system.
Background technique
It is well known that many search servers can show search result to user according to the height of advertisement bidding ranking, i.e.,
Advertisement bidding is higher, and ranking is more forward namely its scoring is higher；Bid ranking, which is enterprise, buys keyword in search engine,
When consumer (i.e. user) searches for these keywords, the promotional content of enterprise is just appeared in face of consumer.The row of bidding
The promotion effect of name has very strong specific aim, and it is its outstanding feature that client, which actively finds, targetedly searches information,.It is most
Whole purpose is to ensure that when being scanned for its selected keyword, and the client web site link ranking for paying more and scoring are more leaned on
Before.Bid ranking is a kind of network promotion mode paid by effect.
This search result according to advertisement bidding scoring and ranking, user can only passively receive, due to competing by advertisement
The influence of valence scoring and ranking, so user cannot obtain than the scoring of more objective search result and ranking.
Therefore, how to influence to have become urgently to solve at present from the advertisement bidding scoring that the angle of user eliminates search result
Certainly the problem of.
Summary of the invention
The present invention is directed to the above-mentioned technical problems in the prior art, provides a kind of search result methods of marking and is
System.The search result methods of marking can make user obtain more objective believable search result scoring, thus avoid user by
Search server shows the influence of search result according to the potential scoring of advertisement bidding.
The present invention provides a kind of search result methods of marking, comprising:
Step S11: second scoring of the user to described search result is received；
Step S12: handling described search result, and according to second scoring or second scoring and area
First scoring of the described search result stored in block chain network calculates the newest final scoring of described search result；Wherein,
First scoring is the final of the last for the described search result that acquisition is calculated by the step S11 and step S12
Scoring.
Preferably, the step S12 includes:
Extract the key message of described search result；The key message includes search key and is closed by described search
The result information that key word searches；
It retrieves in the block chain network with the presence or absence of the key message；
If it is, first scoring of the key message according to second scoring and the block chain network
Calculate the newest final scoring of the key message；
If it is not, then second scoring to be determined as to the newest final scoring of the key message.
Preferably, described the first of the key message according to second scoring and the block chain network is commented
Divide after the newest final scoring for calculating the key message further include: described in the newest final scoring substitution
First scoring；
It is described by it is described second scoring be determined as the newest final scoring of the key message after further include:
By the newest final scoring as first scoring；
The methods of marking further include: the key message and its described newest final scoring are stored in the block
In chain network.
Preferably, further includes: according to the described newest final of the key message stored in the block chain network
Scoring is ranked up described search result.
Preferably, further includes: receive described search sort result and inquire and return to the ranking results of described search result.
The present invention also provides a kind of search result points-scoring systems, comprising:
Receiving module, for receiving second scoring of the user to described search result；
Grading module is commented for handling described search result, and according to second scoring or described second
Divide the newest final scoring that described search result is calculated with the first scoring of the described search result stored in block chain network；
Wherein, first scoring is the last that the described search result obtained is calculated by the receiving module and institute's scoring module
Final scoring.
Preferably, institute's scoring module includes:
Extraction unit, for extracting the key message of described search result；The key message include search key and
The result information arrived by described search keyword search；
Computing unit is retrieved, for retrieving with the presence or absence of the key message in the block chain network, and according to retrieval
As a result the newest final scoring of the key message is calculated.
Preferably, institute's scoring module further include: replace unit, for calculating according to the retrieval of the retrieval computing unit
As a result the newest final scoring is used to replace first scoring or described newest final will score as described first
Scoring；
Storage unit, for the key message and its described newest final scoring to be stored in the block chain network
In.
Preferably, further includes: sorting module, for the institute according to the key message stored in the block chain network
Newest final scoring is stated to be ranked up described search result.
Preferably, further includes: receive return module, inquire for receiving described search sort result and return to described search
As a result ranking results.
Beneficial effects of the present invention: search result methods of marking provided by the present invention and system, based on user to search
As a result the second scoring or user the second of search result the scoring and the first scoring are calculated obtain searching results it is newest most
Final review point can make user obtain more objective believable search result scoring, thus avoid user by search server according to
The potential scoring of advertisement bidding shows the influence of search result.
Detailed description of the invention
Fig. 1 is the flow chart of search result methods of marking in the embodiment of the present invention 1；
Fig. 2 is the flow chart of search result methods of marking in the embodiment of the present invention 2；
Fig. 3 is the functional block diagram of search result points-scoring system in the embodiment of the present invention 3.
Description of symbols therein:
1. receiving module；2. grading module；21. extraction unit；22. retrieving computing unit；23. replacing unit；24. storage
Unit；3. sorting module；4. receiving return module.
Specific embodiment
To make those skilled in the art more fully understand technical solution of the present invention, with reference to the accompanying drawing and it is embodied
Mode is described in further detail a kind of search result methods of marking provided by the present invention and system.
Embodiment 1:
The present embodiment provides a kind of search result methods of marking, as shown in Figure 1, comprising:
Step S11: second scoring of the user to search result is received.
Step S12: handling search result, and deposits according in the second scoring or the second scoring and block chain network
First scoring of the search result of storage calculates the newest final scoring of search result.Wherein, the first scoring is by step S11
The final scoring of the last of the search result obtained is calculated with step S12.
Wherein, the first scoring of the search result stored in block chain network is by user's repeatedly scoring (more than twice)
Practical calculating obtains afterwards.Since the search result in the prior art, returned from search server is carried out according to advertisement bidding
Potential scoring, so the potential scoring of the search result returned from search server will receive the influence of advertisement bidding, for
For family, the potential scoring of search result is not objective and incredible.Since the second scoring is that user provides, and block chain
First scoring of the search result stored in network is that acquisition is actually calculated after user repeatedly score, therefore, according to the
First scoring calculating of the search result stored in two scorings or the second scoring and block chain network obtains newest final
Scoring is more objective credible compared to the potential scoring for the search result that search server returns.
Search result methods of marking provided by the present embodiment, based on user to the second scoring of search result or user couple
The second scoring and the first scoring of search result calculate the newest final scoring for obtaining searching results, user can be made to be compared
Objective believable search result scoring, is searched so that user be avoided to be showed by search server according to the potential scoring of advertisement bidding
The influence of hitch fruit.
Embodiment 2:
The present embodiment provides a kind of search result methods of marking, as shown in Figure 2, comprising:
Step S11: second scoring of the user to search result is received.
Step S12: handling search result, and deposits according in the second scoring or the second scoring and block chain network
First scoring of the search result of storage calculates the newest final scoring of search result.Wherein, the first scoring is by step S11
The final scoring of the last of the search result obtained is calculated with step S12.
The step specifically includes:
Step S121: the key message of search result is extracted.Key message includes search key and crucial by search
The result information that word searches.
Such as: search key is " hospital of dermatology ", is < skin by the result information that the search key searches
Section, Deshengmen institute of traditional Chinese medicine>,<dermatology, Beijing capital Hospital of Skin Diseases>etc..
Step S122: it whether there is key message in retrieval block chain network.
In the step, key message is retrieved in block chain network by block chain node.
If so, thening follow the steps S123: being counted according to the first scoring of key message in the second scoring and block chain network
Calculate the newest final scoring of key message.
In the step, the newest most final review of key message can be calculated using the algorithm of average value, intermediate value or mode etc.
Point.Such as: when calculating newest final scoring using average algorithm, its calculation formula is: scoreI '=(scoreI*n+
scoreII)/(n+1)；Wherein, scoreI ' is newest final scoring, and scoreI is the first scoring, and scoreII comments for second
Point, n is the number for once participating in calculating the key message of the first scoring.
In addition, calculating newest final scoring using the algorithm of intermediate value or mode is the prior art, which is not described herein again.
After the step further include: step S125: replacing the first scoring with newest final scoring.
If not, thening follow the steps S124: the second scoring is determined as to the newest final scoring of key message.
After the step further include: step S126: by newest final scoring as the first scoring.
The methods of marking further include: step S127: key message and its newest final scoring are stored in block link network
In network.
By step S122~step S126, the first scoring for obtaining search result can either be calculated, and acquisition can be calculated
The newest final scoring of search result.
Wherein, the first scoring of the search result stored in block chain network is by user's repeatedly scoring (more than twice)
Practical calculating obtains afterwards.Since the search result in the prior art, returned from search server is sorted according to advertisement bidding,
The search result that i.e. search server returns is to carry out potential scoring according to advertisement bidding, so searching from what search server returned
The potential scoring of hitch fruit will receive the influence of advertisement bidding, and for a user, the potential scoring of search result is not objective
And it is incredible.Since the second scoring is that user provides, and the first scoring of the search result stored in block chain network is
Acquisition is actually calculated after user repeatedly scores, therefore, according in the second scoring or the second scoring and block chain network
It is latent compared to the search result that search server returns that first scoring of the search result of storage calculates the final scoring obtained
It is more objective credible scoring.
Methods of marking in the present embodiment further include: step S13: most according to the key message stored in block chain network
New final scoring is ranked up search result.
In the step, more objective believable search result scoring can be obtained based on user, so can be avoided user
It is influenced by search server according to the search result that advertisement bidding sequence shows.
Methods of marking in the present embodiment further include: step S14: it receives search results ranking and inquires and return to search result
Ranking results.
The setting of the step can be realized inquiry of the user to search results ranking, and realize user to search result
The acquisition of ranking results.
Examples 1 to 2 the utility model has the advantages that search result methods of marking provided by Examples 1 to 2, based on user to searching
The second scoring of hitch fruit or user calculate to the second scoring of search result and the first scoring and obtain the newest of searching results
Final scoring can make user obtain more objective believable search result scoring, thus avoid user by search server by
Show the influence of search result according to the potential scoring of advertisement bidding.
Embodiment 3:
The present embodiment provides a kind of search result points-scoring systems, as shown in Figure 3, comprising: receiving module 1 is used for receiving
Second scoring of the family to search result.Grading module 2, for handling search result, and according to the second scoring or the
First scoring of the search result stored in two scorings and block chain network calculates the newest final scoring of search result.Its
In, the first scoring is that the final scoring of the last of the search result obtained is calculated by receiving module and grading module.
By setting receiving module 1 and grading module 2, user can be made to obtain more objective believable search result scoring,
To avoid user from being showed the influence of search result according to the potential scoring of advertisement bidding by search server.
Wherein, the setting of receiving module 1 is arranged in browser side, grading module 2 in block chain network side.
In the present embodiment, grading module 2 includes: extraction unit 21, for extracting the key message of search result.Key letter
Breath includes search key and the result information searched by search key.Computing unit 22 is retrieved, for retrieving block
It whether there is key message in chain network, and calculate the newest final scoring of key message according to search result.
It should be noted that extraction unit 21 also can be set in browser side.Retrieval computing unit 22 can either calculate
The first scoring of search result is obtained, and the newest final scoring for obtaining search result can be calculated.
In the present embodiment, grading module 2 further include: replace unit 23, based on the retrieval according to retrieval computing unit 22
Calculating result uses newest final scoring to replace the first scoring or newest final score is scored as first.Storage unit
24, for key message and its newest final scoring to be stored in block chain network.
In the present embodiment, search result points-scoring system further include: sorting module 3, for being stored according in block chain network
Key message it is newest it is final scoring search result is ranked up.The comparison that the search results ranking is obtained based on user
Objective believable search result scoring, thus the search knot for avoiding user from being showed by search server according to advertisement bidding sequence
The influence of fruit.
Wherein, sorting module 3 is arranged in browser side.
In the present embodiment, search result points-scoring system further include: return module 4 is received, for receiving search results ranking
Inquire and return the ranking results of search result.The setting for receiving return module 4, can be realized user to search results ranking
Inquiry, and realize acquisition of the user to the ranking results of search result.
Wherein, return module 4 is received to be arranged in browser side.
Embodiment 3 the utility model has the advantages that search result points-scoring system provided in embodiment 3, search is tied based on user
The second scoring of fruit or user, which calculate the second scoring of search result and the first scoring, obtains the newest final of searching results
Scoring can make user obtain more objective believable search result scoring, to avoid user by search server according to wide
Accuse the influence that the potential scoring bidded shows search result.
It is understood that the principle that embodiment of above is intended to be merely illustrative of the present and the exemplary implementation that uses
Mode, however the present invention is not limited thereto.For those skilled in the art, essence of the invention is not being departed from
In the case where mind and essence, various changes and modifications can be made therein, these variations and modifications are also considered as protection scope of the present invention.
Claims (10)
1. a kind of search result methods of marking characterized by comprising
Step S11: second scoring of the user to described search result is received；
Step S12: handling described search result, and according to second scoring or second scoring and block chain
First scoring of the described search result stored in network calculates the newest final scoring of described search result；Wherein, described
First scoring is that the final scoring of the last of the described search result obtained is calculated by the step S11 and step S12.
2. search result methods of marking according to claim 1, which is characterized in that the step S12 includes:
Extract the key message of described search result；The key message includes search key and by described search keyword
The result information searched；
It retrieves in the block chain network with the presence or absence of the key message；
If it is, first scoring of the key message according to second scoring and the block chain network calculates
The newest final scoring of the key message；
If it is not, then second scoring to be determined as to the newest final scoring of the key message.
3. search result methods of marking according to claim 2, which is characterized in that it is described according to it is described second scoring and
First scoring of key message described in the block chain network calculates the newest most final review of the key message
/ after further include: replace first scoring with the newest final scoring；
It is described by it is described second scoring be determined as the newest final scoring of the key message after further include: by institute
Newest final scoring is stated as first scoring；
The methods of marking further include: the key message and its described newest final scoring are stored in the block link network
In network.
4. search result methods of marking according to claim 3, which is characterized in that further include: according to the block link network
The newest final scoring of the key message stored in network is ranked up described search result.
5. search result methods of marking according to claim 4, which is characterized in that further include: receive described search result
Sorting query and the ranking results for returning to described search result.
6. a kind of search result points-scoring system characterized by comprising
Receiving module, for receiving second scoring of the user to described search result；
Grading module, for handling described search result, and according to it is described second scoring or it is described second scoring and
First scoring of the described search result stored in block chain network calculates the newest final scoring of described search result；Its
In, first scoring is the last that the described search result obtained is calculated by the receiving module and institute's scoring module
Final scoring.
7. search result points-scoring system according to claim 6, which is characterized in that institute's scoring module includes:
Extraction unit, for extracting the key message of described search result；The key message includes search key and passes through
The result information that described search keyword search is arrived；
Computing unit is retrieved, for retrieving with the presence or absence of the key message in the block chain network, and according to search result
Calculate the newest final scoring of the key message.
8. search result points-scoring system according to claim 7, which is characterized in that institute's scoring module further include: replace
Unit, for replacing described first to comment according to the retrieval calculated result newest final scoring of the retrieval computing unit
Divide or by the newest final scoring as first scoring；
Storage unit, for the key message and its described newest final scoring to be stored in the block chain network.
9. search result points-scoring system according to claim 8, which is characterized in that further include: sorting module is used for basis
The newest final scoring of the key message stored in the block chain network is ranked up described search result.
10. search result points-scoring system according to claim 9, which is characterized in that further include: return module is received, is used
It is inquired in reception described search sort result and returns to the ranking results of described search result.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810811991.XA CN109034895A (en) | 2018-07-23 | 2018-07-23 | A kind of search result methods of marking and system |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810811991.XA CN109034895A (en) | 2018-07-23 | 2018-07-23 | A kind of search result methods of marking and system |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN109034895A true CN109034895A (en) | 2018-12-18 |
Family
ID=64645216
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810811991.XA Pending CN109034895A (en) | 2018-07-23 | 2018-07-23 | A kind of search result methods of marking and system |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN109034895A (en) |
Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150379135A1 (en) * | 2013-12-18 | 2015-12-31 | Yanqun Sun | Search Engine Ranking Method Based on User Participation |
| CN106354994A (en) * | 2016-08-22 | 2017-01-25 | 布比（北京）网络技术有限公司 | Method and system for processing medical data |
| CN106372101A (en) * | 2016-07-20 | 2017-02-01 | Tcl集团股份有限公司 | Video recommendation method and apparatus |
| CN107729542A (en) * | 2017-10-31 | 2018-02-23 | 咪咕音乐有限公司 | A kind of information methods of marking and device and storage medium |
-
2018
- 2018-07-23 CN CN201810811991.XA patent/CN109034895A/en active Pending
Patent Citations (4)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| US20150379135A1 (en) * | 2013-12-18 | 2015-12-31 | Yanqun Sun | Search Engine Ranking Method Based on User Participation |
| CN106372101A (en) * | 2016-07-20 | 2017-02-01 | Tcl集团股份有限公司 | Video recommendation method and apparatus |
| CN106354994A (en) * | 2016-08-22 | 2017-01-25 | 布比（北京）网络技术有限公司 | Method and system for processing medical data |
| CN107729542A (en) * | 2017-10-31 | 2018-02-23 | 咪咕音乐有限公司 | A kind of information methods of marking and device and storage medium |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| US8078601B1 (en) | Determining unambiguous geographic references | |
| US10956518B2 (en) | Systems and methods for improved web searching | |
| CN106156127B (en) | Method and device for selecting data content to push to terminal | |
| Cao et al. | Context-aware query suggestion by mining click-through and session data | |
| US8478704B2 (en) | Decomposable ranking for efficient precomputing that selects preliminary ranking features comprising static ranking features and dynamic atom-isolated components | |
| CN104199833B (en) | The clustering method and clustering apparatus of a kind of network search words | |
| CN103365910B (en) | Method and system for information retrieval | |
| CN104899268A (en) | Distributed enterprise information vertical search method | |
| CN104268175B (en) | A kind of devices and methods therefor of data search | |
| WO2021082123A1 (en) | Information recommendation method and apparatus, and electronic device | |
| CN105930539A (en) | Topic subscription method and device | |
| CN103885985B (en) | Microblogging real-time search method and device | |
| CN102163234A (en) | Equipment and method for error correction of query sequence based on degree of error correction association | |
| WO2008144457A2 (en) | Efficient retrieval algorithm by query term discrimination | |
| CN102999521B (en) | A kind of method and device identifying search need | |
| CN104268230A (en) | Method for detecting objective points of Chinese micro-blogs based on heterogeneous graph random walk | |
| CN103970800B (en) | The extraction processing method and system of webpage associative key | |
| CN108572971A (en) | It is a kind of to be used to excavate and the method and apparatus of the relevant keyword of term | |
| CN100458797C (en) | Process for ordering network advertisement | |
| US20190362003A1 (en) | Techniques for processing long-tail search queries against a vertical search corpus | |
| CN103123638B (en) | Data search method and device | |
| CN108920576A (en) | A kind of adaptive text searching method | |
| JP5250009B2 (en) | Suggestion query extraction apparatus and method, and program | |
| JP2007094552A (en) | Community extracting device, community extracting method, program, and recording medium | |
| Kamruzzaman et al. | Text categorization using association rule and naive Bayes classifier |
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 | ||
| RJ01 | Rejection of invention patent application after publication | ||
| RJ01 | Rejection of invention patent application after publication |
Application publication date: 20181218 |