Several previous systems allow users to interactively explore a large input graph through cuts of a superimposed hierarchy. This hierarchy is often created using clustering algorit...
We propose the use of latent space models applied to local invariant features for object classification. We investigate whether using latent space models enables to learn patterns...
Florent Monay, Pedro Quelhas, Daniel Gatica-Perez,...
With the goal of reducing computational costs without sacrificing accuracy, we describe two algorithms to find sets of prototypes for nearest neighbor classification. Here, the te...
A clustering method is presented which can be applied to knowledge bases storing semantically annotated resources. The method can be used to discover groupings of structured objec...
By attempting to simultaneously partition both the rows (examples) and columns (features) of a data matrix, Co-clustering algorithms often demonstrate surprisingly impressive perf...
Vikas Sindhwani, Jianying Hu, Aleksandra Mojsilovi...