Sciweavers

172 search results - page 21 / 35
» Learning Generative Models of Similarity Matrices
Sort
View
COLT
2008
Springer
13 years 11 months ago
Does Unlabeled Data Provably Help? Worst-case Analysis of the Sample Complexity of Semi-Supervised Learning
We study the potential benefits to classification prediction that arise from having access to unlabeled samples. We compare learning in the semi-supervised model to the standard, ...
Shai Ben-David, Tyler Lu, Dávid Pál
JCB
2002
160views more  JCB 2002»
13 years 9 months ago
Inference from Clustering with Application to Gene-Expression Microarrays
There are many algorithms to cluster sample data points based on nearness or a similarity measure. Often the implication is that points in different clusters come from different u...
Edward R. Dougherty, Junior Barrera, Marcel Brun, ...
IDEAL
2009
Springer
14 years 4 months ago
Clustering with XCS and Agglomerative Rule Merging
Abstract. In this paper, we present a more effective approach to clustering with eXtended Classifier System (XCS) which is divided into two phases. The first phase is the XCS le...
Liangdong Shi, Yinghuan Shi, Yang Gao
ECML
2007
Springer
14 years 4 months ago
Neighborhood-Based Local Sensitivity
Abstract. We introduce a nonparametric model for sensitivity estimation which relies on generating points similar to the prediction point using its k nearest neighbors. Unlike most...
Paul N. Bennett
SODA
2010
ACM
189views Algorithms» more  SODA 2010»
14 years 7 months ago
Correlation Clustering with Noisy Input
Correlation clustering is a type of clustering that uses a basic form of input data: For every pair of data items, the input specifies whether they are similar (belonging to the s...
Claire Mathieu, Warren Schudy