-
1.
公开(公告)号:WO2004111873A3
公开(公告)日:2005-04-07
申请号:PCT/EP2004051029
申请日:2004-06-04
Applicant: IBM , IBM UK , AGRAWAL RAKESH , EVFIMIEVSKI ALEXANDRE VALENTIN , SRIKANT RAMAKRISHNAN
Inventor: AGRAWAL RAKESH , EVFIMIEVSKI ALEXANDRE VALENTIN , SRIKANT RAMAKRISHNAN
CPC classification number: G06F21/6227 , G06F17/30545 , Y10S707/99933
Abstract: A system, method, and computer program product for processing a query spanning separate databases while revealing only minimal information beyond a query answer, by executing only specific information-limiting protocols according to query type.
Abstract translation: 一种系统,方法和计算机程序产品,用于通过仅查询特定的信息限制协议根据查询类型来处理跨越单独数据库的查询,同时仅显示超出查询答案的最小信息。
-
2.
公开(公告)号:WO03091828A2
公开(公告)日:2003-11-06
申请号:PCT/GB0301482
申请日:2003-04-09
Inventor: AGRAWAL RAKESH , SRIKANT RAMAKRISHNAN
CPC classification number: G06F17/30864 , Y10S707/99933 , Y10S707/99937
Abstract: A system and method for using numbers to query a corpus of documents, particularly but not exclusively for data spaces that have low reflectivity, i.e., for a point xi described by one or more numbers, the data space does not contain very many permutations of the numbers. For each document to be searched, each query number is matched with one and only one document number preferably using a bipartite graph or heuristic rule such that a distance function is minimised. The distance function can, but not must, take into account attribute names and unit names. A limiting algorithm can be used to limit the number of documents that must be searched.
Abstract translation: 一种用于使用数字查询文档语料库的系统和方法,特别是但不排他地用于具有低反射率的数据空间,即对于由一个或多个数字描述的点xi,数据空间不包含非常多的排列 数字。 对于要搜索的每个文档,每个查询号码与仅一个文档号码匹配,优选地使用二分图或启发式规则,使得距离函数被最小化。 距离函数可以但不一定要考虑属性名称和单位名称。 限制算法可用于限制必须搜索的文档数量。
-
公开(公告)号:DE60307454T2
公开(公告)日:2007-08-16
申请号:DE60307454
申请日:2003-05-14
Applicant: IBM
Inventor: AGRAWAL RAKESH , KIERNAN GEORGE
Abstract: A method and system for enhancing security in a database by establishing a bit pattern using secret information, the pattern establishing a watermark that can be detected in a copy (authorized or not) of the database only by using the secret information.
-
公开(公告)号:AU2003222598A8
公开(公告)日:2003-11-10
申请号:AU2003222598
申请日:2003-04-09
Applicant: IBM
Inventor: AGRAWAL RAKESH , SRIKANT RAMAKRISHNAN
IPC: G06F17/30
-
公开(公告)号:DE69614309D1
公开(公告)日:2001-09-13
申请号:DE69614309
申请日:1996-04-23
Applicant: IBM
Inventor: AGRAWAL RAKESH , SRIKANT RAMAKRISHNAN
Abstract: A system and method for discovering consumer purchasing tendencies includes a computer-implemented program which identifies consumer transaction itemsets that are stored in a database and which appear in the database a user-defined minimum number of times, referred to as minimum support. The itemsets contain items that are characterized by a hierarchical taxonomy. Then, the system discovers association rules, potentially across different levels of the taxonomy, in the itemsets by comparing the number of times each of the large itemsets appears in the database to the number of times particular subsets of the itemset appear in the database. When the relationship exceeds a predetermined minimum confidence value, the system outputs a generalized association rule which is representative of purchasing tendencies of consumers. The set of generalized association rules can be pruned of uninteresting rules, i.e., association rules which do not occur at a frequency that is significantly different than what is expected based upon the frequency of occurrence of the rule's ancestors.
-
公开(公告)号:BR0310002A
公开(公告)日:2005-02-15
申请号:BR0310002
申请日:2003-05-14
Applicant: IBM
Inventor: AGRAWAL RAKESH , KIERNAN GERALD GEORGE
Abstract: A method and system for enhancing security in a database by establishing a bit pattern using secret information, the pattern establishing a watermark that can be detected in a copy (authorized or not) of the database only by using the secret information.
-
公开(公告)号:DE69621670D1
公开(公告)日:2002-07-18
申请号:DE69621670
申请日:1996-03-01
Applicant: IBM
Inventor: AGRAWAL RAKESH , SRIKANT RAMAKRISHNAN
Abstract: A system and method for mining databases includes a computer-implemented program which identifies patterns of transaction sequences that are stored in a database and which recur in the database with a user-defined regularity. The invention first identifies which sequences are large, i.e., which recur with the defined regularity, and then determines which sequences are maximal, i.e., which large sequences are not subsets of other large sequences. The set of maximal large sequences is returned to the user to indicate recurring purchasing patterns over time.
-
公开(公告)号:DE69614309T2
公开(公告)日:2002-04-25
申请号:DE69614309
申请日:1996-04-23
Applicant: IBM
Inventor: AGRAWAL RAKESH , SRIKANT RAMAKRISHNAN
Abstract: A system and method for discovering consumer purchasing tendencies includes a computer-implemented program which identifies consumer transaction itemsets that are stored in a database and which appear in the database a user-defined minimum number of times, referred to as minimum support. The itemsets contain items that are characterized by a hierarchical taxonomy. Then, the system discovers association rules, potentially across different levels of the taxonomy, in the itemsets by comparing the number of times each of the large itemsets appears in the database to the number of times particular subsets of the itemset appear in the database. When the relationship exceeds a predetermined minimum confidence value, the system outputs a generalized association rule which is representative of purchasing tendencies of consumers. The set of generalized association rules can be pruned of uninteresting rules, i.e., association rules which do not occur at a frequency that is significantly different than what is expected based upon the frequency of occurrence of the rule's ancestors.
-
公开(公告)号:DE69606794T2
公开(公告)日:2000-09-07
申请号:DE69606794
申请日:1996-04-24
Applicant: IBM
Inventor: AGRAWAL RAKESH , LIN KING-IP , SAWHNEY HARPREET SINGH , SHIM KYUSEOK
Abstract: 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.
-
公开(公告)号:DE69811790T2
公开(公告)日:2003-11-20
申请号:DE69811790
申请日:1998-06-22
Applicant: IBM
Inventor: AGRAWAL RAKESH , LEYMANN DR , ROLLER DIETER
-
-
-
-
-
-
-
-
-