Patents by Inventor Leman Akoglu
Leman Akoglu has filed for patents to protect the following inventions. This listing includes patent applications that are pending as well as patents that have already been granted by the United States Patent and Trademark Office (USPTO).
-
Patent number: 10140357Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.Type: GrantFiled: November 11, 2016Date of Patent: November 27, 2018Assignee: International Business Machines CorporationInventors: Leman Akoglu, Hanghang Tong
-
Patent number: 9589046Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.Type: GrantFiled: February 3, 2016Date of Patent: March 7, 2017Assignee: International Business Machines CorporationInventors: Leman Akoglu, Hanghang Tong
-
Publication number: 20170060956Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.Type: ApplicationFiled: November 11, 2016Publication date: March 2, 2017Inventors: Leman Akoglu, Hanghang Tong
-
Publication number: 20160154877Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.Type: ApplicationFiled: February 3, 2016Publication date: June 2, 2016Inventors: Leman Akoglu, Hanghang Tong
-
Patent number: 9292690Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.Type: GrantFiled: June 15, 2012Date of Patent: March 22, 2016Assignee: International Business Machines CorporationInventors: Leman Akoglu, Hanghang Tong
-
Patent number: 9171158Abstract: Techniques are provided for dynamic anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data containing one or more attributes. One or more clusters associated with one or more of the code tables are established. One or more new data points are received. A determination is made if a given one of the new data points is an anomaly. At least one of the one or more code tables is updated responsive to the determination. When a compression cost of a given one of the new data points is greater than a threshold compression cost for each of the one or more clusters, the given one of the new data points is an anomaly.Type: GrantFiled: June 15, 2012Date of Patent: October 27, 2015Assignee: International Business Machines CorporationInventors: Leman Akoglu, Hanghang Tong
-
Patent number: 8903824Abstract: A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.Type: GrantFiled: December 9, 2011Date of Patent: December 2, 2014Assignee: International Business Machines CorporationInventors: Leman Akoglu, Rohit M. Khandekar, Vibhore Kumar, Srinivasan Parthasarathy, Deepak Rajan, Kun-Lung Wu
-
Publication number: 20140074796Abstract: Techniques are provided for dynamic anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data containing one or more attributes. One or more clusters associated with one or more of the code tables are established. One or more new data points are received. A determination is made if a given one of the new data points is an anomaly. At least one of the one or more code tables is updated responsive to the determination. When a compression cost of a given one of the new data points is greater than a threshold compression cost for each of the one or more clusters, the given one of the new data points is an anomaly.Type: ApplicationFiled: June 15, 2012Publication date: March 13, 2014Applicant: International Business Machines CorporationInventors: Leman Akoglu, Hanghang Tong
-
Publication number: 20140074838Abstract: Techniques are provided for anomaly, association and clustering detection. At least one code table is built for each attribute in a set of data. A first code table corresponding to a first attribute and a second code table corresponding to a second attribute are selected. The first code table and the second code table are merged into a merged code table, and a determination is made to accept or reject the merged code table. An anomaly is detected when a total compression cost for a data point is greater than a threshold compression cost inferred from one or more code tables. An association in a data table is detected by merging attribute groups, splitting data groups, and assigning data points to data groups. A cluster is inferred from a matrix of data and code words for each of the one or more code tables.Type: ApplicationFiled: June 15, 2012Publication date: March 13, 2014Applicant: International Business Machines CorporationInventors: Leman Akoglu, Hanghang Tong
-
Publication number: 20130151536Abstract: A method, an apparatus and an article of manufacture for processing a random-walk based vertex-proximity query on a graph. The method includes computing at least one vertex cluster and corresponding meta-information from a graph, dynamically updating the clustering and corresponding meta-information upon modification of the graph, and identifying a vertex cluster relevant to at least one query vertex and aggregating corresponding meta-information of the cluster to process the query.Type: ApplicationFiled: December 9, 2011Publication date: June 13, 2013Applicant: INTERNATIONAL BUSINESS MACHINES CORPORATIONInventors: Leman Akoglu, Rohit M. Khandekar, Vibhore Kumar, Srinivasan Parthasarathy, Deepak Rajan, Kun-Lung Wu