Marco Túlio Ribeiro

Marco Túlio Ribeiro

Seattle, Washington, United States
862 followers 478 connections

Activity

Experience

  • Google DeepMind Graphic
  • -

    Redmond

  • -

    Greater Seattle Area

  • -

    Seattle

  • -

    Seattle, WA

  • -

    Mountain View, CA

  • -

    Belo Horizonte Area, Brazil

Education

  •  Graphic

    -

    -

  • -

    -

    Thesis: Multi-Objective Pareto-Efficient Algorithms for Recommender Systems
    Graduated in 1 year and 1 month, in contrast to the usual 2 years.

  • -

    -

    Activities and Societies: 2009-2011 - Undergrad Researcher at e-Speed laboratory. Advisor: Dr. Wagner Meira Jr.

Publications

  • Spam Detection Using Web Page Content: a New Battleground

    8th Annual Collaboration, Electronic messaging, Anti-Abuse and Spam Conference

    Traditional content-based e-mail spam filtering takes into account content of e-mail messages and apply machine learning
    techniques to infer patterns that discriminate spams from
    hams. In particular, the use of content-based spam filtering
    unleashed an unending arms race between spammers and filter developers, given the spammers' ability to continuously
    change spam message content in ways that might circumvent
    the current filters. In this paper, we propose to expand…

    Traditional content-based e-mail spam filtering takes into account content of e-mail messages and apply machine learning
    techniques to infer patterns that discriminate spams from
    hams. In particular, the use of content-based spam filtering
    unleashed an unending arms race between spammers and filter developers, given the spammers' ability to continuously
    change spam message content in ways that might circumvent
    the current filters. In this paper, we propose to expand the
    horizons of content-based filters by taking into consideration
    the content of the Web pages linked by e-mail messages.
    We describe a methodology for extracting pages linked
    by URLs in spam messages and we characterize the rela-
    tionship between those pages and the messages. We then
    use a machine learning technique (a lazy associative classifier) to extract classification rules from the web pages that
    are relevant to spam detection. We demonstrate that the
    use of information from linked pages can nicely complement
    current spam classification techniques, as portrayed by SpamAssassin. Our study shows that the pages linked by spams
    are a very promising battleground

    Other authors
    See publication
  • Spam Miner: A Platform for Detecting and Characterizing Spam Campaigns (demo paper)

    International Conference on Knowledge Discovery and Data Mining (KDD),Paris, France.

    This demo presents Spam Miner, an online system designed
    for real-time monitoring and characterization of spam traffic over the Internet. Our system is based on high-level
    abstractions such as spam message attributes, spam campaigns and spamming strategies...

    Other authors
    See publication
  • 1. Multi-Objective Pareto-Efficient Approaches for Recommender Systems

    ACM / Transactions on Intelligent Systems and Technology

    In this paper we propose new approaches for multi-objective recommender systems based on the concept of Pareto-efficiency − a state achieved when the system is devised in the
    most efficient manner in the sense that there is no way to improve one of the objectives without making
    any other objective worse off. Given that existing multi-objective recommendation algorithms differ in their
    level of accuracy, diversity and novelty, we exploit the Pareto-efficiency concept in two distinct…

    In this paper we propose new approaches for multi-objective recommender systems based on the concept of Pareto-efficiency − a state achieved when the system is devised in the
    most efficient manner in the sense that there is no way to improve one of the objectives without making
    any other objective worse off. Given that existing multi-objective recommendation algorithms differ in their
    level of accuracy, diversity and novelty, we exploit the Pareto-efficiency concept in two distinct manners:
    (i) the aggregation of ranked lists produced by existing algorithms into a single one, which we call Pareto-efficient ranking, and (ii) the weighted combination of existing algorithms resulting in a hybrid one, which
    we call Pareto-efficient hybridization. Our evaluation involves two real application scenarios: music recommendation with implicit feedback (i.e., Last.fm) and movie recommendation with explicit feedback (i.e., MovieLens). We show that the proposed Pareto-efficient approaches are effective in suggesting items that
    are likely to be simultaneously accurate, diverse and novel. We discuss scenarios where the system achieves
    high levels of diversity and novelty without compromising its accuracy. Further, comparison against multi-
    objective baselines reveals improvements in terms of accuracy (from 10.4% to 10.9%), novelty (from 5.7% to 7.5%), and diversity(from 1.6% to 4.2%).

    Other authors
    See publication
  • Pareto-Efficient Hybridization for Multi-Objective Recommender Systems

    to appear in the Proceedings of the 6 ACM Conference on Recommender Systems, Dublin, 2012

    Performing accurate suggestions is an objective of paramount importance for effective recommender systems.
    Other important and increasingly evident objectives are novelty and diversity, which are achieved by recommender systems that are able to suggest diversified items
    not easily discovered by the users. Different recommendation algorithms have
    particular strengths and weaknesses when it comes to each of these objectives, motivating the construction
    of hybrid approaches. However…

    Performing accurate suggestions is an objective of paramount importance for effective recommender systems.
    Other important and increasingly evident objectives are novelty and diversity, which are achieved by recommender systems that are able to suggest diversified items
    not easily discovered by the users. Different recommendation algorithms have
    particular strengths and weaknesses when it comes to each of these objectives, motivating the construction
    of hybrid approaches. However, most of these approaches only focus on
    optimizing accuracy, with no regard for novelty and diversity. The problem of combining
    recommendation algorithms grows significantly harder
    when multiple objectives are considered simultaneously. For instance, devising
    multi-objective recommender systems that suggest items
    that are simultaneously accurate, novel and diversified
    may lead to a conflicting-objective problem, where the attempt to
    improve an objective further may result in worsening other competing objectives.
    In this paper we propose a hybrid recommendation approach
    that combines existing
    algorithms which differ in their level of accuracy, novelty and diversity.
    We employ an evolutionary search for hybrids following the Strength Pareto approach,
    which isolates hybrids that are not dominated by others (i.e., the so
    called Pareto frontier).
    Experimental results on two recommendation scenarios show that: (i) we can combine
    recommendation algorithms in order to improve an
    objective without significantly hurting other objectives,
    and (ii) we allow for adjusting the compromise between accuracy, diversity and novelty,
    so that the recommendation emphasis can be adjusted dynamically according to the needs of
    different users.

    Other authors

Languages

  • English

    Full professional proficiency

  • Portuguese

    Native or bilingual proficiency

View Marco Túlio’s full profile

  • See who you know in common
  • Get introduced
  • Contact Marco Túlio directly
Join to view full profile

People also viewed

Explore collaborative articles

We’re unlocking community knowledge in a new way. Experts add insights directly into each article, started with the help of AI.

Explore More

Others named Marco Túlio Ribeiro

Add new skills with these courses