发明名称 Monitoring interesting subjects
摘要 Methods and systems for monitoring interesting subjects. A method including: selecting, based on a first collection of interesting subjects, a set of critical nodes including at least one critical node which participates in one or more interesting subjects in the first collection; and monitoring contents posted by the one or more critical nodes in the set so as to find a second collection of interesting subjects. The set of critical nodes which participate in one or more interesting subjects in the first collection of interesting subjects is selected based on the first collection, as objects to be monitored, thereby reducing the number of contents posted by the nodes to be monitored as compared with monitoring all the user nodes, so that interesting subjects such as hot news or hot events can be found in real time with high efficiency and low cost.
申请公布号 US9584608(B2) 申请公布日期 2017.02.28
申请号 US201414297770 申请日期 2014.06.06
申请人 INTERNATIONAL BUSINESS MACHINES CORPORATION 发明人 Gong Min;Hu Guoqiang;Qi Yi;Wang Yu;Yan Junchi
分类号 G06F15/16;H04L29/08;H04L29/06;G06Q50/00;G06Q10/10 主分类号 G06F15/16
代理机构 代理人 Hobson Mercedes
主权项 1. A method for monitoring interesting subjects, the method comprising: selecting, based on a first collection of interesting subjects, a set of critical nodes including at least one critical node which participates in one or more interesting subjects in the first collection; obtaining a plurality of participating nodes which participate in one or more interesting subjects in the first collection; selecting, from the plurality of participating nodes, a set including at least one participating node that satisfies a first specific condition, as the set of critical nodes, wherein the first specific condition includes making a coverage gain for the set that includes the participating nodes so that the first specific condition covers the first collection; wherein the coverage gain satisfies one of the following conditions: (i) the coverage gain is larger than a first specific threshold, and (ii) the coverage gain is the largest; and wherein the coverage gain represents a degree to which contents posted by the set including the participating nodes cover the first collection of interesting subjects; wherein the coverage gain for the set to cover the first collection is calculated through the following formula: G=αRcovered+βRuncovered wherein: G represents the coverage gain;α and β represent weight constants, respectively;Rcovered represents an efficiency coefficient related to the number of the posted contents relevant to the interesting subjects covered by the set;Runcovered represents an extent coefficient related to the number of the posted contents relevant to the interesting subjects not covered by the set; the interesting subjects covered by the set are the interesting subjects for which the number of the participating nodes in the set participating in the interesting subjects is larger than a second specific threshold; the interesting subjects not covered by the set are the interesting subjects for which the number of the participating nodes in the set participating in the interesting subjects is smaller than or equal to the second specific threshold; and monitoring contents posted by the one or more critical nodes in the set so as to find a second collection of interesting subjects.
地址 Armonk NY US