Sciweavers

1004 search results - page 111 / 201
» A comparison of generalized linear discriminant analysis alg...
Sort
View
MP
1998
109views more  MP 1998»
13 years 8 months ago
Rounding algorithms for covering problems
In the last 25 years approximation algorithms for discrete optimization problems have been in the center of research in the fields of mathematical programming and computer science...
Dimitris Bertsimas, Rakesh V. Vohra
GECCO
2000
Springer
138views Optimization» more  GECCO 2000»
14 years 12 days ago
Time Complexity of genetic algorithms on exponentially scaled problems
This paper gives a theoretical and empirical analysis of the time complexity of genetic algorithms (GAs) on problems with exponentially scaled building blocks. It is important to ...
Fernando G. Lobo, David E. Goldberg, Martin Pelika...
TKDE
2012
253views Formal Methods» more  TKDE 2012»
11 years 11 months ago
Horizontal Aggregations in SQL to Prepare Data Sets for Data Mining Analysis
—Preparing a data set for analysis is generally the most time consuming task in a data mining project, requiring many complex SQL queries, joining tables and aggregating columns....
Carlos Ordonez, Zhibo Chen 0002
IPPS
2007
IEEE
14 years 3 months ago
RNAVLab: A unified environment for computational RNA structure analysis based on grid computing technology
Ribonucleic acid (RNA) molecules play important roles in many biological processes including gene expression and regulation. An RNA molecule is a linear polymer which folds back o...
Michela Taufer, Ming-Ying Leung, Kyle L. Johnson, ...
CSDA
2008
128views more  CSDA 2008»
13 years 8 months ago
Classification tree analysis using TARGET
Tree models are valuable tools for predictive modeling and data mining. Traditional tree-growing methodologies such as CART are known to suffer from problems including greediness,...
J. Brian Gray, Guangzhe Fan