• xmlui.mirage2.page-structure.header.title
    • français
    • English
  • Help
  • Login
  • Language 
    • Français
    • English
View Item 
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
  •   BIRD Home
  • LAMSADE (UMR CNRS 7243)
  • LAMSADE : Publications
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

Browse

BIRDResearch centres & CollectionsBy Issue DateAuthorsTitlesTypeThis CollectionBy Issue DateAuthorsTitlesType

My Account

LoginRegister

Statistics

Most Popular ItemsStatistics by CountryMost Popular Authors
Thumbnail - No thumbnail

A closed sets based learning classifier for implicit authentication in web browsing

Dia, Diyé; Kahn, Giacomo; Labernia, Fabien; Loiseau, Yannick; Raynaud, Olivier (2020), A closed sets based learning classifier for implicit authentication in web browsing, Discrete Applied Mathematics, 273, p. 65-80. 10.1016/j.dam.2018.11.016

Type
Article accepté pour publication ou publié
External document link
https://hal.uca.fr/hal-02024887
Date
2020
Journal name
Discrete Applied Mathematics
Volume
273
Publisher
Elsevier
Pages
65-80
Publication identifier
10.1016/j.dam.2018.11.016
Metadata
Show full item record
Author(s)
Dia, Diyé
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Kahn, Giacomo
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Labernia, Fabien
Laboratoire d'analyse et modélisation de systèmes pour l'aide à la décision [LAMSADE]
Loiseau, Yannick cc
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Raynaud, Olivier
Laboratoire d'Informatique, de Modélisation et d'optimisation des Systèmes [LIMOS]
Abstract (EN)
Faced with both identity theft and the theft of means of authentication, users of digital services are starting to look rather suspiciously at online systems. To increase access security it is necessary to introduce some new factor of implicit authentication such as user behavior analysis. A behavior is made up of a series of observable actions and taken as a whole, the most frequent of these actions amount to habit. The challenge is to detect identity theft as quickly as possible and, reciprocally, to validate a legitimate identity for as long as possible. To take up this challenge, we introduce in this paper a closed set-based learning classifier. This classifier is inspired by classification in concept lattices from positive and negative examples and several works on emerging patterns. We also rely on the tf-idf parameter used in the context of information retrieval. We propose three heuristics named H c tf −idf , H c sup and H c supM in to select closed patterns for each class to be described. To compute performance of our models we have followed an experimental protocol described in a previous study which had the same purpose. Then, we compared the results from our own dataset of web navigation connection logs of 3, 000 users over a six-month period with the heuristic H sup introduced in this study. Moreover, to strengthen our analysis, we have designed and set up one model based on the naive Bayes classifier to be used as a reference statistical tool.
Subjects / Keywords
Machine learning; Classifier; Implicit authentication; Closed set; Emerging Patterns

Related items

Showing items related by title and author.

  • Thumbnail
    Using Closed Itemsets for Implicit User Authentication in Web Browsing 
    Raynaud, Olivier; Loiseau, Yannick; Dia, Diyé; Coupelon, Olivier; Labernia, Fabien (2014) Communication / Conférence
  • Thumbnail
    Query-based learning of acyclic conditional preference networks from noisy data 
    Labernia, Fabien; Yger, Florian; Mayag, Brice; Atif, Jamal (2016) Communication / Conférence
  • Thumbnail
    Query-based learning of acyclic conditional preference networks from contradictory preferences 
    Labernia, Fabien; Yger, Florian; Mayag, Brice; Atif, Jamal (2017) Article accepté pour publication ou publié
  • Thumbnail
    Algorithmes efficaces pour l’apprentissage de réseaux de préférences conditionnelles à partir de données bruitées 
    Labernia, Fabien (2018-09-27) Thèse
  • Thumbnail
    Online learning of acyclic conditional preference networks from noisy data 
    Labernia, Fabien; Zanuttini, Bruno; Mayag, Brice; Yger, Florian; Atif, Jamal (2017) Communication / Conférence
Dauphine PSL Bibliothèque logo
Place du Maréchal de Lattre de Tassigny 75775 Paris Cedex 16
Phone: 01 44 05 40 94
Contact
Dauphine PSL logoEQUIS logoCreative Commons logo