首页> 外国专利> MAXIMUM-INNER PRODUCT SEARCH APPARATUS, MAXIMUM-INNER PRODUCT SEARCH METHOD, AND MAXIMUM-INNER PRODUCT SEARCH PROGRAM

MAXIMUM-INNER PRODUCT SEARCH APPARATUS, MAXIMUM-INNER PRODUCT SEARCH METHOD, AND MAXIMUM-INNER PRODUCT SEARCH PROGRAM

机译:最大内产品搜索装置,最大内产品搜索方法和最大内产品搜索程序

摘要

PROBLEM TO BE SOLVED: To perform a maximum-inner product search with less computational complexity.;SOLUTION: A maximum-inner product search apparatus 1 comprises: a search database 10 for storing a search vector set, a quantization search vector set, and a representative vector set; a query acquisition unit 14 for acquiring a query vector; and a maximum-inner product search unit 15 which divides the elements of an acquired query vector into blocks, calculates, for each of the blocks, an inner product of the query vector for the block and the representative vector for the block in the stored representative vector set, selects, for each of the blocks, a representative block for the vector based on the calculated inner product, and searches the search vectors contained in the stored search vector set for a search vector containing a representative vector selected for each block in all the blocks, based on the stored quantization vector set.;SELECTED DRAWING: Figure 1;COPYRIGHT: (C)2018,JPO&INPIT
机译:解决的问题:以较少的计算复杂度执行最大内积搜索;解决方案:最大内积搜索设备1包括:搜索数据库10,用于存储搜索向量集,量化搜索向量集和搜索向量集。代表性向量集查询获取单元14,用于获取查询向量;最大内积搜索单元15,其将获取的查询向量的元素划分为块,为每个块计算该块的查询向量与该块中的代表向量的内积。向量集,基于计算出的内积,为每个块选择向量的代表块,并在存储的搜索向量集中包含的搜索向量中搜索包含为所有块选择的代表向量的搜索向量块;基于存储的量化矢量集。;选定的图纸:图1;版权:(C)2018,JPO&INPIT

著录项

  • 公开/公告号JP2018045564A

    专利类型

  • 公开/公告日2018-03-22

    原文格式PDF

  • 申请/专利权人 PREFERRED NETWORKS INC;

    申请/专利号JP20160181489

  • 发明设计人 OKANOHARA DAISUKE;OKUDA RYOSUKE;

    申请日2016-09-16

  • 分类号G06F17/30;

  • 国家 JP

  • 入库时间 2022-08-21 13:12:59

相似文献

  • 专利
  • 外文文献
  • 中文文献
获取专利

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号