Abstract:
A classification method includes receiving a collection of samples, each sample comprising a multidimensional feature representation. A class label prediction for each sample in the collection is generated with one or more pretrained classifiers. For at least one iteration, each multidimensional feature representation is augmented with a respective class label prediction to form an augmented representation, a set of corrupted samples is generated from the augmented representations, and a transformation that minimizes a reconstruction error for the set of corrupted samples is learned. An adapted class label prediction for at least one of the samples in the collection is generated using the learned transformation and information is output, based on the adapted class label prediction. The method is useful in predicting labels for target samples where there is no access to source domain samples that are used to train the classifier and no access to target domain training data.
Abstract:
In demand prediction, a history of demand for a resource is modeled to generate a baseline model of the demand, and demand for the resource at a prediction time is predicted by evaluating a regression function of depth k operating on an input data set including at least the demand for the resource at the prediction time output by the baseline model and measured demand for the resource measured at k times prior to the prediction time. The resource may be off-street parking, and the input data set may further include weather data. The regression function may comprise a support vector regression (SVR) function that is trained on the history of demand for the resource. The baseline model suitably comprises a Fourier model of the history of demand for the resource.
Abstract:
A multi-task learning system and method for predicting travel demand on an associated transportation network are provided. Observations corresponding to the associated transportation network are collected and a set of time series corresponding to travel demand are generated. Clusters of time series are then formed and for each cluster, multi-task learning is applied to generate a prediction model. Travel demand on a selected segment of the associated transportation network corresponding to at least one of the set of time series is then predicted in accordance with the generated prediction model.
Abstract:
In demand prediction, a history of demand for a resource is modeled to generate a baseline model of the demand, and demand for the resource at a prediction time is predicted by evaluating a regression function of depth k operating on an input data set including at least the demand for the resource at the prediction time output by the baseline model and measured demand for the resource measured at k times prior to the prediction time. The resource may be off-street parking, and the input data set may further include weather data. The regression function may comprise a support vector regression (SVR) function that is trained on the history of demand for the resource. The baseline model suitably comprises a Fourier model of the history of demand for the resource.
Abstract:
A multi-relational data set is represented by a probabilistic multi-relational data model in which each entity of the multi-relational data set is represented by a D-dimensional latent feature vector. The probabilistic multi-relational data model is trained using a collection of observations of relations between entities of the multi-relational data set. The collection of observations includes observations of at least two different relation types. A prediction is generated for an observation of a relation between two or more entities of the multi-relational data set based on a dot product of the optimized D-dimensional latent feature vectors representing the two or more entities. The training may comprise optimizing the D-dimensional latent feature vectors to maximize likelihood of the collection of observations, for example by Bayesian inference performed using Gibbs sampling.
Abstract:
A method and apparatus for classifying an image. In one example, the method may include receiving one or more images associated with a source domain and one or more images associated with a target domain, identifying one or more source domain features based on the one or more images associated with the source domain, identifying one or more target domain features based on the one or more images associated with the target domain, training a conditional maximum mean discrepancy (CMMD) engine based on a difference between the one or more source domain features and the one or more target domain features, applying the CMMD engine to the one or more images associated with the target domain to generate one or more labels for each unlabeled target image of the one or more images associated with the target domain and classifying each one of the one or more images in the target domain using the one or more labels.
Abstract:
A method for domain adaptation of samples includes receiving training samples from a plurality of domains, the plurality of domains including at least one source domain and a target domain, each training sample including values for a set of features. A domain predictor is learned on at least some of the training samples from the plurality of domains and respective domain labels. Domain adaptation is performed on the training samples using marginalized denoising autoencoding. This generates a domain adaptation transform layer (or layers) that transforms the training samples to a common adapted feature space. The domain adaptation employs the domain predictor to bias the domain adaptation towards one of the plurality of domains. Domain adapted training samples and their class labels can be used to train a classifier for prediction of class labels for unlabeled target samples that have been domain adapted with the domain adaptation transform layer(s).
Abstract:
Methods and systems for estimating airport usage demand. Airport parking traffic usage data and flight-time table data can be compiled with respect to an airport (or more than one airport). The airport parking traffic usage data and flight-time table data can be analyzed using an efficient time matching approach (e.g., a time segment matching algorithm). An efficient method to match passengers and flights is introduced. Passenger behavior can be estimated with respect to the airport based on the airport parking traffic usage data and flight-time table data.
Abstract:
A method and system are disclosed for generating a list of trips on an associated transportation network, the list ranked in accordance with time-dependent modeling of passenger preferences. User preferences of choosing a specific public transportation service or change point are modeled by a set of latent variables. Any actual trip on the network is converted into a set of pairwise preferences implicitly made by the passenger during the trip. Sequences of services matrices and change points matrices from the retrieved set of trips and non-negative factorization of the services and change points matrices is performed to smooth the matrices. The set of pairwise preferences are used to learn a ranking function and the output of a journey planner is re-ranked using the ranking function.
Abstract:
Methods and systems for estimating airport usage demand. Airport parking traffic usage data and flight-time table data can be compiled with respect to an airport (or more than one airport). The airport parking traffic usage data and flight-time table data can be analyzed using an efficient time matching approach (e.g., a time segment matching algorithm). An efficient method to match passengers and flights is introduced. Passenger behavior can be estimated with respect to the airport based on the airport parking traffic usage data and flight-time table data.