Abstract: A method provides program structures for constructing a program that is learned over training data. In one example, two specific program structures are provided in which the first program structure transforms each vector in an input tuple of vectors to provide an output tuple of vectors, and the second program structure operates on an input tuple of vectors to provide an output tuple of vectors by applying one or more transformations that each involves two or more vectors in the input tuple. The transformations of the first and second program structures may be linear transformations. The program may alternatively execute the first program structure and the second program structure in any suitable order a number of times, beginning with operating one of the program structures on an initial tuple of vectors. The vectors may each consist of an ordered set of real numbers.

Abstract: A machine learning classifier system includes a data set processing subsystem to generate a training set and a validation set from multiple data sources. Classifier hardware induces a classifier according to the training set, and tests the classifier according to the validation set. A buffer connected to the classifier hardware stores data objects to be classified, and a register connected to the classifier hardware stores outputs of the classifier, including classified data objects.

Abstract: Systems and methods for improving the time and cost to calculate connected components in a distributed graph are disclosed. One method includes reducing a quantity of map-reduce rounds used to determine a cluster assignment for a node in a large distributed graph by alternating between two hashing functions in the map stage of a map-reduce round and storing the cluster assignment for the node in a memory. Another method includes reducing a quantity of messages sent during map-reduce rounds by performing a predetermined quantity of rounds to generate, for each node, a set of potential cluster assignments, generating a data structure in memory to store a mapping between each node and its potential cluster assignment, and using the data structure during remaining map-reduce rounds, wherein the remaining map-reduce rounds do not send messages between nodes. The method can also include storing the cluster assignment for the node in a memory.

Abstract: A computer-implemented method for identifying relationships between entities includes accessing a first data structure being a two-dimensional array of scalar elements (e, eij, ekl(i)) representable as a matrix, each of the scalar elements capturing a relationship between two entities; reorganizing the first data structure by clustering the scalar elements separately on each dimension of the two-dimensional array, to obtain a second data structure, representable as a K×M block matrix, wherein each block is a reordered sequence of rows and/or columns of the first data structure; compacting the second data structure by: determining two parallel block sequences, which are the most similar according to a given distance measure, the parallel block sequences being either distinct rows or distinct columns of blocks of the second data structure; and reorganizing the second data structure by merging the two determined sequences into a single block sequence.

Abstract: Systems comprising a processor and a dynamic random access memory (DRAM). The DRAM comprises a programmable intelligent search memory (PRISM).

Abstract: Methods and systems for feature extraction of LIDAR surface manifolds. LIDAR point data with respect to one or more LIDAR surface manifolds can be generated. An AHAH-based feature extraction operation can be automatically performed on the point data for compression and processing thereof. The results of the AHAH-based feature extraction operation can be output as a compressed binary label representative of the at least one surface manifold rather than the point data to afford a high-degree of compression for transmission or further processing thereof. Additionally, one or more voxels of a LIDAR point cloud composed of the point data can be scanned in order to recover the compressed binary label, which represents prototypical surface patches with respect to the LIDAR surface manifold(s).

Abstract: Techniques to optimize messages sent to a user of a social networking system. In one embodiment, information about the user may be collected by the social networking system. The information may be applied to train a model for determining likelihood of a desired action by the user in response to candidate messages that may be provided for the user. The social networking system may provide to the user a message from the candidate messages with a selected likelihood of causing the desired action.

Abstract: Embodiments are directed to managing operations. If Operations events are provided, event clusters may be associated with one or more Operations events, such that the Operations events may be associated with the event clusters based on characteristics of the Operations events. Metrics including resolution metrics, root cause analysis, notes, and other remediation information may be associated with the event clusters. Then a modeling engine may be employed to train models based on the Operations events, the event clusters, and the resolution metrics, such that the trained model may be trained to correlate and predict the resolution metrics from real-time Operations events. If real-time Operations events may be provided, the trained models may be employed to predict the resolution metrics that are associated with the real-time Operations events. If model performance degrades beyond accuracy requirements, new observations may be added to the training set and the model re-trained.

Abstract: Herein disclosed is a system and method for record linkage that uses machine learning to link records, so that many users can contribute their training data to a shared repository and employ the accumulated training data without any user having to share their actual data. The system includes a record linkage server, which further includes a record linkage repository, a domain classifier, and a domain classification trainer. The record linkage server is connected with a record linkage client, which includes a field comparator and a manual label prompter.

Abstract: The disclosure relates to a communication client application for running on a user terminal to conduct calls over a network. The client is configured to access a model which models quality of user experience for calls based on a set of technical parameters of each call. The model itself is based on user feedback indicating subjective quality of multiple past calls as experienced by multiple users, modeled with respect to the technical parameters collected from each of the past calls. The model generates a predicted call quality score predicting the quality of user experience for the call given its technical parameters. Based on this process, one or more of the technical parameters of the call can be adapted to try to increase the quality experienced by the user.

Abstract: A medical general intelligence computer system and computer-implemented methods analyze morpho-physiological numbers for determining a risk of an emergent disease state, determining an emergent disease state, predicting a pre-emergent disease state, determining a pre-emergent disease state, and/or predicting a risk of a pre-emergent disease state.

Abstract: Embodiments are described for determining and/or estimating a nearest neighbor to a data vector in a dataset are presented. Some embodiments redistribute data vectors between clusters based upon the character of the clusters to more evenly balance the computational load. Some embodiments employ Locality Sensitive Hashing (LSH) functions as part of the clustering and remove redundant data vectors from the data set to mitigate unbalanced computation. The disclosed embodiments may facilitate the analysis of very large and/or very high dimensional datasets with reasonable runtimes.

Abstract: A rule based analysis of content is provided to manage activation of a web extension. A user interaction with the content launches a process to match a rule from the manifest to a portion of the content. The rule and the detected content are loaded into memory. The content is processed using the rule and by accessing the memory containing the content to determine a match. An application may choose to process the content using the rules on a background thread to avoid impacting user's experience. An activation control is displayed for the web extension associated with the rule within a web extension pane upon matching the rule to an item in the content.

Abstract: A dynamic time-evolution Boltzmann machine capable of learning is provided. Aspects include acquiring a time-series input data and supplying a plurality of input values of input data of the time-series input data at one time point to a plurality of nodes of the mode. Aspects also include computing, based on an input data sequence before the one time point in the time-series input data and a weight parameter between each of a plurality of input values of input data of the input data sequence and a corresponding one of the plurality of nodes of the model, a conditional probability of the input value at the one time point given that the input data sequence has occurred. Aspects further include adjusting the weight parameter so as to increase a conditional probability of occurrence of the input data at the one time point given that the input data sequence has occurred.

Abstract: A method for estimating model parameters. The method comprises receiving a data set related to a plurality of users and associated content, partitioning the data set into a plurality of sub data sets in accordance with the users so that data associated with each user are not partitioned into more than one sub data set, storing each of the sub data sets in a separate one of a plurality of user data storages, each of said data storages being coupled with a separate one of a plurality of estimators, storing content associated with the plurality of users in a content storage, where the content storage is coupled to the plurality of estimators so that the content in the content storage is shared by the estimators, and estimating, asynchronously by each estimator, one or more parameters associated with a model based on data from one of the sub data sets.

Abstract: Described is a system for assessing the quality of machine learning algorithms over massive time series. A set of random blocks of a time series data sample of size n is selected in parallel. Then, r resamples are generated, in parallel, by applying a bootstrapping method to each block in the set of random blocks to obtain a resample of size n, where r is not fixed. Errors are estimated on the r resamples, and a final accuracy estimate is produced by averaging the errors estimated on the r resamples.

Abstract: An event clustering system includes an extraction engine in communication with an infrastructure. The extraction engine receives data from the infrastructure and produces events. An alert engine receives the events and creates alerts mapped into a matrix, M. A sigalizer engine includes one or more of an NMF engine, a k-means clustering engine and a topology proximity engine. The sigalizer engine determines one or more common steps from events and produces clusters relating to the alerts and or events.

Abstract: A method for configuring a device for detecting a situation from a set of situations where a physical system comprises the following steps: reception of a learning sequence corresponding to a given situation of the physical system; determination of parameters of a hidden-state Markov statistical model recorded in the detection device and relating to the given situation, on the basis of a prior initialization of these parameters.

Abstract: Plagiarism may be detected, as disclosed herein, utilizing a database that stores documents for one or more courses. The database may restrict sharing of content between documents. A feature extraction module may receive edits and timestamp the edits to the document. A writing pattern for a particular user or group of users may be discerned from the temporal data and the documents for the particular user or group of users. A feature vector may be generated that represents the writing pattern. A machine learning technique may be applied to the feature vector to determine whether or not a document is plagiarized.

Abstract: An apparatus and a method for diagnosis are provided. The apparatus for diagnosis lesion include: a model generation unit configured to categorize learning data into one or more categories and to generate one or more categorized diagnostic models based on the categorized learning data, a model selection unit configured to select one or more diagnostic model for diagnosing a lesion from the categorized diagnostic models, and a diagnosis unit configured to diagnose the lesion based on image data of the lesion and the selected one or more diagnostic model.