WO2016058423A1 - 新闻列表刷新的方法及装置 - Google Patents

新闻列表刷新的方法及装置 Download PDF

Info

Publication number
WO2016058423A1
WO2016058423A1 PCT/CN2015/083803 CN2015083803W WO2016058423A1 WO 2016058423 A1 WO2016058423 A1 WO 2016058423A1 CN 2015083803 W CN2015083803 W CN 2015083803W WO 2016058423 A1 WO2016058423 A1 WO 2016058423A1
Authority
WO
WIPO (PCT)
Prior art keywords
news
time
recommended
list
time interval
Prior art date
Application number
PCT/CN2015/083803
Other languages
English (en)
French (fr)
Inventor
张一鸣
周晶锦
曹欢欢
Original Assignee
北京字节跳动网络技术有限公司
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 北京字节跳动网络技术有限公司 filed Critical 北京字节跳动网络技术有限公司
Priority to CA2964822A priority Critical patent/CA2964822C/en
Priority to EP15850122.1A priority patent/EP3208725A4/en
Priority to US15/519,756 priority patent/US10509842B2/en
Priority to MX2017004992A priority patent/MX2017004992A/es
Priority to BR112017007909-7A priority patent/BR112017007909A2/zh
Priority to JP2017539488A priority patent/JP6479999B2/ja
Publication of WO2016058423A1 publication Critical patent/WO2016058423A1/zh

Links

Images

Classifications

    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/957Browsing optimisation, e.g. caching or content distillation
    • G06F16/9574Browsing optimisation, e.g. caching or content distillation of access to content, e.g. by caching
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/245Query processing
    • G06F16/2458Special types of queries, e.g. statistical queries, fuzzy queries or distributed queries
    • G06F16/2477Temporal data queries
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/20Information retrieval; Database structures therefor; File system structures therefor of structured data, e.g. relational data
    • G06F16/24Querying
    • G06F16/248Presentation of query results
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/953Querying, e.g. by the use of web search engines
    • G06F16/9535Search customisation based on user profiles and personalisation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F16/00Information retrieval; Database structures therefor; File system structures therefor
    • G06F16/90Details of database functions independent of the retrieved data types
    • G06F16/95Retrieval from the web
    • G06F16/957Browsing optimisation, e.g. caching or content distillation
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0481Interaction techniques based on graphical user interfaces [GUI] based on specific properties of the displayed interaction object or a metaphor-based environment, e.g. interaction with desktop elements like windows or icons, or assisted by a cursor's changing behaviour or appearance
    • G06F3/0482Interaction with lists of selectable items, e.g. menus
    • GPHYSICS
    • G06COMPUTING; CALCULATING OR COUNTING
    • G06FELECTRIC DIGITAL DATA PROCESSING
    • G06F3/00Input arrangements for transferring data to be processed into a form capable of being handled by the computer; Output arrangements for transferring data from processing unit to output unit, e.g. interface arrangements
    • G06F3/01Input arrangements or combined input and output arrangements for interaction between user and computer
    • G06F3/048Interaction techniques based on graphical user interfaces [GUI]
    • G06F3/0487Interaction techniques based on graphical user interfaces [GUI] using specific features provided by the input device, e.g. functions controlled by the rotation of a mouse with dual sensing arrangements, or of the nature of the input device, e.g. tap gestures based on pressure sensed by a digitiser
    • G06F3/0488Interaction techniques based on graphical user interfaces [GUI] using specific features provided by the input device, e.g. functions controlled by the rotation of a mouse with dual sensing arrangements, or of the nature of the input device, e.g. tap gestures based on pressure sensed by a digitiser using a touch-screen or digitiser, e.g. input of commands through traced gestures

Definitions

  • the present invention relates to the field of computers, and in particular, to a method and apparatus for refreshing a news list.
  • news reading is also increasingly fragmented.
  • users generally browse news at a fixed time.
  • Mobile users can open news clients to browse interesting news at any time when they are bored. Therefore, the news client based on smart phones has increasingly become the main tool for the majority of netizens to obtain news.
  • the user experience of most news clients basically follows the logic of traditional portals. Whether it is the home page or the channel, the news is manually selected by the editor or recommended by the recommendation algorithm.
  • the order of the news is generally sorted according to the release time at a certain time granularity.
  • the time granularity here can be minutes, hours, three hours, and so on.
  • the news ordering method of the traditional news client based on the release time, there will be regrets that the good news is missed. For example, at 9:00 in the morning, the user opens the news client, and the news displayed is sorted as shown in Figure 1. At 11:00 am, the user opens the news client again when they are idle. At this time, if you want to ensure that the news list is orderly in the order of the hourly level, the newly recommended news can only be published after 9:00 and before 11:00. If the quality of the news in this section is not high or there is no new news (newly published but the content and previous iterations are not suitable for recommendation), users will have to browse through these low-quality news or not be able to refresh more content.
  • the main purpose of the present invention is to provide a method and apparatus for refreshing a news list, so as to solve the problem that the news client in the prior art sorts according to the news release time, and the news cannot be refreshed by the refresh operation.
  • a method of news list refreshing includes: receiving a refresh signal; reading a refresh start time according to the received refresh signal, The refresh start time is the current system time or the recommended time of the last news that has been refreshed; and the preset at least one time threshold is used, and the time threshold is used to define a time interval for refreshing the news list together with the refresh start time; Refreshing the start time and the time threshold to obtain a recommended news list, the recommended news list includes: at least one news to be recommended, the release time of the news to be recommended is within the time interval; and each news release to be recommended in the recommended news list Recommended time; refresh the news to be recommended in the recommended news list according to the recommended time to generate a new recommended news list.
  • an apparatus for refreshing a news list comprising: a receiving module, configured to receive a refresh signal; and a first reading module, configured to receive the Refreshing the signal, reading the refresh start time, wherein the refresh start time is the current system time or the recommended time of the last news that has been refreshed; the second reading module is configured to read at least one preset time threshold, time The threshold is used to define a time interval for refreshing the news list together with the refresh start time; the first obtaining module is configured to obtain a recommended news list according to the refresh start time and the time threshold, where the recommended news list includes: at least one news to be recommended, The publishing time of the news to be recommended is in the time interval; the first processing module is configured to allocate a recommendation time to each news to be recommended in the recommended news list; and a generating module is configured to: in the recommended news list according to the recommended time The recommended news is refreshed to generate a new list of recommended news.
  • the refresh start time is a current system time or a recommended time of the last news that has been refreshed; reading a preset At least one time threshold, the time threshold is used to define a time interval for refreshing the news list together with the refresh start time; and according to the refresh start time and the time threshold, the recommended news list is obtained, and the recommended news list includes: at least one news to be recommended, to be The recommended news is published in the time interval; the recommended time is allocated to each news to be recommended in the recommended news list; the news to be recommended in the recommended news list is refreshed according to the recommended time, and a new recommended news list is generated.
  • the problem that the news client in the prior art sorts according to the news release time, which makes it impossible to refresh more news through the refresh operation is solved. It realizes that all the news of the day can be refreshed only by the refresh operation.
  • FIG. 1 is a schematic diagram of an interface of a mobile phone news client provided by the prior art
  • FIG. 2 is a flowchart of a method for refreshing a news list according to Embodiment 1 of the present invention
  • FIG. 3 is a schematic diagram of allocation of news display time by a mobile phone news client according to an embodiment of the present invention
  • FIG. 4 is a schematic diagram of an interface for bottom-up refreshing of a mobile phone news client according to an embodiment of the present invention
  • FIG. 5 is a flowchart of an optional method for refreshing a news list according to Embodiment 1 of the present invention.
  • FIG. 6 is a schematic structural diagram of an apparatus for refreshing a news list according to Embodiment 2 of the present invention.
  • FIG. 7 is a schematic structural diagram of an apparatus for refreshing an optional news list according to Embodiment 2 of the present invention.
  • Embodiments of the present invention provide a method for refreshing a news list.
  • FIG. 2 is a flow chart of a method of news list refreshing in accordance with an embodiment of the present invention. As shown in Figure 2, the method includes the following steps:
  • step S11 a refresh signal is received.
  • step S11 of the present application the refresh process is triggered by receiving the refresh signal, and the refresh function of the news list is implemented.
  • the refresh signal may be a signal generated by dragging an area of the page, or may be a signal generated by clicking on an area on the screen, or may be The system sets the refresh time and the system automatically generates a refresh signal.
  • Step S13 Read the refresh start time according to the received refresh signal, wherein the refresh start time is the current system time or the recommended time of the last news that has been refreshed.
  • the refresh type is determined according to the received refresh signal.
  • the refresh start time corresponding to the refresh type is recorded according to different refresh types.
  • the refresh type can be divided into two types: refreshing the latest news and refreshing the historical news, and respectively reading and recording according to the refresh type.
  • the refresh start time corresponding to the refresh type.
  • step S15 at least one time threshold set in advance is read, and the time threshold is used to define a time interval for refreshing the news list together with the refresh start time.
  • the preset time threshold is read, and the time threshold and the refresh start time constitute a time interval.
  • the news with the release time in this time interval is filtered.
  • the time interval mentioned here can also be referred to as a time window.
  • any time point can be set as the refresh start time, and the selection of the refresh start time point depends on the refresh strategy or the refresh algorithm. For example, in this embodiment, when the latest news is refreshed, the current time may be set as the refresh start time. When the historical news is refreshed, the recommended time of the last news refreshed in the historical news list may be set as the refresh start time.
  • Step S17 Obtain a recommended news list according to the refresh start time and the time threshold.
  • the recommended news list includes: at least one news to be recommended, and the release time of the news to be recommended is within a time interval.
  • the recommended news list is obtained according to the time interval formed by the refresh start time and the time threshold.
  • the time threshold can be set according to the user's own preferences. The smaller the time threshold is set, the refreshed and the current time range will be refreshed each time the refresh is performed. The closer the news. However, if the time threshold is set too small, the amount of news that can be refreshed will be small. You can also fix the time threshold to a default value, which can be 24 hours.
  • step S19 a recommendation time is allocated to each news to be recommended in the recommended news list.
  • each news has a time attribute, and the time attribute records the release time of the news.
  • a recommended time attribute is set for each news item.
  • the news in the recommended news list can be sorted by time, and the recommended time is allocated for each news in the news list. It is also possible to perform weighting calculation on each news in the recommended news list according to the browsing habits of the user or the preference of the news type, and assign a recommendation time to each news according to the weight value obtained by weighting the budget according to the weight value. .
  • Step S21 refreshing the news to be recommended in the recommended news list according to the recommended time, and generating a new recommended news list.
  • step S21 of the present application for each news to be recommended in the recommended news list, the positive order or the reverse order is performed according to the order of the recommended time.
  • step S11 to step S21 the refresh of the news is triggered according to the judgment of the refresh signal.
  • step S11 to step S21 the refresh of the news is triggered according to the judgment of the refresh signal.
  • step S11 to step S21 the refresh of the news is triggered according to the judgment of the refresh signal.
  • step S11 to step S21 the refresh of the news is triggered according to the judgment of the refresh signal.
  • step S11 to step S21 the refresh of the news is triggered according to the judgment of the refresh signal.
  • a new allocation recommendation list is generated by assigning a recommendation time to each news and in the order of the recommended time.
  • FIG. 3 intuitively describes a strategy for displaying time allocation.
  • T represents the current system time
  • T0 represents the time of the most recent news display in the current list
  • T1 represents the time of the oldest news in the current list
  • T2 represents the display time of the most recent news in the previous refresh history.
  • the current list is refreshed at 9:00 in the morning
  • the last news item is 7:00 in the morning
  • the last refresh is 8:00 last night
  • T0, T1, T2 are 9:00 in the morning, 7 in the morning. :00, 8:00 last night.
  • the news personalized sorting method is as follows:
  • Step A The news does not show the real release time in the client, but a time set on the server.
  • Step B Each time the user refreshes the news list, the client calculates a time window according to the type of the user action and the time of the last news of the current list, where the time window is also the time interval proposed in the claim, wherein the action type It is divided into top-down pull-down action and bottom-up pull-up action.
  • Step C Given a time window, the news recommendation service recommends to the user a number of news published in a specific time window, and filters out the news that the user has ever brushed out.
  • Step D The server allocates a recommendation time to each recommended news according to the number of news obtained by refreshing and the start and end time of the time window. This recommendation time is valid only for the current user and is recorded on the server.
  • Step E The client sorts the news according to the recommended time of the newly recommended news, and displays the recommended time of the news.
  • Step F Because every time the user refreshes the system, the recommended news may not be newly released after the last refresh. If the time window is large enough (for example, 1 day, there are at least tens of thousands of news in a day), this news sorting method can Get unlimited refreshing product effects.
  • how to allocate the display time of the recommended news is a key link of the present invention. Only when the display time is properly allocated can the news sorting list appear to be arranged in chronological order, and the pull-up refresh should be minimized and recommended.
  • the news, the recommended news here, is the news obtained through the refresh operation.
  • the time that each user sees the news in the list is the time set by the recommended service rather than the release time of the news, which is related to the time the user has swiped the news. In this sense, this time is personalized.
  • the foregoing embodiment of the present invention provides a method for supporting an infinite refresh personalized sorting, which can ensure that the user perceives that the news arrangement follows the chronological order while avoiding missing the wonderful news that the user may be interested in.
  • the present invention solves the problem that the news client in the prior art sorts according to the news release time, and the news cannot be refreshed by the refresh operation. It realizes that all the news of the day can be refreshed only by the refresh operation.
  • the refresh signal includes at least: a first touch sensitive signal generated by sliding from top to bottom on the touch screen and a second generated by sliding from bottom to top on the touch screen. Touch sensitive signal.
  • the refresh signal can be set.
  • the generated touch sensitive signal sets this signal as the first touch sensitive signal for refreshing the most recent news.
  • the generated touch sensitive signal sets this signal as a second touch sensitive signal for refreshing historical news.
  • the refresh signal can also be generated in many forms.
  • a touch sensitive signal generated by clicking on an area on the screen can be defined as a refresh signal.
  • a level signal generated by a physical button on the body of the mobile phone as a refresh signal, and when the volume up button is pressed, the latest news is refreshed; when the volume down button is pressed, the history news is refreshed.
  • the refresh start time is the current system time
  • the above step S17 obtains the recommendation according to the refresh start time and the time threshold.
  • the steps include:
  • Step S171a Acquire, according to the first touch sensitive signal, the number n of news of the first news set included in the recommended news list, where n is an integer.
  • Step S173a Acquire a current system time and a preset first time threshold.
  • Step S175a Determine a first time interval according to the current system time and the first time threshold, where the first time interval is used to define a time interval for refreshing the first recommended news list.
  • Step S177a Acquire, according to the first time interval, n news items whose release time is within the first time interval.
  • Step S179a Generate a first recommended news list according to the obtained n news items.
  • the news item refreshed each time can be set in advance, and a numerical value n is set in advance.
  • the step of refreshing the most recent news is started.
  • the current system time is acquired as the refresh start time.
  • the first time interval for refreshing the news release time is determined according to the current system time and the preset first time threshold.
  • the first time interval may also be referred to as a time window. According to the first time interval, n news published in the first time interval are acquired, and a first recommended news list is generated.
  • the recommended time is allocated to each news to be recommended in the recommended news list, and the steps include:
  • Step S191a obtaining the previous refresh time when the first touch sensitive signal was received and the news list is refreshed.
  • Step S193a Determine a second time interval according to the previous refresh time and the current system time, where the second time interval is used to define the recommended time of the news in the first recommended list.
  • Step S195a Allocating a recommendation time to each news item in the first recommendation list according to the second time interval, wherein the recommendation time is in the second time interval.
  • the second time interval is confirmed according to the previous refresh time and the current time, and the second time interval is used to limit the value range of the recommended time set for each news. According to this second time interval, a recommendation time is allocated for each news.
  • the step of allocating the recommended time to each news in the first recommendation list according to the second time interval in step S195a includes:
  • Step S1951a according to the number of news n and the second time interval in the first recommended news list, the second time interval is equally distributed, and the first equal time interval of each news in the recommended news list is obtained.
  • Step S1953a assigning a recommendation time to each news in the first recommendation list according to the first halving time interval and the current system time.
  • the second time interval may be equally divided into a plurality of first equal time intervals according to the number n of news in the recommended news list.
  • Each piece of news in the first recommendation list is assigned a recommendation time according to the order of the release time and the first equal time interval.
  • a random variable can also be introduced. Use random variables to assign a random recommendation time for each news in the second time interval.
  • each user's news browsing habits, interest news types, and other personalized information can be used to weight each news in the recommendation list to determine the weight value of each news item for the user.
  • the recommendation list is pre-sorted according to the weight value. Then, a recommended time value is assigned to each news in the pre-sorted recommendation list by the above method of allocating the recommended time. News that interests the user can be refreshed first.
  • the refresh start time is the recommended time of the last news that has been refreshed, and the above step S17 is based on the refresh start time.
  • the steps of obtaining the recommended news list also include:
  • Step S171b Acquire, according to the second touch sensitive signal, the number of news m of the second news set included in the recommended news list, where m is an integer.
  • Step S173b Acquire a recommended time and a second time threshold of the last news that has been refreshed.
  • Step S175b Determine a third time interval according to the recommended time of the last news that has been refreshed and the second time threshold, where the third time interval is used to define a time interval for refreshing the second recommended news list.
  • Step S177b according to the third time interval, obtaining m news with the release time in the third time interval.
  • Step S179b Generate a second recommended news list according to the obtained m news.
  • the news item refreshed each time can be set in advance, and a value m is set in advance.
  • the step of refreshing the historical news is started when the second touch sensitive signal generated by the bottom-up sliding on the screen is received.
  • the recommended time of the last news that has been refreshed is acquired as the refresh start time.
  • the third time interval for refreshing the news release time is determined according to the recommended time of the last news that has been refreshed and the second time threshold set in advance. This third time interval may also be referred to as a time window. According to the third time interval, m news published in the third time interval are obtained, and a second recommended news list is generated.
  • the recommended time is allocated to each news to be recommended in the recommended news list, and the step further includes:
  • Step S191b Acquire a recommended time and a third time threshold of the last news that has been refreshed.
  • Step S193b Determine a fourth time interval according to the recommended time of the last news that has been refreshed and the third time threshold, where the fourth time interval is used to define the recommended time of the news in the second recommended list.
  • Step S195b assigning a recommendation time to each news in the second recommendation list, wherein the recommendation time is in the fourth time interval.
  • a recommendation time is allocated for each news in the second recommendation list according to the fourth time interval.
  • the recommended time allocated to the refreshed historical news is limited using the fourth time interval.
  • the maximum display time is the display time of the oldest news in the current history list, but the minimum value cannot simply correspond to The last time the latest news was refreshed. This is because the number of recommended news is limited (assuming 15). If the display time of these 15 items has been filled twice, the interval between refresh history refreshes, the user can only display the old refresh history after the next pull-down refresh. And can't take this opportunity to recommend more news. So generally speaking, we will take a fixed time interval from the maximum value, such as 10 minutes, the display time of each news is equal to the display time of the previous news minus 10 minutes.
  • the display time of the i-th recommended news is T-i*t, where t is a fixed interval, which may be 10 minutes. If there is news in the recommended news, the display time is already less than the latest news in the last refresh.
  • the list with the maximum time interval of 1 hour is the current list of users, and the last time the user refreshed was last night, then the system will recommend older news when the user pulls up the list.
  • the step of assigning the recommended time to each news in the second recommendation list according to the fourth time interval in step S191b includes:
  • Step S1911b according to the number of news m and the fourth time interval in the second recommended news list, the fourth time interval is evenly distributed, and the second halving time interval of each news in the recommended news list is obtained;
  • Step S1913b assigning a recommendation time to each news item in the second recommendation list according to the second halving time interval and the recommended time of the last news item that has been refreshed.
  • the fourth time interval may be equally divided into a plurality of second equal time intervals according to the number m of news in the recommended news list.
  • Each piece of news in the second recommendation list is assigned a recommendation time according to the order of the release time and the second division time interval.
  • a random variable can also be introduced. Use random variables to assign a random recommendation time for each news in the fourth time interval.
  • each user's news browsing habits, interest news types, and other personalized information can be used to weight each news in the recommendation list to determine the weight value of each news item for the user.
  • the recommendation list is pre-sorted according to the weight value.
  • a recommended time value is assigned to each news in the pre-sorted recommendation list by the above method of allocating the recommended time.
  • the user is preferentially refreshed with news of different time intervals that the user is most likely to be interested in. This way, you can recommend the most likely news to the user.
  • step S19 before the recommendation time is allocated to each news to be recommended in the recommended news list in step S19, the following steps may also be performed:
  • Step S181 obtaining a historical news list that has been obtained by refreshing before the current refreshing
  • Step S183 the comparison is performed according to the historical news list and the recommended news list.
  • the news in the recommended news list is the same as the news in the historical news list, the same news is deleted from the recommended news list.
  • step S181 to step S183 the comparison is performed according to the historical news list and the recommended news list, and the news in the recommended news list and the historical news list are deleted. Avoid the same news being refreshed repeatedly.
  • the recommendation service In practice, taking the news client running on the touch screen mobile phone as an example, through a given time interval, the recommendation service first finds news that may be of interest to the user according to an algorithm, and then needs to find out which one has been shown to the user. News and filtered out. Because this part of the news should not be shown to the user again, this step can be called recommendation to weight. In general, the recommendation service stores all users' browsing history in a memory-based high-performance cache service (such as Memory Cache) for quick access.
  • a memory-based high-performance cache service such as Memory Cache
  • the main advantage of the present invention is that it not only satisfies the user's perceptually demanding order of news in chronological order, but also does not limit the recommendation opportunities of news due to sorting, and can support an infinitely refreshed user experience. It also distinguishes between two different types of refresh requirements: pull-up and pull-down refresh.
  • the embodiment of the present invention further provides a device for refreshing a news list.
  • the device includes: a receiving module 30, a first reading module 32, a second reading module 34, a first acquiring module 36, and a first A processing module 38 and a generating module 40.
  • the receiving module 30 is configured to receive a refresh signal.
  • the receiving module 30 of the present application triggers a refresh process by receiving a refresh signal, and implements a refresh function for the news list.
  • the refresh signal may be a signal generated by dragging an area of the page, or may be a signal generated by clicking on an area on the screen, or may be The system sets the refresh time and the system automatically generates a refresh signal.
  • the first reading module 32 is configured to read the refresh start time according to the received refresh signal, wherein the refresh start time is the current system time or the recommended time of the last news that has been refreshed.
  • the first reading module 32 of the present application determines the refresh type according to the received refresh signal.
  • the refresh start time corresponding to the refresh type is recorded according to different refresh types.
  • the refresh type can be divided into two types: refreshing the latest news and refreshing the historical news, and respectively reading and recording according to the refresh type.
  • the refresh start time corresponding to the refresh type.
  • the second reading module 34 is configured to read at least one time threshold set in advance, and the time threshold is used to define a time interval for refreshing the news list together with the refresh start time.
  • the second reading module 34 of the present application reads a preset time threshold, and the time threshold and the refresh start time constitute a time interval. Through the above time interval, the news with the release time in this time interval is filtered.
  • the time interval mentioned here can also be referred to as a time window.
  • any time point can be set as the refresh start time, and the selection of the refresh start time point depends on the refresh strategy or the refresh algorithm. For example, in this embodiment, when the latest news is refreshed, the current time may be set as the refresh start time. When the historical news is refreshed, the recommended time of the last news refreshed in the historical news list may be set as the refresh start time.
  • the first obtaining module 36 is configured to obtain a recommended news list according to the refresh start time and the time threshold.
  • the recommended news list includes: at least one news to be recommended, and the release time of the news to be recommended is within the time interval.
  • the first obtaining module 36 of the present application obtains the recommended news list according to the time interval formed by the refresh start time and the time threshold.
  • the time threshold can be set according to the user's own preferences. The smaller the time threshold is set, the refreshed and the current time range will be refreshed each time the refresh is performed. The closer the news. However, if the time threshold is set too small, the amount of news that can be refreshed will be small. You can also fix the time threshold to a default value, which can be 24 hours.
  • the first processing module 38 is configured to allocate a recommended time to each news to be recommended in the recommended news list.
  • each news has a time attribute, and the time attribute records the release time of the news.
  • a recommended time attribute is set for each news item.
  • the news in the recommended news list can be sorted by time, and the recommended time is allocated for each news in the news list. It is also possible to perform weighting calculation on each news in the recommended news list according to the browsing habits of the user or the preference of the news type, and assign a recommendation time to each news according to the weight value obtained by weighting the budget according to the weight value. .
  • the generating module 40 is configured to refresh the news to be recommended in the recommended news list according to the recommended time to generate a new recommended news list.
  • the positive order or the reverse order is performed according to the order of the recommended time.
  • the receiving module 30, the first reading module 32, the second reading module 34, the first obtaining module 36, the first processing module 38, and the generating module 40 trigger a refresh of the news according to the judgment of the refresh signal. .
  • the receiving module 30, the first reading module 32, the second reading module 34, the first obtaining module 36, the first processing module 38, and the generating module 40 trigger a refresh of the news according to the judgment of the refresh signal.
  • the receiving module 30, the first reading module 32, the second reading module 34, the first obtaining module 36, the first processing module 38, and the generating module 40 trigger a refresh of the news according to the judgment of the refresh signal.
  • re-add the recommended time attribute for each news re-add the recommended time attribute for each news.
  • a new allocation recommendation list is generated by assigning a recommendation time to each news and in the order of the recommended time.
  • FIG. 3 intuitively describes a strategy for displaying time allocation.
  • T represents the current system time
  • T0 represents the time of the most recent news display in the current list
  • T1 represents the time of the oldest news in the current list
  • T2 represents the display time of the most recent news in the previous refresh history.
  • the current list is refreshed at 9:00 in the morning
  • the last news item is 7:00 in the morning
  • the last refresh is 8:00 last night
  • T0, T1, T2 are 9:00 in the morning, 7 in the morning. :00, 8:00 last night.
  • the news personalized sorting method is as follows:
  • Step A The news does not show the real release time in the client, but a time set on the server.
  • Step B Each time the user refreshes the news list, the client calculates a time window according to the type of the user action and the time of the last news of the current list, where the time window is also the time interval proposed in the claim, wherein the action type It is divided into top-down pull-down action and bottom-up pull-up action.
  • Step C Given a time window, the news recommendation service recommends to the user a number of news published in a specific time window, and filters out the news that the user has ever brushed out.
  • Step D The server allocates a recommendation time to each recommended news according to the number of news obtained by refreshing and the start and end time of the time window. This recommendation time is valid only for the current user and is recorded on the server.
  • Step E The client sorts the news according to the recommended time of the newly recommended news, and displays the recommended time of the news.
  • Step F Because every time the user refreshes the system, the recommended news may not be newly released after the last refresh. If the time window is large enough (for example, 1 day, there are at least tens of thousands of news in a day), this news sorting method can Get unlimited refreshing product effects.
  • how to allocate the display time of the recommended news is a key link of the present invention. Only when the display time is properly allocated can the news sorting list appear to be arranged in chronological order, and the pull-up refresh should be minimized and recommended.
  • the news, the recommended news here, is the news obtained through the refresh operation.
  • the time that each user sees the news in the list is the time set by the recommended service rather than the release time of the news, which is related to the time the user has swiped the news. In this sense, this time is personalized.
  • the foregoing embodiment of the present invention provides a method for supporting an infinite refresh personalized sorting, which can ensure that the user perceives that the news arrangement follows the chronological order while avoiding missing the wonderful news that the user may be interested in.
  • the refresh signal includes at least: a first touch sensitive signal generated by sliding from top to bottom on the touch screen and a second touch sensitive signal generated by sliding from bottom to top on the touch screen.
  • the refresh signal can be set.
  • the generated touch sensitive signal sets this signal as the first touch sensitive signal for refreshing the most recent news.
  • the generated touch sensitive signal sets this signal as a second touch sensitive signal for refreshing the historical news.
  • the refresh signal can also be generated in many forms.
  • a touch sensitive signal generated by clicking on an area on the screen can be defined as a refresh letter. number.
  • a level signal generated by a physical button on the body of the mobile phone as a refresh signal, and when the volume up button is pressed, the latest news is refreshed; when the volume down button is pressed, the history news is refreshed.
  • the refresh start time is the current system time
  • the first obtaining module 36 includes: a first sub-acquisition module 3611, a second sub-acquisition module 3613, a first sub-determination module 3615, a third sub-acquisition module 3617, and a first sub-generation module 3619.
  • the first sub-acquisition module 3611 is configured to obtain, according to the first touch sensitive signal, the number n of news of the first news set included in the recommended news list.
  • the second sub-acquisition module 3613 is configured to acquire a current system time and a preset first time threshold.
  • the first sub-determination module 3615 is configured to determine a first time interval according to the current system time and the first time threshold, where the first time interval is used to define a time interval for refreshing the first recommended news list.
  • the third sub-acquisition module 3617 is configured to obtain, according to the first time interval, n news items whose release time is within the first time interval.
  • the first sub-generation module 3619 is configured to generate a first recommended news list according to the obtained n news.
  • the first sub-acquisition module 3611, the second sub-acquisition module 3613, the first sub-determination module 3651, the third sub-acquisition module 3617, and the first sub-generation module 3619 can pre-set each refreshed news item. Set a value n in advance.
  • the step of refreshing the most recent news is started.
  • the current system time is acquired as the refresh start time.
  • the first time interval for refreshing the news release time is determined according to the current system time and the preset first time threshold.
  • the first time interval may also be referred to as a time window. According to the first time interval, n news published in the first time interval are acquired, and a first recommended news list is generated.
  • the first processing module 38 includes: a fourth sub-acquisition module 3811, a second sub-determination module 3813, and a first distribution module 3815.
  • the fourth sub-acquisition module 3811 is configured to acquire a previous refresh time when the first touch sensitive signal is received and the news list is refreshed.
  • the second sub-determination module 3813 is configured to determine a second time interval according to the previous refresh time and the current system time, where the second time interval is used to define the recommended time of the news in the first recommendation list.
  • the first allocating module 3815 is configured to allocate a recommended time to each news in the first recommendation list according to the second time interval, wherein the recommended time is in the second time interval.
  • the fourth sub-acquisition module 3811, the second sub-determination module 3813, and the first distribution module 3815 confirm the second time interval according to the previous refresh time and the current time, and the second time interval is used to be limited to each news setting.
  • the range of values for the recommended time According to this second time interval, a recommendation time is allocated for each news.
  • the first allocation module 3815 includes: a first sub-processing module 38151 and a first sub-allocation module 38153.
  • the first sub-processing module 38151 is configured to perform an average distribution of the second time interval according to the number of news n and the second time interval in the first recommended news list, and obtain a first halving time interval of each news in the recommended news list;
  • the first sub-allocation module 38153 is configured to allocate a recommended time to each news in the first recommendation list according to the first halving time interval and the current system time.
  • the first sub-processing module 38151 and the first sub-allocation module 38153 may divide the second time interval into a plurality of first equal-divided time intervals according to the number n of news in the recommended news list. Each piece of news in the first recommendation list is assigned a recommendation time according to the order of the release time and the first halving time interval.
  • a random variable can also be introduced. Use random variables to assign a random recommendation time for each news in the second time interval.
  • each user's news browsing habits, interest news types, and other personalized information can be used to weight each news in the recommendation list to determine the weight value of each news item for the user.
  • the recommendation list is pre-sorted according to the weight value.
  • a recommended time value is assigned to each news in the pre-sorted recommendation list by the above method of allocating the recommended time. According to different refresh methods, give priority to users New news from different time intervals that users are most likely to be interested in. This way, you can recommend the most likely news to the user.
  • the refresh start time is the last news that has been refreshed.
  • the first acquisition module 36 further includes a fifth sub-acquisition module 3621, a sixth sub-acquisition module 3623, a third sub-determination module 3625, a seventh sub-acquisition module 3627, and a second sub-generation module 3629.
  • the fifth sub-acquisition module 3621 is configured to obtain, according to the second touch sensitive signal, the number of news m of the second news set included in the recommended news list.
  • the sixth sub-acquisition module 3623 is configured to obtain a recommended time and a second time threshold of the last news that has been refreshed.
  • the third sub-determination module 3625 is configured to determine a third time interval according to the recommended time of the last news that has been refreshed and the second time interval, where the third time interval is used to define a time interval for refreshing the second recommended news list.
  • the seventh sub-acquisition module 3627 is configured to obtain, according to the third time interval, m news that the release time is in the third time interval.
  • the second sub-generation module 3629 is configured to generate a second recommended news list according to the obtained m news.
  • the fifth sub-acquisition module 3621, the sixth sub-acquisition module 3623, the third sub-determination module 3625, the seventh sub-acquisition module 3627, and the second sub-generation module 3629 can set the news items that are refreshed each time in advance.
  • a value m is set in advance.
  • the step of refreshing the historical news is started when the second touch sensitive signal generated by the bottom-up sliding on the screen is received.
  • the recommended time of the last news that has been refreshed is acquired as the refresh start time.
  • the third time interval for refreshing the news release time is determined according to the recommended time of the last news that has been refreshed and the second time threshold set in advance. This third time interval may also be referred to as a time window. According to the third time interval, m news published in the third time interval are obtained, and a second recommended news list is generated.
  • the system preferentially displays his refresh history, but there is a certain time interval between his two refresh history.
  • some news needs to be refreshed instead of jumping directly to the older history.
  • the start time of the time window should be twice.
  • the display time mentioned here is not the actual news release time, but the news recommendation time.
  • the first processing module 38 further includes: an eighth obtaining module 3821, a fourth sub-determining module 3823, and a second assigning module 3825.
  • the eighth obtaining module 3821 is configured to obtain a recommended time and a third time threshold of the last news that has been refreshed;
  • the fourth sub-determination module 3823 is configured to determine, according to the recommended time of the last news that has been refreshed and the third time threshold, a fourth time interval, where the fourth time interval is used to define a recommendation time of the news in the second recommendation list;
  • the second allocating module 3825 is configured to allocate a recommended time to each news in the second recommended list according to the fourth time interval, wherein the recommended time is in the fourth time interval.
  • the first processing module 38 includes: an eighth obtaining module 3821, a fourth sub-determining module 3823, and a second assigning module 3825, and according to the fourth time interval, allocating a recommended time for each news in the second recommended list.
  • the fourth time interval is used to limit the recommended time allocated to the refreshed historical news.
  • the maximum display time is the display time of the oldest news in the current history list, but the minimum value cannot simply correspond to The last time the latest news was refreshed. This is because the number of recommended news is limited (assuming 15). If the display time of these 15 items has been filled twice, the interval between refresh history refreshes, the user can only display the old refresh history after the next pull-down refresh. And can't take this opportunity to recommend more news. So generally speaking, we will take a fixed time interval from the maximum value, such as 10 minutes, the display time of each news is equal to the display time of the previous news minus 10 minutes.
  • the display time of the i-th recommended news is T-i*t, where t is a fixed interval, which may be 10 minutes. If there is news in the recommended news, the display time is already less than the latest news in the last refresh.
  • the list with the maximum time interval of 1 hour is the current list of users, and the last time the user refreshed was last night, then the system will recommend older news when the user pulls up the list.
  • the second allocation module 3825 includes: a second sub-processing module 38251 and a second sub-allocation module 38253.
  • the second sub-processing module 38251 is configured to perform an average distribution on the fourth time interval according to the number of news m and the fourth time interval in the second recommended news list, and obtain a second equal interval of each news in the recommended news list. .
  • the second sub-allocation module 38253 is configured to allocate a recommended time for each news in the second recommendation list according to the second halving time interval and the recommended time of the last news that has been refreshed.
  • the second sub-processing module 38251 and the second sub-allocation module 38253 may equally divide the fourth time interval into a plurality of second equal-divided time intervals according to the quantity m of news in the recommended news list. Each piece of news in the second recommendation list is assigned a recommendation time according to the order of the release time and the second division time interval.
  • a random variable can also be introduced. Use random variables to assign a random recommendation time for each news in the fourth time interval.
  • each user's news browsing habits, interest news types, and other personalized information can be used to weight each news in the recommendation list to determine the weight value of each news item for the user.
  • the recommendation list is pre-sorted according to the weight value. Then, a recommended time value is assigned to each news in the pre-sorted recommendation list by the above method of allocating the recommended time.
  • the news that makes the user uninterested is first refreshed when refreshing the historical news, so that it is possible to preferentially refresh the user's interest when refreshing the latest news.
  • the apparatus further includes: a second obtaining module 371 and a second processing module 373.
  • the second obtaining module 371 is configured to obtain a historical news list that has been obtained by refreshing before the current refreshing
  • the second processing module 373 is configured to perform comparison according to the historical news list and the recommended news list. When the news in the recommended news list is the same as the news in the historical news list, the same news is deleted from the recommended news list.
  • the second obtaining module 371 and the second processing module 373 perform comparison according to the historical news list and the recommended news list, and delete the news in the recommended news list and the repeated news in the historical news list. Avoid the same news being refreshed repeatedly.
  • the recommendation service In practice, taking the news client running on the touch screen mobile phone as an example, through a given time interval, the recommendation service first finds news that may be of interest to the user according to an algorithm, and then needs to find out which one has been displayed to User's news is filtered out. Because this part of the news should not be shown to the user again, this step can be called recommendation to weight. In general, the recommendation service stores all users' browsing history in a memory-based high-performance cache service (such as Memory Cache) for quick access.
  • a memory-based high-performance cache service such as Memory Cache
  • the main advantage of the present invention is that it not only satisfies the user's perceptually demanding order of news in chronological order, but also does not limit the recommendation opportunities of news due to sorting, and can support an infinitely refreshed user experience. It also distinguishes between two different types of refresh requirements: pull-up and pull-down refresh.
  • the various functional units provided by the embodiments of the present application may be operated in a mobile terminal, a computer terminal, or the like, or may be stored as part of a storage medium.
  • embodiments of the present invention may provide a computer terminal, which may be any computer terminal device in a group of computer terminals.
  • a computer terminal may also be replaced with a terminal device such as a mobile terminal.
  • the computer terminal may be located in at least one network device of the plurality of network devices of the computer network.
  • the computer terminal may execute the program code of the following steps in the method of refreshing the news list: receiving the refresh signal; and reading the refresh start time according to the received refresh signal, wherein the refresh start time is the current system Time or recommended time of the last news that has been refreshed; reading at least one time threshold set in advance, the time threshold is used to define a time interval for refreshing the news list together with the refresh start time; obtaining according to the refresh start time and the time threshold
  • the recommended news list includes: at least one news to be recommended, the release time of the news to be recommended is within the time interval; the recommended time is allocated to each news to be recommended in the recommended news list; and the recommended news is recommended according to the recommended time The news to be recommended in the list is refreshed to generate a new recommended news list.
  • the computer terminal can include: one or more processors, memory, and transmission means.
  • the memory can be used to store software programs and modules, such as the method and the program instructions/modules corresponding to the news list refreshing in the embodiment of the present invention, and the processor executes various software programs and modules stored in the memory. Functional application and data processing, that is, a method of implementing the above-mentioned news list refresh.
  • the memory may include a high speed random access memory, and may also include non-volatile memory such as one or more magnetic storage devices, flash memory, or other non-volatile solid state memory.
  • the memory can further include memory remotely located relative to the processor, which can be connected to the terminal over a network. Examples of such networks include, but are not limited to, the Internet, intranets, local area networks, mobile communication networks, and combinations thereof.
  • the above transmission device is for receiving or transmitting data via a network.
  • Specific examples of the above network may include a wired network and a wireless network.
  • the transmission device includes a Network Interface Controller (NIC) that can be connected to other network devices and routers via a network cable to communicate with the Internet or a local area network.
  • the transmission device is a Radio Frequency (RF) module for communicating with the Internet wirelessly.
  • NIC Network Interface Controller
  • RF Radio Frequency
  • the memory is used to store preset action conditions and information of the preset rights user, and an application.
  • the processor can call the memory stored information and the application by the transmitting device to execute the program code of the method steps of each of the alternative or preferred embodiments of the above method embodiments.
  • the computer terminal can also be a smart phone (such as an Android phone, an iOS phone, etc.), a tablet computer, a palm computer, and a mobile Internet device (MID), a PAD, and the like.
  • a smart phone such as an Android phone, an iOS phone, etc.
  • a tablet computer such as a Samsung Galaxy Tab, etc.
  • a palm computer such as a Samsung Galaxy Tab, etc.
  • MID mobile Internet device
  • Embodiments of the present invention also provide a storage medium.
  • the foregoing storage medium may be used to save the program code executed by the page layout method provided by the foregoing method embodiment and the system embodiment.
  • the foregoing storage medium may be located in any one of the computer terminal groups in the computer network, or in any one of the mobile terminal groups.
  • the storage medium is configured to store program code for performing the following steps: receiving a refresh signal; and reading a refresh start time according to the received refresh signal, wherein the refresh start time is The current system time or the recommended time of the last news that has been refreshed; reading at least one time threshold set in advance, the time threshold is used to define a time interval for refreshing the news list together with the refresh start time; according to the refresh start time and the time threshold And obtaining a recommended news list, the recommended news list includes: at least one news to be recommended, the release time of the news to be recommended is within a time interval; and the recommended time is allocated to each news to be recommended in the recommended news list; according to the recommended time The news to be recommended in the recommended news list is refreshed to generate a new recommended news list.
  • the storage medium may also be arranged to store program code for various preferred or optional method steps provided by the method for performing a news list refresh.

Landscapes

  • Engineering & Computer Science (AREA)
  • Theoretical Computer Science (AREA)
  • General Engineering & Computer Science (AREA)
  • Physics & Mathematics (AREA)
  • Databases & Information Systems (AREA)
  • General Physics & Mathematics (AREA)
  • Data Mining & Analysis (AREA)
  • Computational Linguistics (AREA)
  • Human Computer Interaction (AREA)
  • Mathematical Physics (AREA)
  • Probability & Statistics with Applications (AREA)
  • Software Systems (AREA)
  • Fuzzy Systems (AREA)
  • User Interface Of Digital Computer (AREA)
  • Two-Way Televisions, Distribution Of Moving Picture Or The Like (AREA)
  • Telephone Function (AREA)

Abstract

一种新闻列表刷新的方法及装置。其中,该方法包括:接收刷新信号(S11);根据接收到的刷新信号,读取刷新起始时间(S13);读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间(S15);根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内(S17);对推荐新闻列表内的每条待推荐的新闻分配推荐时间(S19);根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表(S21)。该方法及装置解决了现有技术中新闻客户端按照新闻发布时间进行排序,导致无法通过刷新操作刷新出更多新闻的问题。

Description

新闻列表刷新的方法及装置 技术领域
本发明涉及计算机领域,具体而言,涉及一种新闻列表刷新的方法及装置。
背景技术
在移动互联网时代,新闻阅读也越来越呈现碎片化的特点。相比于PC时代用户一般会在固定的时间段浏览新闻,移动用户在无聊的时候随时可以打开新闻客户端浏览感兴趣的新闻。所以,基于智能手机的新闻客户端越来越成为广大网民获取新闻的主要工具。大部分新闻客户端的用户体验基本沿用了传统门户网站的逻辑。无论是主页还是频道,新闻都是经过编辑人工挑选或是通过推荐算法推荐出来的,新闻的排序一般都在某个时间粒度上按照发布时间排序。这里的时间粒度可以是分钟级,小时级,三小时等等。用户在浏览时一般会因为无法感知还有多少内容没有浏览过而感觉很不适应。除此之外,按照传统新闻客户端基于发布时间的新闻排序方法,会发生错失好新闻的遗憾。例如,早上9:00用户打开了新闻客户端,展示的新闻排序如图1。上午11:00,用户在空闲时又打开了新闻客户端。这时,如果要保证新闻列表以小时级的粒度有序,新推荐的新闻只能是发表于9:00以后,11:00以前的。如果这一段的新闻质量不高或者没有新的新闻(有新发表的但是内容和之前的重复也不适宜推荐),用户就得要么浏览这些低质量新闻要么压根无法刷新出更多内容。实际上,早上7:00到9:00是优质新闻集中发布的高峰期,因为版面的限制,上次给用户展示的新闻只是一部分精选。还有很多质量也不错的新闻没有机会展示。如果仅仅因为要保持新闻列表的时间有序就不再推荐这部分新闻非常可惜。
针对现有技术中新闻客户端按照新闻发布时间进行排序,导致无法通过刷新操作刷新出更多新闻的问题,目前尚未提出有效的解决方案。
发明内容
本发明的主要目的在于提供一种新闻列表刷新的方法及装置,以解决现有技术中新闻客户端按照新闻发布时间进行排序,导致无法通过刷新操作刷新出更多新闻的问题。
为了实现上述目的,根据本发明实施例的一个方面,提供了一种新闻列表刷新的方法。该方法包括:接收刷新信号;根据接收到的刷新信号,读取刷新起始时间,其 中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间;根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内;对推荐新闻列表内的每条待推荐的新闻分配推荐时间;根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表。
为了实现上述目的,根据本发明实施例的另一方面,提供了一种新闻列表刷新的装置,该装置包括:接收模块,用于接收刷新信号;第一读取模块,用于根据接收到的刷新信号,读取刷新起始时间,其中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;第二读取模块,用于读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间;第一获取模块,用于根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内;第一处理模块,用于对推荐新闻列表内的每条待推荐的新闻分配推荐时间;生成模块,用于根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表。
根据发明实施例,通过接收刷新信号;根据接收到的刷新信号,读取刷新起始时间,其中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间;根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内;对推荐新闻列表内的每条待推荐的新闻分配推荐时间;根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表,解决了现有技术中新闻客户端按照新闻发布时间进行排序,导致无法通过刷新操作刷新出更多新闻的问题。实现了仅通过刷新操作,就可以刷新出当天所有新闻的效果。
为了实现上述以及相关目的,本发明的一个或多个方面包括后面将详细说明并在权利要求中特别指出的特征。下面的说明以及附图详细说明了本发明的某些示例性方面。然而,这些方面指示的仅仅是可使用本发明的原理的各种方式中的一些方式。此外,本发明旨在包括所有这些方面以及它们的等同物。
附图说明
通过参考以下结合附图的说明及权利要求书的内容,并且随着对本发明的更全面理解,本发明的其它目的及结果将更加明白及易于理解。构成本申请的一部分的附图 用来提供对本发明的进一步理解,本发明的示意性实施例及其说明用于解释本发明,并不构成对本发明的不当限定。在附图中:
图1是现有技术提供的手机新闻客户端的界面示意图;
图2是根据本发明实施例一的新闻列表刷新的方法流程图;
图3是根据本发明实施例的手机新闻客户端对新闻显示时间的分配示意图;
图4是根据本发明实施例的对手机新闻客户端进行自下而上刷新的界面示意图;
图5是根据本发明实施例一的可选的新闻列表刷新的方法流程图;
图6是根据本发明实施例二的新闻列表刷新的装置的结构示意图;以及
图7是根据本发明实施例二的可选的新闻列表刷新的装置的结构示意图。
具体实施方式
需要说明的是,在不冲突的情况下,本申请中的实施例及实施例中的特征可以相互组合。下面将参考附图并结合实施例来详细说明本发明。
为了使本技术领域的人员更好地理解本发明方案,下面将结合本发明实施例中的附图,对本发明实施例中的技术方案进行清楚、完整地描述,显然,所描述的实施例仅仅是本发明一部分的实施例,而不是全部的实施例。基于本发明中的实施例,本领域普通技术人员在没有做出创造性劳动前提下所获得的所有其他实施例,都应当属于本发明保护的范围。
需要说明的是,本发明的说明书和权利要求书及上述附图中的术语“第一”、“第二”等是用于区别类似的对象,而不必用于描述特定的顺序或先后次序。应该理解这样使用的数据在适当情况下可以互换,以便这里描述的本发明的实施例。此外,术语“包括”和“具有”以及他们的任何变形,意图在于覆盖不排他的包含,例如,包含了一系列步骤或单元的过程、方法、系统、产品或设备不必限于清楚地列出的那些步骤或单元,而是可包括没有清楚地列出的或对于这些过程、方法、产品或设备固有的其它步骤或单元。
实施例1
本发明实施例提供了一种新闻列表刷新的方法。
图2是根据本发明实施例的新闻列表刷新的方法的流程图。如图2所示,该方法包括步骤如下:
步骤S11,接收刷新信号。
本申请上述步骤S11,通过接收刷新信号,来触发刷新进程,实现对新闻列表的刷新功能。
在实际当中,以触屏手机上运行的新闻客户端为例,上述刷新信号可以是拖动页面某一区域产生信号,也可以是通过点击屏幕上的某一区域产生的信号,还可以是对系统设定刷新时间,系统自动产生的刷新信号。
步骤S13,根据接收到的刷新信号,读取刷新起始时间,其中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间。
本申请上述步骤S13,根据接收到的刷新信号,对刷新类型进行判断。依照不同的刷新类型,记录与该刷新类型相对应的刷新起始时间。
在实际当中,以触屏手机上运行的新闻客户端为例,刷新类型可以分为:对最近新闻进行刷新和对历史新闻进行刷新这两种类型,根据刷新类型的不同,分别读取并记录与刷新类型相对应的刷新起始时间。
步骤S15,读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间。
本申请上述步骤S15,读取预先设定的时间阈值,时间阈值与刷新起始时间构成了一个时间区间。通过上述时间区间,来筛选发布时间在此时间区间内的新闻。这里所说的时间区间也可以被称为时间窗口。
在实际当中,以触屏手机上运行的新闻客户端为例,可以设定任意一个时间点作为刷新起始时间,刷新起始时间点的选择依照刷新策略或者刷新算法而定。例如,本实施例中,当对最近新闻进行刷新时,可以设置当前时间为刷新起始时间。当对历史新闻进行刷新时,可以设置历史新闻列表中已刷新的最后一条新闻的推荐时间为刷新起始时间。
步骤S17,根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内。
本申请上述步骤S17,根据刷新起始时间和时间阈值构成的时间区间,获取推荐新闻列表。
在实际当中,以触屏手机上运行的新闻客户端为例,时间阈值可以根据用户自己的喜好进行设置,时间阈值设定的越小,每次进行刷新时,就会刷新出与当前时间范围越接近的新闻。但是,如果将时间阈值设置的过于小,可以被刷新的新闻数量就会很少。也可以将时间阈值固定为一个默认值,默认值可以为24小时。
步骤S19,对推荐新闻列表内的每条待推荐的新闻分配推荐时间。
本申请上述步骤S19中,每条新闻都有时间属性,时间属性记录了该条新闻的发布时间。在这里,除了发布时间又为每条新闻设置推荐时间属性。
在实际当中,以触屏手机上运行的新闻客户端为例,为每条新闻设置推荐时间的方法有很多。其中,可以先通过对推荐新闻列表中的新闻按时间的远近进行排序,并依次为新闻列表中的每条新闻分配推荐时间。也可以根据用户的浏览习惯或对新闻类型的喜好程度,对推荐新闻列表中的各条新闻进行加权运算,根据通过加权预算得到的权重值,依照权重值的大小,为每条新闻分配推荐时间。
步骤S21,根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表。
本申请上述步骤S21中,对推荐新闻列表中的每条待推荐的新闻,依照推荐时间的先后顺序进行正序排序或者倒序排序。
具体的,通过步骤S11至步骤S21,根据对刷新信号的判断,触发对新闻的刷新。在获取新闻列表的过程中,为每条新闻重新添加推荐时间属性。通过为每条新闻分配推荐时间,并依照推荐时间的先后顺序,生成新的分配推荐列表。
在实际当中,以触屏手机上运行的新闻客户端为例,图3直观的描述了显示时间分配的策略。其中,T代表当前系统时间,T0代表当前列表里最近一篇新闻显示的时间,T1代表当前列表里最老一篇新闻显示的时间,T2代表上一次刷新历史中最近一篇新闻的显示时间。例如,当前列表中是早上9:00刷新的,里面最后一篇新闻显示是早上7点,上一次刷新是昨晚8:00,那么T0,T1,T2就分别是早上9:00,早上7:00,昨晚8:00。
具体的,新闻个性化排序方法如下:
步骤A:新闻在客户端中不展示真实发布时间,而是在服务端设置的一个时间。
步骤B:每次用户刷新新闻列表时,客户端根据用户动作类型和当前列表最后一篇新闻的时间计算一个时间窗口,这里的时间窗口也就是权利要求书中提出的时间区间,其中,动作类型分为自上而下下拉动作和自下而上的上拉动作。
步骤C:给定一个时间窗口,新闻推荐服务推荐给用户若干篇发布于特定时间窗口内的新闻,并过滤掉该用户曾经刷出过的新闻。
步骤D:服务端根据刷新获取到的新闻的数量和时间窗口的起止时间给每篇推荐新闻分配一个推荐时间,这个推荐时间只对当前用户生效,并记录在服务端。
步骤E:客户端根据新推荐新闻的推荐时间对新闻排序,并显示新闻的推荐时间。
步骤F:因为每次用户刷新系统可推荐的新闻不一定是上次刷新后新发布的,如果时间窗口足够大(比如1天,一天内至少有上万篇新闻),这种新闻排序方法可以获得无限刷新的产品效果。
上述步骤中,如何分配推荐新闻的显示时间是本发明的一个关键环节,只有合理的分配显示时间,才能保证新闻排序列表看起来是按照时间顺序排列的,并且上拉刷新时尽量不浪费可推荐的新闻,此处的推荐新闻,就是通过刷新操作获取到的新闻。
对于每个用户,用户所看到的客户端每篇新闻在列表中的时间是推荐服务设置的时间而不是新闻的发布时间,这个时间和用户刷出来这篇新闻的时间有关。从这个意义上来说这个时间是个性化的。
本发明上述实施例提出了一种支持无限刷新个性化排序方法,可以在保证用户在感知上认为新闻排列遵循时间顺序,同时尽量不遗漏用户可能感兴趣的精彩新闻。
综上可知,本发明解决了现有技术中新闻客户端按照新闻发布时间进行排序,导致无法通过刷新操作刷新出更多新闻的问题。实现了仅通过刷新操作,就可以刷新出当天所有新闻的效果。
优选的,本申请提供的可选实施例中,刷新信号至少包括:通过在触摸屏幕上自上而下滑动产生的第一触敏信号和通过在触摸屏幕上自下而上滑动产生的第二触敏信号。
具体的,可对刷新信号进行设定。当在屏幕上自上而下滑动时,所产生的触敏信号,设定这个信号为第一触敏信号,用于对最近新闻进行刷新。当在屏幕上自下而上 滑动时,所产生的触敏信号,设定这个信号为第二触敏信号,用于对历史新闻进行刷新。
在实际当中,以触屏手机上运行的新闻客户端为例,刷新信号还可以通过很多形式产生。比如,可以将在屏幕上的某一区域进行点击所产生的触敏信号定义为刷新信号。还可以将手机机身上的某个实体按键产生的电平信号定义为刷新信号,当按下音量增加键实现对最近新闻进行刷新;当按下音量减小键实现对历史新闻进行刷新。
优选的,本申请提供的可选实施例中,当接收到的刷新信号为第一触敏信号时,刷新起始时间为当前系统时间,上述步骤S17根据刷新起始时间和时间阈值,获取推荐新闻列表中,步骤包括:
步骤S171a,根据第一触敏信号获取推荐新闻列表内包含的第一新闻集合的新闻数量n,其中,n为整数。
步骤S173a,获取当前系统时间和预设的第一时间阈值。
步骤S175a,根据当前系统时间和第一时间阈值,确定第一时间区间,第一时间区间用于限定刷新第一推荐新闻列表的时间区间。
步骤S177a,根据第一时间区间,获取发布时间在第一时间区间内的n个新闻。
步骤S179a,根据获取到的n个新闻,生成第一推荐新闻列表。
具体的,通过步骤S171a至步骤S179a,可以预先对每次刷新的新闻条目进行设定,预先设定一个数值n。当接收到在屏幕上自上而下滑动产生的第一触敏信号时,开始对最近新闻进行刷新的步骤。当对最近新闻进行刷新时,获取当前系统时间作为刷新起始时间。根据当前系统时间和预先设置的第一时间阈值,确定刷新新闻发布时间的第一时间区间,也可以称这个第一时间区间为时间窗口。根据第一时间区间,获取n个在第一时间区间内发布的新闻,生成第一推荐新闻列表。
在实际当中,以触屏手机上运行的新闻客户端为例,如图3所示,给定一个用户A和用户A上次刷新时间T,我们认为除了T时刻后新发布的新闻,T时刻之前发布但是A没有看过的新闻仍然有推荐的价值。但是,考虑到新闻的时效性,也不能推荐特别老的新闻,所以我们需要设置一个时间窗口的限制,比如24小时。如果用户是在屏幕上,自上而下的下拉刷新,这时候用户的需求是看新的新闻,这样我们时间窗口的起始时间就是当前系统时间,也就是说只推荐24小时内的新闻。
优选的,本申请提供的可选实施例中,在步骤S19对推荐新闻列表内的每条待推荐的新闻分配推荐时间中,步骤包括:
步骤S191a,获取前一次接收到第一触敏信号并对新闻列表进行刷新的前一次刷新时间。
步骤S193a,根据前一次刷新时间和当前系统时间,确定第二时间区间,第二时间区间用于限定第一推荐列表内新闻的推荐时间。
步骤S195a,根据第二时间区间,对第一推荐列表内的每条新闻分配推荐时间,其中,推荐时间处于第二时间区间内。
具体的,在步骤S191a至步骤S195a中,根据前一次刷新时间和当前时间确认第二时间区间,第二时间区间用于限定为每条新闻设置的推荐时间的取值范围。根据这个第二时间区间,为每条新闻分配推荐时间。
在实际当中,以触屏手机上运行的新闻客户端为例,结合图3所示,对于下拉刷新的情况,我们首先需要获取刷新前列表中最近一篇新闻的显示时间T0,然后对每一篇新推荐的新闻分配一个介于T0和当前时间T的一个时间,并按照这个时间排序。
优选的,本申请提供的可选实施例中,在步骤S195a根据第二时间区间,对第一推荐列表内的每条新闻分配推荐时间的步骤包括:
步骤S1951a,根据第一推荐新闻列表中的新闻数量n和第二时间区间,对第二时间区间平均分配,得到推荐新闻列表中每条新闻的第一等分时间间隔。
步骤S1953a,根据第一等分时间间隔和当前系统时间,对第一推荐列表内的每条新闻分配推荐时间。
具体的,在步骤S1951a至步骤S1953a中,可以根据推荐新闻列表中新闻的数量n,将第二时间区间平分为若干个第一等分时间间隔。将第一推荐列表内的每条新闻,根据发布时间的顺序和第一等分时间间隔,分配一个推荐时间。
在实际当中,以触屏手机上运行的新闻客户端为例,除了以上述等分时间区间的形式对新闻分配推荐时间之外,为了使推荐时间看起来更为真实,还可以引入随机变量。使用随机变量,为每条新闻分配一个在第二时间区间内的随机推荐时间。
除此之外,还可以通过每个用户的新闻浏览习惯、感兴趣的新闻类型等个性化信息,对推荐列表中的每条新闻进行加权运算,确定针对于该用户的每条新闻的权重值。 根据权重值对推荐列表进行预排序。之后通过上述分配推荐时间的方法,对经过预排序的推荐列表中的每条新闻分配一个推荐时间值。使得用户感兴趣的新闻可以首先被刷新出来。
优选的,本申请提供的可选实施例中,当接收到的刷新信号为第二触敏信号时,刷新起始时间为已刷新的最后一条新闻的推荐时间,上述步骤S17根据刷新起始时间和时间阈值,获取推荐新闻列表的步骤还包括:
步骤S171b,根据第二触敏信号获取推荐新闻列表内包含的第二新闻集合的新闻数量m,其中,m为整数。
步骤S173b,获取已刷新的最后一条新闻的推荐时间和第二时间阈值。
步骤S175b,根据已刷新的最后一条新闻的推荐时间和第二时间阈值,确定第三时间区间,第三时间区间用于限定刷新第二推荐新闻列表的时间区间。
步骤S177b,根据第三时间区间,获取发布时间在第三时间区间内的m个新闻。
步骤S179b,根据获取到的m个新闻,生成第二推荐新闻列表。
具体的,通过步骤S171b至步骤S179b,可以预先对每次刷新的新闻条目进行设定,预先设定一个数值m。当接收到在屏幕上自下而上滑动产生的第二触敏信号时,开始对历史新闻进行刷新的步骤。当对历史新闻进行刷新时,获取已刷新的最后一条新闻的推荐时间作为刷新起始时间。根据已刷新的最后一条新闻的推荐时间和预先设置的第二时间阈值,确定刷新新闻发布时间的第三时间区间,也可以称这个第三时间区间为时间窗口。根据第三时间区间,获取m个在第三时间区间内发布的新闻,生成第二推荐新闻列表。
在实际当中,以触屏手机上运行的新闻客户端为例,结合图3所示,用户自下而上上拉列表时,系统优先展示他的刷新历史,但是当他的两次刷新历史之间有一定的时间间隔,当用户向上滑动到较近刷新历史的末尾处,需要刷新出来一些新闻而不是直接跳到更老的历史。我们认为,如果用户是上拉刷新,这时候用户的需求就变成了看看在两次刷新历史之间还有什么有意思的老新闻,这时候时间窗口的起始时间就应该从两次之间较近刷新历史最老一篇新闻的显示时间算起。在这里的提到的显示时间不是真实的新闻发布时间,而是新闻推荐时间。
优选的,本申请提供的可选实施例中,在步骤S19对推荐新闻列表内的每条待推荐的新闻分配推荐时间中,步骤还包括:
步骤S191b,获取已刷新的最后一条新闻的推荐时间和第三时间阈值。
步骤S193b,根据已刷新的最后一条新闻的推荐时间和第三时间阈值,确定第四时间区间,第四时间区间用于限定第二推荐列表内新闻的推荐时间。
步骤S195b,根据第四时间区间,对第二推荐列表内的每条新闻分配推荐时间,其中,推荐时间处于第四时间区间内。
具体的,在步骤S191b至步骤S195b中,根据第四时间区间,为第二推荐列表内的每条新闻分配推荐时间。此处,使用第四时间区间,对分配给刷新出来的历史新闻的推荐时间进行限定。
在实际当中,以触屏手机上运行的新闻客户端为例,如图3所示,显示时间的最大值是当前历史列表中最老一篇新闻的显示时间,但是最小值不能简单的对应于上一次刷新最近新闻的时间。这是因为一次推荐的新闻数量是有限的(假设15条),如果这15条的显示时间已经填满了两次刷新历史刷新的间隔时间,用户下次下拉刷新就只能显示老的刷新历史,而无法借此机会推荐更多的新闻。因此一般来讲我们从最大值开始会取一个固定的时间间隔,比如10分钟,每篇新闻的显示时间等于上一篇新闻的显示时间减去10分钟。也就是说,假设当前列表最老新闻的显示时间是T1,那么第i篇推荐新闻的显示时间是T-i*t,这里的t是一个固定间隔,可以是10分钟。如果推荐新闻中有新闻的显示时间已经小于上次刷新中最近的新闻。
如图4所示,最大时间间隔为1个小时的列表为用户的当前列表,而用户上一次刷新是在昨天晚上,那么用户上拉列表时系统会推荐较老的新闻。我们取当前列表中最老一篇新闻的时间作为推荐时间窗口的起始时间。假设时间窗口长度为24小时,意味着我们可以推荐2小时前到26小时内的新闻。
优选的,本申请提供的可选实施例中,步骤S191b根据第四时间区间,对第二推荐列表内的每条新闻分配推荐时间的步骤包括:
步骤S1911b,根据第二推荐新闻列表中的新闻数量m和第四时间区间,对第四时间区间平均分配,得到推荐新闻列表中每条新闻的第二等分时间间隔;
步骤S1913b,根据第二等分时间间隔和已刷新的最后一条新闻的推荐时间,对第二推荐列表内的每条新闻分配推荐时间。
具体的,在步骤S1911b至步骤S1913b中,可以根据推荐新闻列表中新闻的数量m,将第四时间区间平分为若干个第二等分时间间隔。将第二推荐列表内的每条新闻,根据按照发布时间的顺序和第二等分时间间隔,分配一个推荐时间。
在实际当中,以触屏手机上运行的新闻客户端为例,除了以上述等分时间区间的形式对新闻分配推荐时间之外,为了使推荐时间看起来更为真实,还可以引入随机变量。使用随机变量,为每条新闻分配一个在第四时间区间内的随机推荐时间。
除此之外,还可以通过每个用户的新闻浏览习惯、感兴趣的新闻类型等个性化信息,对推荐列表中的每条新闻进行加权运算,确定针对于该用户的每条新闻的权重值。根据权重值对推荐列表进行预排序。之后通过上述分配推荐时间的方法,对经过预排序的推荐列表中的每条新闻分配一个推荐时间值。根据刷新方式不同,为用户优先刷新出用户最可能感兴趣的不同时间区间的新闻。这样就可以尽可能的为用户推荐最可能感兴趣的新闻。
优选的,如图5所示,本申请提供的可选实施例中,在步骤S19对推荐新闻列表内的每条待推荐的新闻分配推荐时间之前,还可以执行如下步骤:
步骤S181,获取在本次刷新之前,已通过刷新获取到的历史新闻列表;
步骤S183,根据历史新闻列表和推荐新闻列表进行比对,当推荐新闻列表中的新闻与历史新闻列表中的新闻相同时,将相同的新闻从推荐新闻列表中删除。
具体的,在步骤S181至步骤S183中,根据历史新闻列表和推荐新闻列表进行比对,将推荐新闻列表中与历史新闻列表中重复的新闻删除。避免了相同的新闻被反复刷新出来。
在实际当中,以触屏手机上运行的新闻客户端为例,通过给定的时间区间,推荐服务先按照某种算法找到若干用户可能感兴趣的新闻,然后需要找出其中曾经展示给用户的新闻并过滤掉。因为这部分新闻不应该再次展示给用户,这个步骤可以被称之为推荐去重。一般来说,推荐服务会把所有用户的浏览历史存放在基于内存的高性能缓存服务(比如Memory Cache)从而能够快速的访问。
综上所述,本发明的主要优点在于既满足了用户在感知上对于新闻按照时间顺序排序的需求,又不会因为排序限制好新闻的推荐机会,可以支持无限刷新的用户体验。而且区分了上拉和下拉刷新两种不同类型的刷新需求。
实施例2
本发明实施例还提供了一种新闻列表刷新的装置,如图6所示,该装置包括:接收模块30、第一读取模块32、第二读取模块34、第一获取模块36、第一处理模块38和生成模块40。
其中,接收模块30,用于接收刷新信号。
本申请上述接收模块30,通过接收刷新信号,来触发刷新进程,实现对新闻列表的刷新功能。
在实际当中,以触屏手机上运行的新闻客户端为例,上述刷新信号可以是拖动页面某一区域产生信号,也可以是通过点击屏幕上的某一区域产生的信号,还可以是对系统设定刷新时间,系统自动产生的刷新信号。
第一读取模块32,用于根据接收到的刷新信号,读取刷新起始时间,其中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间。
本申请上述第一读取模块32,根据接收到的刷新信号,对刷新类型进行判断。依照不同的刷新类型,记录与该刷新类型相对应的刷新起始时间。
在实际当中,以触屏手机上运行的新闻客户端为例,刷新类型可以分为:对最近新闻进行刷新和对历史新闻进行刷新这两种类型,根据刷新类型的不同,分别读取并记录与刷新类型相应的刷新起始时间。
第二读取模块34,用于读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间。
本申请上述第二读取模块34,读取预先设定的时间阈值,时间阈值与刷新起始时间构成了一个时间区间。通过上述时间区间,来筛选发布时间在此时间区间内的新闻。这里所说的时间区间也可以被称为时间窗口。
在实际当中,以触屏手机上运行的新闻客户端为例,可以设定任意一个时间点作为刷新起始时间,刷新起始时间点的选择依照刷新策略或者刷新算法而定。例如,本实施例中,当对最近新闻进行刷新时,可以设置当前时间为刷新起始时间。当对历史新闻进行刷新时,可以设置历史新闻列表中已刷新的最后一条新闻的推荐时间为刷新起始时间。
第一获取模块36,用于根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内。
本申请上述第一获取模块36,根据刷新起始时间和时间阈值构成的时间区间,获取推荐新闻列表。
在实际当中,以触屏手机上运行的新闻客户端为例,时间阈值可以根据用户自己的喜好进行设置,时间阈值设定的越小,每次进行刷新时,就会刷新出与当前时间范围越接近的新闻。但是,如果将时间阈值设置的过于小,可以被刷新的新闻数量就会很少。也可以将时间阈值固定为一个默认值,默认值可以为24小时。
第一处理模块38,用于对推荐新闻列表内的每条待推荐的新闻分配推荐时间。
本申请上述第一处理模块38中,每条新闻都有时间属性,时间属性记录了该条新闻的发布时间。在这里,除了发布时间又为每条新闻设置推荐时间属性。
在实际当中,以触屏手机上运行的新闻客户端为例,为每条新闻设置推荐时间的方法有很多。其中,可以先通过对推荐新闻列表中的新闻按时间的远近进行排序,并依次为新闻列表中的每条新闻分配推荐时间。也可以根据用户的浏览习惯或对新闻类型的喜好程度,对推荐新闻列表中的各条新闻进行加权运算,根据通过加权预算得到的权重值,依照权重值的大小,为每条新闻分配推荐时间。
生成模块40,用于根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表。
本申请上述生成模块40中,对推荐新闻列表中的每条待推荐的新闻,依照推荐时间的先后顺序进行正序排序或者倒序排序。
具体的,通过接收模块30、第一读取模块32、第二读取模块34、第一获取模块36、第一处理模块38和生成模块40,根据对刷新信号的判断,触发对新闻的刷新。在获取新闻列表的过程中,为每条新闻重新添加推荐时间属性。通过为每条新闻分配推荐时间,并依照推荐时间的先后顺序,生成新的分配推荐列表。
在实际当中,以触屏手机上运行的新闻客户端为例,图3直观的描述了显示时间分配的策略。其中,T代表当前系统时间,T0代表当前列表里最近一篇新闻显示的时间,T1代表当前列表里最老一篇新闻显示的时间,T2代表上一次刷新历史中最近一篇新闻的显示时间。例如,当前列表中是早上9:00刷新的,里面最后一篇新闻显示是早上7点,上一次刷新是昨晚8:00,那么T0,T1,T2就分别是早上9:00,早上7:00,昨晚8:00。
具体的,新闻个性化排序方法如下:
步骤A:新闻在客户端中不展示真实发布时间,而是在服务端设置的一个时间。
步骤B:每次用户刷新新闻列表时,客户端根据用户动作类型和当前列表最后一篇新闻的时间计算一个时间窗口,这里的时间窗口也就是权利要求书中提出的时间区间,其中,动作类型分为自上而下下拉动作和自下而上的上拉动作。
步骤C:给定一个时间窗口,新闻推荐服务推荐给用户若干篇发布于特定时间窗口内的新闻,并过滤掉该用户曾经刷出过的新闻。
步骤D:服务端根据刷新获取到的新闻的数量和时间窗口的起止时间给每篇推荐新闻分配一个推荐时间,这个推荐时间只对当前用户生效,并记录在服务端。
步骤E:客户端根据新推荐新闻的推荐时间对新闻排序,并显示新闻的推荐时间。
步骤F:因为每次用户刷新系统可推荐的新闻不一定是上次刷新后新发布的,如果时间窗口足够大(比如1天,一天内至少有上万篇新闻),这种新闻排序方法可以获得无限刷新的产品效果。
上述步骤中,如何分配推荐新闻的显示时间是本发明的一个关键环节,只有合理的分配显示时间,才能保证新闻排序列表看起来是按照时间顺序排列的,并且上拉刷新时尽量不浪费可推荐的新闻,此处的推荐新闻,就是通过刷新操作获取到的新闻。
对于每个用户,用户所看到的客户端每篇新闻在列表中的时间是推荐服务设置的时间而不是新闻的发布时间,这个时间和用户刷出来这篇新闻的时间有关。从这个意义上来说这个时间是个性化的。
本发明上述实施例提出了一种支持无限刷新个性化排序方法,可以在保证用户在感知上认为新闻排列遵循时间顺序,同时尽量不遗漏用户可能感兴趣的精彩新闻。
本申请提供的实施例中,刷新信号至少包括:通过在触屏上自上而下滑动产生的第一触敏信号和通过在触摸屏幕上自下而上滑动产生的第二触敏信号。
具体的,可对刷新信号进行设定。当在屏幕上自上而下滑动时,所产生的触敏信号,设定这个信号为第一触敏信号,用于对最近新闻进行刷新。当在屏幕上自下而上滑动时,所产生的触敏信号,设定这个信号为第二触敏信号,用于对历史新闻进行刷新。
在实际当中,以触屏手机上运行的新闻客户端为例,刷新信号还可以通过很多形式产生。比如,可以将在屏幕上的某一区域进行点击所产生的触敏信号定义为刷新信 号。还可以将手机机身上的某个实体按键产生的电平信号定义为刷新信号,当按下音量增加键实现对最近新闻进行刷新;当按下音量减小键实现对历史新闻进行刷新。
优选的,本申请提供的可选实施例中,当接收到的刷新信号为通过在触屏上自上而下滑动产生的第一触敏信号时,刷新起始时间为当前系统时间,其中,第一获取模块36包括:第一子获取模块3611、第二子获取模块3613、第一子确定模块3615、第三子获取模块3617和第一子生成模块3619。
其中,第一子获取模块3611,用于根据第一触敏信号获取推荐新闻列表内包含的第一新闻集合的新闻数量n。
第二子获取模块3613,用于获取当前系统时间和预设的第一时间阈值。
第一子确定模块3615,用于根据当前系统时间和第一时间阈值,确定第一时间区间,第一时间区间用于限定刷新第一推荐新闻列表的时间区间。
第三子获取模块3617,用于根据第一时间区间,获取发布时间在第一时间区间内的n个新闻。
第一子生成模块3619,用于根据获取到的n个新闻,生成第一推荐新闻列表。
具体的,通过第一子获取模块3611、第二子获取模块3613、第一子确定模块3651、第三子获取模块3617和第一子生成模块3619,可以预先对每次刷新的新闻条目进行设定,预先设定一个数值n。当接收到在屏幕上自上而下滑动产生的第一触敏信号时,开始对最近新闻进行刷新的步骤。当对最近新闻进行刷新时,获取当前系统时间作为刷新起始时间。根据当前系统时间和预先设置的第一时间阈值,确定刷新新闻发布时间的第一时间区间,也可以称这个第一时间区间为时间窗口。根据第一时间区间,获取n个在第一时间区间内发布的新闻,生成第一推荐新闻列表。
在实际当中,以触屏手机上运行的新闻客户端为例,如图3所示,给定一个用户A和用户A上次刷新时间T,我们认为除了T时刻后新发布的新闻,T时刻之前发布但是A没有看过的新闻仍然有推荐的价值。但是,考虑到新闻的时效性,也不能推荐特别老的新闻,所以我们需要设置一个时间窗口的限制,比如24小时。如果用户是在屏幕上,自上而下的下拉刷新,这时候用户的需求是看新的新闻,这样我们时间窗口的起始时间就是当前系统时间,也就是说只推荐24小时内的新闻。
优选的,本申请提供的可选实施例中,第一处理模块38包括:第四子获取模块3811、第二子确定模块3813和第一分配模块3815。
其中,第四子获取模块3811,用于获取前一次接收到第一触敏信号并对新闻列表进行刷新的前一次刷新时间。
第二子确定模块3813,用于根据前一次刷新时间和当前系统时间,确定第二时间区间,第二时间区间用于限定第一推荐列表内新闻的所述推荐时间。
第一分配模块3815,用于根据第二时间区间,对第一推荐列表内的每条新闻分配推荐时间,其中,推荐时间处于第二时间区间内。
具体的,第四子获取模块3811、第二子确定模块3813和第一分配模块3815,根据前一次刷新时间和当前时间确认第二时间区间,第二时间区间用于限定为每条新闻设置的推荐时间的取值范围。根据这个第二时间区间,为每条新闻分配推荐时间。
在实际当中,以触屏手机上运行的新闻客户端为例,对于下拉刷新的情况,我们首先需要获取刷新前列表中最近一篇新闻的显示时间T0,然后对每一篇新推荐的新闻分配一个介于T0和当前时间T的一个时间,并按照这个时间排序。
优选的,本申请提供的可选实施例中,第一分配模块3815包括:第一子处理模块38151和第一子分配模块38153。
第一子处理模块38151,用于根据第一推荐新闻列表中的新闻数量n和第二时间区间,对第二时间区间平均分配,得到推荐新闻列表中每条新闻的第一等分时间间隔;
第一子分配模块38153,用于根据第一等分时间间隔和当前系统时间,对第一推荐列表内的每条新闻分配推荐时间。
具体的,第一子处理模块38151和第一子分配模块38153,可以根据推荐新闻列表中新闻的数量n,将第二时间区间平分为若干个第一等分时间间隔。将第一推荐列表内的每条新闻,根据按照发布时间的顺序和第一等分时间间隔,分配一个推荐时间。
在实际当中,以触屏手机上运行的新闻客户端为例,除了以上述等分时间区间的形式对新闻分配推荐时间之外,为了使推荐时间看起来更为真实,还可以引入随机变量。使用随机变量,为每条新闻分配一个在第二时间区间内的随机推荐时间。
除此之外,还可以通过每个用户的新闻浏览习惯、感兴趣的新闻类型等个性化信息,对推荐列表中的每条新闻进行加权运算,确定针对于该用户的每条新闻的权重值。根据权重值对推荐列表进行预排序。之后通过上述分配推荐时间的方法,对经过预排序的推荐列表中的每条新闻分配一个推荐时间值。根据刷新方式不同,为用户优先刷 新出用户最可能感兴趣的不同时间区间的新闻。这样就可以尽可能的为用户推荐最可能感兴趣的新闻。
优选的,本申请提供的可选实施例中,当接收到的刷新信号为通过在触摸屏幕上自下而上滑动产生的第二触敏信号时,刷新起始时间为已刷新的最后一条新闻的推荐时间,其中,第一获取模块36还包括:第五子获取模块3621、第六子获取模块3623、第三子确定模块3625、第七子获取模块3627和第二子生成模块3629。
其中,第五子获取模块3621,用于根据第二触敏信号获取推荐新闻列表内包含的第二新闻集合的新闻数量m。
第六子获取模块3623,用于获取已刷新的最后一条新闻的推荐时间和第二时间阈值。
第三子确定模块3625,用于根据已刷新的最后一条新闻的推荐时间和第二时间阈值,确定第三时间区间,第三时间区间用于限定刷新第二推荐新闻列表的时间区间。
第七子获取模块3627,用于根据第三时间区间,获取发布时间在第三时间区间内的m个新闻。
第二子生成模块3629,用于根据获取到的m个新闻,生成第二推荐新闻列表。
具体的,第五子获取模块3621、第六子获取模块3623、第三子确定模块3625、第七子获取模块3627和第二子生成模块3629,可以预先对每次刷新的新闻条目进行设定,预先设定一个数值m。当接收到在屏幕上自下而上滑动产生的第二触敏信号时,开始对历史新闻进行刷新的步骤。当对历史新闻进行刷新时,获取已刷新的最后一条新闻的推荐时间作为刷新起始时间。根据已刷新的最后一条新闻的推荐时间和预先设置的第二时间阈值,确定刷新新闻发布时间的第三时间区间,也可以称这个第三时间区间为时间窗口。根据第三时间区间,获取m个在第三时间区间内发布的新闻,生成第二推荐新闻列表。
在实际当中,以触屏手机上运行的新闻客户端为例,用户自下而上上拉列表时,系统优先展示他的刷新历史,但是当他的两次刷新历史之间有一定的时间间隔,当用户向上滑动到较近刷新历史的末尾处,需要刷新出来一些新闻而不是直接跳到更老的历史。我们认为,如果用户是上拉刷新,这时候用户的需求就变成了看看在两次刷新历史之间还有什么有意思的老新闻,这时候时间窗口的起始时间就应该从两次之间较 近刷新历史最老一篇新闻的显示时间算起。在这里的提到的显示时间不是真实的新闻发布时间,而是新闻推荐时间。
优选的,本申请提供的可选实施例中,第一处理模块38还包括:第八获取模块3821、第四子确定模块3823和第二分配模块3825。
其中,第八获取模块3821,用于获取已刷新的最后一条新闻的推荐时间和第三时间阈值;
第四子确定模块3823,用于根据已刷新的最后一条新闻的推荐时间和第三时间阈值,确定第四时间区间,第四时间区间用于限定第二推荐列表内新闻的推荐时间;
第二分配模块3825,用于根据第四时间区间,对第二推荐列表内的每条新闻分配推荐时间,其中,推荐时间处于第四时间区间内。
具体的,第一处理模块38包括:第八获取模块3821、第四子确定模块3823和第二分配模块3825,根据这个第四时间区间,为第二推荐列表内的每条新闻分配推荐时间。使用第四时间区间,对分配给刷新出来的历史新闻的推荐时间进行限定。
在实际当中,以触屏手机上运行的新闻客户端为例,如图3所示,显示时间的最大值是当前历史列表中最老一篇新闻的显示时间,但是最小值不能简单的对应于上一次刷新最近新闻的时间。这是因为一次推荐的新闻数量是有限的(假设15条),如果这15条的显示时间已经填满了两次刷新历史刷新的间隔时间,用户下次下拉刷新就只能显示老的刷新历史,而无法借此机会推荐更多的新闻。因此一般来讲我们从最大值开始会取一个固定的时间间隔,比如10分钟,每篇新闻的显示时间等于上一篇新闻的显示时间减去10分钟。也就是说,假设当前列表最老新闻的显示时间是T1,那么第i篇推荐新闻的显示时间是T-i*t,这里的t是一个固定间隔,可以是10分钟。如果推荐新闻中有新闻的显示时间已经小于上次刷新中最近的新闻。
如图4所示,最大时间间隔为1个小时的列表为用户的当前列表,而用户上一次刷新是在昨天晚上,那么用户上拉列表时系统会推荐较老的新闻。我们取当前列表中最老一篇新闻的时间作为推荐时间窗口的起始时间。假设时间窗口长度为24小时,意味着我们可以推荐2小时前到26小时内的新闻。
优选的,本申请提供的可选实施例中,第二分配模块3825包括:第二子处理模块38251和第二子分配模块38253。
其中第二子处理模块38251,用于根据第二推荐新闻列表中的新闻数量m和第四时间区间,对第四时间区间平均分配,得到推荐新闻列表中每条新闻的第二等分时间间隔。
第二子分配模块38253,用于根据第二等分时间间隔和已刷新的最后一条新闻的推荐时间,对第二推荐列表内的每条新闻分配推荐时间。
具体的,第二子处理模块38251和第二子分配模块38253,可以根据推荐新闻列表中新闻的数量m,将第四时间区间平分为若干个第二等分时间间隔。将第二推荐列表内的每条新闻,根据按照发布时间的顺序和第二等分时间间隔,分配一个推荐时间。
在实际当中,以触屏手机上运行的新闻客户端为例,除了以上述等分时间区间的形式对新闻分配推荐时间之外,为了使推荐时间看起来更为真实,还可以引入随机变量。使用随机变量,为每条新闻分配一个在第四时间区间内的随机推荐时间。
除此之外,还可以通过每个用户的新闻浏览习惯、感兴趣的新闻类型等个性化信息,对推荐列表中的每条新闻进行加权运算,确定针对于该用户的每条新闻的权重值。根据权重值对推荐列表进行预排序。之后通过上述分配推荐时间的方法,对经过预排序的推荐列表中的每条新闻分配一个推荐时间值。使得用户不感兴趣的新闻优先在对历史新闻进行刷新时先被刷新出来,这样可以保证在对最近新闻进行刷新时,优先将用户感兴趣的刷新出来。
优选的,如图7所示,本申请提供的可选实施例中,装置还包括:第二获取模块371和第二处理模块373。
其中,第二获取模块371,用于获取在本次刷新之前,已通过刷新获取到的历史新闻列表;
第二处理模块373,用于根据历史新闻列表和推荐新闻列表进行比对,当推荐新闻列表中的新闻与历史新闻列表中的新闻相同时,将相同的新闻从推荐新闻列表中删除。
具体的,第二获取模块371和第二处理模块373,根据历史新闻列表和推荐新闻列表进行比对,将推荐新闻列表中与历史新闻列表中重复的新闻删除。避免了相同的新闻被反复刷新出来。
在实际当中,以触屏手机上运行的新闻客户端为例,通过给定的时间区间,推荐服务先按照某种算法找到若干用户可能感兴趣的新闻,然后需要找出其中曾经展示给 用户的新闻并过滤掉。因为这部分新闻不应该再次展示给用户,这个步骤可以被称之为推荐去重。一般来说,推荐服务会把所有用户的浏览历史存放在基于内存的高性能缓存服务(比如Memory Cache)从而能够快速的访问。
综上所述,本发明的主要优点在于既满足了用户在感知上对于新闻按照时间顺序排序的需求,又不会因为排序限制好新闻的推荐机会,可以支持无限刷新的用户体验。而且区分了上拉和下拉刷新两种不同类型的刷新需求。
本申请实施例所提供的各个功能单元可以在移动终端、计算机终端或者类似的运算装置中运行,也可以作为存储介质的一部分进行存储。
由此,本发明的实施例可以提供一种计算机终端,该计算机终端可以是计算机终端群中的任意一个计算机终端设备。可选地,在本实施例中,上述计算机终端也可以替换为移动终端等终端设备。
可选地,在本实施例中,上述计算机终端可以位于计算机网络的多个网络设备中的至少一个网络设备。
在本实施例中,上述计算机终端可以执行新闻列表刷新的方法中以下步骤的程序代码:接收刷新信号;根据接收到的刷新信号,读取刷新起始时间,其中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间;根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内;对推荐新闻列表内的每条待推荐的新闻分配推荐时间;根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表。
可选地,该计算机终端可以包括:一个或多个处理器、存储器、以及传输装置。
其中,存储器可用于存储软件程序以及模块,如本发明实施例中的新闻列表刷新的方法及装置对应的程序指令/模块,处理器通过运行存储在存储器内的软件程序以及模块,从而执行各种功能应用以及数据处理,即实现上述的新闻列表刷新的方法。存储器可包括高速随机存储器,还可以包括非易失性存储器,如一个或者多个磁性存储装置、闪存、或者其他非易失性固态存储器。在一些实例中,存储器可进一步包括相对于处理器远程设置的存储器,这些远程存储器可以通过网络连接至终端。上述网络的实例包括但不限于互联网、企业内部网、局域网、移动通信网及其组合。
上述的传输装置用于经由一个网络接收或者发送数据。上述的网络具体实例可包括有线网络及无线网络。在一个实例中,传输装置包括一个网络适配器(Network Interface Controller,NIC),其可通过网线与其他网络设备与路由器相连从而可与互联网或局域网进行通讯。在一个实例中,传输装置为射频(Radio Frequency,RF)模块,其用于通过无线方式与互联网进行通讯。
其中,具体地,存储器用于存储预设动作条件和预设权限用户的信息、以及应用程序。
处理器可以通过传输装置调用存储器存储的信息及应用程序,以执行上述方法实施例中的各个可选或优选实施例的方法步骤的程序代码。
本领域普通技术人员可以理解,计算机终端也可以是智能手机(如Android手机、iOS手机等)、平板电脑、掌上电脑以及移动互联网设备(Mobile Internet Devices,MID)、PAD等终端设备。
本领域普通技术人员可以理解上述实施例的各种方法中的全部或部分步骤是可以通过程序来指令终端设备相关的硬件来完成,该程序可以存储于一计算机可读存储介质中,存储介质可以包括:闪存盘、只读存储器(Read-Only Memory,ROM)、随机存取器(Random Access Memory,RAM)、磁盘或光盘等。
本发明的实施例还提供了一种存储介质。可选地,在本实施例中,上述存储介质可以用于保存上述方法实施例和系统实施例所提供的页面排版方法所执行的程序代码。
可选地,在本实施例中,上述存储介质可以位于计算机网络中计算机终端群中的任意一个计算机终端中,或者位于移动终端群中的任意一个移动终端中。
可选地,在本实施例中,存储介质被设置为存储用于执行以下步骤的程序代码:接收刷新信号;根据接收到的刷新信号,读取刷新起始时间,其中,刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;读取预先设置的至少一个时间阈值,时间阈值用于与刷新起始时间共同限定刷新新闻列表的时间区间;根据刷新起始时间和时间阈值,获取推荐新闻列表,推荐新闻列表包括:至少一个待推荐的新闻,待推荐的新闻的发布时间在时间区间内;对推荐新闻列表内的每条待推荐的新闻分配推荐时间;根据推荐时间对推荐新闻列表内的待推荐的新闻进行刷新,生成新的推荐新闻列表。
可选地,在本实施例中,存储介质还可以被设置为存储用于执行新闻列表刷新的方法提供的各种优选地或可选的方法步骤的程序代码。
以上所述仅为本发明的优选实施例而已,并不用于限制本发明,对于本领域的技术人员来说,本发明可以有各种更改和变化。凡在本发明的精神和原则之内,所作的任何修改、等同替换、改进等,均应包含在本发明的保护范围之内。

Claims (19)

  1. 一种新闻列表刷新的方法,其特征在于,包括:
    接收刷新信号;
    根据接收到的所述刷新信号,读取刷新起始时间,其中,所述刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;
    读取预先设置的至少一个时间阈值,所述时间阈值用于与所述刷新起始时间共同限定刷新所述新闻列表的时间区间;
    根据所述刷新起始时间和所述时间阈值,获取推荐新闻列表,所述推荐新闻列表包括:至少一个待推荐的新闻,所述待推荐的新闻的发布时间在所述时间区间内;
    对所述推荐新闻列表内的每条所述待推荐的新闻分配推荐时间;
    根据所述推荐时间对所述推荐新闻列表内的所述待推荐的新闻进行刷新,生成新的推荐新闻列表。
  2. 根据权利要求1所述的方法,其特征在于,所述刷新信号至少包括:通过在触摸屏幕上自上而下滑动产生的第一触敏信号和通过在所述触摸屏幕上自下而上滑动产生的第二触敏信号。
  3. 根据权利要求2所述的方法,其特征在于,当接收到的所述刷新信号为所述第一触敏信号时,所述刷新起始时间为所述当前系统时间,其中,所述根据所述刷新起始时间和所述时间阈值,获取推荐新闻列表的步骤包括:
    根据所述第一触敏信号获取所述推荐新闻列表内包含的第一新闻集合的新闻数量n,其中,n为自然数;
    获取所述当前系统时间和预设的第一时间阈值;
    根据所述当前系统时间和所述第一时间阈值,确定第一时间区间,所述第一时间区间用于限定刷新第一推荐新闻列表的时间区间;
    根据所述第一时间区间,获取发布时间在所述第一时间区间内的n个所述新闻;
    根据获取到的所述n个所述新闻,生成所述第一推荐新闻列表。
  4. 根据权利要求3所述的方法,其特征在于,所述对所述推荐新闻列表内的每条所述待推荐的新闻分配推荐时间的步骤包括:
    获取前一次接收到所述第一触敏信号并对所述新闻列表进行刷新的前一次刷新时间;
    根据所述前一次刷新时间和所述当前系统时间,确定第二时间区间,所述第二时间区间用于限定所述第一推荐列表内新闻的推荐时间;
    根据所述第二时间区间,对所述第一推荐列表内的每条所述新闻分配所述推荐时间,其中,所述推荐时间处于所述第二时间区间内。
  5. 根据权利要求4所述的方法,其特征在于,所述根据所述第二时间区间,对所述第一推荐列表内的每条所述新闻分配所述推荐时间的步骤包括:
    根据所述第一推荐新闻列表中的新闻数量n和所述第二时间区间,对第二时间区间平均分配,得到所述推荐新闻列表中每条所述新闻的第一等分时间间隔;
    根据所述第一等分时间间隔和所述当前系统时间,对所述第一推荐列表内的每条所述新闻分配所述推荐时间。
  6. 根据权利要求2所述的方法,其特征在于,当接收到的所述刷新信号为所述第二触敏信号时,所述刷新起始时间为已刷新的最后一条新闻的推荐时间,其中,所述根据所述刷新起始时间和所述时间阈值,获取推荐新闻列表的步骤包括:
    根据所述第二触敏信号获取所述推荐新闻列表内包含的第二新闻集合的新闻数量m,其中,m为整数;
    获取所述已刷新的最后一条新闻的推荐时间和第二时间阈值;
    根据所述已刷新的最后一条新闻的推荐时间和所述第二时间阈值,确定第三时间区间,所述第三时间区间用于限定刷新第二推荐新闻列表的时间区间;
    根据所述第三时间区间,获取发布时间在所述第三时间区间内的m个所述新闻;
    根据获取到的所述m个所述新闻,生成所述第二推荐新闻列表。
  7. 根据权利要求6所述的方法,其特征在于,所述对所述推荐新闻列表内的每条所述待推荐的新闻分配推荐时间的步骤包括:
    获取所述已刷新的最后一条新闻的推荐时间和第三时间阈值;
    根据所述已刷新的最后一条新闻的推荐时间和所述第三时间阈值,确定第四时间区间,所述第四时间区间用于限定所述第二推荐列表内新闻的推荐时间;
    根据所述第四时间区间,对所述第二推荐列表内的每条所述新闻分配所述推荐时间,其中,所述推荐时间处于所述第四时间区间内。
  8. 根据权利要求7所述的方法,其特征在于,所述根据所述第四时间区间,对所述第二推荐列表内的每条所述新闻分配所述推荐时间的步骤包括:
    根据所述第二推荐新闻列表中的新闻数量m和所述第四时间区间,对第四时间区间平均分配,得到所述推荐新闻列表中每条所述新闻的第二等分时间间隔;
    根据所述第二等分时间间隔和所述已刷新的最后一条新闻的推荐时间,对所述第二推荐列表内的每条所述新闻分配所述推荐时间。
  9. 根据权利要求1至8中任意一所述的方法,其特征在于,在所述对所述推荐新闻列表内的每条所述待推荐的新闻分配推荐时间之前,所述方法还包括:
    获取在本次刷新之前,已通过刷新获取到的历史新闻列表;
    根据所述历史新闻列表和所述推荐新闻列表进行比对,当所述推荐新闻列表中的所述新闻与所述历史新闻列表中的所述新闻相同时,将所述相同的新闻从所述推荐新闻列表中删除。
  10. 一种新闻列表刷新的装置,其特征在于,包括:
    接收模块,用于接收刷新信号;
    第一读取模块,用于根据接收到的所述刷新信号,读取刷新起始时间,其中,所述刷新起始时间为当前系统时间或已刷新的最后一条新闻的推荐时间;
    第二读取模块,用于读取预先设置的至少一个时间阈值,所述时间阈值用于与所述刷新起始时间共同限定刷新所述新闻列表的时间区间;
    第一获取模块,用于根据所述刷新起始时间和所述时间阈值,获取推荐新闻列表,所述推荐新闻列表包括:至少一个待推荐的新闻,所述待推荐的新闻的发布时间在所述时间区间内;
    第一处理模块,用于对所述推荐新闻列表内的每条所述待推荐的新闻分配推荐时间;
    生成模块,用于根据所述推荐时间对所述推荐新闻列表内的所述待推荐的新闻进行刷新,生成新的推荐新闻列表。
  11. 根据权利要求10所述的装置,其特征在于,当接收到的所述刷新信号为通过在触摸屏幕上自上而下滑动产生的第一触敏信号时,所述刷新起始时间为所述当前系统时间,其中,所述第一获取模块包括:
    第一子获取模块,用于根据所述第一触敏信号获取所述推荐新闻列表内包含的第一新闻集合的新闻数量n,其中,n为整数;
    第二子获取模块,用于获取所述当前系统时间和预设的第一时间阈值;
    第一子确定模块,用于根据所述当前系统时间和所述第一时间阈值,确定第一时间区间,所述第一时间区间用于限定刷新第一推荐新闻列表的时间区间;
    第三子获取模块,用于根据所述第一时间区间,获取发布时间在所述第一时间区间内的n个所述新闻;
    第一子生成模块,用于根据获取到的所述n个所述新闻,生成所述第一推荐新闻列表。
  12. 根据权利要求11所述的装置,其特征在于,所述第一处理模块包括:
    第四子获取模块,用于获取前一次接收到所述第一触敏信号并对所述新闻列表进行刷新的前一次刷新时间;
    第二子确定模块,用于根据所述前一次刷新时间和所述当前系统时间,确定第二时间区间,所述第二时间区间用于限定第一推荐列表内新闻的所述推荐时间;
    第一分配模块,用于根据所述第二时间区间,对所述第一推荐列表内的每条所述新闻分配所述推荐时间,其中,所述推荐时间处于所述第二时间区间内。
  13. 根据权利要求12所述的装置,其特征在于,所述第一分配模块包括:
    第一子处理模块,用于根据所述第一推荐新闻列表中的新闻数量n和所述第二时间区间,对第二时间区间平均分配,得到所述推荐新闻列表中每条所述新闻的第一等分时间间隔;
    第一子分配模块,用于根据所述第一等分时间间隔和所述当前系统时间,对所述第一推荐列表内的每条所述新闻分配所述推荐时间。
  14. 根据权利要求10所述的装置,其特征在于,当接收到的所述刷新信号为通过在触摸屏幕上自下而上滑动产生的第二触敏信号时,所述刷新起始时间为已刷新的最后一条新闻的推荐时间,其中,所述第一获取模块还包括:
    第五子获取模块,用于根据所述第二触敏信号获取所述推荐新闻列表内包含的第二新闻集合的新闻数量m,其中,m为整数;
    第六子获取模块,用于获取所述已刷新的最后一条新闻的推荐时间和第二时间阈值;
    第三子确定模块,用于根据所述已刷新的最后一条新闻的推荐时间和所述第二时间阈值,确定第三时间区间,所述第三时间区间用于限定刷新第二推荐新闻列表的时间区间;
    第七子获取模块,用于根据所述第三时间区间,获取发布时间在所述第三时间区间内的m个所述新闻;
    第二子生成模块,用于根据获取到的所述m个所述新闻,生成所述第二推荐新闻列表。
  15. 根据权利要求14所述的装置,其特征在于,所述第一处理模块还包括:
    第八获取模块,用于获取所述已刷新的最后一条新闻的推荐时间和第三时间阈值;
    第四子确定模块,用于根据所述已刷新的最后一条新闻的推荐时间和第三时间阈值,确定第四时间区间,所述第四时间区间用于限定所述第二推荐列表内新闻的推荐时间;
    第二分配模块,用于根据所述第四时间区间,对所述第二推荐列表内的每条所述新闻分配所述推荐时间,其中,所述推荐时间处于所述第四时间区间内。
  16. 根据权利要求15所述的装置,其特征在于,所述第二分配模块包括:
    第二子处理模块,用于根据所述第二推荐新闻列表中的新闻数量m和所述第四时间区间,对第四时间区间平均分配,得到所述推荐新闻列表中每条所述新闻的第二等分时间间隔;
    第二子分配模块,用于根据所述第二等分时间间隔和所述已刷新的最后一条新闻的推荐时间,对所述第二推荐列表内的每条所述新闻分配所述推荐时间。
  17. 根据权利要求10至16中任意一所述的装置,其特征在于,所述装置还包括:
    第二获取模块,用于获取在本次刷新之前,已通过刷新获取到的历史新闻列表;
    第二处理模块,用于根据所述历史新闻列表和所述推荐新闻列表进行比对,当所述推荐新闻列表中的所述新闻与所述历史新闻列表中的所述新闻相同时,将所述相同的新闻从所述推荐新闻列表中删除。
  18. 一种计算机终端,用于执行所述权利要求1所述的新闻列表刷新的方法提供的步骤的程序代码。
  19. 一种存储介质,用于保存所述权利要求1所述的新闻列表刷新的方法所执行的程序代码。
PCT/CN2015/083803 2014-10-17 2015-07-10 新闻列表刷新的方法及装置 WO2016058423A1 (zh)

Priority Applications (6)

Application Number Priority Date Filing Date Title
CA2964822A CA2964822C (en) 2014-10-17 2015-07-10 Method and device for refreshing news list
EP15850122.1A EP3208725A4 (en) 2014-10-17 2015-07-10 Method and device for refreshing news list
US15/519,756 US10509842B2 (en) 2014-10-17 2015-07-10 Method and device for refreshing news list
MX2017004992A MX2017004992A (es) 2014-10-17 2015-07-10 Metodo y dispositivo para actualizar listas de noticias.
BR112017007909-7A BR112017007909A2 (zh) 2014-10-17 2015-07-10 Method and apparatus refresh news list
JP2017539488A JP6479999B2 (ja) 2014-10-17 2015-07-10 ニュースリストの更新方法および装置

Applications Claiming Priority (2)

Application Number Priority Date Filing Date Title
CN201410555495.4 2014-10-17
CN201410555495.4A CN104239587B (zh) 2014-10-17 2014-10-17 新闻列表刷新的方法及装置

Publications (1)

Publication Number Publication Date
WO2016058423A1 true WO2016058423A1 (zh) 2016-04-21

Family

ID=52227646

Family Applications (1)

Application Number Title Priority Date Filing Date
PCT/CN2015/083803 WO2016058423A1 (zh) 2014-10-17 2015-07-10 新闻列表刷新的方法及装置

Country Status (8)

Country Link
US (1) US10509842B2 (zh)
EP (1) EP3208725A4 (zh)
JP (1) JP6479999B2 (zh)
CN (1) CN104239587B (zh)
BR (1) BR112017007909A2 (zh)
CA (1) CA2964822C (zh)
MX (1) MX2017004992A (zh)
WO (1) WO2016058423A1 (zh)

Families Citing this family (21)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
CN104239587B (zh) 2014-10-17 2017-09-12 北京字节跳动网络技术有限公司 新闻列表刷新的方法及装置
CN104915399A (zh) * 2015-05-29 2015-09-16 百度在线网络技术(北京)有限公司 基于新闻标题的推荐数据处理方法及系统
CN106657172A (zh) * 2015-10-28 2017-05-10 北京金山安全软件有限公司 一种信息推送的实现方法及装置
CN105574182A (zh) * 2015-12-22 2016-05-11 北京搜狗科技发展有限公司 一种新闻推荐方法和装置、一种用于新闻推荐的装置
CN106933482A (zh) * 2015-12-30 2017-07-07 百度在线网络技术(北京)有限公司 一种切换对象的方法和装置
CN105677819A (zh) * 2015-12-31 2016-06-15 广州华多网络科技有限公司 一种排行榜刷新方法及装置
CN111414082A (zh) * 2016-09-06 2020-07-14 苹果公司 用于提供触觉反馈的设备、方法和图形用户界面
CN108255900A (zh) 2017-03-22 2018-07-06 广州市动景计算机科技有限公司 推荐新闻呈现方法、设备、浏览器及电子设备
CN107391590B (zh) * 2017-06-27 2020-12-18 北京金山安全软件有限公司 一种主题列表的更新方法、装置、电子设备及存储介质
CN107609073A (zh) * 2017-09-01 2018-01-19 福建中金在线信息科技有限公司 一种资讯展示方法、装置、电子设备及存储介质
CN107590230B (zh) * 2017-09-06 2020-06-16 维沃移动通信有限公司 一种数据列表展示方法及移动终端
CN108108400B (zh) * 2017-12-05 2020-12-11 厦门哨子科技有限公司 一种api基于本地数据增量的方法
CN108259317B (zh) * 2017-12-21 2021-07-06 杭州传送门网络科技有限公司 一种基于创投圈子智能精准化内容推荐及过滤方法
CN110019945A (zh) * 2017-12-28 2019-07-16 飞狐信息技术(天津)有限公司 视频推荐方法及装置、存储介质及电子设备
CN108595534B (zh) * 2018-03-30 2020-06-30 北京金堤科技有限公司 一种资讯刷新的方法及装置
US10929498B2 (en) * 2019-04-02 2021-02-23 International Business Machines Corporation Identifying and storing relevant user content in a collection accessible to user in website subscribed to service
CN110572311B (zh) * 2019-08-09 2022-01-11 青岛海信移动通信技术股份有限公司 一种邮件下载的方法及终端
US11971934B2 (en) 2020-03-31 2024-04-30 Hithink Royalflush Information Network Co., Ltd. Methods and systems for refreshing current page information
JP7394346B2 (ja) 2020-06-05 2023-12-08 株式会社ジェイ・キャスト 記事処理システム及び記事処理方法
CN114880562A (zh) * 2022-05-10 2022-08-09 北京百度网讯科技有限公司 用于推荐信息的方法和装置
CN115097988B (zh) * 2022-07-20 2024-03-22 抖音视界有限公司 一种信息展示方法、装置、计算机设备及存储介质

Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100100845A1 (en) * 2008-10-20 2010-04-22 Ingboo Inc. Organization and Delivery of Information Updates
CN102024031A (zh) * 2010-11-25 2011-04-20 百度在线网络技术(北京)有限公司 一种用于基于实时搜索提供第二搜索结果的方法与设备
CN102831234A (zh) * 2012-08-31 2012-12-19 北京邮电大学 基于新闻内容和主题特征的个性化新闻推荐装置和方法
CN103428075A (zh) * 2013-08-20 2013-12-04 贝壳网际(北京)安全技术有限公司 一种信息推送方法及装置
CN103747343A (zh) * 2014-01-09 2014-04-23 深圳Tcl新技术有限公司 资源分时段推荐的方法和装置
CN104239587A (zh) * 2014-10-17 2014-12-24 北京字节跳动网络技术有限公司 新闻列表刷新的方法及装置

Family Cites Families (38)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US6032182A (en) * 1997-07-11 2000-02-29 International Business Machines Corporation Method, apparatus and computer program product for user selected refreshing of internet web pages
US5907681A (en) * 1997-10-20 1999-05-25 International Business Machines Corporation Intelligent method, apparatus and computer program product for automated refreshing of internet web pages
US6292835B1 (en) * 1997-11-26 2001-09-18 International Business Machines Corporation Network bandwidth and object obsolescence sensitive scheduling method and apparatus for objects distributed broadcasting
US6959295B1 (en) * 2000-06-30 2005-10-25 Puscar Michael A System and method for providing news updates
JP2002108524A (ja) * 2000-10-02 2002-04-12 Canon Inc 情報処理システム、受信装置、情報処理方法及び記録媒体
JP2002278990A (ja) * 2001-03-15 2002-09-27 Hitachi Ltd メッセージ情報抽出方法およびそのシステム
DE10160607A1 (de) * 2001-12-10 2003-06-26 Oce Printing Systems Gmbh Verfahren, Gerätesystem und Computerprogrammprodukt zur Erzeugung eines gedruckten Dokuments aus mehreren Eingangsdateien
US20050096039A1 (en) * 2003-10-31 2005-05-05 Haberman William E. Storing new and updated broadcasts in mobile device
US20050262145A1 (en) * 2004-05-19 2005-11-24 Dwango Co., Ltd. System, method and program for news updates
US8620994B2 (en) * 2006-02-23 2013-12-31 Qualcomm Incorporated System and method for scheduling content updates in a content-based application
GB2453753A (en) * 2007-10-17 2009-04-22 Motorola Inc Method and system for generating recommendations of content items
WO2009135187A1 (en) * 2008-05-01 2009-11-05 Blip, Inc. Method and apparatus for providing dynamic playlists and tag-tuning of multimedia objects
CA2634020A1 (en) * 2008-05-30 2009-11-30 Biao Wang System and method for multi-level online learning
WO2010085874A1 (en) * 2009-01-27 2010-08-05 Kibboko, Inc. Recommender system for on-line articles and documents
US20120159336A1 (en) * 2009-03-27 2012-06-21 Michael Roy Norwood Electronic list priority management system and method of using same
US20110010307A1 (en) * 2009-07-10 2011-01-13 Kibboko, Inc. Method and system for recommending articles and products
US20120297011A1 (en) * 2009-12-30 2012-11-22 Nokia Corporation Intelligent Reception of Broadcasted Information Items
US10318589B2 (en) * 2010-09-20 2019-06-11 International Business Machines Corporation Detection and display of volatile data
US9015639B2 (en) * 2011-02-11 2015-04-21 Linkedin Corporation Methods and systems for navigating a list with gestures
WO2013037256A1 (zh) * 2011-09-13 2013-03-21 腾讯科技(深圳)有限公司 数据匹配方法和装置
CN102737082A (zh) * 2011-09-23 2012-10-17 新奥特(北京)视频技术有限公司 一种动态更新文稿数据索引的方法和系统
JP5978308B2 (ja) * 2011-10-19 2016-08-24 トムソン ライセンシングThomson Licensing 自動的にコンテンツ番組を発見するためのシステムおよび方法
JP5954975B2 (ja) * 2011-12-06 2016-07-20 キヤノン株式会社 情報処理装置、情報処理方法、コンピュータプログラム
CN103164317B (zh) * 2011-12-08 2018-04-03 腾讯科技(深圳)有限公司 一种检测更新的方法和装置
US8826125B2 (en) * 2012-03-12 2014-09-02 Hyperion Media LLC System and method for providing news articles
JP5704655B2 (ja) * 2012-04-12 2015-04-22 株式会社Nttドコモ 表示装置及びプログラム
US9785883B2 (en) * 2012-04-27 2017-10-10 Excalibur Ip, Llc Avatars for use with personalized generalized content recommendations
US9836545B2 (en) * 2012-04-27 2017-12-05 Yahoo Holdings, Inc. Systems and methods for personalized generalized content recommendations
US8996530B2 (en) * 2012-04-27 2015-03-31 Yahoo! Inc. User modeling for personalized generalized content recommendations
US20130337785A1 (en) * 2012-06-01 2013-12-19 Airpush, Inc. Methods and systems for providing a dynamic array of services and information through a dynamic icon
CN102946599B (zh) * 2012-11-08 2016-08-17 惠州Tcl移动通信有限公司 实现移动终端应用程序下载的方法及移动终端
JP5984685B2 (ja) * 2013-01-11 2016-09-06 アルパイン株式会社 表示システム、サーバ、端末装置、表示方法およびプログラム
US20150019642A1 (en) * 2013-07-11 2015-01-15 Papaya Mobile, Inc. Calendar-event recommendation system
CN103399884A (zh) * 2013-07-14 2013-11-20 王国栋 一种随机新闻系统及其自动刷新方法
US9832284B2 (en) * 2013-12-27 2017-11-28 Facebook, Inc. Maintaining cached data extracted from a linked resource
KR20150083336A (ko) * 2014-01-09 2015-07-17 삼성전자주식회사 서버 장치, 그 서버장치의 서비스 제공방법, 디스플레이 장치 및 그 디스플레이 장치의 표시 방법
US10504034B2 (en) * 2015-01-27 2019-12-10 Huawei Technologies Co., Ltd. Systems, devices and methods for distributed content interest prediction and content discovery
WO2016201631A1 (en) * 2015-06-17 2016-12-22 Yahoo! Inc. Systems and methods for online content recommendation

Patent Citations (6)

* Cited by examiner, † Cited by third party
Publication number Priority date Publication date Assignee Title
US20100100845A1 (en) * 2008-10-20 2010-04-22 Ingboo Inc. Organization and Delivery of Information Updates
CN102024031A (zh) * 2010-11-25 2011-04-20 百度在线网络技术(北京)有限公司 一种用于基于实时搜索提供第二搜索结果的方法与设备
CN102831234A (zh) * 2012-08-31 2012-12-19 北京邮电大学 基于新闻内容和主题特征的个性化新闻推荐装置和方法
CN103428075A (zh) * 2013-08-20 2013-12-04 贝壳网际(北京)安全技术有限公司 一种信息推送方法及装置
CN103747343A (zh) * 2014-01-09 2014-04-23 深圳Tcl新技术有限公司 资源分时段推荐的方法和装置
CN104239587A (zh) * 2014-10-17 2014-12-24 北京字节跳动网络技术有限公司 新闻列表刷新的方法及装置

Non-Patent Citations (1)

* Cited by examiner, † Cited by third party
Title
See also references of EP3208725A4 *

Also Published As

Publication number Publication date
BR112017007909A2 (zh) 2018-01-23
JP6479999B2 (ja) 2019-03-06
EP3208725A4 (en) 2018-04-25
CA2964822A1 (en) 2016-04-21
CN104239587A (zh) 2014-12-24
US10509842B2 (en) 2019-12-17
JP2017538233A (ja) 2017-12-21
CN104239587B (zh) 2017-09-12
EP3208725A1 (en) 2017-08-23
MX2017004992A (es) 2018-02-23
CA2964822C (en) 2019-05-28
US20170242930A1 (en) 2017-08-24

Similar Documents

Publication Publication Date Title
WO2016058423A1 (zh) 新闻列表刷新的方法及装置
US11743545B2 (en) Interactive programming guide
US9354790B2 (en) Dynamically selecting and ordering facets and facet values in a user interface based on user preference
US20200201596A1 (en) Method and system for playback of audio content using wireless mobile device
US8903819B2 (en) Systems and methods for sharing profile information using user preference tag clouds
CN105359125B (zh) 用户历史播放列表和预订
CN104091287B (zh) 一种基于数据驱动的任务实现方法及装置
CN106792210B (zh) 一种电视用户的分类方法及系统
US9537913B2 (en) Method and system for delivery of audio content for use on wireless mobile device
CN102523511A (zh) 一种网络节目聚合及节目推荐系统和方法
CN107454442B (zh) 一种推荐视频的方法和装置
CN110225407B (zh) 一种播放数据的获取方法和装置及计算机可读存储介质
CN105701226A (zh) 多媒体资源评估方法和装置
CN106227870A (zh) 一种视频网站推荐方法及装置
CN104581224B (zh) 切换播放内容的方法、装置及终端
CN106534984A (zh) 电视节目推送方法及装置
CN103699589A (zh) 一种信息推送方法及装置
CN103942247A (zh) 多媒体资源的信息提供方法及装置
CN108134948B (zh) 电视节目推荐方法、装置、系统及可读存储介质
CN106658180A (zh) 确定用户对频道偏好程度的方法及装置
TWI609315B (zh) 應用程式推薦方法及應用其的電子裝置

Legal Events

Date Code Title Description
121 Ep: the epo has been informed by wipo that ep was designated in this application

Ref document number: 15850122

Country of ref document: EP

Kind code of ref document: A1

ENP Entry into the national phase

Ref document number: 2017539488

Country of ref document: JP

Kind code of ref document: A

WWE Wipo information: entry into national phase

Ref document number: 15519756

Country of ref document: US

Ref document number: MX/A/2017/004992

Country of ref document: MX

ENP Entry into the national phase

Ref document number: 2964822

Country of ref document: CA

NENP Non-entry into the national phase

Ref country code: DE

REG Reference to national code

Ref country code: BR

Ref legal event code: B01A

Ref document number: 112017007909

Country of ref document: BR

REEP Request for entry into the european phase

Ref document number: 2015850122

Country of ref document: EP

ENP Entry into the national phase

Ref document number: 112017007909

Country of ref document: BR

Kind code of ref document: A2

Effective date: 20170417