Sciweavers

2363 search results - page 384 / 473
» Learning Algorithms for Domain Adaptation
Sort
View
ICDM
2009
IEEE
168views Data Mining» more  ICDM 2009»
14 years 5 months ago
Bi-relational Network Analysis Using a Fast Random Walk with Restart
—Identification of nodes relevant to a given node in a relational network is a basic problem in network analysis with great practical importance. Most existing network analysis ...
Jing Xia, Doina Caragea, William H. Hsu
AUSAI
2007
Springer
14 years 2 months ago
Advances in Local Search for Satisfiability
In this paper we describe a stochastic local search (SLS) procedure for finding satisfying models of satisfiable propositional formulae. This new algorithm, gNovelty+ , draws on th...
Duc Nghia Pham, John Thornton, Charles Gretton, Ab...
GECCO
2006
Springer
218views Optimization» more  GECCO 2006»
14 years 2 months ago
A survey of mutation techniques in genetic programming
The importance of mutation varies across evolutionary computation domains including: genetic programming, evolution strategies, and genetic algorithms. In the genetic programming ...
Alan Piszcz, Terence Soule
ISCI
2008
116views more  ISCI 2008»
13 years 10 months ago
Discovery of maximum length frequent itemsets
The use of frequent itemsets has been limited by the high computational cost as well as the large number of resulting itemsets. In many real-world scenarios, however, it is often ...
Tianming Hu, Sam Yuan Sung, Hui Xiong, Qian Fu
CSDA
2007
106views more  CSDA 2007»
13 years 10 months ago
Parsimonious additive models
A new method for function estimation and variable selection, specifically designed for additive models fitted by cubic splines is proposed.This new method involves regularizing ...
Marta Avalos, Yves Grandvalet, Christophe Ambroise