Sciweavers

919 search results - page 101 / 184
» Generalizing over Several Learning Settings
Sort
View
JAIR
2011
134views more  JAIR 2011»
13 years 4 months ago
Scaling up Heuristic Planning with Relational Decision Trees
Current evaluation functions for heuristic planning are expensive to compute. In numerous planning problems these functions provide good guidance to the solution, so they are wort...
Tomás de la Rosa, Sergio Jiménez, Ra...
KDD
2007
ACM
144views Data Mining» more  KDD 2007»
14 years 9 months ago
Fast direction-aware proximity for graph mining
In this paper we study asymmetric proximity measures on directed graphs, which quantify the relationships between two nodes or two groups of nodes. The measures are useful in seve...
Hanghang Tong, Christos Faloutsos, Yehuda Koren
IWANN
2009
Springer
14 years 3 months ago
Biomedical Text Mining Applied to Document Retrieval and Semantic Indexing
In Biomedical research, the ability to retrieve the adequate information from the ever growing literature is an extremely important asset. This work provides an enhanced and genera...
Anália Lourenço, Sónia Carnei...
AAAI
2011
12 years 9 months ago
Improving Semi-Supervised Support Vector Machines Through Unlabeled Instances Selection
Semi-supervised support vector machines (S3VMs) are a kind of popular approaches which try to improve learning performance by exploiting unlabeled data. Though S3VMs have been fou...
Yu-Feng Li, Zhi-Hua Zhou
CORR
2010
Springer
167views Education» more  CORR 2010»
13 years 9 months ago
Network Flow Algorithms for Structured Sparsity
We consider a class of learning problems that involve a structured sparsityinducing norm defined as the sum of -norms over groups of variables. Whereas a lot of effort has been pu...
Julien Mairal, Rodolphe Jenatton, Guillaume Obozin...