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

1. 发明授权

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而不改变其频率。

2. 发明申请

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.

3. 发明申请

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.
摘要翻译：一种用于仅有效提取有意义的频繁项集的系统和方法。该系统包括：决定单元，以与深度优先方式搜索项目集树顺序相同的顺序决定成为调查对象的新项目集，并且以降序排列;频繁发生确定单元，其登记发生频率的频率如果发生频率等于或大于预定阈值，则表中的新项目集合;确定新项目集中的每个项目与从该项目组中移除的剩余项目的子集是否相关的相关确定单元新项目集和注册单元，如果新项目集的所有项目的确定为肯定，则将新项目集注册到一组有意义的频繁项集中。

4. 发明授权

US07440952B1 Systems, methods, and computer products for information sharing using personalized index caching 有权
标题翻译：使用个性化索引缓存进行信息共享的系统，方法和计算机产品
公开(公告)号：US07440952B1
公开(公告)日：2008-10-21
申请号：US11958415
申请日：2007-12-18
申请人： Fumiko Satoh , Toyotaro Suzumura , Issei Yoshida
发明人： Fumiko Satoh , Toyotaro Suzumura , Issei Yoshida
IPC分类号： G06F17/30
CPC分类号： G06F17/30094 , Y10S707/99933
摘要： Systems, methods, and computer products for information sharing using personalized index caching. Exemplary embodiments include a method including receiving a search query history from a node X in a node A, extracting characteristics of an index of the node A, searching the extracted characteristics, which include a file ID that is included in the index of the node A, adding metadata information to the index of the node A, in response to a determination that the node A includes at least one additional local metaindex, searching the at least one additional metaindex with the search query history from the node X in the node A, and merging search results with the metaindex of the node A, wherein the one additional metaindex merged to the metaindex of the node A includes an acquisition path, and sending the metaindex of the node A to the node X.
摘要翻译：使用个性化索引缓存进行信息共享的系统，方法和计算机产品。示例性实施例包括一种方法，包括从节点A中的节点X接收搜索查询历史，提取节点A的索引的特征，搜索提取的特征，其包括包括在节点A的索引中的文件ID 响应于确定所述节点A包括至少一个附加本地metaindex，从所述节点A中的节点X搜索所述至少一个附加元数据与所述搜索查询历史，将元数据信息添加到所述节点A的索引，并且将搜索结果与节点A的metaindex合并，其中合并到节点A的metaindex的一个附加metaindex包括获取路径，并将节点A的metaindex发送到节点X.

5. 发明申请

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.
摘要翻译：本发明的系统存储：从各文本的标识指定文本中包含的关键字的列表的第一索引; 第二索引，其指定包含来自各个关键词的标识的关键字的文本的列表; 以及包含各个关键字的文本数量。然后，在接收到文本搜索条件的输入时，系统通过第一索引计算搜索时间的估计和通过第二索引的搜索时间的估计，并且确定第一和第二索引中哪一个使得搜索更快。然后，通过使用确定的索引更快地进行搜索，系统搜索出现在满足文本搜索条件的文本中的较高频率的关键字。

6. 发明授权

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。

7. 发明授权

US08856183B2 Database access using partitioned data areas 有权
标题翻译：使用分区数据区访问数据库
公开(公告)号：US08856183B2
公开(公告)日：2014-10-07
申请号：US12613764
申请日：2009-11-06
申请人： Kaoru Shinkawa , Issei Yoshida
发明人： Kaoru Shinkawa , Issei Yoshida
IPC分类号： G06F17/30 , G06F15/16
CPC分类号： G06F17/30312 , G06F17/2705 , G06F17/30584 , G06F17/30923
摘要： To provide an information processing apparatus, a database system, an information processing method, and a program which ensure efficient database accesses by partitioning. The apparatus includes a partition generating unit (222) which generates a value partition in which a unit subtree including target data to be partitioned is separated and registered according to the target data, and a base partition which includes an index for uniquely identifying the unit subtree, an XML parser (224) which identifies positions of a start tag and an end tag defining an attribute value of the structured document and generates a cutting position list corresponding to the hierarchical structure of the attribute value for registration in a storage area, an XML cutting unit (226) which identifies the start tag position and the end tag position of the unit subtree to be cut, and separates the unit subtree and its index from the structured document, and a cut-XML registration unit which registers the unit subtree and the index in the separate partitions.
摘要翻译：提供一种信息处理装置，数据库系统，信息处理方法以及通过划分确保有效的数据库访问的程序。该装置包括一个分区生成单元，用于根据目标数据生成包含要分割的目标数据的单元子树的单位子树的值分区，以及包括用于唯一地识别单位子树的索引的基本分区，XML解析器（224），其识别开始标签的位置和定义结构化文档的属性值的结束标签的位置，并且生成与用于在存储区域中注册的属性值的分层结构对应的切割位置列表，XML 切割单元（226），其识别要切割的单位子树的开始标签位置和结束标签位置，并且将单位子树及其索引与结构化文档分离;以及剪切XML注册单元，其将单元子树和在独立分区中的索引。

8. 发明授权

US08095652B2 Analysis system, information processing apparatus, activity analysis method and program product 有权
标题翻译：分析系统，信息处理设备，活动分析方法和程序产品
公开(公告)号：US08095652B2
公开(公告)日：2012-01-10
申请号：US12395031
申请日：2009-02-27
申请人： Raymond Harry Putra Rudy , Akiko Suzuki , Hiroki Yanagisawa , Issei Yoshida
发明人： Raymond Harry Putra Rudy , Akiko Suzuki , Hiroki Yanagisawa , Issei Yoshida
IPC分类号： G06F15/173 , G06F15/16
CPC分类号： H04L67/1095 , G06F17/30867 , H04L67/22 , H04L67/306
摘要： An analysis system, information processing apparatus, activity analysis method, and program for analyzing activities of an information source on a network. The system and apparatus include an attribute extraction block for extracting, an information propagation graph acquisition block for searching action history data, and a characteristic user calculation block for calculating an amount characteristic. The method and program product include the steps of extracting an information characteristic value, searching action history data, registering the information, calculating an amount characteristic, and integrating the amount characteristic.
摘要翻译：用于分析网络上的信息源的活动的分析系统，信息处理装置，活动分析方法和程序。该系统和装置包括用于提取用于搜索动作历史数据的信息传播图形获取块和用于计算量特征的特征用户计算块的属性提取块。该方法和程序产品包括提取信息特征值，搜索动作历史数据，登记信息，计算量特征以及积分量特征的步骤。

9. 发明申请

US20100138442A1 DATABASE ACCESS USING PARTITIONED DATA AREAS 有权
标题翻译：使用分区数据区进行数据库访问
公开(公告)号：US20100138442A1
公开(公告)日：2010-06-03
申请号：US12613764
申请日：2009-11-06
申请人： Kaoru Shinkawa , Issei Yoshida
发明人： Kaoru Shinkawa , Issei Yoshida
IPC分类号： G06F17/30 , G06F17/00
CPC分类号： G06F17/30312 , G06F17/2705 , G06F17/30584 , G06F17/30923
摘要： To provide an information processing apparatus, a database system, an information processing method, and a program which ensure efficient database accesses by partitioning. The apparatus includes a partition generating unit (222) which generates a value partition in which a unit subtree including target data to be partitioned is separated and registered according to the target data, and a base partition which includes an index for uniquely identifying the unit subtree, an XML parser (224) which identifies positions of a start tag and an end tag defining an attribute value of the structured document and generates a cutting position list corresponding to the hierarchical structure of the attribute value for registration in a storage area, an XML cutting unit (226) which identifies the start tag position and the end tag position of the unit subtree to be cut, and separates the unit subtree and its index from the structured document, and a cut-XML registration unit which registers the unit subtree and the index in the separate partitions.
摘要翻译：提供一种信息处理装置，数据库系统，信息处理方法以及通过划分确保有效的数据库访问的程序。该装置包括一个分区生成单元，用于根据目标数据生成包含要分割的目标数据的单元子树的单位子树的值分区，以及包括用于唯一地识别单位子树的索引的基本分区，XML解析器（224），其识别开始标签的位置和定义结构化文档的属性值的结束标签的位置，并且生成与用于在存储区域中注册的属性值的分层结构对应的切割位置列表，XML 切割单元（226），其识别要切割的单位子树的开始标签位置和结束标签位置，并且将单位子树及其索引与结构化文档分离;以及剪切XML注册单元，其将单元子树和在独立分区中的索引。

10. 发明申请

US20090307214A1 COMPUTER SYSTEM FOR PERFORMING AGGREGATION OF TREE-STRUCTURED DATA, AND METHOD AND COMPUTER PROGRAM PRODUCT THEREFOR 失效
标题翻译：用于执行树结构化数据聚合的计算机系统及其方法和计算机程序产品
公开(公告)号：US20090307214A1
公开(公告)日：2009-12-10
申请号：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。

你已经成功收藏专利！

检索式保存成功!

IPRDB

热门服务

关于我们

友情链接

联系方式