Sciweavers

87 search results - page 4 / 18
» Constellations and the Unsupervised Learning of Graphs
Sort
View
CORR
2002
Springer
82views Education» more  CORR 2002»
13 years 7 months ago
Using eigenvectors of the bigram graph to infer morpheme identity
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...
Mikhail Belkin, John A. Goldsmith
NIPS
2001
13 years 9 months ago
Unsupervised Learning of Human Motion Models
This paper presents an unsupervised learning algorithm that can derive the probabilistic dependence structure of parts of an object (a moving human body in our examples) automatic...
Yang Song, Luis Goncalves, Pietro Perona
NAACL
2003
13 years 9 months ago
Unsupervised Learning of Morphology for English and Inuktitut
We describe a simple unsupervised technique for learning morphology by identifying hubs in an automaton. For our purposes, a hub is a node in a graph with in-degree greater than o...
Howard Johnson, Joel D. Martin
ICASSP
2011
IEEE
12 years 11 months ago
Unsupervised vocabulary discovery using non-negative matrix factorization with graph regularization
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...
Meng Sun, Hugo Van hamme
NAACL
2007
13 years 9 months ago
Unsupervised Natural Language Processing Using Graph Models
In the past, NLP has always been based on the explicit or implicit use of linguistic knowledge. In classical computer linguistic applications explicit rule based approaches prevai...
Chris Biemann