Sciweavers

240 search results - page 36 / 48
» Improved Adomian decomposition method
Sort
View
COLING
2008
13 years 9 months ago
On Robustness and Domain Adaptation using SVD for Word Sense Disambiguation
In this paper we explore robustness and domain adaptation issues for Word Sense Disambiguation (WSD) using Singular Value Decomposition (SVD) and unlabeled data. We focus on the s...
Eneko Agirre, Oier Lopez de Lacalle
KDD
2009
ACM
192views Data Mining» more  KDD 2009»
14 years 8 months ago
Learning optimal ranking with tensor factorization for tag recommendation
Tag recommendation is the task of predicting a personalized list of tags for a user given an item. This is important for many websites with tagging capabilities like last.fm or de...
Steffen Rendle, Leandro Balby Marinho, Alexandros ...
GECCO
2010
Springer
176views Optimization» more  GECCO 2010»
13 years 9 months ago
A hierarchical cooperative evolutionary algorithm
To successfully search multiple coadaptive subcomponents in a solution, we developed a novel cooperative evolutionary algorithm based on a new computational multilevel selection f...
Shelly Xiaonan Wu, Wolfgang Banzhaf
SCHOLARPEDIA
2008
109views more  SCHOLARPEDIA 2008»
13 years 7 months ago
Latent semantic analysis
A new method for automatic indexing and retrieval is described. The approach is to take advantage of implicit higher-order structure in the association of terms with documents (&q...
Thomas K. Landauer, Susan T. Dumais
COCO
2010
Springer
152views Algorithms» more  COCO 2010»
13 years 11 months ago
A Log-Space Algorithm for Reachability in Planar Acyclic Digraphs with Few Sources
Designing algorithms that use logarithmic space for graph reachability problems is fundamental to complexity theory. It is well known that for general directed graphs this problem...
Derrick Stolee, Chris Bourke, N. V. Vinodchandran