4.2 Article

Authorship verification of e-mail and tweet messages applied for continuous authentication

Journal

JOURNAL OF COMPUTER AND SYSTEM SCIENCES
Volume 81, Issue 8, Pages 1429-1440

Publisher

ACADEMIC PRESS INC ELSEVIER SCIENCE
DOI: 10.1016/j.jcss.2014.12.019

Keywords

Continuous authentication; Stylometry; Short message verification; n-Gram features; Unbalanced dataset; SVM classifier

Funding

  1. Vanier scholarship from the Natural Sciences and Engineering Research Council of Canada (NSERC) [VCGS3 - 424654 - 2012]
  2. CNPq (Brazil) scholarship [237628/2012-0]

Ask authors/readers for more resources

Authorship verification using stylometry consists of identifying a user based on his writing style. In this paper, authorship verification is applied for continuous authentication using unstructured online text-based entry. An online document is decomposed into consecutive blocks of short texts over which (continuous) authentication decisions happen, discriminating between legitimate and impostor behaviors. We investigate blocks of texts with 140, 280 and 500 characters. The feature set includes traditional features such as lexical, syntactic, application specific features, and new features extracted from n-gram analysis. Furthermore, the proposed approach includes a strategy to circumvent issues related to unbalanced dataset, and uses Information Gain and Mutual Information as a feature selection strategy and Support Vector Machine (SVM) for classification. Experimental evaluation of the proposed approach based on the Enron email and Twitter corpuses yields very promising results consisting of an Equal Error Rate (EER) varying from 9.98% to 21.45%, for different block sizes. (C) 2014 Elsevier Inc. All rights reserved.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.2
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
Article Computer Science, Hardware & Architecture

Solving problems on generalized convex graphs via mim-width

Flavia Bonomo-Braberman, Nick Brettell, Andrea Munaro, Daniel Paulusma

Summary: This article discusses the convexity and mim-width of bipartite graphs, and it proves that for certain families of graphs 7-t, the 7-t-convex graphs can be solved in polynomial time for NP-complete problems. It also explores the bounded and unbounded mim-width of 7-t-convex graphs for different sets 7-t.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Performance modeling and analysis for randomly walking mobile users with Markov chains

Keqin Li

Summary: In this paper, we propose a computation offloading strategy to satisfy all UEs served by an MEC and develop an efficient method to find such a strategy. By using Markov chains to characterize UE mobility and calculating the joint probability distribution of UE locations, we can obtain the average response time of UEs and predict the overall average response time of tasks. Additionally, we solve the power constrained MEC speed setting problem.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Correction Computer Science, Hardware & Architecture

Prediction, learning, uniform convergence, and scale-sensitive dimensions (vol 56, pg 174, 1998)

Peter L. Bartlett, Philip M. Long

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Fast and succinct population protocols for Presburger arithmetic

Philipp Czerner, Roland Guttenberg, Martin Helfrich, Javier Esparza

Summary: This paper presents a construction method that produces population protocols with a small number of states, while achieving near-optimal expected number of interactions, for deciding Presburger predicates.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Orienting undirected phylogenetic networks

Katharina T. Huber, Leo van Iersel, Remie Janssen, Mark Jones, Vincent Moulton, Yukihiro Murakami, Charles Semple

Summary: This paper investigates the relationship between undirected and directed phylogenetic networks, and provides corresponding algorithms. The study reveals that the directed phylogenetic network is unique under specific conditions. Additionally, an algorithm for directing undirected binary networks is described, applicable to certain classes of directed phylogenetic networks.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Wireless IoT sensors data collection reward maximization by leveraging multiple energy- and storage-constrained UAVs

Francesco Betti Sorbelli, Alfredo Navarra, Lorenzo Palazzetti, Cristina M. Pinotti, Giuseppe Prencipe

Summary: This study discusses the deployment of IoT sensors in an area that needs to be monitored. Drones are used to collect data from the sensors, but they have energy and storage constraints. To maximize the overall reward from the collected data and ensure compliance with energy and storage limits, an optimization problem called Multiple-drone Data-collection Maximization Problem (MDMP) is proposed and solved using an Integer Linear Programming algorithm.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

On the complexity of the storyplan problem

Carla Binucci, Emilio Di Giacomo, William J. Lenhart, Giuseppe Liotta, Fabrizio Montecchiani, Martin Nollenburg, Antonios Symvonis

Summary: In this study, we investigate the problem of representing a graph as a storyplan, which is a model for dynamic graph visualization. We prove the NP-completeness of this problem and propose two parameterized algorithms as solutions. We also demonstrate that partial 3-trees always admit a storyplan and can be computed in linear time. Additionally, we show that even if the vertex appearance order is given, the problem of choosing how to draw the frames remains NP-complete.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)

Article Computer Science, Hardware & Architecture

Perpetual maintenance of machines with different urgency requirements

Leszek Gasieniec, Tomasz Jurdzinski, Ralf Klasing, Christos Levcopoulos, Andrzej Lingas, Jie Min, Tomasz Radzik

Summary: This passage describes the Bamboo Garden Trimming Problem and presents approximation algorithms for both Discrete BGT and Continuous BGT.

JOURNAL OF COMPUTER AND SYSTEM SCIENCES (2024)