1658 search results - page 133 / 332 » Learning Unknown Graphs |
134
Voted
STOC
1993
ACM
15 years 8 months ago
1993
ACM
In this paper, we study the problem of learning in the presence of classification noise in the probabilistic learning model of Valiant and its variants. In order to identify the cl...
156
click to vote
AIRWEB
2008
Springer
15 years 6 months ago
2008
Springer
We present an algorithm, witch, that learns to detect spam hosts or pages on the Web. Unlike most other approaches, it simultaneously exploits the structure of the Web graph as we...
138
Voted
ACL
2006
15 years 6 months ago
2006
This paper presents an unsupervised learning approach to disambiguate various relations between name entities by use of various lexical and syntactic features from the contexts. I...
120
click to vote
ESANN
2003
15 years 5 months ago
2003
Martinetz and Schulten proposed the use of a Competitive Hebbian Learning (CHL) rule to build Topology Representing Networks. From a set of units and a data distribution, a link i...
121
Voted
ISBI
2008
IEEE
16 years 5 months ago
2008
IEEE
In limited data tomography, with applications such as electron microscopy and medical imaging, the scanning views are within an angular range that is often both limited and sparse...