Disk-resident High Utility Pattern Mining: A Trie Structure Implementation

被引：0

作者：

Dwivedi, Vijay Kumar ^{[1
]}

机构：

[1] United Coll Engn & Management, Dept Comp Sci & Informat Technol, UPSIDC Ind Area, Allahabad, Uttar Pradesh, India

来源：

PROCEEDINGS OF THE 2013 INTERNATIONAL CONFERENCE ON INFORMATION SYSTEMS AND COMPUTER NETWORKS (ISCON) | 2013年

关键词：

Trie; Utility; Threshold; Disk-resident; Itemsets; FREQUENT PATTERNS; TREE;

D O I：

暂无

中图分类号：

TP3 [计算技术、计算机技术];

学科分类号：

0812 ;

摘要：

High utility pattern mining is useful for identification of the most valuable itemsets in incremental databases. We propose algorithm for constructing IHUP_(TWU) tree structure using trie structure. We further propose mining algorithm for identifying most valuable itemsets by using trie structures. Experiments show that algorithms are efficient as compared to other existing algorithms.

引用

页码：44 / 49

页数：6

共 17 条

[1] A Bounded and Adaptive Memory-Based Approach to Mine Frequent Patterns From Very Large Databases [J].

Adnan, Muhaimenul ;

Alhajj, Reda .

IEEE TRANSACTIONS ON SYSTEMS MAN AND CYBERNETICS PART B-CYBERNETICS, 2011, 41 (01) :154-172

[2] DRFP-tree: disk-resident frequent pattern tree [J].

Adnan, Muhaimenul ;

Alhajj, Reda .

APPLIED INTELLIGENCE, 2009, 30 (02) :84-97

[3]

Agrawal R., 1993, SIGMOD Record, V22, P207, DOI 10.1145/170036.170072

[4] Efficient Tree Structures for High Utility Pattern Mining in Incremental Databases [J].

Ahmed, Chowdhury Farhan ;

Tanbeer, Syed Khairuzzaman ;

Jeong, Byeong-Soo ;

Lee, Young-Koo .

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2009, 21 (12) :1708-1721

[5] A new and versatile method for association generation [J].

Amir, A ;

Feldman, R ;

Kashi, R .

INFORMATION SYSTEMS, 1997, 22 (6-7) :333-347

[6]

Borgelt C, 2005, P 1 INT WORKSH OP SO, P1, DOI DOI 10.1145/1133905.1133907

[7]

Buehrer G., 2006, P 12 ACM SIGKDD INT, P86

[8] Constructing suffix tree for gigabyte sequences with megabyte memory [J].

Cheung, CF ;

Yu, JX ;

Lu, HJ .

IEEE TRANSACTIONS ON KNOWLEDGE AND DATA ENGINEERING, 2005, 17 (01) :90-105

[9] Mining frequent itemsets from secondary memory [J].

Grahne, G ;

Zhu, JF .

FOURTH IEEE INTERNATIONAL CONFERENCE ON DATA MINING, PROCEEDINGS, 2004, :91-98

[10] Mining frequent patterns without candidate generation: A frequent-pattern tree approach [J].

Han, JW ;

Pei, J ;

Yin, YW ;

Mao, RY .

DATA MINING AND KNOWLEDGE DISCOVERY, 2004, 8 (01) :53-87

← 1 2 →