Patents by Inventor Svetlana Levitan
Svetlana Levitan 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).
-
Publication number: 20200327187Abstract: Estimating a Bayes factor is provided. Table dimensions of a contingency table are determined. A statistical model type to apply to the contingency table is determined. Fixed marginal totals are specified for either rows or columns when a Multinomial sampling model is applied. A table total is computed when a Poisson sampling model is applied or fixed marginal totals are computed when the Multinomial sampling model is applied to a two by two contingency table. The table total is compared to a first threshold when the Poisson sampling model is applied or fixed marginal totals are compared to a second threshold when the Multinomial sampling model is applied to a two by two contingency table. An estimation method is selected to apply to the contingency table to compute the Bayes factor based on table dimensions, sampling model applied, and fixed marginal totals of the contingency table.Type: ApplicationFiled: April 10, 2019Publication date: October 15, 2020Inventors: Yingda Jiang, Svetlana Levitan
-
Patent number: 10467236Abstract: In each iteration of the process of mining association rules from transaction data by a cluster of computing systems, each mapper node in the cluster receives a split of the transaction data. Each mapper node scans the split to count an absolute support value of each candidate itemset for current search level(s), and passes the candidate itemsets and their support values to reducer nodes in the cluster. The number of reducer nodes will be determined adaptively based on the number of the candidate itemsets and the number of maximum available resource nodes in the cluster. Each reducer node combines the absolute support value of each candidate itemset, and finds frequent itemsets among them using a minimum support threshold. For each frequent itemset it finds, the reducer node creates association rule(s) satisfying a minimum confidence threshold, and exports all discovered frequent itemsets and association rules to a file system for storage.Type: GrantFiled: September 29, 2014Date of Patent: November 5, 2019Assignee: International Business Machines CorporationInventors: Svetlana Levitan, Dong Liang
-
Patent number: 10185752Abstract: In each iteration of the process of mining association rules from transaction data by a cluster of computing systems, each mapper node in the cluster receives a split of the transaction data. Each mapper node scans the split to count an absolute support value of each candidate itemset for current search level(s), and passes the candidate itemsets and their support values to reducer nodes in the cluster. The number of reducer nodes will be determined adaptively based on the number of the candidate itemsets and the number of maximum available resource nodes in the cluster. Each reducer node combines the absolute support value of each candidate itemset, and finds frequent itemsets among them using a minimum support threshold. For each frequent itemset it finds, the reducer node creates association rule(s) satisfying a minimum confidence threshold, and exports all discovered frequent itemsets and association rules to a file system for storage.Type: GrantFiled: April 24, 2015Date of Patent: January 22, 2019Assignee: International Business Machines CorporationInventors: Svetlana Levitan, Dong Liang
-
Patent number: 10042912Abstract: One or more processors initiate cluster feature (CF)-tree based hierarchical clustering on leaf entries of CF-trees included in a plurality of subsets. One or more processors, generate respective partial clustering solutions for the subsets. A partial clustering solution includes a set of regular sub-clusters and candidate outlier sub-clusters. One or more processors generate initial regular clusters by performing hierarchical clustering using the regular sub-clusters. For a candidate outlier sub-cluster, one or more processors determine a closest initial regular cluster, and a distance separating the candidate outlier sub-cluster and the closest initial regular cluster. One or more processors determine which candidate outlier sub-clusters are outlier clusters based on which candidate outlier sub-clusters have a computed distance to their respective closest initial regular cluster that is greater than a corresponding distance threshold associated with their respective closest initial regular cluster.Type: GrantFiled: November 25, 2014Date of Patent: August 7, 2018Assignee: International Business Machines CorporationInventors: Svetlana Levitan, Jing-Yun Shyr, Damir Spisic, Jing Xu
-
Patent number: 9916344Abstract: Embodiments of the present invention provide efficient systems and methods for processing large data sets using a composite function. Embodiments of the present invention can be used to compute a broad range of composite functions in a single map-reduce job. Each mapper computes an additive function G on a set of specified data partitions, and then passes the results to one or more reducers. The one or more reducers can then compute a function F, using the aggregate results of function G and data from a single partition.Type: GrantFiled: January 4, 2016Date of Patent: March 13, 2018Assignee: International Business Machines CorporationInventors: Svetlana Levitan, Damir Spisic
-
Publication number: 20170193030Abstract: Embodiments of the present invention provide efficient systems and methods for processing large data sets using a composite function. Embodiments of the present invention can be used to compute a broad range of composite functions in a single map-reduce job. Each mapper computes an additive function G on a set of specified data partitions, and then passes the results to one or more reducers. The one or more reducers can then compute a function F, using the aggregate results of function G and data from a single partition.Type: ApplicationFiled: January 4, 2016Publication date: July 6, 2017Inventors: Svetlana Levitan, Damir Spisic
-
Patent number: 9589045Abstract: One or more processors initiate cluster feature (CF)-tree based hierarchical clustering on leaf entries of CF-trees included in a plurality of subsets. One or more processors, generate respective partial clustering solutions for the subsets. A partial clustering solution includes a set of regular sub-clusters and candidate outlier sub-clusters. One or more processors generate initial regular clusters by performing hierarchical clustering using the regular sub-clusters. For a candidate outlier sub-cluster, one or more processors determine a closest initial regular cluster, and a distance separating the candidate outlier sub-cluster and the closest initial regular cluster. One or more processors determine which candidate outlier sub-clusters are outlier clusters based on which candidate outlier sub-clusters have a computed distance to their respective closest initial regular cluster that is greater than a corresponding distance threshold associated with their respective closest initial regular cluster.Type: GrantFiled: April 8, 2014Date of Patent: March 7, 2017Assignee: International Business Machines CorporationInventors: Svetlana Levitan, Jing-Yun Shyr, Damir Spisic, Jing Xu
-
Publication number: 20160092514Abstract: In each iteration of the process of mining association rules from transaction data by a cluster of computing systems, each mapper node in the cluster receives a split of the transaction data. Each mapper node scans the split to count an absolute support value of each candidate itemset for current search level(s), and passes the candidate itemsets and their support values to reducer nodes in the cluster. The number of reducer nodes will be determined adaptively based on the number of the candidate itemsets and the number of maximum available resource nodes in the cluster. Each reducer node combines the absolute support value of each candidate itemset, and finds frequent itemsets among them using a minimum support threshold. For each frequent itemset it finds, the reducer node creates association rule(s) satisfying a minimum confidence threshold, and exports all discovered frequent itemsets and association rules to a file system for storage.Type: ApplicationFiled: September 29, 2014Publication date: March 31, 2016Inventors: Svetlana LEVITAN, Dong LIANG
-
Publication number: 20160092515Abstract: In each iteration of the process of mining association rules from transaction data by a cluster of computing systems, each mapper node in the cluster receives a split of the transaction data. Each mapper node scans the split to count an absolute support value of each candidate itemset for current search level(s), and passes the candidate itemsets and their support values to reducer nodes in the cluster. The number of reducer nodes will be determined adaptively based on the number of the candidate itemsets and the number of maximum available resource nodes in the cluster. Each reducer node combines the absolute support value of each candidate itemset, and finds frequent itemsets among them using a minimum support threshold. For each frequent itemset it finds, the reducer node creates association rule(s) satisfying a minimum confidence threshold, and exports all discovered frequent itemsets and association rules to a file system for storage.Type: ApplicationFiled: April 24, 2015Publication date: March 31, 2016Inventors: Svetlana LEVITAN, Dong LIANG
-
Publication number: 20150286707Abstract: One or more processors initiate cluster feature (CF)-tree based hierarchical clustering on leaf entries of CF-trees included in a plurality of subsets. One or more processors, generate respective partial clustering solutions for the subsets. A partial clustering solution includes a set of regular sub-clusters and candidate outlier sub-clusters. One or more processors generate initial regular clusters by performing hierarchical clustering using the regular sub-clusters. For a candidate outlier sub-cluster, one or more processors determine a closest initial regular cluster, and a distance separating the candidate outlier sub-cluster and the closest initial regular cluster. One or more processors determine which candidate outlier sub-clusters are outlier clusters based on which candidate outlier sub-clusters have a computed distance to their respective closest initial regular cluster that is greater than a corresponding distance threshold associated with their respective closest initial regular cluster.Type: ApplicationFiled: April 8, 2014Publication date: October 8, 2015Applicant: International Business Machines CorporationInventors: Svetlana Levitan, Jing-Yun Shyr, Damir Spisic, Jing Xu
-
Publication number: 20150286703Abstract: One or more processors initiate cluster feature (CF)-tree based hierarchical clustering on leaf entries of CF-trees included in a plurality of subsets. One or more processors, generate respective partial clustering solutions for the subsets. A partial clustering solution includes a set of regular sub-clusters and candidate outlier sub-clusters. One or more processors generate initial regular clusters by performing hierarchical clustering using the regular sub-clusters. For a candidate outlier sub-cluster, one or more processors determine a closest initial regular cluster, and a distance separating the candidate outlier sub-cluster and the closest initial regular cluster. One or more processors determine which candidate outlier sub-clusters are outlier clusters based on which candidate outlier sub-clusters have a computed distance to their respective closest initial regular cluster that is greater than a corresponding distance threshold associated with their respective closest initial regular cluster.Type: ApplicationFiled: November 25, 2014Publication date: October 8, 2015Inventors: Svetlana Levitan, Jing-Yun Shyr, Damir Spisic, Jing Xu