We address the problem of classification in partially labeled networks (a.k.a. within-network classification) where observed class labels are sparse. Techniques for statistical re...
Brian Gallagher, Hanghang Tong, Tina Eliassi-Rad, ...
Schema matching identifies elements of two given schemas that correspond to each other. Although there are many algorithms for schema matching, little has been written about build...
Philip A. Bernstein, Sergey Melnik, Michalis Petro...
In many applications, we find large video collections from different genres where the user is often only interested in one or two specific video genres. So, when users are queryin...
The fact that the heat equation is controllable to zero in any bounded domain of the euclidean space, any time T > 0 and from any open subset of the boundary is well known. On ...
The goal of clustering is to identify distinct groups in a dataset. The basic idea of model-based clustering is to approximate the data density by a mixture model, typically a mix...