公开(公告)号：US5930789A

公开(公告)日：1999-07-27

申请号：US920031

申请日：1997-08-28

申请人： Rakesh Agrawal ,  King-Ip Lin ,  Harpreet Singh Sawhney ,  Kyuseok Shim

发明人： Rakesh Agrawal ,  King-Ip Lin ,  Harpreet Singh Sawhney ,  Kyuseok Shim

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30548 ,  G06F17/30551 ,  G06F2216/03 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A system and method for discovering similar time sequences in a database of time sequences includes a computer-implemented program which first breaks each sequence into small windows. The windows from the first sequence are compared to selected windows from the second sequence to determine which windows are similar. Pairs of similar windows are then stitched together when certain stitching constraints are met to establish pairs of similar subsequences. Likewise, pairs of similar subsequences are stitched together, and the lengths of the stitched subsequences are then compared to the overall length of the time sequences to determine whether the time sequences meet a similarity criteria.

摘要翻译： 用于在时间序列数据库中发现类似时间序列的系统和方法包括计算机实现的程序，其首先将每个序列分解成小窗口。 将来自第一序列的窗口与来自第二序列的所选窗口进行比较，以确定哪些窗口相似。 然后，当满足某些缝合约束以建立相似的子序列对时，将对的相似的窗口缝合在一起。 类似地，将相似的子序列对拼接在一起，然后将缝合子序列的长度与时间序列的总长度进行比较，以确定时间序列是否满足相似性标准。

公开(公告)号：US5664174A

公开(公告)日：1997-09-02

申请号：US437746

申请日：1995-05-09

申请人： Rakesh Agrawal ,  King-Ip Lin ,  Harpreet Singh Sawhney ,  Kyuseok Shim

发明人： Rakesh Agrawal ,  King-Ip Lin ,  Harpreet Singh Sawhney ,  Kyuseok Shim

IPC分类号： G06F12/00 ,  G06F17/30

CPC分类号： G06F17/30548 ,  G06F17/30551 ,  G06F2216/03 ,  Y10S707/99931 ,  Y10S707/99933 ,  Y10S707/99935 ,  Y10S707/99936

摘要： A system and method for discovering similar time sequences in a database of time sequences includes a computer-implemented program which first breaks each sequence into small windows. The windows from the first sequence are compared to selected windows from the second sequence to determine which windows are similar. Pairs of similar windows are then stitched together when certain stitching constraints are met to establish pairs of similar subsequences. Likewise, pairs of similar subsequences are stitched together, and the lengths of the stitched subsequences are then compared to the overall length of the time sequences to determine whether the time sequences meet a similarity criteria.

摘要翻译： 用于在时间序列数据库中发现类似时间序列的系统和方法包括计算机实现的程序，其首先将每个序列分解成小窗口。 将来自第一序列的窗口与来自第二序列的所选窗口进行比较，以确定哪些窗口相似。 然后，当满足某些缝合约束以建立相似的子序列对时，将对的相似的窗口缝合在一起。 类似地，将相似的子序列对拼接在一起，然后将缝合子序列的长度与时间序列的总长度进行比较，以确定时间序列是否满足相似性标准。

公开(公告)号：US5978794A

公开(公告)日：1999-11-02

申请号：US629688

申请日：1996-04-09

申请人： Rakesh Agrawal ,  Kyuseok Shim ,  Ramakrishnan Srikant

发明人： Rakesh Agrawal ,  Kyuseok Shim ,  Ramakrishnan Srikant

IPC分类号： G06F17/30 ,  G06F17/00

CPC分类号： G06F17/30327 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99942

摘要： A method and system are disclosed for performing spatial similarity joins on high-dimensional points that represent data objects of a database. The method comprises the steps of: generating a data structure based on the similarity distance .epsilon. for organizing the high-dimensional points, traversing the data structure to select pairs of leaf nodes from which the high-dimensional points are joined, and joining the points from selected pairs of nodes according to a joining condition based on the similarity distance .epsilon.. An efficient data structure referred to as an .epsilon.-K-D-B tree is disclosed to provide fast access to the high-dimensional points and to minimize system storage requirements. The invention provides algorithms for generating the .epsilon.-K-D-B tree using biased splitting to minimize the number of nodes to be examined during join operations. The traversing step includes joining selected pairs of nodes and also self-joining selected nodes. Alternatively, the data structure is an R+tree generated using biased splitting.

摘要翻译： 公开了用于在表示数据库的数据对象的高维点执行空间相似性连接的方法和系统。 该方法包括以下步骤：基于用于组织高维点的相似距离ε生成数据结构，遍历数据结构以选择从其连接高维点的叶节点对，以及从 根据基于相似距离ε的连接条件选择的节点对。 公开了称为eps-K-D-B树的有效数据结构，以提供对高维度点的快速访问并且最小化系统存储要求。 本发明提供了使用偏差分割来生成epsilon -K-D-B树的算法，以使在连接操作期间要检查的节点的数量最小化。 遍历步骤包括连接所选择的节点对以及自连接所选择的节点。 或者，数据结构是使用偏置分割生成的R +树。

公开(公告)号：US5734885A

公开(公告)日：1998-03-31

申请号：US518875

申请日：1995-08-24

申请人： Rakesh Agrawal ,  Kyuseok Shim

发明人： Rakesh Agrawal ,  Kyuseok Shim

IPC分类号： G06F17/30

CPC分类号： G06F17/3041 ,  G06F17/30483 ,  Y10S707/99933

摘要： An application program is tightly coupled to a relational database without changing the software of the database management system. A first user defined function (udf) allocates a work area in the address space of the database management system. Then, a second udf embodying the computational steps of the application program undertakes the computational steps within the dbms work area and saves the results in the work area. Importantly, the second udf does not return an answer to the application program during the processing of records, thereby eliminating copying costs and context switch costs. When processing is complete, the results are transmitted to the application program and the work area is released.

摘要翻译： 应用程序紧密耦合到关系数据库，而不改变数据库管理系统的软件。 第一个用户定义的函数（udf）在数据库管理系统的地址空间中分配一个工作区。 然后，体现应用程序的计算步骤的第二个udf承担dbms工作区域内的计算步骤，并将结果保存在工作区域。 重要的是，第二个udf在处理记录期间不会返回应用程序的答案，从而消除了复制成本和上下文切换成本。 处理完成后，将结果发送到应用程序，并释放工作区。

公开(公告)号：US20120259862A1

公开(公告)日：2012-10-11

申请号：US13273569

申请日：2011-10-14

申请人： Younghoon Kim ,  Hyoung Park ,  Kyuseok Shim ,  Kyoung-gu Woo

发明人： Younghoon Kim ,  Hyoung Park ,  Kyuseok Shim ,  Kyoung-gu Woo

IPC分类号： G06F17/30

CPC分类号： G06F17/30634

摘要： Provided are a method and apparatus for processing a query. The method includes generating string sets comprising a plurality of partial strings from a query string, determining a subset of the string sets as a candidate set, and searching for a document comprising the query string from the candidate set.

摘要翻译： 提供了一种用于处理查询的方法和装置。 该方法包括从查询字符串生成包括多个部分字符串的字符串集合，确定字符串集合的子集作为候选集合，以及从候选集合搜索包括查询字符串的文档。

公开(公告)号：US06751363B1

公开(公告)日：2004-06-15

申请号：US09371112

申请日：1999-08-10

申请人： Apostol Ivanov Natsev ,  Rajeev Rastogi ,  Kyuseok Shim

发明人： Apostol Ivanov Natsev ,  Rajeev Rastogi ,  Kyuseok Shim

IPC分类号： G06K954

CPC分类号： G06K9/522 ,  Y10S707/99933 ,  Y10S707/99934 ,  Y10S707/99936

摘要： Methods of imaging objects based on wavelet retrieval of scenes utilize wavelet transformation of plural defined regions of a query image. By increasing the granularity of the query image to greater than one region, accurate feature vectors are obtained that allow for robust extraction of corresponding regions from a database of target images. The methods further include the use of sliding windows to decompose the query and target images into regions, and the clustering of the regions utilizing a novel similarity metric that ensures robust image matching in low response times.

摘要翻译： 基于场景小波检索的物体成像方法利用查询图像的多个限定区域的小波变换。 通过将查询图像的粒度提高到大于一个区域，获得准确的特征向量，其允许从目标图像的数据库中鲁棒地提取对应的区域。 这些方法还包括使用滑动窗口将查询和目标图像分解成区域，以及利用新颖的相似性度量来聚类区域，以确保在低响应时间内稳健的图像匹配。

公开(公告)号：US06473757B1

公开(公告)日：2002-10-29

申请号：US09537082

申请日：2000-03-28

申请人： Minos N. Garofalakis ,  Rajeev Rastogi ,  Kyuseok Shim

发明人： Minos N. Garofalakis ,  Rajeev Rastogi ,  Kyuseok Shim

IPC分类号： G06F1730

CPC分类号： G06F17/30404 ,  G06F17/30539 ,  G06F17/30548 ,  G06F2216/03 ,  Y10S707/99936

摘要： The present invention provides a method and system for sequential pattern mining with a given constraint. A Regular Expression (RE) is used for identifying the family of interesting frequent patterns. A family of methods that enforce the RE constraint to different degrees within the generating and pruning of candidate patterns during the mining process is utilized. This is accomplished by employing different relaxations of the RE constraint in the mining loop. Those sequences which satisfy the given constraint are thus identified most expeditiously.

摘要翻译： 本发明提供了一种具有给定约束的顺序模式挖掘的方法和系统。 正则表达式（RE）用于识别有趣的频繁模式的家族。 利用在采矿过程中在候选模式的生成和修剪之内将RE约束强制到不同程度的一系列方法。 这是通过在采矿循环中采用RE约束的不同放松来实现的。 因此，最快地确定满足给定约束的那些序列。

公开(公告)号：US06185549B2

公开(公告)日：2001-02-06

申请号：US09069135

申请日：1998-04-29

申请人： Rajeev Rastogi ,  Kyuseok Shim

发明人： Rajeev Rastogi ,  Kyuseok Shim

IPC分类号： G06F1700

CPC分类号： G06F17/30539 ,  G06Q30/0201

摘要： An electronic data mining process for mining from an electronic data base using an electronic digital computer a listing of commercially useful information of the type known in the art as an association rule containing at least one uninstantiated condition. For example, the commercially useful information may be information useful for sales promotion, such as promotion of telephone usage. The computer retrieves from the database a plurality of stored parameters from which measures of the uninstatiated condition can be determined. The computer uses a dynamic programming algorithm and iterates over intervals or sub-ranges of the parameters to obtain what is called an at least partially optimized association rule, as optimized intervals or sub-ranges of at least some of the retrieved parameters, for example, time intervals of high usage of certain types of telephone connections. These optimized intervals are provided as the listed commercially useful information. The amount of needed iteration is reduced in some cases by using so-called bucketing and divide-and-conquer techniques. Extension of the process for a plurality of uninstantiated conditions is described.

摘要翻译： 一种用于使用电子数字计算机从电子数据库挖掘的电子数据挖掘过程，本领域已知的类型的商业上有用的信息的列表作为包含至少一个未发生状态的关联规则。 例如，商业上有用的信息可以是有助于促销的信息，例如促进电话使用。 计算机从数据库中检索多个存储的参数，从该信息可以确定不受损状态的测量。 计算机使用动态规划算法，并且遍历参数的间隔或子范围，以获得所谓的至少部分优化的关联规则，作为至少一些检索参数的优化间隔或子范围，例如， 某些类型的电话连接的高使用时间间隔。 这些优化的间隔作为列出的商业有用的信息提供。 在某些情况下，通过使用所谓的抗衡和分治技术来减少需要的迭代量。 描述了用于多个未示例的条件的处理的扩展。

公开(公告)号：US20100241622A1

公开(公告)日：2010-09-23

申请号：US12699122

申请日：2010-02-03

申请人： Hee Gyu JIN ,  Kyoung Gu Woo ,  Kyuseok Shim ,  Hyoungmin Park ,  Younghoon Kim

发明人： Hee Gyu JIN ,  Kyoung Gu Woo ,  Kyuseok Shim ,  Hyoungmin Park ,  Younghoon Kim

IPC分类号： G06F7/10 ,  G06F17/30

CPC分类号： G06F16/322

摘要： An n-gram based query processing apparatus and method are provided. A query processing is performed using only a portion of n-grams out of all n-grams with respect to the search key. A candidate set of documents having a possibility of including the search key is extracted using a posting list with respect to the portion of n-grams.

摘要翻译： 提供了一种基于n-gram的查询处理装置和方法。 使用相对于搜索关键字的所有n-gram中的n-gram的一部分执行查询处理。 使用关于n克的部分的发布列表提取具有包括搜索关键字的可能性的候选文本集合。

公开(公告)号：US06247016B1

公开(公告)日：2001-06-12

申请号：US09189257

申请日：1998-11-10

申请人： Rajeev Rastogi ,  Kyuseok Shim

发明人： Rajeev Rastogi ,  Kyuseok Shim

IPC分类号： G06F1730

CPC分类号： G06F17/30598 ,  G06K9/6282 ,  Y10S707/99942 ,  Y10S707/99943

摘要： A method of data classification using a decision tree having nodes is disclosed, along with an apparatus for perming the method. Periodically or after a certain number of nodes of the tree are split, the partially built tree is pruned. During the building phase the minimum cost of subtrees rooted at leaf nodes that can still be expanded (“yet to be expanded nodes”)is computed. With the computation of the minimum subtree cost at nodes, the nodes pruned are a subset of those that would have been pruned anyway during the pruning phase, and they are pruned while the tree is still being built.

摘要翻译： 公开了一种使用具有节点的决策树进行数据分类的方法，以及用于对该方法进行烫发的装置。 定期地或在树的一定数量的节点被分割之后，修剪部分构建的树。 在构建阶段，计算根植于仍然可扩展的叶节点（“尚未扩展节点”）的子树的最小成本。 通过计算节点的最小子树成本，修剪的节点是在修剪阶段将被修剪的节点的子集，并且在树仍在构建时它们被修剪。