Sciweavers

860 search results - page 88 / 172
» Lower Bounds on the Size of Test Data Sets
Sort
View
SPIRE
2009
Springer
14 years 2 months ago
Sketching Algorithms for Approximating Rank Correlations in Collaborative Filtering Systems
Collaborative filtering (CF) shares information between users to provide each with recommendations. Previous work suggests using sketching techniques to handle massive data sets i...
Yoram Bachrach, Ralf Herbrich, Ely Porat
GECCO
2006
Springer
124views Optimization» more  GECCO 2006»
13 years 11 months ago
An efficient approach to unbounded bi-objective archives -: introducing the mak_tree algorithm
Given the prominence of elite archiving in contemporary multiobjective optimisation research and the limitations inherent in bounded population sizes, it is unusual that the vast ...
Adam Berry, Peter Vamplew
WWW
2010
ACM
13 years 11 months ago
Hierarchical cluster visualization in web mapping systems
This paper presents a technique for visualizing large spatial data sets in Web Mapping Systems (WMS). The technique creates a hierarchical clustering tree, which is subsequently u...
Jean-Yves Delort
BMCBI
2006
142views more  BMCBI 2006»
13 years 7 months ago
Improving the Performance of SVM-RFE to Select Genes in Microarray Data
Background: Recursive Feature Elimination is a common and well-studied method for reducing the number of attributes used for further analysis or development of prediction models. ...
Yuanyuan Ding, Dawn Wilkins
VLDB
2006
ACM
190views Database» more  VLDB 2006»
14 years 8 months ago
Online summarization of dynamic time series data
Managing large-scale time series databases has attracted significant attention in the database community recently. Related fundamental problems such as dimensionality reduction, tr...
Ümit Y. Ogras, Hakan Ferhatosmanoglu