Sciweavers

536 search results - page 60 / 108
» The Optimality of Naive Bayes
Sort
View
WSC
2008
13 years 10 months ago
Optimizing portfolio tail measures: Asymptotics and efficient simulation optimization
We consider a portfolio allocation problem where the objective function is a tail event such as probability of large portfolio losses. The dependence between assets is captured th...
Sandeep Juneja
FOCI
2007
IEEE
14 years 2 months ago
Almost All Learning Machines are Singular
— A learning machine is called singular if its Fisher information matrix is singular. Almost all learning machines used in information processing are singular, for example, layer...
Sumio Watanabe
ATAL
2003
Springer
14 years 28 days ago
Scheduling tasks with precedence constraints to solicit desirable bid combinations
In our previous research we suggested an approach to maximizing agents preferences over schedules of multiple tasks with temporal and precedence constraints. The proposed approach...
Alexander Babanov, John Collins, Maria L. Gini
GECCO
2005
Springer
132views Optimization» more  GECCO 2005»
14 years 1 months ago
Greedy, genetic, and greedy genetic algorithms for the quadratic knapsack problem
Augmenting an evolutionary algorithm with knowledge of its target problem can yield a more effective algorithm, as this presentation illustrates. The Quadratic Knapsack Problem e...
Bryant A. Julstrom
PAKDD
2000
ACM
128views Data Mining» more  PAKDD 2000»
13 years 11 months ago
A Comparative Study of Classification Based Personal E-mail Filtering
This paper addresses personal E-mail filtering by casting it in the framework of text classification. Modeled as semi-structured documents, Email messages consist of a set of field...
Yanlei Diao, Hongjun Lu, Dekai Wu