Sciweavers

4263 search results - page 487 / 853
» Learning without Coding
Sort
View
ICML
2006
IEEE
16 years 7 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
KDD
2005
ACM
153views Data Mining» more  KDD 2005»
16 years 7 months ago
Using retrieval measures to assess similarity in mining dynamic web clickstreams
While scalable data mining methods are expected to cope with massive Web data, coping with evolving trends in noisy data in a continuous fashion, and without any unnecessary stopp...
Olfa Nasraoui, Cesar Cardona, Carlos Rojas
AAAI
2008
15 years 9 months ago
An Effective and Robust Method for Short Text Classification
Classification of texts potentially containing a complex and specific terminology requires the use of learning methods that do not rely on extensive feature engineering. In this w...
Victoria Bobicev, Marina Sokolova
MOBISYS
2010
ACM
15 years 9 months ago
Darwin phones: the evolution of sensing and inference on mobile phones
We present Darwin, an enabling technology for mobile phone sensing that combines collaborative sensing and classification techniques to reason about human behavior and context on ...
Emiliano Miluzzo, Cory Cornelius, Ashwin Ramaswamy...
ATAL
2008
Springer
15 years 8 months ago
On the usefulness of opponent modeling: the Kuhn Poker case study
The application of reinforcement learning algorithms to Partially Observable Stochastic Games (POSG) is challenging since each agent does not have access to the whole state inform...
Alessandro Lazaric, Mario Quaresimale, Marcello Re...