Sciweavers

2100 search results - page 212 / 420
» Learning to rank on graphs
Sort
View
ACL
2006
15 years 8 months ago
Unsupervised Relation Disambiguation Using Spectral Clustering
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...
Jinxiu Chen, Dong-Hong Ji, Chew Lim Tan, Zheng-Yu ...
ESANN
2003
15 years 8 months ago
Robust Topology Representing Networks
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...
Michaël Aupetit
ICML
2006
IEEE
16 years 7 months ago
Generalized spectral bounds for sparse LDA
We present a discrete spectral framework for the sparse or cardinality-constrained solution of a generalized Rayleigh quotient. This NPhard combinatorial optimization problem is c...
Baback Moghaddam, Yair Weiss, Shai Avidan
FGR
2008
IEEE
231views Biometrics» more  FGR 2008»
16 years 1 months ago
Personalized facial attractiveness prediction
We present an approach to learning the personal preferences of individual users directly from example images. The target application is computer assisted search of partners in onl...
Jacob Whitehill, Javier R. Movellan
WEBNET
2001
15 years 8 months ago
Using Online Tools to Enhance Classrooms: A Case Study with MaSH (Making Serendipity Happen)
: The middle ground between distance learning and standard-issue classroom education is ripe for exploration. In particular, the Open Directory Project shows that groups of people ...
Dan Cosley