Sciweavers

1435 search results - page 216 / 287
» Generalization Error Bounds Using Unlabeled Data
Sort
View
PAKDD
2004
ACM
127views Data Mining» more  PAKDD 2004»
15 years 11 months ago
Separating Structure from Interestingness
Condensed representations of pattern collections have been recognized to be important building blocks of inductive databases, a promising theoretical framework for data mining, and...
Taneli Mielikäinen
RECSYS
2009
ACM
16 years 20 days ago
Measuring predictive capability in collaborative filtering
This paper presents a new memory-based approach to Collaborative Filtering where the neighbors of the active user will be selected taking into account their predictive capability....
Luis M. de Campos, Juan M. Fernández-Luna, ...
TSP
2008
124views more  TSP 2008»
15 years 6 months ago
Robust Beamforming via Worst-Case SINR Maximization
Minimum variance beamforming, which uses a weight vector that maximizes the signal-to-interference-plus-noise ratio (SINR), is often sensitive to estimation error and uncertainty i...
Seung-Jean Kim, Alessandro Magnani, Almir Mutapcic...
PODS
2005
ACM
211views Database» more  PODS 2005»
16 years 6 months ago
Join-distinct aggregate estimation over update streams
There is growing interest in algorithms for processing and querying continuous data streams (i.e., data that is seen only once in a fixed order) with limited memory resources. Pro...
Sumit Ganguly, Minos N. Garofalakis, Amit Kumar, R...
WWW
2010
ACM
16 years 1 months ago
Antourage: mining distance-constrained trips from flickr
We study how to automatically extract tourist trips from large volumes of geo-tagged photographs. Working with more than 8 million of these photographs that are publicly available...
Saral Jain, Stephan Seufert, Srikanta J. Bedathur