Abstract: A novel opposing polarity machine learning device and method is described, where two machine learning models are generated, one for each polarity (accepting and rejecting, for example). The device may include memory, connected to circuitry, the memory including historical records of opposing polarities, an input record received from an input device, and instructions for the circuitry.

Abstract: A novel distributed method for machine learning is described, where the algorithm operates on a plurality of data silos, such that the privacy of the data in each silo is maintained. In some embodiments, the attributes of the data and the features themselves are kept private within the data silos. The method includes a distributed learning algorithm whereby a plurality of data spaces are co-populated with artificial, evenly distributed data, and then the data spaces are carved into smaller portions whereupon the number of real and artificial data points are compared. Through an iterative process, clusters having less than evenly distributed real data are discarded. A plurality of final quality control measurements are used to merge clusters that are too similar to be meaningful. These distributed quality control measures are then combined from each of the data silos to derive an overall quality control metric.

Abstract: A transformation-as-a-service apparatus, system and method are described, where the transformation converts financial messages from one format to another (such as SWIFT format to ISO 20022 format, etc), storing the original and transformed messages for future access by a token. The transformation service also includes a permissions and access control mechanism for allowing access to the financial messages based on requestor permissions when requested via the token.

Abstract: Disclosed is a system for reading contents from a document. The system includes a memory unit for storing a set of instructions, and a processing unit is coupled to the memory unit for processing the set of instruction. The set of instructions initiates with a step of rendering the document to retrieve the image of each page and retrieving the digital text and location of each word to create digital text blocks for each word. Running OCR on the images retrieved on rendering the document to an OCR location and creating OCR text blocks from the obtained OCR location of each word. Creating an empty array of text blocks, and adding the digital text blocks to the empty array. Adding one OCR text block to the corresponding empty array on confirming the location and performing the looping step on loop till the document is added with the OCR text block into each empty array.

Abstract: This document describes a non-transitory computer readable media programmed to enrich an entered record submitted to be matched with a dataset record stored on a data storage device. The enrichment is done by supplementing data in the entered record with customer data from a dataset. The media is further programmed to search through a plurality of dataset records in the dataset for the entered record. The search is programmed to first determine if the entered record unambiguously matches one of the dataset records or if the entered record unambiguously does not match one of the dataset records. If the entered record does not unambiguously match one of the dataset records, score match characteristics using a Fellegi-Sunter algorithm, save the score as a highest score if the score is above the highest score less a threshold, and save a location of one of the dataset records as a matching record if the score is above a previous highest score.

Abstract: A method of exercising effective influence over future occurrences using knowledge synthesis is described. Techniques include influencing methods that yield actions, once a proposed outcome has been assumed. This is different from methods, typically referred to as “predictive” or “prescriptive” that use analytics to model future results based upon existing data and predict most likely outcome. One or more methods of analysis of historical data, in a hierarchical manner, determine events which led to an observed outcome. The outcome-based algorithms use, as input, a future event or state and generate attributes that are necessary precursors. By creating these attributes, the future can be affected. Where necessary, synthetic contributors of such attributes are also created and made to act in ways consistent with generating the assumed outcome. These contributors might be called upon respectively, to post favorable opinions, to report balmy weather, or to describe sales to a certain population demographic.

Abstract: A two-step algorithm for conducting near real-time fuzzy searches of a target on one or more large data sets is described. This algorithm includes the simplification of the data by removing grammatical constructs to bring the target search term (and the stored database) to their base elements and then performing a Levenstein comparison to create a subset of the data set that may be a match. Then performing a scoring algorithm while comparing the target to the subset of the data set to identify any matches.

Abstract: A unique user interface for improving legal (and other fields) spend management is described herein. The algorithm may include looping through the lines of an invoice and displaying an icon with multiple visual indicators displaying the machine learning confidence score. When a mouse hovers over the icon, a set of icons are displayed to accept the teaching user's input. In addition, the words that drove the machine learning confidence score are highlighted with formatting so that the teaching user can understand what drove the machine learning confidence score.

Abstract: A computer-implemented method for matching user inputted text to stored text. The user inputted text is compared to each of the text strings stored in a database using a string similarity score determined using a Levenshtein distance algorithm, the n-gram or trigram methods, the Jaro-Winkler algorithm, the Cosine similarity algorithm, the Hamming distance algorithm, the Damerau-Levenshtein distance algorithm, or similar. For each comparison, the string similarity score is analyzed to determine exact matches, non-matches, and probable matches. Probable matches are further analyzed using a keyboard distance algorithm to differentiate between matches and non-matches. The keyboard distance is determined by counting a number of key movements required to move from one key to another using diagonal movements.

Abstract: A computer-implemented method for providing tenant aware, variable length, deduplication of data stored on a non-transitory computer readable storage medium is described here. The method is performed at least in part by circuitry and the data comprises a plurality of data items. Each of the plurality of data items is associated with a particular tenant of a group of tenants that store data on the storage medium. In addition, a data deduplication data storage medium made up of one or more tenant storage areas and a deduplicated block database stored on the data deduplication data storage medium is described. The tenant storage areas comprise a plurality of data items, where each data item comprises a plurality of item blocks and each item block comprises a pointer to a storage location in a deduplicated block database.

Abstract: A device may verify the authorization of the payee by a payee identification server. A device may create a record in a database on the payee identification server, the record including, either directly or indirectly, payee identification information, payee address, payee phone number, payee tax information, one or more methods of payment accepted by the payee comprising a type of payment, institution information, and account information. A device may verify said record with one or more verification sources. A device may record the results of the verification in the record. A device may create a d-token to point to the record. A device may send the d-token to the payee. A device may receive, by the payee identification server, the d-token from a third party. A device may retrieve the one or more of the methods of the payment accepted by the payee.

Abstract: A system and method for deconstructing a document is described herein, where the method is an improvement over existing document deconstruction techniques. These improvements increase speed and accuracy by rapidly identifying the source in a document by splitting the document into a plurality of sections and performing a perceptual image hashing on each section. Then a hamming distance is used to compare the hash for each section with the hashes of known documents to identify the source who sent the document.

Abstract: A two-step algorithm for conducting near real-time fuzzy searches of a target on one or more large data sets is described. This algorithm includes the simplification of the data by removing grammatical constructs to bring the target search term (and the stored database) to their base elements and then performing a Levenstein comparison to create a subset of the data set that may be a match. Then performing a scoring algorithm while comparing the target to the subset of the data set to identify any matches.

Abstract: A method and device for providing notification of improper access to secure data on a mobile device. The mobile device detects a request to record content displayed on a display of the mobile device. A determination is then made regarding whether the content that was displayed on the screen when the request to record was received is protected content. If the displayed content was protected, then a third party is notified that a security breach has been detected. A remedial action is also performed regarding the security breach. A device may receive protected content on a mobile device from a third party computer. A device may display the protected content and non-protected content on a display on the mobile device. A device may receive a request to record the protected content and the non-protected content currently displayed on the display on the mobile device. A device may determine whether the protected content is currently on the display on the mobile device.