This paper describes the results of some experiments exploring statistical methods to infer syntactic categories from a raw corpus in an unsupervised fashion. It shares certain po...
In this paper, we present a model for unsupervised pattern discovery using non-negative matrix factorization (NMF) with graph regularization. Though the regularization can be appl...
Abstract. In this paper, we propose a novel method for the unsupervised clustering of graphs in the context of the constellation approach to object recognition. Such method is an E...
Boyan Bonev, Francisco Escolano, Miguel Angel Loza...
Graph matching is an important problem in computer
vision. It is used in 2D and 3D object matching and recognition.
Despite its importance, there is little literature on
learnin...