Sciweavers

2295 search results - page 205 / 459
» Learning Overcomplete Representations
Sort
View
ICMLA
2008
15 years 8 months ago
Text Classification Using Tree Kernels and Linguistic Information
Standard Machine Learning approaches to text classification use the bag-of-words representation of documents to deceive the classification target function. Typical linguistic stru...
Teresa Gonçalves, Paulo Quaresma
LREC
2008
88views Education» more  LREC 2008»
15 years 8 months ago
A Trainable Tokenizer, solution for multilingual texts and compound expression tokenization
Tokenization is one of the initial steps done for almost any text processing task. It is not particularly recognized as a challenging task for English monolingual systems but it r...
Oana Frunza
JMLR
2008
117views more  JMLR 2008»
15 years 6 months ago
Closed Sets for Labeled Data
Closed sets have been proven successful in the context of compacted data representation for association rule learning. However, their use is mainly descriptive, dealing only with ...
Gemma C. Garriga, Petra Kralj, Nada Lavrac
ML
2006
ACM
15 years 6 months ago
Type-sensitive control-flow analysis
Higher-order typed languages, such as ML, provide strong support for data and type abn. While such abstraction is often viewed as costing performance, there are situations where i...
John H. Reppy
ICASSP
2011
IEEE
14 years 10 months ago
USPACOR: Universal sparsity-controlling outlier rejection
The recent upsurge of research toward compressive sampling and parsimonious signal representations hinges on signals being sparse, either naturally, or, after projecting them on a...
Georgios B. Giannakis, Gonzalo Mateos, Shahrokh Fa...