Observational learning algorithm is an ensemble algorithm where each network is initially trained with a bootstrapped data set and virtual data are generated from the ensemble for ...
Clustering partitions a collection of objects into groups called clusters, such that similar objects fall into the same group. Similarity between objects is defined by a distance ...
Venkatesh Ganti, Raghu Ramakrishnan, Johannes Gehr...
We consider clustering situations in which the pairwise affinity between data points depends on a latent ”context” variable. For example, when clustering features arising fro...
Distance functions are an important component in many learning applications. However, the correct function is context dependent, therefore it is advantageous to learn a distance f...
We introduce a framework for defining a distance on the (non-Euclidean) space of Linear Dynamical Systems (LDSs). The proposed distance is induced by the action of the group of o...