Sciweavers

4354 search results - page 599 / 871
» Classification-based objective functions
Sort
View
STOC
2004
ACM
150views Algorithms» more  STOC 2004»
16 years 6 months ago
Typical properties of winners and losers in discrete optimization
We present a probabilistic analysis for a large class of combinatorial optimization problems containing, e.g., all binary optimization problems defined by linear constraints and a...
René Beier, Berthold Vöcking
SIGMOD
2008
ACM
144views Database» more  SIGMOD 2008»
16 years 6 months ago
Mining significant graph patterns by leap search
With ever-increasing amounts of graph data from disparate sources, there has been a strong need for exploiting significant graph patterns with user-specified objective functions. ...
Xifeng Yan, Hong Cheng, Jiawei Han, Philip S. Yu
CVPR
2010
IEEE
16 years 2 months ago
Pareto Discriminant Analysis
Linear Discriminant Analysis (LDA) is a popular tool for multiclass discriminative dimensionality reduction. However, LDA suffers from two major problems: (1) It only optimizes th...
Karim Abou-Moustafa, Fernando De la Torre, Frank F...
SAC
2010
ACM
16 years 1 months ago
Adaptive internet services through performance and availability control
Cluster-based multi-tier systems provide a means for building scalable Internet services. Building adaptive Internet services that are able to apply appropriate system sizing and ...
Jean Arnaud, Sara Bouchenak
GECCO
2009
Springer
100views Optimization» more  GECCO 2009»
16 years 1 months ago
Partial neighborhoods of elementary landscapes
This paper introduces a new component based model that makes it relatively simple to prove that certain types of landscapes are elementary. We use the model to reconstruct proofs ...
L. Darrell Whitley, Andrew M. Sutton