Columbia University

Sense Networks, Inc.

Yellowpages.com LLC

Tony Jebara

Blake Shaw

Bert Huang

Markus Loecher

Girish Rao

Jason Uechi

Joseph Mattiello

Greg Skibiski

Christine Lemke

Alex (Sandy) Pentland

David Rosenberg

Lakshminarasimhan Sethumadhavan

Gail E Kaiser

Fang-Hsiang Su

Pannagadatta Shivaswamy

Disclosed are devices, systems, apparatus, methods, products, media, and other implementations, including a method that includes generating for a code segment of a first process an instruction dependency graph representative of behavior of the first process, obtaining respective one or more instruction dependency graphs representative of behaviors of code segments for one or more other processes, and determining, based on the first instruction dependency graph for the first process and the respective one or more instruction dependency graphs for the one or more other processes, a level of similarity between the first process and at least one of the one or more other processes.

Code relatives detection

A system for reducing the information content of a data stream according to privacy requirements that vary according to referents of the data while maximizing the utility of the data stream in the aggregate. In embodiments, a receiver of data characterizing multiple referents extracts information such as statistics. A filter may reduce the information content of the data to reduce the probability that the receiver could uniquely identify any single referent from the data, according to privacy requirements that vary by the referent. The filter allows this to be done in a way that allows the utility of the data to be maximized when the permitted probability of identification varies among the referents.

Database privacy protection devices, methods, and systems

A system, apparatus, method, and computer-readable medium for optimizing classifiers are disclosed. The optimization process can include receiving one or more training examples. The optimization process can further include assigning a loss parameter to each training example. The optimization process can further include optimizing each loss parameter of each training sample based on a sample variance of each training example using a non-linear function. The optimization process can further include estimating a classifier from the one or more weighted training samples. The optimization process can further include assigning a loss parameter to the classifier based on a number of training examples that the classifier correctly classified and a number of training examples that the classifier incorrectly classified. The optimization process can further include adding the weighted classifier to an overall classifier.

High accuracy learning by boosting weak learners

A method, system, computer program product and computer readable media for matching using degree distribution information are disclosed. An embodiment of the method can include performing b-matching on a graph data structure expanded using degree distribution information in order to identify neighbors of a selected input node. The b-matching can be performed using belief propagation. The belief propagation method is adapted to use a compressed message update rule and to be suitable for use with distributed processing systems. An embodiment can also include enhancing a matching result by applying degree distribution information to a first matching result to generate a second matching result. Embodiments for online advertisement/search term matching, product recommendation, dating service and social network matching, auction buyer/seller matching and resource allocation, among other, are disclosed.

Machine optimization devices, methods, and systems

Entities may be matched to enhance the efficiency of various commercial activities using various system and method embodiments of the disclosed subject matter. Belief propagation on a graph data structure defining a bipartite or unipartite matching opportunity is used to calculate a best matching. In embodiments, functions are implemented based upon the match, such as executing sales between matched buyers and sellers in an online auction system. In embodiments, messages with scalar values carry information about the relative value of possible matchings, initially provided as weights or values for the possible matchings. Weights may depend on, for example, bids or costs. Messages may be passed, for example over a network between processors respective to the nodes. Belief values reflecting a best matching can be continuously updated for each node responsively to the value information and received messages to rank the matches respective to each node, which progressively improve. This allows short or complete terminations conditions to determine the goodness of the matching. Differing numbers of matches respective to each member of the disjoint sets and distributions of the desirability of different numbers of matches can be integrated in the matchings in respective embodiments.

Belief propagation for generalized matching

Methods and systems for predicting links in a network, such as a social network, are disclosed. The existing network structure can be used to optimize link prediction. The methods and systems can learn a distance metric and/or a degree preference function that are structure preserving to predict links for new/existing nodes based on node properties.

Network information methods devices and systems

A system and method are provided for associating location data from one or more unique sources. The place and time of a unique location enabled device are associated with stored demographic information relating to the particular place and particular time. The place and time of the unique location enabled device are associated with a historical record of past locations and time of locations that the device has been. Based on the association of demographical information and historical information, the unique location enabled device is assigned to one or more groups or tribes. The location of all members of the group or tribe can be aggregated and exported for further analysis or display, thereby showing all group or tribe members at a particular time and place.

System and method of performing location analytics

A computerized method for optimizing parameters is described. A system can initialize a group of parameters to respective values within a set of allowable models and bound a partition function across a number of variable pairs to generate a plurality of bounds. The system can also determine new values for the group of parameters that minimize a sum of the plurality of bounds. The system can set the group of parameters to the new values and optimize the parameters by iteratively performing the bounding, determining and setting. The system can stop optimizing when a termination condition is reached.

Systems, device, and methods for parameter optimization

A system, method and computer-readable medium for maximum a posteriori (MAP) estimation of a graphical model are disclosed. The MAP estimation process can include obtaining an encoded data message sent over a 4G cellular wireless network and generating a graphical model representation of the message. The graphical model can be converted into a nand Markov random field (NMRF). The MAP estimation process can also include determining whether the NMRF has a perfect graph structure, and solving for a MAP estimate configuration of the NMRF. The MAP estimation process can further include outputting the MAP estimate configuration, an indication of the MAP estimate configuration, and/or a result based on a combination of the MAP estimate configuration and the encoded data message (e.g., a decoded message).

Systems, devices, and methods for posteriori estimation using NAND markov random field (NMRF)

A method of detecting an event anomaly includes receiving one or more data points, in which each data point represents a spatial or temporal event; associating a unique identifier with each of the one or more data points to obtain one or more individualized data points; distributing the one or more individualized data points across a grid, in which the grid includes one or more cells; determining an event likelihood ratio for one or more of the grid cells; identifying one or more event clusters, in which each event cluster includes one or more of the grid cells; and storing in a data repository an event cluster having a significance level above a threshold significance level.

Event identification in sensor analytics

Systems and computer-implemented methods are provided for comparing, associating and deriving associations between two or more spatial temporal data trails. One or more spatial-temporal data trails comprising one or more places are received at a processor. Each place is identified by a spatial temporal data point. And each spatial-temporal data trail is associated with an individual. The similarity between pairs of places is determined to establish one or more groups of places or one or more groups of individuals. Similarity and/groups can be determined based on demographics associated with the place or individual.

Comparing spatial-temporal trails in location analytics

Methods and systems are provided for encoding, transmission and decoding of vectorized input data, for example, video or audio data. A convex invariance learning framework is established for processing input data or a given data type. Each input vector is associated with a variable transformation matrix that acts on the vector to invariantly permute the vector elements. Joint invariance and model learning is performed on a training set of invariantly transformed vectors over a constrained space of transformation matrices using maximum likelihood analysis. The maximum likelihood analysis reduces the data volume to a linear subspace volume in which the training data can be modeled by a reduced number of variables. Principal component analysis is used to identify a set of N eigenvectors that span the linear subspace. The set of N eigenvectors is used a basis set to encode input data and to decode compressed data.

Growing community of inventors

New York, NY, United States of America

Tony Jebara