Abstract: A processor may identify a plurality of data sets subject to upcoming update processing in a next update cycle. For each of the plurality of data sets, the processor may determine a probability that data included in the data set has changed since a most recent update processing. The processor may exclude a first subset of the plurality of data sets having respective probabilities below a threshold value from the upcoming update processing until the respective probabilities are determined again in a subsequent update cycle. The processor may perform the upcoming update processing on the plurality of the data sets not included in the first subset, where the upcoming update processing may include obtaining updated data from at least one external data source.

Abstract: Systems and methods are provided to structure event description data.

Abstract: A method and system that proactively generate alerts for updating a scraping script to avoid scraping script errors. A predetermined number of webpages targeted by the scraping script are randomly sampled. The scraping script is appended to each webpage in the sample. A structured list of text fragments across the webpages with the appended script is generated. At predetermined time intervals, a fresh set of webpages is sampled, the scraping script is appended to the webpages, and a new structured list is generated. If the new structured list and the previous structured list do not match, the webpages may have been changed and the scraping script may have to be updated. An alert is generated indicating that such update is required and may include a location of the mismatch. Therefore, scraping script errors are proactively detected and can be rectified before an actual error occurs and propagates.

Abstract: A method implements private categorization using shared keys. The method includes selecting an encryption key, encrypting a transaction vector, generated from a transaction record, with the encryption key to generate an encrypted transaction vector, and receiving an encrypted category vector generated by a classifier model, corresponding to the encryption key, from the encrypted transaction vector. The method further includes decrypting a category from the encrypted category vector with a decryption key corresponding to the encryption key and presenting the category.

Abstract: A method comprising generating, during multiple user sessions of a first user with a software application, first clickstream data from the multiple user sessions, and extracting, from the first clickstream data, a first plurality of task instances of the first user performing a first plurality of tasks. The method also includes decomposing, from the first clickstream data, each task instance of the first plurality of task instances into a first plurality of steps to obtain a first plurality of decomposed task instances. The first plurality of steps in the first plurality of decomposed task instances are each associated with a timestamp. The method further includes training a first user model with the first plurality of decomposed task instances to learn a user optimal order to perform the first plurality of tasks and presenting, to the first user, the user optimal order to perform the first plurality of tasks.

Abstract: Methods, computer systems and computer program product are provided for retrieving contextually relevant documents in near real time. When text data it's received from an application, the text data is processed through a text segmentation model to generate a set of documents. Each document corresponds to a segment of the text data. A first vector representation is generated for a first document of the set of documents. A machine learning process compares the first vector representation and a set of vector representations for a set of documents within a data repository to determine a subset of the documents. A composite rank is generated for each respective document of the subset. The subset of documents is then presented through an interface, sorted according to the respective composite ranks.

Abstract: A method comprising generating, during multiple user sessions of a first user with a software application, first clickstream data from the multiple user sessions, and extracting, from the first clickstream data, a first plurality of task instances of the first user performing a first plurality of tasks. The method also includes decomposing, from the first clickstream data, each task instance of the first plurality of task instances into a first plurality of steps to obtain a first plurality of decomposed task instances. The first plurality of steps in the first plurality of decomposed task instances are each associated with a timestamp. The method further includes training a first user model with the first plurality of decomposed task instances to learn a user optimal order to perform the first plurality of tasks and presenting, to the first user, the user optimal order to perform the first plurality of tasks.

Abstract: Described herein are example implementations for handling of phishing attempts. A system receives a request to perform an electronic transaction, with the request including information regarding a user account. The system generates one or more probabilities of the request being valid based on the request and processing of a plurality of electronic transactions associated with one or more user accounts, identifies whether the request is valid based on the one or more probabilities, and in response to identifying that the request is not valid, provides an indication that the request is not valid.

Abstract: Certain aspects of the present disclosure provide techniques for privacy preserving sharing and validation of sensitive information in a computing environment. An example method generally includes generating a hashed value of a sensitive data item. A set of modulo values is calculated for the hashed value of the first sensitive data item using a set of prime numbers between an upper bound number and a lower bound number. A request to validate the first sensitive data item is transmitted to a target computing system. The request includes the set of prime numbers and the set of modulo values. An indication of whether a match was found for each respective modulo value in the set of modulo values is received from the target computing system, and a request associated with the first sensitive data item is processed based on the indication.

Abstract: A method of zoning a transcription of audio data includes separating the transcription of audio data into a plurality of utterances. A that each word in an utterances is a meaning unit boundary is calculated. The utterance is split into two new utterances at a work with a maximum calculated probability. At least one of the two new utterances that is shorter than a maximum utterance threshold is identified as a meaning unit.

Abstract: A method may be used to predict a business' category by analyzing the business' vendors. A neural network architecture may be trained via supervised learning to predict categories for businesses based on listed vendors. The neural network may be used to classify uncategorized businesses within an accounting software database. A list of factors associated with a business' success may be generated by analyzing, aggregating and ranking factors determined to be relevant to a business based on its categorization. The factors associated with the business' success may be related to the products and/or services offered by the business and the format of which those products and/or services are offered by the business. The factors may also be related to the products and/or services purchased by the business from a vendor and the format of which those products and/or services are purchased from the vendor.

Abstract: Aspects of the present disclosure relate to electronic document creation assistance. Embodiments include determining a current time related to creation of a document by a user and providing inputs to a machine learning model based on the current time. Embodiments include receiving output from the machine learning model based on the inputs and selecting, based on the output, a first recommended item from a plurality of items for inclusion in the document. Embodiments include determining a likelihood of each additional item of the plurality of items co-occurring with the first recommended item based on historical item co-occurrence data. Embodiments include selecting, based on the output and the likelihood of each additional item of the plurality of items co-occurring with the first recommended item, a second recommended item for inclusion in the document and providing, via a user interface, the first recommended item and the second recommended item to the user.

Abstract: Certain aspects of the present disclosure provide techniques for training decision trees representing users of a software application. An example method generally includes generating, from a transaction history data set for a plurality of users of a software application, a plurality of grouped data sets including transactions grouped by counterparty. A plurality of feature vectors are generated from the plurality of grouped data sets. Each feature vector generally corresponds to a user of the plurality of users and includes a plurality of features describing relationships between the user and a plurality of counterparties in a transaction history associated with the user. A decision tree is trained based on the plurality of feature vectors. The decision tree generally includes a plurality of paths terminating in a similar or different classification, and the plurality of paths distinguishes a user associated with the decision tree from other users of the software application.

Abstract: Automatic keyphrase labeling and machine learning training may include a processor extracting a plurality of keywords from at least one search query that resulted in a selection of a document appearing in a search result. For each of the plurality of keywords, the processor may determine a probability that the keyword describes the document. The processor may generate one or more keyphrases by performing processing including selecting each of the plurality of keywords having a probability greater than a predetermined threshold value for insertion into at least one of the one or more keyphrases and assembling the one or more keyphrases from the selected plurality of keywords. The processor may label the document with the keyphrase.

Abstract: Techniques for detecting fraud may include obtaining a merchant's financial data; determining, via a machine learning model, a first prediction of the merchant's industry; generating a first probability matrix based on the first prediction and the declared information regarding the merchant's industry; determining, via the machine learning model, a second prediction of the merchant's industry; generating a second probability matrix based on the second prediction and the declared information regarding the merchant's industry; obtaining a declared industry of a subject merchant in a runtime environment; determining, via the machine learning model, a predicted industry for the subject merchant; obtaining, based on the declared industry and the predicted industry of the subject merchant, a first value from the first probability matrix and a second value from the second probability matrix; and labeling the subject merchant for further investigation.

Abstract: A system deploying a machine learning technique that utilizes known code graph and abstract syntax tree pairs for known JSON objects to learn a function for predicting a corresponding abstract syntax tree from a new JSON object. The predicted abstract syntax tree is used to generate code for formatting the new JSON object into a standardized data structure.

Abstract: Aspects of the present disclosure provide techniques for automated text amendment. Embodiments include identifying a first plurality of n-grams in first text associated with a domain. Embodiments include identifying a second plurality of n-grams in second text associated with the domain. Embodiments include identifying a third plurality of n-grams in third text that is not associated with the domain. Embodiments include determining candidate n-grams that are overexpressed in the second plurality of n-grams compared to the third plurality of n-grams. Embodiments include determining a match between a candidate n-gram of the candidate n-grams and a given n-gram of the first plurality of n-grams based on one or more matching factors. Embodiments include amending the first text based on the match between the candidate n-gram and the given n-gram.

Abstract: Systems and methods for matching entities to target objects using an ensemble model are disclosed. The ensemble model includes a general trained machine learning (ML) model (which is trained using the entirety of a training dataset) and a subarea trained ML model (which is trained using a subset of the training dataset corresponding to a specific, defined subarea) that provides potential matches to a meta-model of the ensemble model to generate a final match. The ensemble model may also include a general trained natural language processing (NLP) model and a subarea trained NLP model that provides potential matches to the meta-model. The meta-model of a quad-ensemble ML model combines the four potential matches (such as probabilities and similarities of matching specific pairs of targets objects and entities) to generate a final match (such as a final probability used to identify the final match).

Abstract: Systems and methods of optimizing cash flow are disclosed. A system obtains bill information regarding a plurality of bills and invoice information regarding a plurality of invoices, and the system pairs one or more bills to one or more invoices. Pairing the one or more bills includes, for each bill, generating one or more potential pairs of the bill to an invoice. For each potential pair, the system calculates a matching score associated with the potential pair based on the bill information of the bill and the invoice information of the invoice, identifies a subset of potential pairs of the one or more potential pairs associated with a threshold matching score, and selects a pair of a paired invoice to the bill from the subset of potential pairs. The system generates instructions to automatically pay the one or more bills, with payment scheduled based on the pairings.

Abstract: A computer-implemented method and system are provided to utilize machine learning technology to process user financial transaction data to predict a personalized payment screen architecture. A plurality of feature datasets associated with transaction data of a plurality of electronic invoices are obtained by a computing device. Each feature dataset comprises a plurality of features, a payment screen and a payment method configured to be presented on at least one payment screen. The computing device is configured to train a machine learning model with the feature datasets to produce a probability matrix with probabilities of each payment method used to pay the invoices through each payment screen. The computing device may weigh the probability matrix to generate a recommendation matrix and determine a prediction of a payment screen based on the recommendation matrix.