Sciweavers

4196 search results - page 85 / 840
» Unsupervised Learning of Relations
Sort
View
112
Voted
SOCIALCOM
2010
14 years 10 months ago
Measuring Similarity between Sets of Overlapping Clusters
The typical task of unsupervised learning is to organize data, for example into clusters, typically disjoint clusters (eg. the K-means algorithm). One would expect (for example) a...
Mark K. Goldberg, Mykola Hayvanovych, Malik Magdon...
126
Voted
ICASSP
2011
IEEE
14 years 4 months ago
Distributed routing in networks using affinity propagation
This paper applies affinity propagation (AP) to develop distributed solutions for routing over networks. AP is a message passing algorithm for unsupervised learning. This paper d...
Manohar Shamaiah, Sang Hyun Lee, Sriram Vishwanath...
106
Voted
IDA
2001
Springer
15 years 5 months ago
Self-Supervised Chinese Word Segmentation
Abstract. We propose a new unsupervised training method for acquiring probability models that accurately segment Chinese character sequences into words. By constructing a core lexi...
Fuchun Peng, Dale Schuurmans
CORR
2002
Springer
82views Education» more  CORR 2002»
15 years 14 days 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
IDA
2006
Springer
15 years 20 days ago
Structural hidden Markov models: An application to handwritten numeral recognition
We introduce in this paper a generalization of the widely used hidden Markov models (HMM's), which we name "structural hidden Markov models" (SHMM). Our approach is ...
Djamel Bouchaffra, Jun Tan