专利快速检索-快速检索全球专利，免费商用专利数据库-IPRDB

1. 发明授权

US09348806B2 High speed dictionary expansion 有权
标题翻译：高速字典扩展
公开(公告)号：US09348806B2
公开(公告)日：2016-05-24
申请号：US14502939
申请日：2014-09-30
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Kenneth L. Clarkson , Daniel F. Gruhl , Neal R. Lewis , Nimrod Megiddo
IPC分类号： G06F17/21 , G06F17/27 , G06F17/30
CPC分类号： G06F17/2735 , G06F17/277 , G06F17/30731 , G06F17/30734 , G06F17/30737
摘要： Embodiments of the present invention relate to a pattern-based system for building dictionaries of terms related to a seed set of terms. In one embodiment, a text is read. The text comprises a plurality of tokens. A first plurality of patterns is read. The first plurality of tokens is searched using the first plurality of patterns to generate a plurality of candidate terms. Each of the plurality of candidate term comprises one or more of the plurality of tokens. A plurality of seed terms is read. Each of the first plurality of patterns is scored based on the plurality of candidate terms and the plurality of seed terms.
摘要翻译：本发明的实施例涉及一种用于构建与种子术语组相关的术语的词典的基于模式的系统。在一个实施例中，读取文本。该文本包括多个令牌。读取第一多个图案。使用第一多个模式来搜索第一多个令牌以生成多个候选项。多个候选项中的每一个包括多个令牌中的一个或多个。读取多个种子项。基于多个候选项和多个种子项来对第一多个模式中的每一个进行评分。

2. 发明授权

US11455562B2 Quantum walk for community clique detection 有权
公开(公告)号：US11455562B2
公开(公告)日：2022-09-27
申请号：US16573862
申请日：2019-09-17
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Tal Kachman , Lior Horesh , Giacomo Nannicini , Mark S. Squillante , John A. Gunnels , Kenneth L. Clarkson
IPC分类号： G06N10/00 , G06F17/11 , H03K19/195 , G06N5/00 , G06N10/60
摘要： A method of detecting cliques in a graph includes determining, based on a number of nodes in the graph, a number of qubits to be included in a quantum processor. The method includes assigning to each node in the graph, a qubit of the quantum processor. The method includes operating on the qubits with a preparation circuit to create a quantum state in the qubits that corresponds to the graph. The method includes operating on the quantum state with a random walk circuit, and measuring the qubits of the quantum processor to detect cliques in the graph. The preparation circuit comprises a plurality of single- and two-qubit operators, wherein, for each pair of adjacent nodes in the graph, an operator of the plurality of two-qubit operators acts on a pair of qubits corresponding to the pair of adjacent nodes to create the quantum state.

3. 发明授权

US11163774B2 Lower-dimensional subspace approximation of a dataset 有权
公开(公告)号：US11163774B2
公开(公告)日：2021-11-02
申请号：US16403650
申请日：2019-05-06
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Kenneth L. Clarkson , David P. Woodruff
IPC分类号： G06F16/2455 , G06F16/35 , G06F16/33
摘要： A lower-dimensional representation (e.g., approximation) of a dataset is determined. The lower-dimensional representation can be used, for example, to perform semantic document analysis. Given a matrix of input data points, where each entry of the matrix indicates a number of times a particular term in a set of terms appears in a particular document in a set of documents, a lower-dimensional compressed matrix is obtained from the matrix by sampling rows of the matrix based on a target rank parameter, a desired accuracy tolerance, leverage scores calculated for the rows, and/or distances from rows of the matrix to a span of the initial set of sampled rows. The compressed matrix is used to determine a similarity metric indicative of a degree of similarity between documents. The documents can then be classified into a same document cluster or different clusters based on whether the similarity metric satisfied a threshold value.

4. 发明授权

US09971735B2 Information retrieval using sparse matrix sketching 有权
公开(公告)号：US09971735B2
公开(公告)日：2018-05-15
申请号：US14024135
申请日：2013-09-11
申请人： International Business Machines Corporation
发明人： Kenneth L. Clarkson , David P. Woodruff
IPC分类号： G06F17/16
CPC分类号： G06F17/16
摘要： A system for retrieving stored data includes memory and a processor. The memory stores a first matrix, A, having dimensions n×d, a first sparse matrix, R, and a second sparse matrix, S. The processor receives an input value, k, corresponding to a selected rank to generate a second matrix, AR, by multiplying the first matrix, A, by the first sparse matrix, R. The second matrix, AT, has dimensions n×t. The processor generates a third matrix, SA, by multiplying the second sparse matrix, S, by the first matrix, A. The third matrix, SA, has dimensions t′×n, and the processor generates a fourth matrix, (SAR)−, by calculating a Moore-Penrose pseudo-inverse of a matrix, (SAR), and approximating the first matrix, A by generating a fifth matrix, Ã, the fifth matrix defined as AR×(SAR)−×SA.

5. 发明授权

US10902346B2 Efficient semi-supervised concept organization accelerated via an inequality process 有权
公开(公告)号：US10902346B2
公开(公告)日：2021-01-26
申请号：US15471933
申请日：2017-03-28
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Alfredo Alba , Kenneth L. Clarkson , Clemens Drews , Ronald Fagin , Daniel F. Gruhl , Neal R. Lewis , Pablo N. Mendes , Meenakshi Nagarajan , Cartic Ramakrishnan
IPC分类号： G06N5/02 , G06N20/00
摘要： One embodiment provides generating a similarity matrix corresponding to an input collection including initializing, by a processor, a working set as a collection of a multiple items. Until the similarity matrix converges: receiving a seed for similarity for at least one pair of items of the multiple items, and obtaining a similarity value for all other item pairs using a Naive Triangle Inequality process. The similarity is generated with obtained similarity values.

6. 发明申请

US20140280428A1 INFORMATION RETRIEVAL USING SPARSE MATRIX SKETCHING 有权
标题翻译：使用SPARSE MATRIX草图的信息检索
公开(公告)号：US20140280428A1
公开(公告)日：2014-09-18
申请号：US14024135
申请日：2013-09-11
申请人： International Business Machines Corporation
发明人： Kenneth L. Clarkson , David P. Woodruff
IPC分类号： G06F17/16
CPC分类号： G06F17/16
摘要： A system for retrieving stored data includes memory and a processor. The memory stores a first matrix, A, having dimensions n×d, a first sparse matrix, R, and a second sparse matrix, S. The processor receives an input value, k, corresponding to a selected rank to generate a second matrix, RA, by multiplying the first matrix, A, by the first sparse matrix, R. The second matrix, RA, has dimensions n×t. The processor generates a third matrix, AST, by multiplying the first matrix, A, by the second sparse matrix, S, transposed. The third matrix, AST, has dimensions d×t′, and the processor generates a fourth matrix, (SART)−, by calculating a Moore-Penrose pseudo-inverse of a matrix, (SART), and approximating the first matrix, A by generating a fifth matrix, Â, the fifth matrix defined as AST×(SART)−×RA.
摘要翻译：用于检索存储数据的系统包括存储器和处理器。存储器存储具有尺寸n×d的第一矩阵A，第一稀疏矩阵R和第二稀疏矩阵S.处理器接收对应于所选择的等级的输入值k以生成第二矩阵， RA，通过将第一矩阵A与第一稀疏矩阵R相乘。第二矩阵RA具有尺寸n×t。处理器通过将第一矩阵A乘以被转置的第二稀疏矩阵S来产生第三矩阵AST。第三矩阵AST具有尺寸d×t'，并且处理器通过计算矩阵的Moore-Penrose伪逆（SART）并生成第四矩阵（SART），并近似第一矩阵A 通过生成第五个矩阵，第五个矩阵定义为AST×（SART） - ×RA。

7. 发明授权

US11347810B2 Methods of automatically and self-consistently correcting genome databases 有权
公开(公告)号：US11347810B2
公开(公告)日：2022-05-31
申请号：US16226995
申请日：2018-12-20
申请人： International Business Machines Corporation
发明人： James H. Kaufman , Matthew A. Davis , Mark Kunitomi , Kenneth L. Clarkson
IPC分类号： G06F16/90 , G06F16/906 , G06F16/901 , G06F16/907
摘要： A method is described for automatically correcting metadata errors in a k-mer database. A k-mer database having a self-consistent taxonomy based on genome-genome distance was constructed from a set of sample and reference genomes whose metadata included taxonomic labeling from a reference taxonomy (the standard NCBI taxonomy), which is not based on genetic distance. As a result, genomes of a given taxonomic ID of the self-consistent taxonomy could be separated into clusters based on the differences in the metadata. Genomes of the clusters less than a minimum cluster size Cmin were removed and profiled against the remaining genomes, correcting metadata automatically for those genomes that could be mapped back. The resulting k-mer database showed improved specificity for genetic profiling. Another method is described for identifying and handling chimeric genomes using the self-consistent taxonomy. Another method is described for correcting a classification database.

8. 发明申请

US20210406954A1 QUANTUM WALK FOR COMMUNITY CLIQUE DETECTION 有权
公开(公告)号：US20210406954A1
公开(公告)日：2021-12-30
申请号：US16573862
申请日：2019-09-17
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Tal Kachman , Lior Horesh , Giacomo Nannicini , Mark S. Squillante , John A. Gunnels , Kenneth L. Clarkson
IPC分类号： G06Q30/02 , G06N10/00
摘要： A method of detecting cliques in a graph includes determining, based on a number of nodes in the graph, a number of qubits to be included in a quantum processor. The method includes assigning to each node in the graph, a qubit of the quantum processor. The method includes operating on the qubits with a preparation circuit to create a quantum state in the qubits that corresponds to the graph. The method includes operating on the quantum state with a random walk circuit, and measuring the qubits of the quantum processor to detect cliques in the graph. The preparation circuit comprises a plurality of single- and two-qubit operators, wherein, for each pair of adjacent nodes in the graph, an operator of the plurality of two-qubit operators acts on a pair of qubits corresponding to the pair of adjacent nodes to create the quantum state.

9. 发明申请

US20180285762A1 EFFICIENT SEMI-SUPERVISED CONCEPT ORGANIZATION ACCELERATED VIA AN INEQUALITY PROCESS 审中-公开
公开(公告)号：US20180285762A1
公开(公告)日：2018-10-04
申请号：US15471933
申请日：2017-03-28
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Alfredo Alba , Kenneth L. Clarkson , Clemens Drews , Ronald Fagin , Daniel F. Gruhl , Neal R. Lewis , Pablo N. Mendes , Meenakshi Nagarajan , Cartic Ramakrishnan
IPC分类号： G06N99/00 , G06N5/04
摘要： One embodiment provides generating a similarity matrix corresponding to an input collection including initializing, by a processor, a working set as a collection of a multiple items. Until the similarity matrix converges: receiving a seed for similarity for at least one pair of items of the multiple items, and obtaining a similarity value for all other item pairs using a Naive Triangle Inequality process. The similarity is generated with obtained similarity values.

10. 发明申请

US20180107716A1 LOWER-DIMENSIONAL SUBSPACE APPROXIMATION OF A DATASET 审中-公开
公开(公告)号：US20180107716A1
公开(公告)日：2018-04-19
申请号：US15295388
申请日：2016-10-17
申请人： INTERNATIONAL BUSINESS MACHINES CORPORATION
发明人： Kenneth L. Clarkson , David P. Woodruff
IPC分类号： G06F17/30
CPC分类号： G06F16/24561 , G06F16/334 , G06F16/35
摘要： A lower-dimensional representation (e.g., approximation) of a dataset is determined. The lower-dimensional representation can be used, for example, to perform semantic document analysis. Given a matrix of input data points, where each entry of the matrix indicates a number of times a particular term in a set of terms appears in a particular document in a set of documents, a lower-dimensional compressed matrix is obtained from the matrix by sampling rows of the matrix based on a target rank parameter, a desired accuracy tolerance, leverage scores calculated for the rows, and/or distances from rows of the matrix to a span of the initial set of sampled rows. The compressed matrix is used to determine a similarity metric indicative of a degree of similarity between documents. The documents can then be classified into a same document cluster or different clusters based on whether the similarity metric satisfied a threshold value.

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式