LIA@RepLab 2013
Published 23 September 2013
Jean Valère Cossu, Benjamin Bigot, Ludovic Bonnefoy, Mohamed Morchid, Xavier Bost, Grégory Senay
Citations9
Generate an AI Snapshot to get a quick, structured summary of this paper.
Study Snapshot
ObjectiveStudy objective
MethodsResearch methodology
PopulationPopulation studied
Sample sizeSample sizes
OutcomesStudy outcomes here
ResultsStudy results comes here
LimitationsResearch study limitations comes here
A concise AI-generated summary of the paper will appear here once you click Generate AI Snapshot.
TL;DR
This paper presents the participation of the Computer Science Laboratory of Avignon (LIA) to RepLab 2013 edition, an evaluation campaign for Online Reputation Management Systems.
Abstract
In this paper, we present the participation of the Computer Science Laboratory of Avignon (LIA) to RepLab 2013 edition. RepLab is an evaluation campaign for Online Reputation Management Systems. LIA has produced a important number of experiments for every tasks of the campaign: filtering, topic priority detection, Polarity for Reputation and topic detection. Our approaches rely on a large variety of machine learning methods. We have chosen to mainly exploit tweet contents. In several of our experiments we have also added selected metadata. A fewer number of our proposals have integrated external information by using provided links to Wikipedia and users homepage.
Keywords
Computer Science
A training algorithm for optimal margin classifiers
11,594 Citations1992Bernhard E. Boser, Isabelle Guyon +1 more
A training algorithm that maximizes the margin between the training patterns and the decision boundary is presented, applicable to a wide variety of the classification functions, including Perceptrons, polynomials, and Radial Basis Functions.
Foundations of statistical natural language processing
9,996 Citations1999Christopher D. Manning, Hinrich Schütze
Information Processing & ManagementTerm-weighting approaches in automatic text retrieval
9,532 Citations1988Gerard Salton, Chris Buckley
This paper summarizes the insights gained in automatic term weighting, and provides baseline single term indexing models with which other more elaborate content analysis procedures can be compared.
Transductive Inference for Text Classification using Support Vector Machines
2,717 Citations1999Thorsten Joachims
An analysis of why TSVMs are well suited for text classi(cid:12)cation is presented, and an algorithm for training TSVMs e(cid:14)-ciently, handling 10,000 examples and more is proposed.
Machine LearningBoosTexter: A Boosting-based System for Text Categorization
2,194 Citations2000Robert E. Schapire, Yoram Singer
This work describes in detail an implementation, called BoosTexter, of the new boosting algorithms for text categorization tasks, and presents results comparing the performance of Boos Texter and a number of other text-categorization algorithms on a variety of tasks.
Lecture notes in statisticsThe Boosting Approach to Machine Learning: An Overview
2,013 Citations2003Robert E. Schapire
This chapter overviews some of the recent work on boosting including analyses of AdaBoost's training error and generalization error; boosting’s connection to game theory and linear programming; the relationship between boosting and logistic regression; extensions of Ada boost for multiclass classification problems; methods of incorporating human knowledge into boosting; and experimental and applied work using boosting.
Journal of DocumentationUnderstanding inverse document frequency: on theoretical arguments for IDF
1,505 Citations2004Stephen Robertson
It is shown that the Information Theory approaches are problematic, but that there are good theoretical justifications of both IDF and TF*IDF in the traditional probabilistic model of information retrieval.
Lecture notes in computer sciencePredicting time series with support vector machines
977 Citations1997K. Müller, Alexander J. Smola +4 more
Two different cost functions for Support Vectors are made use: training with an e insensitive loss and Huber's robust loss function and how to choose the regularization parameters in these models are discussed.
A weakly-supervised detection of entity central documents in a stream
23 Citations2013Ludovic Bonnefoy, Vincent Bouvier +1 more
This work proposes an approach which does not require new training data when processing a new entity and relies on three types of features: document centric features, entity profile related features and time features to capture intrinsic characteristics of highly relevant documents.
arXiv (Cornell University)Beyond Stemming and Lemmatization: Ultra-stemming to Improve Automatic Text Summarization
20 Citations2012Juan‐Manuel Torres‐Moreno
The results show that Ultra-stemming not only preserve the content of summaries produced by this representation, but often the performances of the systems can be dramatically improved.
Journal of SoftwareAn Improved Algorithm of Bayesian Text Categorization
18 Citations2011Tao Dong, Wenqian Shang +1 more
Results show that using the improved Gini index algorithm to feature weight can improve the performance of Naive Bayesian classifier effectively and obtains good application in the sensitive information recognition system.
Person name recognition in ASR outputs using continuous context models
16 Citations2013Benjamin Bigot, Grégory Senay +3 more
The fundamental hypothesis of this study has been validated on broadcast TV documents available in the context of the REPERE challenge and a new context modelling is proposed in order to capture lexical and structural information surrounding a spoken name.