Sciweavers

EMNLP
2009
13 years 2 months ago
Reverse Engineering of Tree Kernel Feature Spaces
We present a framework to extract the most important features (tree fragments) from a Tree Kernel (TK) space according to their importance in the target kernelbased machine, e.g. ...
Daniele Pighin, Alessandro Moschitti
CIKM
2010
Springer
13 years 3 months ago
Utilizing re-finding for personalized information retrieval
Individuals often use search engines to return to web pages they have previously visited. This behaviour, called refinding, accounts for about 38% of all queries. While researcher...
Sarah K. Tyler, Jian Wang, Yi Zhang 0001
ACL
2010
13 years 3 months ago
A Study of Information Retrieval Weighting Schemes for Sentiment Analysis
Most sentiment analysis approaches use as baseline a support vector machines (SVM) classifier with binary unigram weights. In this paper, we explore whether more sophisticated fea...
Georgios Paltoglou, Mike Thelwall
PAMI
2010
122views more  PAMI 2010»
13 years 3 months ago
Domain Adaptation Problems: A DASVM Classification Technique and a Circular Validation Strategy
—This paper addresses pattern classification in the framework of domain adaptation by considering methods that solve problems in which training data are assumed to be available o...
Lorenzo Bruzzone, Mattia Marconcini
IFIP12
2010
13 years 3 months ago
Learning the Preferences of News Readers with SVM and Lasso Ranking
We attack the task of predicting which news-stories are more appealing to a given audience by comparing ‘most popular stories’, gathered from various online news outlets, over ...
Elena Hensinger, Ilias N. Flaounas, Nello Cristian...
ICASSP
2010
IEEE
13 years 3 months ago
A comparison of approaches for modeling prosodic features in speaker recognition
Prosodic information has been successfully used for speaker recognition for more than a decade. The best-performing prosodic system to date has been one based on features extracte...
Luciana Ferrer, Nicolas Scheffer, Elizabeth Shribe...
ICASSP
2010
IEEE
13 years 3 months ago
Bayesian compressive sensing for phonetic classification
In this paper, we introduce a novel bayesian compressive sensing (CS) technique for phonetic classification. CS is often used to characterize a signal from a few support training...
Tara N. Sainath, Avishy Carmi, Dimitri Kanevsky, B...
NECO
2007
107views more  NECO 2007»
13 years 4 months ago
Training a Support Vector Machine in the Primal
Most literature on Support Vector Machines (SVMs) concentrate on the dual optimization problem. In this paper, we would like to point out that the primal problem can also be solve...
Olivier Chapelle
ML
2007
ACM
130views Machine Learning» more  ML 2007»
13 years 4 months ago
A note on Platt's probabilistic outputs for support vector machines
Platt’s probabilistic outputs for Support Vector Machines (Platt, 2000) has been popular for applications that require posterior class probabilities. In this note, we propose an ...
Hsuan-Tien Lin, Chih-Jen Lin, Ruby C. Weng
VLDB
2002
ACM
112views Database» more  VLDB 2002»
13 years 4 months ago
Fast and Accurate Text Classification via Multiple Linear Discriminant Projections
Abstract. Support vector machines (SVMs) have shown superb performance for text classification tasks. They are accurate, robust, and quick to apply to test instances. Their only po...
Soumen Chakrabarti, Shourya Roy, Mahesh V. Soundal...