Sciweavers

1403 search results - page 244 / 281
» Set cover algorithms for very large datasets
Sort
View
SADM
2010
173views more  SADM 2010»
13 years 3 months ago
Data reduction in classification: A simulated annealing based projection method
This paper is concerned with classifying high dimensional data into one of two categories. In various settings, such as when dealing with fMRI and microarray data, the number of v...
Tian Siva Tian, Rand R. Wilcox, Gareth M. James
TASLP
2010
106views more  TASLP 2010»
13 years 3 months ago
Efficient and Robust Music Identification With Weighted Finite-State Transducers
We present an approach to music identification based on weighted finite-state transducers and Gaussian mixture models, inspired by techniques used in large-vocabulary speech recogn...
Mehryar Mohri, Pedro Moreno, Eugene Weinstein
CVPR
2012
IEEE
11 years 11 months ago
Seeded watershed cut uncertainty estimators for guided interactive segmentation
Watershed cuts are among the fastest segmentation algorithms and therefore well suited for interactive segmentation of very large 3D data sets. To minimize the number of user inte...
Christoph N. Straehle, Ullrich Köthe, Graham ...
KDD
2008
ACM
174views Data Mining» more  KDD 2008»
14 years 9 months ago
Effective label acquisition for collective classification
Information diffusion, viral marketing, and collective classification all attempt to model and exploit the relationships in a network to make inferences about the labels of nodes....
Mustafa Bilgic, Lise Getoor
BMCBI
2006
137views more  BMCBI 2006»
13 years 8 months ago
A classification-based framework for predicting and analyzing gene regulatory response
Background: We have recently introduced a predictive framework for studying gene transcriptional regulation in simpler organisms using a novel supervised learning algorithm called...
Anshul Kundaje, Manuel Middendorf, Mihir Shah, Chr...