Nowadays, information plays an important role in organizations. Sensitive information is often stored in databases. Traditional mechanisms such as encryption, access control, and authentication cannot provide a high level of confidence. Therefore, the existence of Intrusion Detection Systems in databases is necessary. In this paper, we propose an intrusion detection system for detecting attacks...

0957-4174/$ see front matter 2008 Elsevier Ltd. A doi:10.1016/j.eswa.2008.10.008 * Corresponding author. Tel.: +886 2 8212 2000 63 E-mail addresses: [email protected], d917250 Sequential pattern and inter-transaction pattern mining have long been important issues in data mining research. The former finds sequential patterns without considering the relationships between transactions in databa...

There is a fundamental di erence between rule R and the other rules The classical association rules express the associations among items purchased by one customer or share price movement within a day i e associations among items within the same transaction record We call them intra transaction association rules Sequential pattern discovery is also intra transaction mining in nature because each...

Inter-transaction pattern and rule mining has been the subject of active research and has potential application in many areas. All the previous inter-transaction rule mining studies proposed generating a full set of inter-transaction rules (i.e., all frequent and confident rules) from a full set of inter-transaction patterns (i.e., all frequent patterns). However, generating a full set inter-tr...

out of fifty-two iranian nonaflatoxigenic strains of aspergillus flavus, which were collected from various substrates (soil and kernel) and sources (peanut, corn and pistachio), fifteen representatives were selected according to their different geographical origins (six provinces: guilan and golestan, ardebil, fars, kerman and semnan) and vegetative compatibility groups (vcgs, ir1 to ir15) for ...

In this paper, we propose an efficient algorithm, called ICMiner (Inter-transaction Closed patterns Miner), for mining closed inter-transaction itemsets. Our proposed algorithm consists of two phases. First, we scan the database once to find the frequent items. For each frequent item found, the ICMiner converts the original transaction database into a set of domain attributes, called a dataset....

In this paper, we propose an efficient method for mining all frequent inter-transaction patterns. The method consists of two phases. First, we devise two data structures: a dat-list, which stores the item information used to find frequent intertransaction patterns; and an ITP-tree, which stores the discovered frequent inter-transaction patterns. In the second phase, we apply an algorithm, calle...