@inproceedings{34af8b0ed40842e7bef9b2867e3fcbbc,
title = "A boolean approach for detection of frequent items",
abstract = "We propose a new technique for identifying frequent patterns that occur in large transactional data sets using Boolean algebras. Our approach, which involves extending the notion of support from sets of attributes to Boolean functions is more expressive than the standard approach that amounts to a search for conjunctive patterns. An efficient algorithm based on computing supports for minterms is presented. Also, we discuss an application of this algorithm to finding independent sets in graphs.",
keywords = "Boolean functions, Minterms, Petersen graph, Support",
author = "Simovici, \{Dan A.\} and Roman Sizov and Mimaroglu, \{Selim N.\}",
note = "Publisher Copyright: {\textcopyright} 2017 IEEE.; 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017 ; Conference date: 21-09-2017 Through 24-09-2017",
year = "2018",
month = nov,
day = "9",
doi = "10.1109/SYNASC.2017.00037",
language = "English",
series = "Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017",
publisher = "Institute of Electrical and Electronics Engineers Inc.",
pages = "173--179",
editor = "Tetsuo Ida and Tudor Jebelean and Dana Petcu and Watt, \{Stephen M.\} and Viorel Negru and Daniela Zaharie",
booktitle = "Proceedings - 2017 19th International Symposium on Symbolic and Numeric Algorithms for Scientific Computing, SYNASC 2017",
}