Sciweavers

229 search results - page 5 / 46
» Ergodic-Type Characterizations of Algorithmic Randomness
Sort
View
JMLR
2006
143views more  JMLR 2006»
13 years 7 months ago
Segmental Hidden Markov Models with Random Effects for Waveform Modeling
This paper proposes a general probabilistic framework for shape-based modeling and classification of waveform data. A segmental hidden Markov model (HMM) is used to characterize w...
Seyoung Kim, Padhraic Smyth
ALGOSENSORS
2007
Springer
14 years 1 months ago
Maximal Breach in Wireless Sensor Networks: Geometric Characterization and Algorithms
e for abstract modeling, algorithmic design and analysis to achieve provably efficient, scalable and fault-tolerant realizations of such huge, highly-dynamic, complex, non-conventi...
Anirvan DuttaGupta, Arijit Bishnu, Indranil Sengup...
CORR
2012
Springer
171views Education» more  CORR 2012»
12 years 2 months ago
Random Feature Maps for Dot Product Kernels
Approximating non-linear kernels using feature maps has gained a lot of interest in recent years due to applications in reducing training and testing times of SVM classifiers and...
Purushottam Kar, Harish Karnick
WIRN
2005
Springer
14 years 17 days ago
Ensembles Based on Random Projections to Improve the Accuracy of Clustering Algorithms
We present an algorithmic scheme for unsupervised cluster ensembles, based on randomized projections between metric spaces, by which a substantial dimensionality reduction is obtai...
Alberto Bertoni, Giorgio Valentini
ML
2006
ACM
163views Machine Learning» more  ML 2006»
13 years 7 months ago
Extremely randomized trees
Abstract This paper proposes a new tree-based ensemble method for supervised classification and regression problems. It essentially consists of randomizing strongly both attribute ...
Pierre Geurts, Damien Ernst, Louis Wehenkel