CN108205589B - Heat iterative calculation method - Google Patents

Heat iterative calculation method Download PDF

Info

Publication number
CN108205589B
CN108205589B CN201711478007.4A CN201711478007A CN108205589B CN 108205589 B CN108205589 B CN 108205589B CN 201711478007 A CN201711478007 A CN 201711478007A CN 108205589 B CN108205589 B CN 108205589B
Authority
CN
China
Prior art keywords
heat
sequence
index sequence
webpage
iteration
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
CN201711478007.4A
Other languages
Chinese (zh)
Other versions
CN108205589A (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.)
Chengdu Youe Data Co ltd
Original Assignee
Chengdu Youe Data 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 Chengdu Youe Data Co ltd filed Critical Chengdu Youe Data Co ltd
Priority to CN201711478007.4A priority Critical patent/CN108205589B/en
Publication of CN108205589A publication Critical patent/CN108205589A/en
Application granted granted Critical
Publication of CN108205589B publication Critical patent/CN108205589B/en
Active legal-status Critical Current
Anticipated expiration legal-status Critical

Links

Images

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20—Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24—Querying
    • G06F16/245—Query processing
    • G06F16/2458—Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2462—Approximate or statistical queries
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING OR COUNTING
    • G06F—ELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00—Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90—Details of database functions independent of the retrieved data types
    • G06F16/95—Retrieval from the web
    • G06F16/951—Indexing; Web crawling techniques

Landscapes

  • Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Theoretical Computer Science (AREA)
  • Databases & Information Systems (AREA)
  • Probability & Statistics with Applications (AREA)
  • General Physics & Mathematics (AREA)
  • General Engineering & Computer Science (AREA)
  • Data Mining & Analysis (AREA)
  • Fuzzy Systems (AREA)
  • Computational Linguistics (AREA)
  • Software Systems (AREA)
  • Mathematical Physics (AREA)
  • Complex Calculations (AREA)
  • Investigating Or Analyzing Materials Using Thermal Means (AREA)

Abstract

The invention discloses a heat degree iterative computation method, aiming at solving the problems that the heat degree quantification and normalization of a webpage are difficult to realize in the prior art, so that the prediction of the heat degree of the webpage is not accurate enough or the comparison and analysis among different webpage heat degrees are difficult to carry out; the invention comprises the following steps: setting a hot index of a webpage, obtaining a hot index sequence, and performing conditional constraint on the hot index sequence; setting a standardization interval of the heat index sequence, standardizing the heat index sequence into a heat standard sequence according to the standardization interval, and constructing a heat iteration function related to the heat standard sequence; carrying out iterative computation on the heat iterative function to obtain the maximum iterative increment of the heat index sequence; according to the invention, the webpage heat is controlled within a set range, so that the normalization processing of the webpage heat is realized, the statistics and comparison of the webpage heat are facilitated, the webpage heat is quantized, and the webpage heat can be more accurately evaluated and predicted; the invention is suitable for the heat calculation related field.

Description

Heat iterative calculation method
Technical Field
The invention relates to the field of heat degree calculation, in particular to a heat degree iterative calculation method.
Background
Search engines have become an indispensable way for obtaining information, but the information resources are rich and diversified at present. Just because of the rich and diversified information resources, it is difficult to obtain the information really needed by us. In order to meet the requirements of users, the existing search engines predict information required by the users according to collected search information of the users. However, in the actual processing process, the existing heat calculation is complex due to excessive added variables, for a supplier, the more complex the algorithm is, the too high the occupied CPU is, the more the memory is occupied, and the cost of the search engine is high, the amount of users trying to search the search engine is large, if the calculated amount of each user amount is large, the main server of the search engine is difficult to meet the needs of the users, and the cost of the server is extremely high; on the other hand, when the algorithm is too complex, the actual operation efficiency is low. The existing heat algorithms have some defects that heat statistics and calculation can be performed only on the search behavior which occurs, but the heat is difficult to quantify and accurate prediction is difficult to be performed on future hot spots of the webpage. Meanwhile, a certain technical bias exists in the existing heat estimation, the heat is generally considered to rise with higher and higher speed, and the heat is estimated to fall only when the trend is reduced, so that the heat of a certain word is estimated to fall when the heat of the word is reduced, that is, the heat of the certain word is difficult to be predicted to fall, in other words, the turning point is difficult to be predicted, and the most valuable place is predicted; meanwhile, the existing heat statistics of some web pages are usually cumulative statistics, that is, cumulative statistics, but in the analysis of big data, it is often necessary to perform comprehensive analysis on a certain or even different types of pages, the hot spots of different pages are very different, for example, the click rate of a certain page is hundreds of thousands of times, and the click rate of another page is several times.
Disclosure of Invention
The invention aims to: the invention provides a heat degree iterative calculation method, aiming at the problems that in the prior art, quantification and normalization of the heat degree of a webpage are difficult to realize, so that prediction of the heat degree of the webpage is not accurate enough or comparison and analysis among different webpage heat degrees are difficult to carry out.
The technical scheme adopted by the invention is as follows:
a heat iterative computation method comprises the following steps:
step 1: setting a hot index h of a web pagenObtaining a heat index sequence of { h }nH, heat index sequence { h }nCarrying out conditional constraint;
in the foregoing scheme, specifically, the step 1 specifically includes:
step 1.1: setting a hot index h of a web pagenAt Δ hnMark Heat increment Δ h after n +1 th RefreshnComprises the following steps:
Δhn＝hn+1-hn；
step 1.2: the obtained heat index sequence is { hnH, heat index sequence { h }nMaking condition constraint, said condition includes hnShould lie in the interval 0, X]In the method, X is a positive integer, and the heat index sequence is as follows: h is0，h1…hn，h0Is an initial heat value, h00, and the heat index sequence is { h }nIs an increasing sequence, i.e. hn<hn+1The heat index sequence is { h }nThe increase should be decreasing, i.e. Δ hn>Δhn+1Heat index sequence hnShould have an upper bound, hn≤X；
Step 2: setting a standardization interval of the heat index sequence, and setting the heat index sequence { h) according to the standardization intervalnNormalized to a heat standard sequence gnAnd construct a standard sequence of heat { g }nThe heat iteration function f (g) ofn)；
In the foregoing scheme, specifically, the step 2 specifically includes:
step 2.1: setting the standardization interval of the heat index sequence as [0,1 ];
step 2.2: according to the standardized interval, the heat index sequence { hnNormalized to a heat standard sequence gnAnd (5) satisfying:
Figure GDA0003317445280000021
step 2.3: and constructs a standard sequence g for heatnThe heat iteration function f (g) ofn) Namely:
gn+1＝f(gn)
wherein f (g)n) I.e. a heat iteration function, where g0＝0。
And step 3: setting a heat iteration function f (g)n) For the heat iteration function f (g)n) Iterative computation is carried out to obtain a heat index sequence { h }nMaximum iteration increment of Δ hnmax。
In the foregoing scheme, specifically, the specific steps of step 3 are:
step 3.1: setting a heat iteration function f (g)n) The initial value parameter epsilon of (c), namely:
f(0)＝ε
and f (1) ═ 1, f ' (0) ═ 1, f ' (1) ═ 1- σ, f (x) ≥ x, f ' (x) >0, f "(x) <0, σ ═ 2 epsilon;
step 3.2: setting f (g)n) As a function of a fourth-order polynomial, the argument gnExpressed in x:
f(x)＝P4(x)＝a4x4+a3x3+a2x2+a1x+a0
and a is0＝ε，a1＝1，2a4+a3＝2ε-σ，a4+a3+a2＝-ε；
Step 3.3: and f (x) is transformed by using the relation in the step 3.2 to obtain:
f(x)＝ax4-2ax3+(a-ε)x2+x+ε；
when a is 0, the iterative function system has the simplest form
f(x)＝ε+x-εx2
Further obtaining:
f'(x)＝1-2εx
f”(x)＝-2ε
further, a heat standard sequence { g }is obtainednMaximum value of iteration increment of
Figure GDA0003317445280000031
Step 3.4: obtaining a heat index sequence { hnMaximum iteration increment of
Figure GDA0003317445280000032
Comprises the following steps:
Figure GDA0003317445280000033
wherein
Figure GDA0003317445280000034
Is a heat index sequence { hnMaximum iteration increment.
In the above scheme, further, the method further comprises the step 4: according to maximum iteration increment
Figure GDA0003317445280000035
The maximum heat value of the web page is obtained.
In the foregoing solution, specifically, the step 4 is based on the maximum iteration increment
Figure GDA0003317445280000036
Obtaining maximum heat value of webpage
Figure GDA0003317445280000037
Comprises the following steps:
Figure GDA00033174452800000311
wherein
Figure GDA0003317445280000038
Is a sequence of heat indicators hnLess than maximum calorific value
Figure GDA0003317445280000039
The value of (c).
In summary, due to the adoption of the technical scheme, the invention has the beneficial effects that:
1. in the invention, the sequence of heat indexes is set as { hnObtaining a heat standard sequence by establishing a standardized interval, and carrying out heat iteration on the heat standard sequence to obtain the iteration maximum increment of the heat standard sequence so as to obtain the maximum iteration increment of the heat index sequence
Figure GDA00033174452800000310
According to the invention, the webpage heat is controlled within a set range, on one hand, the normalization processing of the webpage heat is realized, the statistics and comparison among the webpage heat are convenient, on the other hand, the quantification of the webpage heat is realized, and the webpage heat can be more accurately evaluated and predicted;
2. according to the method, the maximum heat value is obtained according to the maximum iteration increment, and then the maximum heat point value of the webpage can be predicted, so that the highest point of the webpage heat, namely a turning point from hot to cold or from cold to hot is obtained, and the turning point of the webpage heat is evaluated;
3. the method is suitable for calculating the popularity of the webpage, is also suitable for calculating the popularity of word frequency and the like, provides specific quantitative standards for popularity statistics and the like of hot spots, and provides more reliable quantitative standards for big data analysis;
4. in the invention, only a single variable is introduced, and the heat calculation process is continuously simplified, so that a simple heat calculation method is realized.
Drawings
In order to more clearly illustrate the embodiments of the present invention or the technical solutions in the prior art, the drawings needed in the embodiments will be briefly described below, and it is obvious that the drawings in the following description are only some embodiments of the present invention, and it is obvious for those skilled in the art to obtain other drawings without creative efforts. The drawings are not intended to be to scale as practical, emphasis instead being placed upon illustrating the principles of the invention.
Fig. 1 is an iterative principle schematic of the present invention.
Detailed Description
In order to make the objects, technical solutions and advantages of the embodiments of the present invention clearer, the technical solutions in the embodiments of the present invention will be clearly and completely described below with reference to the drawings in the embodiments of the present invention, and it is obvious that the described embodiments are some, but not all, embodiments of the present invention. All other embodiments, which can be derived by a person skilled in the art from the embodiments given herein without making any creative effort, shall fall within the protection scope of the present invention.
A heat iterative computation method comprises the following steps:
step 1: setting a hot index h of a web pagenObtaining a heat index sequence of { h }nH, heat index sequence { h }nCarrying out conditional constraint;
in the foregoing scheme, specifically, the step 1 specifically includes:
step 1.1: setting a hot index h of a web pagen；
Step 1.2: the obtained heat index sequence is { hnH, heat index sequence { h }nMaking condition constraint, said condition includes hnShould lie in the interval 0, X]In the method, X is a positive integer, and the heat index sequence is as follows: h is0，h1…hn，h0Is an initial heat value, h00, and the heat index sequence is { h }nIs an increasing sequence, i.e. hn<hn+1The heat index sequence is { h }nThe increase should be a decrement, i.e.: Δ hn>Δhn+1Heat index sequence hnShould have an upper bound, hn≤X；
Step 2: setting a standardization interval of the heat index sequence, and setting the heat index sequence { h) according to the standardization intervalnNormalized to a heat standard sequence gnAnd construct a standard sequence of heat { g }nThe heat iteration function f (g) ofn)；
In the foregoing scheme, specifically, the step 2 specifically includes:
step 2.1: setting the standardization interval of the heat index sequence as [0,1 ];
step 2.2: according to the standardized interval, the heat index sequence { hnNormalized to a heat standard sequence gnAnd (5) satisfying:
Figure GDA0003317445280000051
step 2.3: and constructs a standard sequence g for heatnThe heat iteration function f (g) ofn) Namely:
gn+1＝f(gn)
wherein f (g)n) I.e. a heat iteration function, where g0＝0。
And step 3: setting a heat iteration function f (g)n) For the heat iteration function f (g)n) Iterative computation is carried out to obtain a heat index sequence { h }nMaximum iteration increment of
Figure GDA0003317445280000052
In the foregoing scheme, specifically, the specific steps of step 3 are:
step 3.1: setting a heat iteration function f (g)n) The initial value parameter epsilon of (c), namely:
f(0)＝ε
and f (1) ═ 1, f ' (0) ═ 1, f ' (1) ═ 1- σ, f (x) ≥ x, f ' (x) >0, f "(x) <0, σ ═ 2 epsilon;
step 3.2: setting f (x) as a fourth order polynomial function:
f(x)＝P4(x)＝a4x4+a3x3+a2x2+a1x+a0
and a is0＝ε，a1＝1，2a4+a3＝2ε-σ，a4+a3+a2＝-ε；
Step 3.3: and f (x) is transformed by using the relation in the step 3.2 to obtain:
f(x)＝ax4-2ax3+(a-ε)x2+x+ε；
when a is 0, the iterative function system has the simplest form
f(x)＝ε+x-εx2
Further obtaining:
f'(x)＝1-2εx
f”(x)＝-2ε
further, a heat standard sequence { g }is obtainednMaximum value of iteration increment of
Figure GDA0003317445280000053
Figure GDA0003317445280000061
Step 3.4: obtaining a heat index sequence { hnMaximum iteration increment of
Figure GDA0003317445280000062
Comprises the following steps:
Figure GDA0003317445280000063
wherein
Figure GDA0003317445280000064
Is a heat index sequence { hnMaximum iteration increment.
In the above scheme, further, the method further comprises the step 4: according to maximum iteration increment
Figure GDA0003317445280000065
The maximum heat value of the web page is obtained.
In the foregoing solution, specifically, the step 4 is based on the maximum iteration increment
Figure GDA0003317445280000066
Obtaining maximum heat value of webpage
Figure GDA0003317445280000067
Comprises the following steps:
Figure GDA0003317445280000068
wherein
Figure GDA0003317445280000069
Is a sequence of heat indicators hnLess than maximum calorific value
Figure GDA00033174452800000610
The value of (c).
Example one
The present embodiment will be described in detail with reference to the following specific contents:
step 1: designing the heat index as a single parameter bounded scale system with { h }nMark heat index sequence, where n-subscript marks heat refresh times, in Δ hnMark Heat increment Δ h after n +1 th RefreshnComprises the following steps:
Δhn＝hn+1-hn
heat index sequence { hnThe following conditional constraints should be satisfied:
(1)hnshould lie in the interval 0,5]Within;
(2) heat index sequence { hnMark from 0, h0Is an initial heat value, h0＝0；
(3) Heat index sequence { hnIs increasing sequence, hn<hn+1；
(4) Heat index sequence { hnThe increase should be a decreasing Δ hn>Δhn+1；
(5) Heat index sequence { hnShould have an upper bound, hn≤5；
Step 2: standardizing;
first, the setting sequenceColumn normalized Interval [0,1]Define a new sequence gnIs as
Figure GDA0003317445280000071
The problem is converted into a construction iteration function f (g)n) Wherein f (g)n) In [0,1]]And satisfies:
gn+1＝f(gn)
and order gnThe following characteristics are satisfied:
(1)gn∈[0,1]；
(2)g0＝0；
(3)Δgn＝gn+1-gn>0；
(4)Δgn+1-Δgn<0；
and step 3: a function iteration process;
the iteration function f (x) satisfies the following condition:
(1)f(0)＝ε
(2)f(1)＝1
(3)f'(0)＝1
(4)f'(1)＝1-σ
(5)f(x)≥x
(6)f'(x)>0
(7)f”(x)<0
wherein epsilon and sigma are small quantities, epsilon is less than or equal to 1/2 to ensure that delta gnIs gradually decreased;
let f (x) be a fourth order polynomial function:
f(x)＝P4(x)＝a4x4+a3x3+a2x2+a1x+a0
substituting the above equation constraints can result in:
a0＝ε，a1＝1，2a4+a3＝2ε-σ
a4+a3+a2＝-ε
setting:
σ＝2ε
a0＝ε,a1＝1,a2＝a-ε,a3＝-2a,a4＝a
the iteration function then has the form:
f(x)＝ax4-2ax3+(a-ε)x2+x+ε
when a is 0, the iterative function system has the simplest form
f(x)＝ε+x-εx2
And further:
f'(x)＝1-εx
f”(x)＝-ε
for heat standard sequence { gnIn terms of, the parameter epsilon marks the maximum value of the iteration increment:
Figure GDA0003317445280000081
for sequence { hnThen the maximum value of the iteration increment is 5 epsilon:
Figure GDA0003317445280000082
and 4, step 4: according to maximum iteration increment
Figure GDA0003317445280000083
Obtaining maximum heat value of webpage
Figure GDA0003317445280000084
Comprises the following steps:
Figure GDA0003317445280000085
wherein
Figure GDA0003317445280000086
Is a sequence of heat indicators hnLess than maximum calorific value
Figure GDA0003317445280000087
The value of (c).
Wherein, in the above, gnIs optimally in the value range of [0,1]]The method is convenient for completely normalizing all webpage heat degrees, but actually the value range of the method only needs to be less than hnThe value range of (1) is just the same;
wherein of the above, the maximum iteration increment
Figure GDA0003317445280000088
Only the predicted value, in practical application, the iteration increment approaches to the value only infinitely, but not equals to the value, and similarly, the iteration increment is based on the maximum iteration increment
Figure GDA0003317445280000089
Obtaining maximum heat value of webpage
Figure GDA00033174452800000810
Is also a theoretical value and approaches this value only infinitely;
wherein in the above, ε and σ are taken to be small amounts to ensure Δ gnIs gradually decreased;
in which fig. 1 is an iterative phase diagram, i.e. a sequence of heat standards g after reflection on the y-x linenCan be visually shown on the x-axis, where gn on the abscissa corresponds to g in the above descriptionn(ii) a g (n +1) is g(n+1)；
The invention is not only suitable for the heat treatment of the web pages, but also suitable for the relevant statistics of word frequency, big data analysis and the like.
The above description is only an embodiment of the present invention, but the scope of the present invention is not limited thereto, and any changes or substitutions that can be easily conceived by those skilled in the art within the technical scope of the present invention are included in the scope of the present invention.

Claims (4)

1. A heat iterative computation method is characterized by comprising the following steps:
step 1: setting a hot index h of a web pagenAt Δ hnMark Heat increment Δ h after n +1 th RefreshnComprises the following steps:
Δhn＝hn+1-hn(ii) a The obtained heat index sequence is { hnH, heat index sequence { h }nCarrying out conditional constraint;
step 2: setting a standardization interval of the heat index sequence, and setting the heat index sequence { h) according to the standardization intervalnNormalized to a heat standard sequence gnAnd construct a standard sequence of heat { g }nThe heat iteration function f (g) ofn)：
gn+1＝f(gn)
Wherein f (g)n) I.e. a heat iteration function, where g0＝0；
And step 3: setting a heat iteration function f (g)n) For the heat iteration function f (g)n) Iterative computation is carried out to obtain a heat index sequence { hnMaximum iteration increment of
Figure FDA0003328386030000011
And 4, step 4: according to maximum iteration increment
Figure FDA0003328386030000012
Obtaining the maximum heat value of the webpage;
the specific steps of the step 3 are as follows:
step 3.1: setting a heat iteration function f (g)n) The initial value parameter epsilon of (c), namely:
f(0)＝ε
and f (1) ═ 1, f ' (0) ═ 1, f ' (1) ═ 1- σ, f (x) ≥ x, f ' (x) >0, f "(x) <0, σ ═ 2 epsilon;
step 3.2: setting f (g)n) As a function of a fourth-order polynomial, the argument gnExpressed in x:
f(x)＝P4(x)＝a4x4+a3x3+a2x2+a1x+a0
and a is0＝ε，a1＝1，2a4+a3＝2ε-σ，a4+a3+a2＝-ε；
Step 3.3: and f (x) is transformed by using the relation in the step 3.2 to obtain:
f(x)＝ax4-2ax3+(a-ε)x2+x+ε；
when a is 0, the iterative function system has the simplest form
f(x)＝ε+x-εx2
Further obtaining:
f'(x)＝1-2εx
f”(x)＝-2ε
further, a heat standard sequence { g }is obtainednMaximum value of iteration increment of
Figure FDA0003328386030000024
Figure FDA0003328386030000023
Step 3.4: obtaining a heat index sequence { hnMaximum iteration increment of
Figure FDA0003328386030000025
Comprises the following steps:
Figure FDA0003328386030000021
wherein
Figure FDA0003328386030000026
Is a heat index sequence { hnMaximum iteration increment.
2. A heat degree iterative computation method according to claim 1, wherein, in step 1,
the heat index sequence { hnCarrying out the condition restriction, and then,the conditions include:
hnshould lie in the interval 0, X]In the method, X is a positive integer, and the heat index sequence is as follows: h is0，h1…hn，h0Is an initial heat value, h00, and the heat index sequence is { h }nIs an increasing sequence, i.e. hn<hn+1The heat index sequence is { h }nThe increase should be decreasing, i.e. Δ hn>Δhn+1Heat index sequence hnShould have an upper bound, hn≤X。
3. The heat iterative computation method according to claim 2, wherein the step 2 specifically includes:
step 2.1: setting the standardization interval of the heat index sequence as [0,1 ];
step 2.2: according to the standardized interval, the heat index sequence { hnNormalized to a heat standard sequence gnAnd i.e.:
Figure FDA0003328386030000022
4. the iterative heat computation method of claim 1, wherein step 4 is based on a maximum iteration increment
Figure FDA0003328386030000027
Obtaining maximum heat value of webpage
Figure FDA0003328386030000028
Comprises the following steps:
Figure FDA0003328386030000029
wherein
Figure FDA00033283860300000210
Is a sequence of heat indicators hnLess than maximum calorific value
Figure FDA00033283860300000211
The value of (c).
CN201711478007.4A 2017-12-29 2017-12-29 Heat iterative calculation method Active CN108205589B (en)

Priority Applications (1)

Application Number Priority Date Filing Date Title
CN201711478007.4A CN108205589B (en) 2017-12-29 2017-12-29 Heat iterative calculation method

Applications Claiming Priority (1)

Application Number Priority Date Filing Date Title
CN201711478007.4A CN108205589B (en) 2017-12-29 2017-12-29 Heat iterative calculation method

Publications (2)

Publication Number Publication Date
CN108205589A CN108205589A (en) 2018-06-26
CN108205589B true CN108205589B (en) 2022-02-15

Family

ID=62606020

Family Applications (1)

Application Number Title Priority Date Filing Date
CN201711478007.4A Active CN108205589B (en) 2017-12-29 2017-12-29 Heat iterative calculation method

Country Status (1)

Country Link
CN (1) CN108205589B (en)

Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104657496A (en) * 2015-03-09 2015-05-27 杭州朗和科技有限公司 Method and equipment for calculating information hot value
CN105224608A (en) * 2015-09-06 2016-01-06 华南理工大学 The hot news Forecasting Methodology analyzed based on microblog data and system
CN106326261A (en) * 2015-06-26 2017-01-11 广州市动景计算机科技有限公司 Pre-reading method and device for webpage and intelligent terminal device

Family Cites Families (5)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
WO2006055983A2 (en) * 2004-11-22 2006-05-26 Truveo, Inc. Method and apparatus for a ranking engine
CN103324637B (en) * 2012-03-23 2017-12-12 深圳市世纪光速信息技术有限公司 A kind of hot information method for digging and system
CN104035960A (en) * 2014-05-08 2014-09-10 东莞市巨细信息科技有限公司 Internet information hotspot predicting method
CN104615627B (en) * 2014-09-23 2018-03-30 中国科学院计算技术研究所 A kind of event public feelings information extracting method and system based on microblog
CN105117422B (en) * 2015-07-30 2018-08-24 中国传媒大学 Intelligent social network recommendation system

Patent Citations (3)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104657496A (en) * 2015-03-09 2015-05-27 杭州朗和科技有限公司 Method and equipment for calculating information hot value
CN106326261A (en) * 2015-06-26 2017-01-11 广州市动景计算机科技有限公司 Pre-reading method and device for webpage and intelligent terminal device
CN105224608A (en) * 2015-09-06 2016-01-06 华南理工大学 The hot news Forecasting Methodology analyzed based on microblog data and system

Non-Patent Citations (3)

* Cited by examiner, † Cited by third party
Title
Chinese Hot Topic Extraction Based on Web Log;Junhua Li 等;《2009 International Conference on Web Information Systems and Mining》;20091231;103-107 *
有效的社会媒体热点话题传播模型研究;韩忠明 等;《南京大学学报（自然科学）》;20150131;第51卷(第1期);187-196 *
网络事件和话题的热度：基于传播效果的操作化测量设计;金兼斌 等;《现代传播》;20170515(第5期);71-75 *

Also Published As

Publication number Publication date
CN108205589A (en) 2018-06-26

Similar Documents

Publication Publication Date Title
Vanden-Eijnden et al. Revisiting the finite temperature string method for the calculation of reaction tubes and free energies
Huang et al. Listwise collaborative filtering
CN113609815B (en) Circuit simulation optimization method and device, computer equipment and storage medium
Müller et al. Spatial correlation robust inference
CN112257851A (en) Model confrontation training method, medium and terminal
CN114936639A (en) Progressive confrontation training method and device
Wang et al. Efficient Bayesian yield optimization approach for analog and SRAM circuits
CN110705099B (en) Method for verifying output correlation of wind power plant
Fang et al. A projection framework for testing shape restrictions that form convex cones
CN108205589B (en) Heat iterative calculation method
Zhang et al. Robust generative adversarial network
CN105701207B (en) Resource request quantity prediction method, application recommendation method and device
Zhao et al. Efficient least angle regression for identification of linear-in-the-parameters models
Shabri et al. Empirical mode decomposition–least squares support vector machine based for water demand forecasting
CN111429979A (en) Steel mechanical property prediction method based on support vector machine quantile regression
Liao Novel gradient calculation method for the largest Lyapunov exponent of chaotic systems
Lin et al. Smart building uncertainty analysis via adaptive Lasso
Koksharov et al. Quasi‐Spectral Method for the Solution of the Master Equation for Unimolecular Reaction Systems
CN113554307A (en) RFM (recursive filter) model-based user grouping method and device and readable medium
Wang et al. Stacking strategy-assisted random forest algorithm and its application
Wang et al. Structural reliability analysis using Bayesian support vector regression and subset-assisted importance sampling with active learning
Miao Clustering of different dimensional variables based on distance correlation coefficient
CN113435653B (en) Method and system for predicting saturated power consumption based on logistic model
Qu et al. Adaptive multi‐surrogate‐based constrained optimization method and its application
Wu et al. Multi‐source to multi‐target domain adaptation method based on similarity measurement

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
GR01 Patent grant
GR01 Patent grant