Efficient Electronic Document Ranking For Internet Resources in Sub-linear Time
    1.
    发明申请
    Efficient Electronic Document Ranking For Internet Resources in Sub-linear Time 审中-公开
    用于亚线性时间的Internet资源的高效电子文档排名

    公开(公告)号:US20130226934A1

    公开(公告)日:2013-08-29

    申请号:US13405419

    申请日:2012-02-27

    IPC分类号: G06F17/30 G06Q30/02

    CPC分类号: G06Q30/02 G06F16/951

    摘要: The subject disclosure is directed towards ranking electronic documents in sub-linear time complexity. An advertising provider may perform such a ranking in order to identify one or more electronic document to advertise a product or service. A ranking mechanism may execute a number of random walks around the Internet by navigating the electronic documents via embedded links from a starting document and an ending document that are within a pre-determined distance. After finishing the random walks, an estimate of rank contribution information associated with each electronic document is provided. The estimated rank contribution information is used to determine an exposure level with respect to a network for one or more of the electronic documents. The exposure value of an example electronic document may correspond to a ranking value that may be computed using a sample of the rank contribution information related to that document.

    摘要翻译: 该主题公开涉及以亚线性时间复杂度排列电子文档。 广告提供者可以执行这样的排名,以便识别一个或多个电子文档来宣传产品或服务。 排序机制可以通过经由来自起始文档和预定距离内的结束文档的嵌入式链接导航电子文档来执行互联网周围的多个随机游走。 在完成随机散步之后,提供与每个电子文档相关联的排名贡献信息的估计。 估计的等级分配信息用于确定关于一个或多个电子文档的网络的曝光水平。 示例电子文档的曝光值可以对应于可以使用与该文档相关的等级提供信息的样本来计算的排名值。