Abstract: A first node on the blockchain storage system node may include data from other blocks on the blockchain used for blockchain verification and an additional node which may include an analysis element. The analysis element may include computer executable code for receiving data added to the blockchain, determining a risk score for the data added to the blockchain based on past performance and in response to the risk score being over a threshold, alerting members of blockchain of the risk score.

Abstract: A series of algorithms can be applied to an automated machine learning model building process in order to reduce complexity and improve model performance. In addition, the settings and parameters for implementing the automated machine learning model building process can be tuned to improve performance of future models. The model building process can also be monitored to ensure that the current build is based on new information compared to previously builds.

Abstract: Embodiments of the invention are directed to methods and devices for predicting interactions. One embodiment is directed to a method comprising receiving, by one or more computers, interaction data for a plurality of known interactions between resource providers and users, and creating a topological graph based on the plurality of known interactions. The method may further comprise determining, by the one or more computers, a plurality of communities to form a predictive model, and receiving a request for a prediction. In addition, the method may comprise applying the request to the predictive model, by the one or more computers, by identifying a community in the plurality of communities corresponding to the request, determining a node within the identified community, and providing information regarding the node as the requested prediction.

Abstract: Systems and methods are provided for transcompiling non-distributed source code for a nondistributed software program into a distributed software package for implementation on a distributed computing system. A transcompiler can identify loops within non-distributed source code written in a data-driven language. The transcompiler can generate MapReduce jobs using mapper keys based on grouping indicators associated with each of the loops. The MapReduce jobs can be linked together based on input-output connections of the loops in the non-distributed source code. Then, the transcompiler can generate a distributed software package including the generated MapReduce jobs to implement the same functionality as the non-distributed source code on the distributed computing system, thereby improving the speed of execution over very large datasets. The distributed software package can be optimized using machine learning searching algorithms.

Abstract: A method including collecting, by a communication device comprising a machine learning model obtained at least in part from a server computer, metadata associated with an application. The communication device can then embed the metadata to form vectorized data. The communication device can input the vectorized data into the machine learning model to obtain a security value. The communication device can determine whether to run or install the application based upon the security value.

Abstract: A disclosed method an analysis computer determining a rolling window associated with interaction data for interactions that occur over time. The analysis computer can retrieve interaction data for interactions occurring in the rolling window. The analysis computer can then generate pseudo interaction data based upon historical interaction data. The analysis computer can optionally embed the interaction data for the interactions occurring within the rolling window and the pseudo interaction data to form interaction data matrices. The analysis computer can then form a neural network model using the interaction data matrices, which is derived from the interaction data in the rolling window and the pseudo interaction data.

Abstract: Embodiments of the invention are directed to methods and devices for predicting interactions. One embodiment is directed to a method comprising receiving, by one or more computers, interaction data for a plurality of known interactions between resource providers and users, and creating a topological graph based on the plurality of known interactions. The method may further comprise determining, by the one or more computers, a plurality of communities to form a predictive model, and receiving a request for a prediction. In addition, the method may comprise applying the request to the predictive model, by the one or more computers, by identifying a community in the plurality of communities corresponding to the request, determining a node within the identified community, and providing information regarding the node as the requested prediction.

Abstract: A method is disclosed. The method includes receiving a text phrase from a user and parsing the text phrase using a natural language parser to generate distinct words. A vector of values relating to the distinct words is generated and compared to vectors in a graph database which relate to learned communities of language. Based on the comparing, a most similar community in the learned communities of language is determined and an action set action set associated with the most similar community is queried. A response to the text phrase from the user is then generated based on the action set and provided to the user.

Abstract: Embodiments are directed to a method for accelerating machine learning using a plurality of graphics processing units (GPUs), involving receiving data for a graph to generate a plurality of random samples, and distributing the random samples across a plurality of GPUs. The method may comprise determining a plurality of communities from the random samples using unsupervised learning performed by each GPU. A plurality of sample groups may be generated from the communities and may be distributed across the GPUs, wherein each GPU merges communities in each sample group by converging to an optimal degree of similarity. In addition, the method may also comprise generating from the merged communities a plurality of subgraphs, dividing each sub-graph into a plurality of overlapping clusters, distributing the plurality of overlapping clusters across the plurality of GPUs, and scoring each cluster in the plurality of overlapping clusters to train an AI model.

Abstract: Embodiments are directed to a method of performing autonomous learning for updating input features used for an artificial intelligence model, the method comprising receiving updated data of an information space that includes a graph of nodes having a defined topology, the updated data including historical data of requests to the artificial intelligence model and output results associated with the requests, wherein different categories of input data corresponds to different input nodes of the graph. The method may further comprise updating edge connections between the nodes of the graph by performing path optimizations that each use a set of agents to explore the information space over cycles to reduce a cost function, each connection including a strength value, wherein during each path optimization, path information is shared between the rest of agents at each cycle for determining a next position value for each of the set of agents in the graph.