会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 3. 发明授权
    • Automatic visual segmentation of webpages
    • 网页自动视觉分割
    • US08255793B2
    • 2012-08-28
    • US11971160
    • 2008-01-08
    • Deepayan ChakrabartiManav Ratan MitalSwapnil HajelaEmre Velipasaoglu
    • Deepayan ChakrabartiManav Ratan MitalSwapnil HajelaEmre Velipasaoglu
    • G06N3/00
    • G06F17/2229G06F17/2247G06F17/30707G06F17/30864
    • To provide valuable information regarding a webpage, the webpage must be divided into distinct semantically coherent segments for analysis. A set of heuristics allow a segmentation algorithm to identify an optimal number of segments for a given webpage or any portion thereof more accurately. A first heuristic estimates the optimal number of segments for any given webpage or portion thereof. A second heuristic coalesces segments where the number of segments identified far exceeds the optimal number recommended. A third heuristic coalesces segments corresponding to a portion of a webpage with much unused whitespace and little content. A fourth heuristic coalesces segments of nodes that have a recommended number of segments below a certain threshold into segments of other nodes. A fifth heuristic recursively analyzes and splits segments that correspond to webpage portions surpassing a certain threshold portion size.
    • 为了提供关于网页的有价值的信息,网页必须被划分成不同的语义上相关的分段用于分析。 一组启发式允许分割算法更精确地识别给定网页或其任何部分的最佳段数。 第一启发式估计任何给定网页或其部分的最佳段数。 第二个启发式聚合段,其中识别的段数远远超过推荐的最优数。 第三个启发式聚合对应于网页的一部分的段,其中使用了许多未使用的空白和少量的内容。 第四个启发式将具有低于某个阈值的推荐数量的节点段合并成其他节点的段。 第五个启发式递归地分析和分割对应于超过某个阈值部分大小的网页部分的分段。
    • 4. 发明申请
    • AUTOMATIC VISUAL SEGMENTATION OF WEBPAGES
    • 自动视觉分割
    • US20090177959A1
    • 2009-07-09
    • US11971160
    • 2008-01-08
    • DEEPAYAN CHAKRABARTIManav Ratan MitalSwapnil HajelaEmre Velipasaoglu
    • DEEPAYAN CHAKRABARTIManav Ratan MitalSwapnil HajelaEmre Velipasaoglu
    • G06F17/21
    • G06F17/2229G06F17/2247G06F17/30707G06F17/30864
    • To provide valuable information regarding a webpage, the webpage must be divided into distinct semantically coherent segments for analysis. A set of heuristics allow a segmentation algorithm to identify an optimal number of segments for a given webpage or any portion thereof more accurately. A first heuristic estimates the optimal number of segments for any given webpage or portion thereof. A second heuristic coalesces segments where the number of segments identified far exceeds the optimal number recommended. A third heuristic coalesces segments corresponding to a portion of a webpage with much unused whitespace and little content. A fourth heuristic coalesces segments of nodes that have a recommended number of segments below a certain threshold into segments of other nodes. A fifth heuristic recursively analyzes and splits segments that correspond to webpage portions surpassing a certain threshold portion size.
    • 为了提供关于网页的有价值的信息,网页必须被划分成不同的语义上相关的分段用于分析。 一组启发式允许分割算法更精确地识别给定网页或其任何部分的最佳段数。 第一启发式估计任何给定网页或其部分的最佳段数。 第二个启发式聚合段,其中识别的段数远远超过推荐的最优数。 第三个启发式聚合对应于网页的一部分的段,其中使用了许多未使用的空白和少量的内容。 第四个启发式将具有低于某个阈值的推荐数量的节点段合并成其他节点的段。 第五个启发式递归地分析和分割对应于超过某个阈值部分大小的网页部分的分段。
    • 6. 发明申请
    • Synthesized Suggestions for Web-Search Queries
    • 网络搜索查询的综合建议
    • US20120191745A1
    • 2012-07-26
    • US13012795
    • 2011-01-24
    • Emre VelipasaogluAlpa JainUmut Ozertem
    • Emre VelipasaogluAlpa JainUmut Ozertem
    • G06F17/30
    • G06F16/3322
    • Data-mining software receives a user query as an input and segments the user query into a number of units. The data-mining software then drops terms from a unit using a Conditional Random Field (CRF) model that combines a number of features. At least one of the features is derived from query logs and at least one of the features is derived from web documents. The data-mining software then generates one or more candidate queries by adding terms to the unit. The added terms result from a hybrid method that utilizes query sessions and a web corpus. The data-mining software also scores each candidate query on well-formedness of the candidate query, utility, and relevance to the user query. Then the data-mining software stores the scored candidate queries in a database for subsequent display in a graphical user interface for a search engine.
    • 数据挖掘软件接收用户查询作为输入,并将用户查询分段成多个单位。 然后,数据挖掘软件使用组合许多功能的条件随机场(CRF)模型从单位中删除术语。 至少有一个功能来源于查询日志,至少有一个功能是从Web文档派生的。 然后,数据挖掘软件通过向单元添加术语来生成一个或多个候选查询。 添加的术语来自使用查询会话和Web语料库的混合方法。 数据挖掘软件还对候选查询的良好形式,实用程序和与用户查询的相关性进行了分类。 然后,数据挖掘软件将得分的候选查询存储在数据库中,以便随后在用于搜索引擎的图形用户界面中显示。
    • 8. 发明授权
    • Segment sensitive query matching
    • 分段敏感查询匹配
    • US09465872B2
    • 2016-10-11
    • US12538711
    • 2009-08-10
    • Srinivas VadrevuEmre Velipasaoglu
    • Srinivas VadrevuEmre Velipasaoglu
    • G06F17/30
    • G06F17/30864
    • Exemplary techniques are provided which may be implemented using various methods, apparatuses, and/or articles of manufacture to provide or otherwise support segment sensitive query matching based on segmented portions of web pages and/or providing related information for use in information extraction and/or information retrieval systems. In certain example implementations techniques may be provided for determining whether a query match exists between a document and obtained query terms based, at least in part, on labeled portion information associated with a plurality of segmented portions of a document.
    • 提供了可以使用各种方法,装置和/或制品制造来实现的示例性技术,以提供或以其他方式支持基于网页的分段部分的段敏感查询匹配和/或提供用于信息提取和/或 信息检索系统。 在某些示例实现中,可以提供技术来至少部分地基于与文档的多个分段部分相关联的标记部分信息来确定文档和获得的查询项之间是否存在查询匹配。