Sciweavers

1658 search results - page 275 / 332
» Learning Unknown Graphs
Sort
View
CEC
2011
IEEE
12 years 8 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
AAMAS
2012
Springer
12 years 3 months ago
Winner determination in voting trees with incomplete preferences and weighted votes
In multiagent settings where agents have different preferences, preference aggregation can be an important issue. Voting is a general method to aggregate preferences. We consider ...
Jérôme Lang, Maria Silvia Pini, Franc...
ICDE
2008
IEEE
203views Database» more  ICDE 2008»
14 years 9 months ago
Training Linear Discriminant Analysis in Linear Time
Linear Discriminant Analysis (LDA) has been a popular method for extracting features which preserve class separability. It has been widely used in many fields of information proces...
Deng Cai, Xiaofei He, Jiawei Han
KDD
2007
ACM
198views Data Mining» more  KDD 2007»
14 years 8 months ago
Applying Link-Based Classification to Label Blogs
In analyzing data from social and communication networks, we encounter the problem of classifying objects where there is an explicit link structure amongst the objects. We study t...
Smriti Bhagat, Graham Cormode, Irina Rozenbaum
RECOMB
2003
Springer
14 years 8 months ago
Optimizing exact genetic linkage computations
Genetic linkage analysis is a challenging application which requires Bayesian networks consisting of thousands of vertices. Consequently, computing the likelihood of data, which i...
Dan Geiger, Maáyan Fishelson