Skip to main content

and
  1. No Access

    Chapter and Conference Paper

    Multi-Objective Recommendations and Promotions at TOTAL

    In this paper, we revisit the semantics of recommendations and promotional offers using multi-objective optimization principles. We investigate two formulations of product recommendation that go beyond traditi...

    Idir Benouaret, Mohamed Bouadi in Database and Expert Systems Applications (2021)

  2. No Access

    Chapter and Conference Paper

    An Efficient Greedy Algorithm for Sequence Recommendation

    Recommending a sequence of items that maximizes some objective func...

    Idir Benouaret, Sihem Amer-Yahia in Database and Expert Systems Applications (2019)

  3. No Access

    Chapter and Conference Paper

    Scalable Active Constrained Clustering for Temporal Data

    In this paper, we introduce a novel interactive framework to handle both instance-level and temporal smoothness constraints for clustering large temporal data. It consists of a constrained clustering algorithm...

    Son T. Mai, Sihem Amer-Yahia in Database Systems for Advanced Applications (2018)

  4. No Access

    Chapter and Conference Paper

    Online Lattice-Based Abstraction of User Groups

    User data is becoming increasingly available in various domains from the social Web to location check-ins and smartphone usage traces. Due to the sparsity and impurity of user data, we propose to analyze label...

    Behrooz Omidvar-Tehrani, Sihem Amer-Yahia in Database and Expert Systems Applications (2017)

  5. Chapter and Conference Paper

    Multi-Objective Group Discovery on the Social Web

    We are interested in discovering user groups from collaborative rating datasets of the form \(\langle i, u, s\rangle \) ...

    Behrooz Omidvar-Tehrani, Sihem Amer-Yahia in Machine Learning and Knowledge Discovery i… (2016)

  6. No Access

    Chapter and Conference Paper

    TopPI: An Efficient Algorithm for Item-Centric Mining

    We introduce TopPI, a new semantics and algorithm designed to mine long-tailed datasets. For each item, and regardless of its frequency, TopPI finds the k most frequent closed itemsets that item belongs to. For e...

    Martin Kirchgessner, Vincent Leroy in Big Data Analytics and Knowledge Discovery (2016)

  7. No Access

    Chapter

    Increasing Coverage in Distributed Search and Recommendation with Profile Diversity

    With the advent of Web 2.0 users are producing bigger and bigger amounts of diverse data, which are stored in a large variety of systems. Since the users’ data spaces are scattered among those independent syst...

    Maximilien Servajean, Esther Pacitti in Transactions on Large-Scale Data- and Know… (2015)