Sciweavers

576 search results - page 25 / 116
» Optimizing Information Agents by Selectively Materializing D...
Sort
View
BMCBI
2006
201views more  BMCBI 2006»
13 years 8 months ago
Gene selection algorithms for microarray data based on least squares support vector machine
Background: In discriminant analysis of microarray data, usually a small number of samples are expressed by a large number of genes. It is not only difficult but also unnecessary ...
E. Ke Tang, Ponnuthurai N. Suganthan, Xin Yao
KDD
2006
ACM
150views Data Mining» more  KDD 2006»
14 years 8 months ago
Maximally informative k-itemsets and their efficient discovery
In this paper we present a new approach to mining binary data. We treat each binary feature (item) as a means of distinguishing two sets of examples. Our interest is in selecting ...
Arno J. Knobbe, Eric K. Y. Ho
NIPS
2003
13 years 9 months ago
Geometric Clustering Using the Information Bottleneck Method
We argue that K–means and deterministic annealing algorithms for geometric clustering can be derived from the more general Information Bottleneck approach. If we cluster the ide...
Susanne Still, William Bialek, Léon Bottou
ECIR
2011
Springer
12 years 11 months ago
Fractional Similarity: Cross-Lingual Feature Selection for Search
Abstract. Training data as well as supplementary data such as usagebased click behavior may abound in one search market (i.e., a particular region, domain, or language) and be much...
Jagadeesh Jagarlamudi, Paul N. Bennett
ADC
2007
Springer
193views Database» more  ADC 2007»
14 years 2 months ago
Optimizing XPath Queries on Streaming XML Data
XML stream processing has recently become popular for many applications such as selective dissemination of information. Several approaches have been proposed and most of them are ...
Keerati Jittrawong, Raymond K. Wong