lanxicy.com

第一范文网 文档专家

第一范文网 文档专家

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

Fast Algorithm for Mining Generalized Association Rules

Bay Vo1 and Bac Le2

1

Faculty of Information Technology, Ho Chi Minh City University of Technology Ho Chi Minh, Vietnam 2 Faculty of Information Technology University of Science, Ho Chi Minh, Vietnam vdbay@hcmhutech.edu.vn, lhbac@fit.hcmus.edu.vn Abstract

In this paper, we present a new algorithm for mining generalized association rules. We develop the algorithm which scans database one time only and use Tidset to compute the support of generalized itemset faster. A tree structure called GIT-tree, an extension of IT-tree, is developed to store database for mining frequent itemsets from hierarchical database. Our algorithm is often faster than MMS_Cumulate, an algorithm mining frequent itemsets in hierarchical database with multiple minimum supports, in experimental databases.

Keywords: generalized association rules, GIT-tree, hierarchical database, multiple minimum supports.

1. Introduction

Mining association rules plays an important role in knowledge discovery and data mining (KDD) [1, 9]. Its purpose is mining the hidden knowledge in databases. Mining association rules in hierarchical database has been proposed in [2, 3, 5, 8, 10, 11]. In [8], the “Mining Generalized Association Rules” problem is mining association rules among items in hierarchical tree that satisfy minSup and minConf. However, this study does not change the support in different hierarchical levels. The paper [3] proposed the uniform minimum support in each level, items in the same level get the same minimum support. The purpose is mining association rules among itemsets in the same level. Another association rule mining method with multiple minimum supports was proposed in [10]. This allows users identify the different minimum supports for different items, so we can mine both frequent and rare rules. However, this method does not traverse the whole hierarchism so that it is very difficult to find association rules among items in different levels. The research in [3] also considered in mining association rules among items in different levels. However, the limitations of this method are still based on Apriori method and used a uniform minimum support for each level. Paper [5] introduced MMS_Stratify and MMS_Cumulate algorithms for mining frequent itemsets from hierarchical database with multiple minimum supports and proposed the computing of the minimum support of items based on the lift measure. This makes us no need to identify the minimum supports of items. The main contributions of paper are as follows: ? We develop GIT-tree data structure, an extension of IT-tree [6].

1

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

?

We propose an algorithm for mining frequent itemsets in hierarchical databases based on GIT-tree: using formulas in [5], we develop an algorithm of mining frequent itemsets based on GIT-tree for reducing run-time.

Section 2 presents concepts and definitions. Section 3 proposes GIT-tree for mining frequent itemsets in hierarchical database. We present our algorithm in section 4. Experimental results are presented in section 5.

2. Concepts

Let I = {i1, i2,…, im} be set of items, D = {t1, t2,…, tn} be set of transactions, each transaction ti = <tid, X> determines a unique tid and an itemset X (X ? I). Suppose that hierarchical database is a graph in I ? J, where J = {j1, j2,…, jp} represents for a general set of items that derives from I. An arc in graph G is an is-a relation, means that if an arc starts from j to i, then j is parent of i. Figure 1 illustrates hierarchical database which are built for I = {Laser printer, Ink-jet printer, Dot matrix printer, Desktop PC, Notebook, Scanner} and J = {Non-impact printer, Printer, PC}.

Printer Non_impact Dot-matrix Desktop PC Notebook Scanner

Laser

Ink-jet Figure 1. Example of hierarchical tree [5]

2.1. Definition 1: Given transaction t = <tid, X>, itemset Y belongs to t if every items of Y belong to X, or parent node of an item belongs to X. An itemset X has the support s, called sup(X), in D if s% of transactions in D contains X. 2.2. Definition 2: Given set of transactions D and a hierarchical tree G, a general association rule is the form: X?Y–X where X, Y ? I ? J, ? ≠ X ? Y, there is no item in Y which is the parent node of any item in X. The support of rule is sup(Y). The confidence of rule, conf(X ? Y - X) = sup(Y)/sup(X). 2.3. Definition 3: Let ms(x) be the minimum support of an item x ? I ? J. An itemset X = {x1, x2,…, xk}, where xi ? I ? J and 1 ? i ? k, is frequent if the support of X is greater or equal the smallest value of items in X. sup ? X ? ? min ms ? x i ? (1)

xi? X

2

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

2.4. Definition 4: An association rule X ? Y – X is strong if its frequent satisfies sup ? X ? Y ? X ? ? min ms ? y i ? and conf(X ? Y - X) ? minConf. The greatest difficulty of general association rule mining is the identification of minimum support for each item. To solve this problem, the paper [2] proposed a formula to compute the minimum support:

y i ?Y

?? ? sup? x ? if ? ? sup? x ? ? min Sup ms? x ? ? ? ?min Sup if else

(2)

The parameter ? (0 ? ? ? 1) is used to adjust the minimum support of single item x, which relates to its reality frequent in databases. If ? = 0, it becomes the homogeneous form. As the formula, user still identifies the minSup and parameter ?. The formula above make user difficult in identifying the parameter ?. Thus, authors in [5] proposed the formula to identify the minimum support:

?sup ? xi ? ? max ?min Conf , sup ? xi ?1 ??if 1 ? i ? n ? 1 ms ? xi ? ? ? if i ? n ?sup ? xi ?

Table 1. Transaction database [5]

(3)

Example: consider the database tid 1 2 3 4 Items Notebook, Laser printer Scanner, Dot-matrix printer Dot-matrix printer, Ink-jet printer Notebook, Dot-matrix printer, Laser printer 5 Scanner 6 Desktop Computer

From Table 1, and equation 3, we have the result:

Table 2. Items are sorted according to supports and minConf = 50%

Item Desktop Ink-jet Laser Notebook Scanner Dot-matrix Non-impact PC Printer

Support (%) 16.7 16.7 33.3 33.3 33.3 50.0 50.0 50.0 66.7

ms (%) 8.3 8.3 16.7 16.7 16.7 25.0 25.0 33.3 66.7

2.5. Definition 5: The minimum support of an itemset:

x? X

ms ? X ? ? min ms ? x ?

(4)

3

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

Remark 1: From equation 4, we see that the order of items in X = {x1, x2, …, xm} is increasing follow ms, then ms(X) = ms(x1). Besides, if we have ms(X) and ms(Y), then ms(X?Y) = min{ms(X), ms(Y)}. Based on this remark, we need not use equation 4 (use the loop) to compute ms(X?Y).

3. GIT-tree

Based on IT-tree [6], we add one more field ms(X) to identify minimum support of itemset X. 3.1. Vertex: Includes 3 fields X: an itemset. Tidset: the set of transaction contains X. ms: The minimum support of X.

(X ) . A vertex is denoted: X ? Tidset ms ( X )

3.2. Arc: Connecting the vertex at kth level (called X) with the vertex at (k+1)th (called Y) in which X ?? k Y (X ?? k Y if X and Y have the same k-prefix – see [6] for more details) and Y does not contain the item that is the parent of any item in X. Consider the database in Table 1. We have results:

Table 3. Map items to IDs and ms of each item

ID A B C D E F G H I

Item Desktop Ink-jet Laser Notebook Scanner Dot-matrix Non-impact PC Printer

Support(%) 16.7 16.7 33.3 33.3 33.3 50.0 50.0 50.0 66.7

ms(%) 8.3 8.3 16.7 16.7 16.7 25.0 25.0 33.3 66.7

Table 4. Database in Table 1 after mapping

ti d 1 2 3 4 5 6

Items D, C E, F F, B D, F, C E A

4

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

I G F A

H D

E

C

B

Figure 2. Hierarchical tree after mapping

Table 5. Database after add parent items

Tid 1 2 3 4 5 6

Items D, C, H, G, I E, F, I F, B, I, G D, F, C, H, I, G E A, H

Table 6. Convert into vertical transaction database

item A B C D E F G H I

Tids 6 3 1, 4 1, 4 2, 5 2, 3, 4 1, 3, 4 1, 4, 6 1, 2, 3, 4

With minConf = 50%, we have results in Table 7.

Table 7. The support with ms+ of items (where ms+ = ?ms * | D | /100? )

ID A B C D E F G H I

Support 1 1 2 2 2 3 3 3 4

ms+ 1 1 1 1 1 2 2 2 4

5

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

4. Algorithm for mining frequent itemsets in hierarchical database based on GIT-tree

In [5], authors proposed algorithms MMS_Stratify and MMS_Cumulate based on Apriori algorithm that lead to do many database scans, and the candidate number will be very large. In this section, we apply GIT-tree to mine frequent itemsets in hierarchical database to reduce the mining time.

4.1. Algorithm Input: Hierarchical database D and minConf Output: Generalized frequent itemsets in D Create IMS /* minimum supports table*/ Create IA /* The item and its parent node in hierarchical tree G*/ SMS = Sort(IMS) /* sort IMS table in increasing order of ms(x) */ F = F-gen (SMS, D, IA) Lr = First level of GIT-tree contains nodes i ? Tidset (i ) with i ? I ? J

ms ( i )

ENUMERATE_GENERALIZED_FIs(Lr) ENUMERATE_GENERALIZED_FIs (Lr) for all node X ? Tidset ( X ) ? Lr do

ms ( X )

Lc = ? for all Y ? Tidset (Y ) ? Lr with Y after X do

ms (Y )

X’ = X ? Y if ?x ? X’,??y ? X’: parent(x)=y then T = Tidset(X) ? Tidset(Y) ms(X’) = min(ms(X), ms(Y)) if |T| ? ms(X’) then Lc = L c ? ? ? ?ms( X ' )? ENUMERATE_GENERALIZED_FIs(Lc) Algorithm 1. Mining frequent itemsets in hierarchical database using GIT-tree

? X '?T ?

6

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

First, we create the minimum support table of items based on equation 3, then create parent-child relation table in hierarchical tree G. Finally, algorithm sorts the IMS in increasing order of minimum support (aim to create set F that includes single items satisfying minimum support threshold of the smallest minimum support item). Function ENUMERATE_GENERALIZED_FIs(Lr) creates GIT-tree to mine generalized frequent itemsets. It creates a new equivalence class Lc by considering every Y after X to form itemset X’ and Tidset of X’ (T). If items in X have not parent-child relation each other, we consider whether its support satisfies the minimum support or not (ms(X’) is computed by remark 1). If it satisfies ms(X’), then we add this node to Lc.

4.2. Illustration Consider the database in Table 6, we have results as follows:

Figure 3. GIT-tree for mining generalized frequent itemsets

Each node in GIT-tree includes 3 elements: itemset, Tidset and ms. Example: DG belongs to transactions (tids) 1, 4 and ms(DG) = 1. When we combine nodes X, Y at higher level to be node at lower level, we compute the intersection between two tidsets and find min{ms(X), ms(Y)}. Example: Consider the combination between D and G to be DG, we compute Tidset(DG) = Tidset(D) ? Tidset(G) = 14, and then compute ms(DG) = min{ms(D), ms(G)} = min{1, 2} = 1. Because |Tidset(DG)| ? ms(DG) so we add DG to next level. Note: Although GI has support is 3 (Tidset(GI) = Tidset(G) ? Tidset(I) = 134 ? 1234 = 134) ≥ ms(GI) = min(ms(G), ms(I)) = 2, but I is a generalized item of G, GI does not combine together.

7

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

4.3. Diffset for fast computing the support In [7], authors used Diffset for fast computing the support of itemset and saving memory that stores Tidset. We also use it for mining generalized frequent itemsets to reduce run-time and memory.

Table 8. Average size of Tidset and Diffset in database from UCI [7]

Database chess connect mushroom pumsb_star pumsb T10I4D100K T40I10D100K

MinSup (%) 0.5 90 5 35 90 0.1 0.5

Avg. of Diffset size 26 143 60 301 330 31 96

Avg. of Tidset size 1820 62204 622 18977 45036 230 755

Scale Tidset/Diffset 70 434.99 10.37 63.04 136.47 7.42 7.86

5. Experimental results

Experimental results are performed in databases from Microsoft Foodmart2000 of Microsoft SQL2000. We call the algorithm based on GIT-tree is MMS_GIT-Tree. Database Foodmart is results from sales_fact_1997 and synthetized database is gotten from sales_fact_1997, sales_fact_1998 and sales_fact_dec_1998 in Foodmart2000. Hierarchical items include 3 levels: 1560 items in level 1 (products), 110 general items in level 2 (product subset) and 47 general items in top level (product types). Both of them have 5581 transactions. For accurate purpose, we run 5 times with each minConf, and the result is averaged of 5 times.

Table 9. Comparing run-time in database Sales_fact_1997 with minConf thresholds

minConf (%) 90 85 80 75 70 65 60 55 50

Time (s) MMS_Cumulate 25.14 25.38 26.12 27.86 30.92 39.25 57.69 104.85 257.36 MMS_GIT-Tree 24.68 24.82 24.96 25.05 25.21 25.39 26.85 27.09 27.36

8

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

Figure 4. Comparing the run-time between MMS_Cumulate and MMS_GIT-Tree in Sales_fact_1997 Table 10. Comparing the run-time in database sales_fact_synthetized

minConf (%) 90 85 80 75 70

Time (s) MMS_Cumulate MMS_GIT-Tree 104.36 101.88 115.83 102.29 156.22 103.02 252.91 103.34 580.10 108.21

Figure 5. Comparing run-time between MMS_Cumulate and MMS_GIT-Tree in Sales_fact_synthetized

From Figures 4 and 5, we see that the run-time based on GIT-tree is more effective than that of MMS_Cumulate, especially when minConf is low. It happens because the smaller the minConf is, the larger the number of candidates MMS_Cumulate are. This costs a lot of time to mine candidates and compute the support of candidates. In contrast, GIT-tree based on the intersection of Tidset to compute the support of itemsets fast, so the mining time is faster.

6. Conclusion and future works

9

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

Identifying the minimum support (minSup) for mining association rules in database and hierarchical database has many difficulties. Thus, authors in [5] proposed the method to direct compute the minimum support of items based on their support. However, the Apriori-based algorithm consumed a lot of time. This paper introduces an efficient algorithm to mine frequent itemsets in hierarchical database with multiple minimum supports that based on GIT-tree. Experimental results show the effect of proposed algorithm. In future, we will develop the efficient algorithm for fast mining generalized association rules which are generated among generalized frequent itemsets. Besides, the evaluation of rules through measures is considered to find the best rules for users. Next, efficient algorithm for mining frequent closed itemsets from hierarchical database will be discussed.

References

[1] A. Savasere, E. Omiecinski, S. Navathe, “An efficient algorithm for mining association rules in large databases”, in: Proc. 21st Int. Conf. on Very Large Data Bases, Zurich, Switzerland, 1995, pp. 432–444. [2] B. Liu, W. Hsu, Y. Ma, “Mining association rules with multiple minimum supports”, in: Proc. 1999 Int. Conf. on Knowledge Discovery and Data Mining, San Deige, CA, 1999, pp. 337–341. [3] J. Han, Y. Fu, “Discovery of multiple-level association rules from large databases”, in: Proc. 21st Int. Conf. on Very Large Data Bases, Zurich, Switzerland, pp. 420–431, 1995. [4] J. Han, M. Kamber, “Data Mining: Concepts and Techniques”, Morgan Kaufmann Publishers, pp. 250 – 254, 2006. [5] M.C. Tseng , W.Y. Lin, “Efficient mining of generalized association rules with non-uniform minimum support”, Data & Knowledge Engineering 62, ScienceDirect, pp. 41–64, 2007. [6] M. J. Zaki, C.J. Hsiao, “Efficient Algorithms for Mining Closed Itemsets and Their Lattice Structure”, IEEE Transactions on Knowledge and Data Engineering, Vol. 17, No 4, April 2005, pp. 462-478, 2005. [7] M.J. Zaki and K. Gouda, “Fast Vertical Mining Using Diffsets”, in: Proc. Ninth ACM SIGKDD Int’l Conf. Knowledge Discovery and Data Mining, Aug. 2003, pp. 326–335. [8] R. Agrawal, R. Srikant, “Fast algorithms for mining generalized association rules”, in: Proceedings of the 20th International Conference on Very Large Databases (VLDB94), Santiago, Chile, pp. 487–499, 1994. [9] R. Agrawal, T. Imielinski, A. Swami, “Mining association rules between sets of items in large databases”, in: Proc. 1993 ACMSIGMOD Int. Conf. on Management of Data, Washington, DC, pp. 207–216, 1993. [10] R. Srikant, R. Agrawal, “Mining generalized association rules”, Future Generation Computer Systems 13 (2– 3), pp. 161–180, 1997. [11] S. Brin, R. Motwani, C. Silverstein, “Beyond market baskets: generalizing association rules to correlations”, in: Proc. 1997 ACMSIGMOD Int. Conf. on Management of Data, pp. 207–216, 1997.

10

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

Authors

Bay Vo is currently Ph.D student at Computer Science department, University of Science, Ho Chi Minh City, Vietnam. He received his Bachelor of Science (2002) and Master of Science (2005) degrees from University of Science, Ho Chi Minh City, Vietnam. His research interests include association rules, classification, data mining in multidimensional database, distributed database and privacy preserving in data mining. Bac Le received the BSc degree, in 1984, the MSc degree, in 1990, and the PhD degree in Computer Science, in 1999. He is an Associate Professor, Vice Dean of Faculty of Information Technology, Head of Department of Computer Science, University of Science, Ho Chi Minh City. His research interests are in Artificial Intelligent, Soft Computing, and Knowledge Discovery and Data Mining.

11

International Journal of Database Theory and Application Vol. 2, No. 3, September 2009

12

相关文章:

- 翻译A fast learning algorithm for deep belief nets
- 翻译A
*fast*learning*algorithm**for*deep belief nets_计算机软件及应用_IT/计算机_专业资料。Hiton论文A*fast*learning*algorithm**for*deep belief nets的翻译。DBN...

- data mining习题
*generalized*data tuple (i.e., of each row ...List all*association**rules*that satisfy the above...*algorithm**for*the example given in the section ...

- 计算机百篇经典文献目录
- Extending attribute-oriented induction
*algorithm**for*...*association**rules**mining**for*protein homology ...Collection Statistics*for**Fast*Duplicate. 171-190....

- ...A Generalized Minimal Residual Algorithm for Sol...
- GMRES A
*Generalized*Minimal Residual*Algorithm**for*Solving Nonsymmetric Linear ...H k yk . As k increases, the expense of the GMRES increases*fast*. ...

- ...processing-Position and Economy Data Mining In B...
- We define the
*association**rule*as the following*rule*where we set the ...The improved*algorithm*can be*generalized*in the following aspects. a) ...

更多相关标签:

- A Fast Distributed Algorithm for Mining Association Rules (1996)
- Fast Algorithms for Mining Association Rules
- QuantMiner A Genetic Algorithm for Mining Quantitative Association Rules
- A New Parallel Algorithm for Mining Association Rules
- A New Hybrid Algorithm for Association Rule Mining
- An effective hash-based algorithm for mining association rules
- An Efficient Parallel Algorithm for Mining Association Rules in Large Databases
- Charm An efficient algorithm for closed association rule mining
- Itemset Materializing for Fast Mining of Association Rules
- Abstract Fast Algorithms for Mining Association Rules