A Different Approach for Clique and Household Analysis in Synthetic Telecom Data Using Propositional Logic

In Marko Koričić (ed.), 2020 43rd International Convention on Information, Communication and Electronic Technology (MIPRO). IEEE Explore. pp. 1286-1289 (2020)
  Copy   BIBTEX

Abstract

In this paper we propose an non-machine learning artificial intelligence (AI) based approach for telecom data analysis, with a special focus on clique detection. Clique detection can be used to identify households, which is a major challenge in telecom data analysis and predictive analytics. Our approach does not use any form of machine learning, but another type of algorithm: satisfiability for propositional logic. This is a neglected approach in modern AI, and we aim to demonstrate that for certain tasks, it may be a good alternative to machine learning-based approaches. We have used a simple DPLL satisfiability solver over an artificially generated telecom dataset (due to GDPR regulations), but our approach can be implemented on any telecom data by following the SAT encoding we have developed, and the DPLL solver can be substituted by a more advanced alternative such as CDCL. This paper extends the method presented in [1] for banking logs to data containing caller information, and proposes a more efficient encoding.

Author Profiles

Kristina Šekrst
University of Zagreb
Sandro Skansi
University of Zagreb

Analytics

Added to PP
2021-06-25

Downloads
72 (#98,282)

6 months
54 (#89,120)

Historical graph of downloads since first upload
This graph includes both downloads from PhilArchive and clicks on external links on PhilPapers.
How can I increase my downloads?