Hewlett-packard Development Company, L.p.

Micro Focus Lcc

Hewlett Packard Enterprise Development LP

Open Text Corporation

Teradata Us, Inc.

Choudur K Lakshminarayan

Jose Carlos Principe

Ramakumar Kosuru

QiFan Chen

Evan Kriminger

Alexander Singh Alvarado

Krishnamurthy Viswanathan

Roger Khemraj Brooks

Erin M Burgoon

Edward E Cullen

Vanish Talwar

Hansjorg Zeller

Chengwei Wang

Qingfeng Yu

Alan Benson

Ram Kosuru

Chetan Kumar Gupta

Vinay K Deolalikar

Awny Kayed Al-Omari

Abhay Mehta

Song Wang

Wade James Satterfield

Hernan Laffitte

Joe R Hill

Michael Heytens

Thiagarajan Ramakrishnan

According to an example, a model is selected from models including an augmented buyer model based on probabilities of conceivable transitions, and each conceivable transition includes a multi-step transition between a first URL and a second URL via at least one intermediate URL of the website. A user is determined to likely be a buyer or a non-buyer based on interaction data and the selected model. The user is presented with an offer that encourages the user to buy from the website upon the determination that the user is a buyer.

Method and non-transitory computer readable medium for models based on data augmented with conceivable transitions

A method is provided in accordance with an aspect of the present disclosure. The method includes processing data related to a group of contacts, where the data includes at least one attribute related to each of the contacts. The method also includes defining the at least one attribute based on a probability distribution of a context in relation to attribute values of the at least one attribute for all contacts. The method further includes determining clusters of contacts based on the probability distribution of the context in relation to the attribute values of the at least one attribute for all contacts, and constructing a plurality of segments of similar contacts by using the clusters.

Segments of contacts

System and apparatus for models based on data augmented with conceivable transitions

Improved techniques for processing large-scale data and various large-scale data applications (e.g., large-scale Data Mining (DM), large-scale data analysis (LSDA)) in computing systems (e.g., Data Information Systems, Database Systems) are disclosed. Redundancy-reduced data (RRDS) can be provided as data that can be used more efficiently by various applications, especially, large-scale data applications. In doing so, at least one assumption about the distribution of a multi-dimensional data set (MDDS) and its corresponding set of responses (Y) can be made in order to reduce the multi-dimensional data set (MDDS). For example, a normal distribution (e.g., bell-shape, symmetric) can be assumed and Mutual information of the combination of a multi-dimensional set (X) and its corresponding responses (Y) can be optimized, for example, by using linear transformations, iterative numerical procedures, one or more constraints associated with the at least one assumption, and using one or more Lagrange multipliers to provide a constraint optimization function.

Data reduction in multi-dimensional computing systems including information systems

A technique includes determining a statistic for values associated with at least one column of a database based at least in part on a first sample of the values; and determining a degree of change in a second sample of the values relative to the first sample; and estimating a count of unique values for the column(s). The estimation of the count of unique values includes selectively incrementally updating the statistic using the second sample based at least in part on the determined degree of change; and basing estimation of the count at least in part on the updated statistic. The technique further includes processing a query to the database based at least in part on the count.

Incrementally updating a database statistic

A method of managing a database including creating an initial counting bloom filter (CBF) instance having an array of counters and hash functions that map an inserted value to the array of counters, and designating the initial CBF instance as a current CBF instance, and sequentially inserting each value of a sample data set of a table column into the hash functions of the current CBF instance and incrementing counters of the array of counters to which the value is mapped. The method further includes, prior to inserting each value into the hash functions of the current CBF instance, when a number of counters of the array of counters having non-zero values is at least at a threshold level, designating the current CBF instance as an old CBF instance, creating a new CBF instance having an array of counters and hash functions that map an inserted value to the array counters, and designating the new CBF instance as the current CBF instance.

Managing database with counting bloom filters

Incrementally updating statistics includes sampling rows from a database column in a database to generate a first sample, sampling a subset of modified rows from the database column after generating the first sample to generate a second sample, determining whether distribution changes occurred to the database column based on the first and second samples, and updating a database statistic about the database column in response to determining that a distribution change exists.

Incrementally updating statistics

In a method for generating a query plan for estimating a number of unique entry counts of an attribute in a database, a sample of entries in the database is identified, at least one of a sampling percent and a coefficient of variance of the entries in the sample is identified, and a skewness of the entries in the sample is calculated. In addition, at least one of a plurality of estimators is selected based upon the skewness of the entries and at least one of the sampling percent and the coefficient of variance of the entries in the sample. Moreover, a query plan is generated from the selected at least one of the plurality of estimators. A query optimizer for performing the method is provided.

Generating a query plan for estimating a number of unique attributes in a database

A method of estimating a number of unique entry counts of an attribute in a database comprises, with a processor: identifying a sample of entries from an attribute database, determining frequencies of a number of input observations of the sample of entries, determining a number of high frequency values of the sample of entries, and estimating a number of unique entry counts of an attribute within the attribute database using a counting Bloom filter and based on the frequencies of the input observations and the high frequency values.

Estimating unique entry counts using a counting bloom filter

An example method for anomaly detection in streaming data includes applying statistical analysis to streaming data in a sliding window. The method also includes extracting a feature. The method also includes determining class assignment for the feature using class conditional probability densities and a threshold.

Anomaly detection in streaming data

A method determines a number of unique values in a sample of a list of values and estimates a number of the unique values for an unsampled portion of the list of values. The method estimates a number of the unique values in the list by adding the number of unique values in the sample to the number of the unique values in the unsampled portion.

Estimating a number of unique values in a list

Probable anomalies associated with at least one data metric may be detected across a series of windows of time series data by comparison of data to a threshold. An estimated probability of anomalies for each of the windows of time series data may be determined based on the detected probable anomalies and the threshold. The windows of time series data may be ranked based on the estimated probabilities. Probable anomalies associated with highest ranked windows of time series data may be output to a user.

System and method for ranking anomalies

Regime change in streaming data is detected. The streaming data is sent to a plurality of modules. Each module in the plurality of modules produces an association measure. The association measure is a measure of similarity between the streaming data and regime data associated with the module producing the association measure. A regime change in the streaming data is detected based on values of the association measures from the plurality of modules.

Growing community of inventors

Leander, TX, United States of America

Choudur K Lakshminarayan