GDL

An Improved Frequent Pattern Algorithm for Mining Association Rules

ISSN 2223-4985
Journal from gdlhub / 2017-08-14 11:52:32
Oleh : D. Gunaseelan , P. Uma , International Journal of Information and Communication Technology Research
Dibuat : 2012-06-23, dengan 1 file

Keyword : D. Gunaseelan, P. Uma
Subjek : An Improved Frequent Pattern Algorithm for Mining Association Rules
Url : http://esjournals.org/journaloftechnology/archive/vol2no5/vol2no5_3.pdf
Sumber pengambilan dokumen : Internet

Data mining, also known as Knowledge Discovery in Databases (KDD) is one of the most important and interesting research areas in


21st


century. Frequent pattern discovery is one of the important techniques in data mining. The application includes Medicine,


Telecommunications and World Wide Web. Nowadays frequent pattern discovery research focuses on finding co-occurrence


relationships between items. Apriori algorithm is a classical algorithm for association rule mining. Lots of algorithms for mining


association rules and their mutations are proposed on the basis of Apriori algorithm. Most of the previous algorithms Apriori-like


algorithm which generates candidates and improving algorithm strategy and structure but at the same time many of the researchers


not concentrate on the structure of database. In this research paper, it has been proposed an improved algorithm for mining frequent


patterns in large datasets using transposition of the database with minor modification of the Apriori-like algorithm. The main


advantage of the proposed method is the database stores in transposed form and in each iteration database is filtered and reduced by


generating the transaction id for each pattern. The proposed method reduces the huge computing time and also decreases the database


size. Several experiments on real-life data show that the proposed algorithm is very much faster than existing Apriori-like


algorithms. Hence the proposed method is very much suitable for the discovering frequent patterns from large datasets.

Deskripsi Alternatif :

Data mining, also known as Knowledge Discovery in Databases (KDD) is one of the most important and interesting research areas in


21st


century. Frequent pattern discovery is one of the important techniques in data mining. The application includes Medicine,


Telecommunications and World Wide Web. Nowadays frequent pattern discovery research focuses on finding co-occurrence


relationships between items. Apriori algorithm is a classical algorithm for association rule mining. Lots of algorithms for mining


association rules and their mutations are proposed on the basis of Apriori algorithm. Most of the previous algorithms Apriori-like


algorithm which generates candidates and improving algorithm strategy and structure but at the same time many of the researchers


not concentrate on the structure of database. In this research paper, it has been proposed an improved algorithm for mining frequent


patterns in large datasets using transposition of the database with minor modification of the Apriori-like algorithm. The main


advantage of the proposed method is the database stores in transposed form and in each iteration database is filtered and reduced by


generating the transaction id for each pattern. The proposed method reduces the huge computing time and also decreases the database


size. Several experiments on real-life data show that the proposed algorithm is very much faster than existing Apriori-like


algorithms. Hence the proposed method is very much suitable for the discovering frequent patterns from large datasets.

Beri Komentar ?#(0) | Bookmark

Properti	Nilai Properti
ID Publisher	gdlhub
Organisasi	International Journal of Information and Communication Technology Research
Nama Kontak	Herti Yani, S.Kom
Alamat	Jln. Jenderal Sudirman
Kota	Jambi
Daerah	Jambi
Negara	Indonesia
Telepon	0741-35095
Fax	0741-35093
E-mail Administrator	elibrarystikom@gmail.com
E-mail CKO	elibrarystikom@gmail.com