CN110457343A - A kind of personalization optimization method - Google Patents
A kind of personalization optimization method Download PDFInfo
- Publication number
- CN110457343A CN110457343A CN201810420849.2A CN201810420849A CN110457343A CN 110457343 A CN110457343 A CN 110457343A CN 201810420849 A CN201810420849 A CN 201810420849A CN 110457343 A CN110457343 A CN 110457343A
- Authority
- CN
- China
- Prior art keywords
- arrangement
- element combinations
- inquiry
- history
- inquiry element
- 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
- 238000005457 optimization Methods 0.000 title claims abstract description 28
- 238000000034 method Methods 0.000 title claims abstract description 22
- 238000012163 sequencing technique Methods 0.000 claims abstract description 7
- 238000012545 processing Methods 0.000 claims abstract description 5
- 238000011161 development Methods 0.000 description 2
- 230000009286 beneficial effect Effects 0.000 description 1
- 239000004744 fabric Substances 0.000 description 1
- 238000012986 modification Methods 0.000 description 1
- 230000004048 modification Effects 0.000 description 1
- 238000011160 research Methods 0.000 description 1
Landscapes
- Information Retrieval, Db Structures And Fs Structures Therefor (AREA)
Abstract
The present invention relates to a kind of personalized optimization methods, which comprises S1: obtaining arrangement inquiry element combinations；S2: history arrangement inquiry element combinations are obtained；S3: processing is optimized to arrangement inquiry element combinations.The present invention can carry out personalized optimization to inquiry element, enable the demand that search result is more close to the users, the mode handed over can not only be increased with element number in the prior art in optimization to combine, additionally provide the optimal way based on element sequencing, the weight of each element is enabled to obtain personalized optimization, to provide better service from multiple dimensions and level for user, search efficiency is improved.
Description
[technical field]
The invention belongs to data-optimized field more particularly to a kind of personalized optimization methods.
[background technique]
With popularizing for large-scale internet application, the magnanimity of network information data increases severely, and big data already controls country
Reason, business decision, personal lifestyle all produce tremendous influence.Under the background epoch of big data, distributed file system is divided
Cloth database etc. is all the technology suitable for big data.In addition, with the fast development of information technology, information snowslide "
(InformationAvalanche) phenomenon is more serious, how to allow the professional user of user, especially specific area, in magnanimity
Information resources in quick-searching to the most accurate, useful information become one of research hotspot.Vertical search engine is opposite
It contains much information existing for universal search engine, inquire the new search engine service that inaccuracy, search depth not enough etc. put forward
Mode, by for a certain specific area, a certain specific crowd or a certain particular demands provide the information for having certain values and
Related service.It is current problem just to be solved that personalized search service how is provided while search technique development.Base
In above-mentioned problems, a kind of new personalized optimization method is needed now, and the present invention can carry out inquiry element personalized
Optimization, the demand that search result is more close to the users can not only be with element in the prior art in optimization
Number increases the modes handed over and combines, and additionally provides the optimal way based on element sequencing, enables the weight of each element
Personalized optimization is obtained, to provide better service from multiple dimensions and level for user, improves search efficiency.
[summary of the invention]
In order to solve the above problem in the prior art, the invention proposes a kind of personalized optimization method, this method packets
Include following steps:
S1: arrangement inquiry element combinations are obtained；
S2: history arrangement inquiry element combinations are obtained；
S3: processing is optimized to arrangement inquiry element combinations.
Further, the step S3 is specifically, obtain history arrangement inquiry element combinations, based on arrangement inquiry member
A history arrangement inquiry element combinations are chosen in element combination, based on history arrangement inquiry element combinations to arrangement inquiry member
Element combination optimizes.
Further, described to choose a history arrangement inquiry element combinations, tool based on arrangement inquiry element combinations
Body are as follows: inquiry element combinations are arranged for each history, calculated permutations inquire element combinations and history arrangement inquiry element combinations
Between first distance, looked into first distance highest history arrangement inquiry element combinations as selected history arrangement
Ask element combinations.
Further, when history arrangement inquiry element combinations identical there are multiple first distances, access times are selected
Most history arrangement inquiry element combinations are as selected history arrangement inquiry element combinations.
Further, first between calculated permutations inquiry element combinations and history arrangement inquiry element combinations away from
From, specifically: obtain the secondary row in the main arrangement binary group and history arrangement inquiry element combinations in arrangement inquiry element combinations
Column binary group；The number for calculating identical arrangement binary group in main arrangement binary group and time arrangement binary group, the number is accounted for
The percentage of binary group number is arranged in main arrangement binary group as the first distance.
Further, identical arrangement binary group refers to that two elements itself are identical in binary group, and two in binary group
The arrangement number sequence of element is also identical.
Further, the history arrangement inquiry element combinations that are based on are excellent to arrangement inquiry element combinations progress
Change, specifically: arrangement inquiry element combinations are carried out according to the ordinal relation that a history arranges inquiry element combinations
Optimization.
Further, the ordinal relation for arranging inquiry element combinations according to a history inquires member to the arrangement
Element combination optimizes, arrangement inquiry element combinations after being handled with acquisition；Specifically: the history is arranged into inquiry element combinations
The sequencing relationship of middle inquiry element optimizes putting in order for element of inquiry in arrangement inquiry element combinations, will
The inquiry element for sorting forward is adjusted to before the inquiry element to sort rearward, and vice versa.
The beneficial effect comprise that personalized optimization can be carried out to inquiry element, enable search result more
Add the demand being close to the users, the mode handed over can not only be increased with element number in the prior art in optimization and combined, also mentioned
The optimal way based on element sequencing has been supplied, the weight of each element is enabled to obtain personalized optimization, thus from more
A dimension and level provide better service for user, improve search efficiency.
[Detailed description of the invention]
Described herein the drawings are intended to provide a further understanding of the invention, constitutes part of this application, but
It does not constitute improper limitations of the present invention, in the accompanying drawings:
Fig. 1 is the flow chart of personalized optimization method of the invention.
[specific embodiment]
Come that the present invention will be described in detail below in conjunction with attached drawing and specific embodiment, illustrative examples therein and says
It is bright to be only used to explain the present invention but not as a limitation of the invention.
A kind of personalization optimization method applied by the present invention is described in detail, the method includes following step:
S1: obtaining arrangement inquiry element combinations from user query request, specific: in inquiry request in inquiry
Hold and judged, if inquiry content is one or more inquiry elements, is directly based upon the inquiry content acquisition arrangement and looks into
Ask element combinations；If inquiring content is one or more query statements, query statement is handled one by one with the row of acquisition
Column inquiry element combinations；
Preferred: the inquiry element is word or word；
It is directly based upon the inquiry content and obtains arrangement inquiry element combinations, specifically: by the inquiry element according to language
Method composition sequence, which is lined up, to be sequentially put into arrangement inquiry element combinations；
Wherein: each inquiry element in arrangement inquiry element combinations has sequencing；Positioned at different order
Inquiring element has different weights；
S2: history arrangement inquiry element combinations are obtained, specific: the query history based on user obtains week predetermined time
History arrangement inquiry element combinations in phase；
Preferred: the predetermined period of time is preset value；Such as: one day etc.；
S3: handling arrangement inquiry element combinations, arrangement inquiry element combinations after being handled with acquisition；It is specific: to obtain
History arrangement inquiry element combinations are taken, choose a history arrangement inquiry element combinations based on arrangement inquiry element combinations,
Inquiry element combinations are arranged based on a history to optimize arrangement inquiry element combinations；
It is described to choose a history arrangement inquiry element combinations based on arrangement inquiry element combinations, specifically: for
Each history arrangement inquiry element combinations, calculated permutations inquire first between element combinations and history arrangement inquiry element combinations
Distance, using the highest history arrangement inquiry element combinations of first distance as selected history arrangement inquiry element group
It closes；
It is preferred: when history arrangement inquiry element combinations identical there are multiple first distances, to select access times most
More history arrangement inquiry element combinations are as selected history arrangement inquiry element combinations；
First distance between the calculated permutations inquiry element combinations and history arrangement inquiry element combinations, specifically:
Obtain the secondary arrangement binary group in the main arrangement binary group and history arrangement inquiry element combinations in arrangement inquiry element combinations；Meter
The number for calculating identical arrangement binary group in main arrangement binary group and time arrangement binary group, accounts for main arrangement binary group for the number
The percentage of middle arrangement binary group number is as the first distance；
Wherein: identical arrangement binary group refers to that two elements itself are identical in binary group, and two elements in binary group
Arrangement number sequence it is also identical；
The main arrangement binary group obtained in arrangement inquiry element combinations, specifically: obtain arrangement inquiry element combinations
In it is all inquiry elements binary permutation and combination, and will meet arrangement inquiry element combinations in order relation binary permutation and combination
It is put into the main arrangement binary group；
Such as: arrangement inquiry element combinations be (A1, A2, A3), main arrangement binary group for (A1, A2), (A1, A3), (A2,
A3)}；
The secondary arrangement binary group obtained in history arrangement inquiry element combinations, specifically: obtain history arrangement inquiry
The binary permutation and combination of all inquiry elements in element combinations, and two of order relation in history arrangement inquiry element combinations will be met
Identical permutation combination is put into described arrangement binary group；
Such as: history arrangement inquiry element combinations be (S1, S2, S3), secondary arrangement binary group for (S1, S2), (S1, S3),
(S2,S3)}；
It is described that arrangement inquiry element combinations are optimized based on history arrangement inquiry element combinations, specifically:
Arrangement inquiry element combinations are optimized according to the ordinal relation that a history arranges inquiry element combinations；
It is described according to a history arrange inquiry element combinations ordinal relation to the arrangement inquiry element combinations into
Row optimization, arrangement inquiry element combinations after being handled with acquisition；Specifically: the history is arranged in inquiry element combinations and inquires member
The sequencing relationship of element optimizes putting in order for element of inquiry in arrangement inquiry element combinations, will sort forward
Inquiry element be adjusted to sort before inquiry element rearward, vice versa；Element group is inquired into arrangement after the optimization
Cooperation is arrangement inquiry element combinations after processing；
S4: arrangement inquiry element combinations input search engine after the processing is inquired.
The above description is only a preferred embodiment of the present invention, thus it is all according to the configuration described in the scope of the patent application of the present invention,
The equivalent change or modification that feature and principle are done, is included in the scope of the patent application of the present invention.
Claims (8)
1. a kind of personalization optimization method, which is characterized in that this method comprises the following steps:
S1: arrangement inquiry element combinations are obtained；
S2: history arrangement inquiry element combinations are obtained；
S3: processing is optimized to arrangement inquiry element combinations.
2. personalization optimization method according to claim 1, which is characterized in that the step S3 is specifically, obtain history
Arrangement inquiry element combinations choose a history arrangement inquiry element combinations based on arrangement inquiry element combinations, are based on institute
History arrangement inquiry element combinations are stated to optimize arrangement inquiry element combinations.
3. personalization optimization method according to claim 2, which is characterized in that described to inquire element group based on the arrangement
It closes and chooses a history arrangement inquiry element combinations, specifically: inquiry element combinations are arranged for each history, calculated permutations are looked into
The first distance between element combinations and history arrangement inquiry element combinations is ask, by the highest history arrangement inquiry member of first distance
Element combination is as selected history arrangement inquiry element combinations.
4. personalization optimization method according to claim 3, which is characterized in that when going through there are multiple first distances are identical
When history arrangement inquiry element combinations, the history arrangement inquiry element combinations for selecting access times most are arranged as selected history
Column inquiry element combinations.
5. personalization optimization method according to claim 4, which is characterized in that calculated permutations inquiry element combinations and
First distance between history arrangement inquiry element combinations, specifically: obtain the main arrangement binary in arrangement inquiry element combinations
Secondary arrangement binary group in group and history arrangement inquiry element combinations；It calculates identical in main arrangement binary group and time arrangement binary group
Arrangement binary group number, the number is accounted in main arrangement binary group and arranges the percentage of binary group number as described the
One distance.
6. personalization optimization method according to claim 5, which is characterized in that identical arrangement binary group refers to binary group
In two elements itself it is identical, and in binary group two elements arrangement number sequence it is also identical.
7. personalization optimization method according to claim 6, which is characterized in that described based on history arrangement inquiry
Element combinations optimize arrangement inquiry element combinations, specifically: the suitable of inquiry element combinations is arranged according to a history
Order relation optimizes arrangement inquiry element combinations.
8. personalization optimization method according to claim 7, which is characterized in that described arrange according to a history is inquired
The ordinal relation of element combinations optimizes arrangement inquiry element combinations, arrangement inquiry element group after being handled with acquisition
It closes；Specifically: the history is arranged to the sequencing relationship that element is inquired in inquiry element combinations to arrangement inquiry member
Putting in order for element of inquiry optimizes in element combination, and it is first that the inquiry element for sorting forward is adjusted to the inquiry sorted rearward
Before element, vice versa.
Priority Applications (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810420849.2A CN110457343A (en) | 2018-05-04 | 2018-05-04 | A kind of personalization optimization method |
Applications Claiming Priority (1)
| Application Number | Priority Date | Filing Date | Title |
|---|---|---|---|
| CN201810420849.2A CN110457343A (en) | 2018-05-04 | 2018-05-04 | A kind of personalization optimization method |
Publications (1)
| Publication Number | Publication Date |
|---|---|
| CN110457343A true CN110457343A (en) | 2019-11-15 |
Family
ID=68471584
Family Applications (1)
| Application Number | Title | Priority Date | Filing Date |
|---|---|---|---|
| CN201810420849.2A Pending CN110457343A (en) | 2018-05-04 | 2018-05-04 | A kind of personalization optimization method |
Country Status (1)
| Country | Link |
|---|---|
| CN (1) | CN110457343A (en) |
Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102419776A (en) * | 2011-12-31 | 2012-04-18 | 北京百度网讯科技有限公司 | Method and equipment for meeting multi-dimensional search requirement of user |
| CN102541897A (en) * | 2010-12-14 | 2012-07-04 | 百度在线网络技术（北京）有限公司 | Equipment and method for optimizing inquiry sequence based on searching particle size |
| CN104598583A (en) * | 2015-01-14 | 2015-05-06 | 百度在线网络技术（北京）有限公司 | Method and device for generating query sentence recommendation list |
| CN104866474A (en) * | 2014-02-20 | 2015-08-26 | 阿里巴巴集团控股有限公司 | Personalized data searching method and device |
| US20160140214A1 (en) * | 2014-11-14 | 2016-05-19 | Aravind Musuluri | System and method for augmenting a search query |
| CN106951531A (en) * | 2017-03-21 | 2017-07-14 | 东软集团股份有限公司 | Data query method and device |
-
2018
- 2018-05-04 CN CN201810420849.2A patent/CN110457343A/en active Pending
Patent Citations (6)
| Publication number | Priority date | Publication date | Assignee | Title |
|---|---|---|---|---|
| CN102541897A (en) * | 2010-12-14 | 2012-07-04 | 百度在线网络技术（北京）有限公司 | Equipment and method for optimizing inquiry sequence based on searching particle size |
| CN102419776A (en) * | 2011-12-31 | 2012-04-18 | 北京百度网讯科技有限公司 | Method and equipment for meeting multi-dimensional search requirement of user |
| CN104866474A (en) * | 2014-02-20 | 2015-08-26 | 阿里巴巴集团控股有限公司 | Personalized data searching method and device |
| US20160140214A1 (en) * | 2014-11-14 | 2016-05-19 | Aravind Musuluri | System and method for augmenting a search query |
| CN104598583A (en) * | 2015-01-14 | 2015-05-06 | 百度在线网络技术（北京）有限公司 | Method and device for generating query sentence recommendation list |
| CN106951531A (en) * | 2017-03-21 | 2017-07-14 | 东软集团股份有限公司 | Data query method and device |
Similar Documents
| Publication | Publication Date | Title |
|---|---|---|
| CN101398835B (en) | Service selecting system and method, and service enquiring system and method based on natural language | |
| CN103164449B (en) | A kind of exhibiting method of Search Results and device | |
| CN103064890B (en) | A kind of GPS mass data processing method | |
| US6625595B1 (en) | Method and system for selectively presenting database results in an information retrieval system | |
| CN102546979B (en) | Call center and interest point search method, point of interest search system | |
| CN104991924A (en) | Method and apparatus for determining address of new supply point | |
| WO2001003032A9 (en) | Apparatus, systems and methods for constructing large numbers of travel fares | |
| CN105045919A (en) | Information output method and apparatus | |
| CN109086902A (en) | Processing method, processing unit, server, computer equipment and storage medium | |
| CN101777989A (en) | Search method and server | |
| CN105389358A (en) | Web service recommending method based on association rules | |
| CN102801766B (en) | Method and system for load balancing and data redundancy backup of cloud server | |
| CN110457343A (en) | A kind of personalization optimization method | |
| CN102542481A (en) | Method, system and device for realizing self-adaptive marketing | |
| CN104063831A (en) | Method and device for providing railway route schemes | |
| CN110134725A (en) | A kind of method and system of dynamic queries extended field | |
| CN102081678B (en) | Method for searching optimal execution plan in database query | |
| CN106331000A (en) | Method and device for determining service scheme | |
| CN112001635A (en) | Process flow determination method, device, server and storage medium | |
| CN101697170A (en) | Method and device for dynamically selecting database | |
| CN102982495B (en) | Adaptive data processing equipment and data processing method | |
| CN108984582A (en) | A kind of inquiry request processing method | |
| CN108376260A (en) | A kind of SVR tourism demand prediction techniques based on optimal subset optimization | |
| CN103440084B (en) | User option optimization method and device | |
| CN113569133A (en) | Information recommendation method and device |
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 |