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

1. 发明申请

US20070136274A1 SYSTEM OF EFFECTIVELY SEARCHING TEXT FOR KEYWORD, AND METHOD THEREOF 失效
标题翻译：关键词有效搜索文本系统及其方法
公开(公告)号：US20070136274A1
公开(公告)日：2007-06-14
申请号：US11555790
申请日：2006-11-02
申请人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
发明人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
IPC分类号： G06F17/30
CPC分类号： G06F17/3061 , Y10S707/99935
摘要： A system of the present invention stores: a first index which designates lists of keywords contained in texts from identifications of the respective texts; a second index which designates lists of texts containing keywords from identifications of the respective keywords; and the number of texts containing the respective keywords. Then, upon receiving an input of a text search condition, the system calculates an estimation of search time by the first index and an estimation of search time by the second index, and determines which one of the first and second indexes makes a search faster. Then, by using the index which has been determined to make the search faster, the system searches for keywords which appear in texts satisfying the text search condition with higher frequency.
摘要翻译：本发明的系统存储：从各文本的标识指定文本中包含的关键字的列表的第一索引; 第二索引，其指定包含来自各个关键词的标识的关键字的文本的列表; 以及包含各个关键字的文本数量。然后，在接收到文本搜索条件的输入时，系统通过第一索引计算搜索时间的估计和通过第二索引的搜索时间的估计，并且确定第一和第二索引中哪一个使得搜索更快。然后，通过使用确定的索引更快地进行搜索，系统搜索出现在满足文本搜索条件的文本中的较高频率的关键字。

2. 发明授权

US07584184B2 System of effectively searching text for keyword, and method thereof 失效
标题翻译：有效搜索关键字文本的系统及其方法
公开(公告)号：US07584184B2
公开(公告)日：2009-09-01
申请号：US11555790
申请日：2006-11-02
申请人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
发明人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
IPC分类号： G06F7/00
CPC分类号： G06F17/3061 , Y10S707/99935
摘要： A system of the present invention stores: a first index which designates lists of keywords contained in texts from identifications of the respective texts; a second index which designates lists of texts containing keywords from identifications of the respective keywords; and the number of texts containing the respective keywords. Then, upon receiving an input of a text search condition, the system calculates an estimation of search time by the first index and an estimation of search time by the second index, and determines which one of the first and second indexes makes a search faster. Then, by using the index which has been determined to make the search faster, the system searches for keywords which appear in texts satisfying the text search condition with higher frequency.
摘要翻译：本发明的系统存储：从各文本的标识指定文本中包含的关键字的列表的第一索引; 第二索引，其指定包含来自各个关键词的标识的关键字的文本的列表; 以及包含各个关键字的文本数量。然后，在接收到文本搜索条件的输入时，系统通过第一索引计算搜索时间的估计和通过第二索引的搜索时间的估计，并且确定第一和第二索引中哪一个使得搜索更快。然后，通过使用确定的索引更快地进行搜索，系统搜索出现在满足文本搜索条件的文本中的较高频率的关键字。

3. 发明授权

US08190613B2 System, method and program for creating index for database 失效
标题翻译：用于创建数据库索引的系统，方法和程序
公开(公告)号：US08190613B2
公开(公告)日：2012-05-29
申请号：US12132301
申请日：2008-06-03
申请人： Daisuke Takuma , Issei Yoshida
发明人： Daisuke Takuma , Issei Yoshida
IPC分类号： G06F17/00
CPC分类号： G06F17/30616
摘要： A computer implemented method for creating indices for a database having a plurality of documents each being associated with one or more keywords. The method includes the steps of: dividing the database into a plurality of subsets; separating the keywords into a plurality of keyword groups based upon modulo G of the hash value of the keyword for each subset; reading each document of each subset to create a first sub-index and writing same to a storage device of the computer; reading the first sub-indices to merge the first sub-indices into a second sub-index for each keyword group to write same to the storage device; and reading the second sub-indices from the storage device to merge the second sub-indices into an index for the database and write same on the storage device. A program and a system for creating indices are also provided.
摘要翻译：一种用于创建具有多个文档的数据库的索引的计算机实现的方法，每个文档都与一个或多个关键字相关联。该方法包括以下步骤：将数据库划分成多个子集; 基于每个子集的关键字的散列值的模G将关键字分离成多个关键字组; 读取每个子集的每个文档以创建第一子索引并将其写入计算机的存储设备; 读取第一子索引以将每个关键字组的第一子索引合并成第二子索引以将其写入存储设备; 以及从所述存储装置读取所述第二子索引，以将所述第二子索引合并到所述数据库的索引中，并将其写入所述存储装置。还提供了一个用于创建索引的程序和系统。

4. 发明授权

US07945552B2 System of effectively searching text for keyword, and method thereof 有权
标题翻译：有效搜索关键字文本的系统及其方法
公开(公告)号：US07945552B2
公开(公告)日：2011-05-17
申请号：US12055420
申请日：2008-03-26
申请人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
发明人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
IPC分类号： G06F7/00
CPC分类号： G06F17/3061 , Y10S707/99935
摘要： A system of the present invention stores: a first index which designates lists of keywords contained in texts from identifications of the respective texts; a second index which designates lists of texts containing keywords from identifications of the respective keywords; and the number of texts containing the respective keywords. Then, upon receiving an input of a text search condition, the system calculates an estimation of search time by the first index and an estimation of search time by the second index, and determines which one of the first and second indexes makes a search faster. Then, by using the index which has been determined to make the search faster, the system searches for keywords which appear in texts satisfying the text search condition with higher frequency.
摘要翻译：本发明的系统存储：从各文本的标识指定文本中包含的关键字的列表的第一索引; 第二索引，其指定包含来自各个关键词的标识的关键字的文本的列表; 以及包含各个关键字的文本数量。然后，在接收到文本搜索条件的输入时，系统通过第一索引计算搜索时间的估计和通过第二索引的搜索时间的估计，并且确定第一和第二索引中哪一个使得搜索更快。然后，通过使用确定的索引更快地进行搜索，系统搜索出现在满足文本搜索条件的文本中的较高频率的关键字。

5. 发明申请

US20090030892A1 SYSTEM OF EFFECTIVELY SEARCHING TEXT FOR KEYWORD, AND METHOD THEREOF 有权
标题翻译：关键词有效搜索文本系统及其方法
公开(公告)号：US20090030892A1
公开(公告)日：2009-01-29
申请号：US12055420
申请日：2008-03-26
申请人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
发明人： Daisuke Takuma , Issei Yoshida , Yuta Tsuboi
IPC分类号： G06F17/30
CPC分类号： G06F17/3061 , Y10S707/99935
摘要： A system of the present invention stores: a first index which designates lists of keywords contained in texts from identifications of the respective texts; a second index which designates lists of texts containing keywords from identifications of the respective keywords; and the number of texts containing the respective keywords. Then, upon receiving an input of a text search condition, the system calculates an estimation of search time by the first index and an estimation of search time by the second index, and determines which one of the first and second indexes makes a search faster. Then, by using the index which has been determined to make the search faster, the system searches for keywords which appear in texts satisfying the text search condition with higher frequency.
摘要翻译：本发明的系统存储：从各文本的标识指定文本中包含的关键字的列表的第一索引; 第二索引，其指定包含来自各个关键词的标识的关键字的文本的列表; 以及包含各个关键字的文本数量。然后，在接收到文本搜索条件的输入时，系统通过第一索引计算搜索时间的估计和通过第二索引的搜索时间的估计，并且确定第一和第二索引中哪一个使得搜索更快。然后，通过使用确定的索引更快地进行搜索，系统搜索出现在满足文本搜索条件的文本中的较高频率的关键字。

6. 发明申请

US20080319987A1 SYSTEM, METHOD AND PROGRAM FOR CREATING INDEX FOR DATABASE 失效
标题翻译：用于创建数据库索引的系统，方法和程序
公开(公告)号：US20080319987A1
公开(公告)日：2008-12-25
申请号：US12132301
申请日：2008-06-03
申请人： Daisuke Takuma , Issei Yoshida
发明人： Daisuke Takuma , Issei Yoshida
IPC分类号： G06F17/30
CPC分类号： G06F17/30616
摘要： An entire document set is decomposed into a sum of subsets each having no common part. Next, a set of keywords appearing in each of the subsets divided in the aforementioned manner is categorized into groups on the basis of a remainder resulting from dividing a hash value of each of the keywords by a certain fixed integer value. Thereby, index files for the respective groups are created. Among the index files prepared for the respective subsets of the document in the aforementioned manner, ones each having the same group number are merged. Thereby, integrated index files corresponding to the respective individual group numbers are created. Such index files, however, exist as many as the number of group numbers, and have not yet become an index corresponding to the entire document set. In this respect, the index files existing as many as the number of group numbers are next merged into one, and thereby, an index file corresponding to the entire document set is created.
摘要翻译：整个文件集被分解为每个没有共同部分的子集的总和。接下来，根据以每个关键字的哈希值除以某个固定整数值的余数，出现在以上述方式划分的每个子集中的一组关键字被分类成组。由此，创建各组的索引文件。在以上述方式为文档的各个子集准备的索引文件中，合并具有相同组号的索引文件。由此，创建与各个组号对应的综合索引文件。然而，这样的索引文件与组号的数量一样多，并且尚未成为与整个文档集相对应的索引。在这方面，存在与组编号一样多的索引文件接下来合并成一个，从而创建与整个文档集相对应的索引文件。

7. 发明授权

US08140546B2 Computer system for performing aggregation of tree-structured data, and method and computer program product therefor 失效
标题翻译：用于执行树结构数据聚合的计算机系统及其方法和计算机程序产品
公开(公告)号：US08140546B2
公开(公告)日：2012-03-20
申请号：US12477975
申请日：2009-06-04
申请人： Issei Yoshida
发明人： Issei Yoshida
IPC分类号： G06F17/30
CPC分类号： G06F17/30312
摘要： A computer system, methods, and programs for creating an index for aggregating data in at least one tree structure including at least one node each including one label indicating node type and values. The system includes a node ID assignment processing unit for assigning IDs to the nodes in a post order; first, second, and third index creation processing units. The first unit creates a first index having one or more sets of data including the node ID and values included in the node; the second unit creates a second index having one or more sets of data including node ID and ID of a descendant node having the minimum ID; and the third unit creates a third index having one or more sets of data including IDs of one or more nodes having specific values.
摘要翻译：一种计算机系统，方法和程序，用于创建用于聚合至少一个树结构中的数据的索引，包括至少一个节点，每个节点包括指示节点类型和值的一个标签。该系统包括用于在后期订单中向节点分配ID的节点ID分配处理单元; 第一，第二和第三索引创建处理单元。第一单元创建具有包括节点ID和节点中包括的值的一组或多组数据的第一索引; 第二单元创建具有包括具有最小ID的后代节点的节点ID和ID的一组或多组数据的第二索引; 并且第三单元创建具有一个或多个数据集合的第三索引，包括具有特定值的一个或多个节点的ID。

8. 发明授权

US09563669B2 Closed itemset mining using difference update 有权
标题翻译：使用差异更新关闭项集挖掘
公开(公告)号：US09563669B2
公开(公告)日：2017-02-07
申请号：US13494599
申请日：2012-06-12
申请人： Issei Yoshida
发明人： Issei Yoshida
IPC分类号： G06F17/30
CPC分类号： G06F17/30539
摘要： Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (μ) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof.
摘要翻译：实施例涉及对于包括一组事务的数据库，其中每个事务包括包括一个或多个单独项目的项集合，通过检查事务集合的频率来获得所有封闭频繁项集的集合，其中给定项集合I是其中至少一些阈值数量（μ）的交易包含I，并且其中给定项目集I被关闭，其中不可能将任何项目添加到I而不改变其频率。

9. 发明申请

US20130332432A1 CLOSED ITEMSET MINING USING DIFFERENCE UPDATE 审中-公开
公开(公告)号：US20130332432A1
公开(公告)日：2013-12-12
申请号：US13552231
申请日：2012-07-18
申请人： Issei Yoshida
发明人： Issei Yoshida
IPC分类号： G06F17/30
CPC分类号： G06F16/2465
摘要： Embodiments are directed to, for a database comprising a set of transactions, with each transaction including an itemset comprising one or more individual items, obtaining a set of all closed frequent itemsets by checking frequencies of transaction sets, wherein a given itemset, I, is frequent where at least some threshold number (μ) of transactions contain I, and wherein the given itemset I is closed wherein it is impossible to add any item to I without changing the frequency thereof.

10. 发明申请

US20120096031A1 SYSTEM, METHOD, AND PROGRAM PRODUCT FOR EXTRACTING MEANINGFUL FREQUENT ITEMSET 有权
标题翻译：系统，方法和程序产品，用于提取均匀的物件
公开(公告)号：US20120096031A1
公开(公告)日：2012-04-19
申请号：US13253102
申请日：2011-10-05
申请人： Issei Yoshida
发明人： Issei Yoshida
IPC分类号： G06F17/30
CPC分类号： G06F17/30539
摘要： A system and method for enabling efficient extraction of only meaningful frequent itemsets. The system includes a decision unit that decides a new itemset that becomes an investigation target in the same sequence as that of searching an itemset tree in a depth-first manner and in descending order, a frequent occurrence determining unit that registers the frequency of occurrence of the new itemset in a table if the frequency of occurrence is equal to or more than a predetermined threshold, a correlation determining unit that determines whether there is a correlation between each item in the new itemset and a subset of remaining items that were removed from the new itemset, and a registration unit that registers the new itemset in a set of meaningful frequent itemsets if the determination is positive for all items of the new itemset.
摘要翻译：一种用于仅有效提取有意义的频繁项集的系统和方法。该系统包括：决定单元，以与深度优先方式搜索项目集树顺序相同的顺序决定成为调查对象的新项目集，并且以降序排列;频繁发生确定单元，其登记发生频率的频率如果发生频率等于或大于预定阈值，则表中的新项目集合;确定新项目集中的每个项目与从该项目组中移除的剩余项目的子集是否相关的相关确定单元新项目集和注册单元，如果新项目集的所有项目的确定为肯定，则将新项目集注册到一组有意义的频繁项集中。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式