#### Filter Results:

- Full text PDF available (8)

#### Publication Year

2002

2006

- This year (0)
- Last 5 years (0)
- Last 10 years (0)

#### Publication Type

#### Co-author

#### Publication Venue

#### Data Set Used

#### Key Phrases

Learn More

- Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
- ICML
- 2004

Feature selection is the task of choosing a small set out of a given set of features that capture the relevant properties of the data. In the context of supervised classification problems the relevance is determined by the given labels on the training data. A good choice of features is a key for building compact and accurate classifiers. In this paper we… (More)

- Koby Crammer, Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
- NIPS
- 2002

Prototypes based algorithms are commonly used to reduce the computational complexity of Nearest-Neighbour (NN) classifiers. In this paper we discuss theoretical and algorithmical aspects of such algorithms. On the theory side, we present margin based generalization bounds that suggest that these kinds of classifiers can be more accurate then the 1-NN rule.… (More)

The Query By Committee (QBC) algorithm is the only algorithm in the active learning framework that has a full theoretical justification. It was proved that it can reduce exponentially the number of labels needed for learning. Unfortunately, a naive implementation of this algorithm is impossible due to impractical time complexity. In this paper we make… (More)

- Amir Navot, Ran Gilad-Bachrach, Yiftah Navot, Naftali Tishby
- SLSFS
- 2005

- Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
- NIPS
- 2005

Training a learning algorithm is a costly task. A major goal of active learning is to reduce this cost. In this paper we introduce a new algorithm , KQBC, which is capable of actively learning large scale problems by using selective sampling. The algorithm overcomes the costly sampling step of the well known Query By Committee (QBC) algorithm by projecting… (More)

- Amir Navot, Lavi Shpigelman, Naftali Tishby, Eilon Vaadia
- NIPS
- 2005

We present a non-linear, simple, yet effective, feature subset selection method for regression and use it in analyzing cortical neural activity. Our algorithm involves a feature-weighted version of the k-nearest-neighbor algorithm. It is able to capture complex dependency of the target function on its input and makes use of the leave-one-out error as a… (More)

- Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
- COLT
- 2003

A fundamental question in learning theory is the quantifi-cation of the basic tradeoff between the complexity of a model and its predictive accuracy. One valid way of quantifying this tradeoff, known as the " Information Bottleneck " , is to measure both the complexity of the model and its prediction accuracy by using Shannon's mutual information. In this… (More)

Feature selection is the task of choosing a small subset of features that is sufficient to predict the target labels well. Here, instead of trying to directly determine which features are better, we attempt to learn the properties of good features. For this purpose we assume that each feature is represented by a set of properties, referred to as… (More)

- I Rozenboim, A Navot, +4 authors A Degen
- British poultry science
- 2003

1. Four methods of semen collecting that involved interruption of mating in two breeding ostrich pairs were tested: an artificial vagina was tested without promising results; the funnel method, in which a funnel was placed under the phallus of the tested male immediately after mating allowing semen drips to be collected; the vacuum method, using a turkey… (More)

- Ran Gilad-Bachrach, Amir Navot, Naftali Tishby
- COLT
- 2004