Library Automation and Digital Archive
LONTAR
Fakultas Ilmu Komputer
Universitas Indonesia

Pencarian Sederhana

Find Similar Add to Favorite

Call Number SEM-317
Collection Type Indeks Artikel prosiding/Sem
Title Frequent episode rules using compressed frequent pattern data tree structure. hal, 65.
Author Rana Loda Tama, Souza Nurafrianto W.P, Alva Erwin, Harya Damar Widiputra;
Publisher Proceedings of international conference on rural information and communication technology 2009, ITB 17-18 Juni 2009
Subject Terms--data mining, frequent episode rules, association rule mining, data sturcture, network security
Location
Lokasi : Perpustakaan Fakultas Ilmu Komputer
Nomor Panggil ID Koleksi Status
SEM-317 TERSEDIA
Tidak ada review pada koleksi ini: 42676
Abstract-in a swiftly gwn network envinronment, network security is offen a big concern in developing a system which is highly persistent against any attack attempts. One of the most severe attacks againt, network environment today is the disstributed attacks. In counterattacking against these threats , the current prevention technique is inadequate to mitigate the sitiation.therefore we propose a new solution as an enhacement technique called frequent episode rules mining (FER). The reason we choose FER is because of its capability in analyzing patterns in inter-transactional records. FER also has the virtue of enabling real-time environment implementation which mostother data mining techniques doesn't accommodate. In addition, this FER technique is best implemented asing compressed frequent pattern tree. Data structure (CTPRO). Since CT-PRO has the caoability of providing efficient memory usage and swift mining process against any other association techniques, FER will be best suited to be implemented in this system. Therefore, this paper will mainly discussed on the reasons and froof of experiment on why frequent episode Rule (FER) data mining technique is efficient and effective in CT-PRO.