Sciweavers

335 search results - page 29 / 67
» A Model of User-Oriented Reduct Construction for Machine Lea...
Sort
View
ICML
2006
IEEE
14 years 8 months ago
Online decoding of Markov models under latency constraints
The Viterbi algorithm is an efficient and optimal method for decoding linear-chain Markov Models. However, the entire input sequence must be observed before the labels for any tim...
Mukund Narasimhan, Paul A. Viola, Michael Shilman
CORR
2006
Springer
151views Education» more  CORR 2006»
13 years 7 months ago
Graph Laplacians and their convergence on random neighborhood graphs
Given a sample from a probability measure with support on a submanifold in Euclidean space one can construct a neighborhood graph which can be seen as an approximation of the subm...
Matthias Hein, Jean-Yves Audibert, Ulrike von Luxb...
BIBM
2010
IEEE
139views Bioinformatics» more  BIBM 2010»
13 years 5 months ago
Scalable, updatable predictive models for sequence data
The emergence of data rich domains has led to an exponential growth in the size and number of data repositories, offering exciting opportunities to learn from the data using machin...
Neeraj Koul, Ngot Bui, Vasant Honavar
MLDM
2005
Springer
14 years 1 months ago
A Grouping Method for Categorical Attributes Having Very Large Number of Values
In supervised machine learning, the partitioning of the values (also called grouping) of a categorical attribute aims at constructing a new synthetic attribute which keeps the info...
Marc Boullé
NIPS
1998
13 years 9 months ago
Semi-Supervised Support Vector Machines
We introduce a semi-supervised support vector machine (S3 VM) method. Given a training set of labeled data and a working set of unlabeled data, S3 VM constructs a support vector m...
Kristin P. Bennett, Ayhan Demiriz