The following information was submitted:
Transactions: WSEAS TRANSACTIONS ON COMPUTERS
Transactions ID Number: 27-650
Full Name: Hatim Aboalsamh
Position: Associate Professor
Age: ON
Sex: Male
Address: Department of Computer Sciences, King Saud University, P.O. Box 2454 Riyadh 11451
Country: SAUDI ARABIA
Tel: 529-5367
Tel prefix: +96650
Fax: +9661-467-6591
E-mail address: ahafez2001@yahoo.com
Other E-mails: Hatim@ccis.ksu.edu.sa
Title of the Paper: a novel boolean algebraic framework for association and pattern mining
Authors as they appear in the Paper: Hatim A. Aboalsamh
Email addresses of all the authors: ahafez2001@yahoo.com, Hatim@ccis.ksu.edu.sa
Number of paper pages: 10
Abstract: Data mining has been defined as the non- trivial extraction of implicit, previously unknown and potentially useful information from data. Association mining and sequential mining analysis are considered as crucial components of strategic control over a broad variety of disciplines in business, science and engineering. Association mining is one of the important sub-fields in data mining, where rules that imply certain association relationships among a set of items in a transaction database are discovered. In Sequence mining, data are represented as sequences of events, where order of those events is important. Finding patterns in sequences is valuable for predicting future events. In many applications such as the WEB applications, stock market, and genetic analysis, finding patterns in a sequence of elements or events, helps in predicting what could be the next event or element. At the conceptual level, association mining and sequence mining are two similar processe!
s but using different representations of data. In association mining, items are distinct and the order of items in a transaction is not important. While in sequential pattern mining, the order of elements (events) in transactions (sequences) is important, and the same event may occur more than once. In this paper, we propose a new mapping function that maps event sequences into itemsets. Based on the unified representation of the association mining and the sequential pattern, a new approach that uses the Boolean representation of input database D to build a Boolean matrix M. Boolean algebra operations are applied on M to generate all frequent itemsets. Finally, frequent items or frequent sequential patterns are represented by logical expressions that could be minimized by using a suitable logical function minimization technique.
Keywords: Sequence Mining, Data Mining, Association Mining, Boolean Association Expressions, Boolean Matrix, Association Matrix.
EXTENSION of the file: .pdf
Special (Invited) Session: A Boolean Algebraic Framework for Association and Pattern Mining
Organizer of the Session: 591-953
How Did you learn about congress:
IP ADDRESS: 41.234.212.52
