Sciweavers

697 search results - page 81 / 140
» A Study of Evaluation Functions for the Graph K-Coloring Pro...
Sort
View
GECCO
2008
Springer
139views Optimization» more  GECCO 2008»
13 years 8 months ago
Coordinate change operators for genetic algorithms
This paper studies the issue of space coordinate change in genetic algorithms, based on two methods: convex quadratic approximations, and principal component analysis. In both met...
Elizabeth F. Wanner, Eduardo G. Carrano, Ricardo H...
CSDA
2006
84views more  CSDA 2006»
13 years 7 months ago
Three-mode partitioning
The three-mode partitioning model is a clustering model for three-way three-mode data sets that implies a simultaneous partitioning of all three modes involved in the data. In the...
Jan Schepers, Iven Van Mechelen, Eva Ceulemans
STOC
2005
ACM
138views Algorithms» more  STOC 2005»
14 years 1 months ago
A new strategy for querying priced information
This paper focuses on competitive function evaluation in the context of computing with priced information. A function f is given together with a cost cx for each variable x of f. ...
Ferdinando Cicalese, Eduardo Sany Laber
WWW
2010
ACM
14 years 2 months ago
Empirical comparison of algorithms for network community detection
Detecting clusters or communities in large real-world graphs such as large social or information networks is a problem of considerable interest. In practice, one typically chooses...
Jure Leskovec, Kevin J. Lang, Michael W. Mahoney
NIPS
2004
13 years 9 months ago
A Large Deviation Bound for the Area Under the ROC Curve
The area under the ROC curve (AUC) has been advocated as an evaluation criterion for the bipartite ranking problem. We study large deviation properties of the AUC; in particular, ...
Shivani Agarwal, Thore Graepel, Ralf Herbrich, Dan...