Demonstration venue · read-only. Every page can be browsed; the buttons that would change it are switched off. Create an account to run TaxoReview on your own data. A simulation from public publication records: the people listed were not invited and did not agree to review.
? Tutorial for this page

Eder Ferreira Martins

dblp:90/8700 · DBLP profile ↗
← Back
5ranked-venue papers
1as first author
0since 2021 · last 2016
—ORCID · none

Domains — the database's venue-derived domains; a paper can count in several

Databases, data management, data science and information retrieval · 5 · 1 first-authorArtificial intelligence and machine learning · 1

Expertise — from the expertise taxonomy: the topics of the expert's papers under the CCF categories. A weight counts papers with recency: 1 for a paper about the topic, 0.3 when the topic is its context, halved every five years.

Databases, data mining, and information retrieval
1 paper
Recommender systems · 81% Information retrieval · 19%

Topics — the 3 heaviest of 3, each with the papers that count most for it

TopicWeightPapersLastEvidence papers
Recommender systems
tag recommendation
0.112011
Associative tag recommendation exploiting multiple textual features · SIGIR 2011
Recommender systems › personalized ranking
learning-to-rank recommendation
0.012011
Associative tag recommendation exploiting multiple textual features · SIGIR 2011
Information retrieval
text analysis
0.012011
Associative tag recommendation exploiting multiple textual features · SIGIR 2011

Methods — techniques the papers use, named apart from their topics

learning to rank · 0.1genetic programming · 0.1RankSVM · 0.1
YearPublicationVenuePosition
2016 On cold start for associative tag recommendation
abstract
Tag recommendation strategies that exploit term co‐occurrence patterns with tags previously assigned to the target object have consistently produced state‐of‐the‐art results. However, such techniques work only for objects with previously assigned tags. Here we focus on tag recommendation for objects with no tags, a variation of the well‐known \textit{cold start} problem. We start by evaluating state‐of‐the‐art co‐occurrence based methods in cold start. Our results show that the effectiveness of these methods suffers in this situation. Moreover, we show that employing various automatic filtering strategies to generate an initial tag set that enables the use of co‐occurrence patterns produces only marginal improvements. We then propose a new approach that exploits both positive and negative user feedback to iteratively select input tags along with a genetic programming strategy to learn the recommendation function. Our experimental results indicate that extending the methods to include user relevance feedback leads to gains in precision of up to 58% over the best baseline in cold start scenarios and gains of up to 43% over the best baseline in objects that contain some initial tags (i.e., no cold start). We also show that our best relevance‐feedback‐driven strategy performs well even in scenarios that lack user cooperation (i.e., users may refuse to provide feedback) and user reliability (i.e., users may provide the wrong feedback).
Eder Ferreira Martins, Fabiano Muniz Belém, Jussara M. Almeida, Marcos André Gonçalves
J. Assoc. Inf. Sci. Technol.1
2014 Personalized and object-centered tag recommendation methods for Web 2.0 applications
Fabiano Muniz Belém, Eder Ferreira Martins, Jussara M. Almeida, Marcos André Gonçalves
Inf. Process. Manag.2
2013 Exploiting Novelty and Diversity in Tag Recommendation
Fabiano Muniz Belém, Eder Ferreira Martins, Jussara M. Almeida, Marcos André Gonçalves
ECIR2
2011 Associative tag recommendation exploiting multiple textual features
abstract
This work addresses the task of recommending relevant tags to a target object by jointly exploiting three dimensions of the problem: (i) term co-occurrence with tags pre-assigned to the target object, (ii) terms extracted from multiple textual features, and (iii) several metrics of tag relevance. In particular, we propose several new heuristic methods, which extend state-of-the-art strategies by including new metrics that try to capture how accurately a candidate term describes the object's content. We also exploit two learning-to-rank (L2R) techniques, namely RankSVM and Genetic Programming, for the task of generating ranking functions that combine multiple metrics to accurately estimate the relevance of a tag to a given object. We evaluate all proposed methods in various scenarios for three popular Web 2.0 applications, namely, LastFM, YouTube and YahooVideo. We found that our new heuristics greatly outperform the methods on which they are based, producing gains in precision of up to 181%, as well as another state-of-the-art technique, with improvements in precision of up to 40% over the best baseline in any scenario. Further improvements can also be achieved with the new L2R strategies, which have the additional advantage of being quite flexible and extensible to exploit other aspects of the tag recommendation problem.
Fabiano Muniz Belém, Eder Ferreira Martins, Tatiana Pontes, Jussara M. Almeida, Marcos André Gonçalves
SIGIR2
2010 Exploiting co-occurrence and information quality metrics to recommend tags in web 2.0 applications
abstract
This work addresses the task of recommending high quality tags by exploiting not only previously assigned tags, but also terms extracted from other textual features (e.g., title and description) associated with the target object.To estimate the quality of a candidate tag recommendation, we use several metrics related to both tag co-occurrence and information quality. We also propose a heuristic function to combine the metrics to produce a final ranking of the recommended tags. We evaluate our heuristic function in various scenarios, for three popular Web 2.0 applications. Our experimental results indicate that our heuristic function significantly outperforms two state-of-the-art tag recommendation algorithms.
Fabiano Muniz Belém, Eder Ferreira Martins, Jussara M. Almeida, Marcos André Gonçalves, Gisele L. Pappa
CIKM2