会员体验
专利管家(专利管理)
工作空间(专利管理)
风险监控(情报监控)
数据分析(专利分析)
侵权分析(诉讼无效)
联系我们
交流群
官方交流:
QQ群: 891211   
微信请扫码    >>>
现在联系顾问~
热词
    • 4. 发明授权
    • Dynamically altered search assistance
    • 动态更改搜索帮助
    • US08918389B2
    • 2014-12-23
    • US13182439
    • 2011-07-13
    • Omer Emre Velipasaoglu
    • Omer Emre Velipasaoglu
    • G06F17/30
    • G06F17/3097
    • Search-engine software displays a group of search results in a graphical user interface (GUI) for a search engine. The search-engine software captures positive feedback and negative feedback as to the search results from a user. Then the search-engine software determines a collective aboutness signature for the search results associated with the positive feedback and a collective aboutness signature for search results associated with the negative feedback. The search-engine software obtains a score of similarity to each of the collective aboutness signatures for a representation of each query suggestion in a group of query suggestions. Then the search-engine software separates the scored query suggestions into two or more groups, based on the similarity scores, and displays query suggestions from the groups in the GUI.
    • 搜索引擎软件在搜索引擎的图形用户界面(GUI)中显示一组搜索结果。 搜索引擎软件捕获来自用户的搜索结果的正反馈和负反馈。 然后,搜索引擎软件确定与正反馈相关联的搜索结果的集体关于性签名,以及与负反馈相关联的搜索结果的集体约性签名。 搜索引擎软件获得与每个集体约性签名相似度的得分,用于在一组查询建议中的每个查询建议的表示。 然后,搜索引擎软件基于相似性分数将得分查询建议分成两个或更多个组,并从GUI中显示组中的查询建议。
    • 6. 发明授权
    • 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.
    • 为了提供关于网页的有价值的信息,网页必须被划分成不同的语义上相关的分段用于分析。 一组启发式允许分割算法更精确地识别给定网页或其任何部分的最佳段数。 第一启发式估计任何给定网页或其部分的最佳段数。 第二个启发式聚合段,其中识别的段数远远超过推荐的最优数。 第三个启发式聚合对应于网页的一部分的段,其中使用了许多未使用的空白和少量的内容。 第四个启发式将具有低于某个阈值的推荐数量的节点段合并成其他节点的段。 第五个启发式递归地分析和分割对应于超过某个阈值部分大小的网页部分的分段。
    • 7. 发明授权
    • Search assist powered by session analysis
    • 搜索辅助由会话分析
    • US08255414B2
    • 2012-08-28
    • US12882974
    • 2010-09-15
    • Chi-Hoon LeeEric CrestanJiefeng ShenRichard Allan KasperskiSu-Lin WuOmer Emre VelipasaogluBenoit Dumoulin
    • Chi-Hoon LeeEric CrestanJiefeng ShenRichard Allan KasperskiSu-Lin WuOmer Emre VelipasaogluBenoit Dumoulin
    • G06F17/30
    • G06F17/3064
    • One embodiment selects from a set of query-suggestion pairs a first query and a subset of query-suggestion pairs that each has the first query as its query; computes a Log Likelihood Ratio (LLR) value for each query-suggestion pair from the subset of query-suggestion pairs; ranks the subset of query-suggestion pairs according to their respective LLR values; removes from the subset of query-suggestion pairs all query-suggestion pairs whose LLR values are below a predetermined LLR threshold; computes a Pointwise Mutual Information (PMI) value for each remaining query suggestion pair from the subset of query-suggestion pairs; removes from the subset of query-suggestion pairs all query-suggestion pairs whose PMI values are below a predetermine PMI threshold; and constructs a ranked set of suggestions for the first query, wherein the ranked set of suggestions comprises one or more suggestions of the remaining query-suggestion pairs from the subset of query-suggestion pairs.
    • 一个实施例从一组查询建议对中选择第一查询和每个具有第一查询作为其查询的查询建议对的子集; 从查询建议对的子集计算每个查询建议对的对数似然比(LLR)值; 根据各自的LLR值对查询建议对的子集进行排序; 从查询建议对的子集中删除其LLR值低于预定LLR阈值的所有查询建议对; 从查询建议对的子集计算每个剩余查询建议对的点向相互信息(PMI)值; 从查询建议对的子集中删除其PMI值低于预定PMI阈值的所有查询建议对; 并且针对第一查询构建排序的建议集合,其中排名的建议集包括来自查询建议对的子集的剩余查询建议对的一个或多个建议。
    • 8. 发明申请
    • 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.
    • 为了提供关于网页的有价值的信息,网页必须被划分成不同的语义上相关的分段用于分析。 一组启发式允许分割算法更精确地识别给定网页或其任何部分的最佳段数。 第一启发式估计任何给定网页或其部分的最佳段数。 第二个启发式聚合段,其中识别的段数远远超过推荐的最优数。 第三个启发式聚合对应于网页的一部分的段,其中使用了许多未使用的空白和少量的内容。 第四个启发式将具有低于某个阈值的推荐数量的节点段合并成其他节点的段。 第五个启发式递归地分析和分割对应于超过某个阈值部分大小的网页部分的分段。