Академический Документы
Профессиональный Документы
Культура Документы
Privacy 3arallel Algorithm for Mining Association Rules and Its Application in HRM
ID 1 2 3 4 5
The branch of each D ' FP (such as D '=F3 or H25˅are
Item a-FP b- FP c- FP d- FP e- FP both ending in F3 or H25,and the support counting just equal
Flag 0 0 0 0 0
to the weight of the leafy node which on the basis of the
A: 192.168. B: 192.168.
IP
192.168.0.14 0.1 192.168.0.1
192.168.0.1
0.1 theory monotonic property of support measurement. so the
frequent item sets generated by a'-FP tree are as follows:
297
F3:6,G18F3:4, and the frequent item sets generated by c'-FP IF(EXISTS(SELECT * FROM distribute_table
are as the following: H25:6, F9H25:4,G6H25:4, G6F25:2. WHERE flag!=0))
null
BEGIN
G18:7 F3:2 SET @id=mod(rand()*100,@n)
VXSSRUW QRGH
UPDATE distribute_table
,' G18 F3
FRXQWLQJ SRLQWHU SET ip=@sub_IP, Flag=1 WHERE id=@id
) F3:4
END
F3 END
/*Frequent-item-set mapping*/
Figure 4. a'-FP tree
CREATE PROCEDURE Frequent_itemsets_convert
@sub_IP varchar(50),@item varchar(50)
null AS
G6:7 F9:2
BEGIN
,'
VXSSRUW QRGH G6 F9 SELECT * INTO path_temp
FRXQWLQJ SRLQWHU F9:4 H25:2
+ H25:2 FROM (SELECT *
F9
H25
H25 FROM FP_Tree
H25:2 WHERE (path_id IN
H25 (SELECT path_id
FROM FP_Tree
WHERE item = @item))) DERIVEDTBL
Figure 5. c'-FP tree
WHERE (itemid BETWEEN 1 AND
The results produced by each sub computer should to (SELECT item_id
return to the host, afterwards, reduced according to TableĊ. FROM FP_Tree
At last the frequent item sets of a'-FP tree are reduced as WHERE (item = @item)
follows:a:4,ba:4; the frequent item sets of c'-FP tree are GROUP BY itemid))
reduced as the following :c:6,ac:4,bc:4,bac:2. In the process ORDER BY id
it shows that due to the differences of each elements of
frequent item sets and inability of reversing the frequent SELECT item, alias INTO hash_table_temp
item sets ,the privacy protection of data is completed . FROM hash_table
WHERE(g_item=@item)
C. Related Property and Theorem [11] UPDATE path_temp
SET ip=@sub_IP, alias=(SELECT TOP 1 alias
z Property of frequent item sets: if an item set is FROM hash_table_temp
frequent, then all of its subsets must also be frequent. WHERE item = path_temp.item)
z Monotonicity Property of support counting: Let I
be a set of items, and J=2I be the power set of I. A III. PERFORMANCE EVALUATION
measure f is monotone(or upward closed) if The performance of this article three set of PC which
X , Y J : ( X Y ) o f ( X ) d f (Y ) have the equivalent configuration as follows: Pentium
which means that if X is a subset of Y, then f(x) must IV2.0GHz CPUˈ512MB Memory ,Window XP Operating
not exceed f(Y). On the other hand ,f is anti-monotone(or System, SQL Sever 2000 database platform ,C# Language.
downward closed) if Tableč displays the hash code of frequent 1-
X , Y J : ( X Y ) o f (Y ) d f ( X ) itemsets .TableĎ, Table ď showed the frequent item sets of
which means that if X is a subset of Y, then f(Y) must not each sub-computer respectively.
exceed f(X).
TABLE V. THE HASH TABLE OF TEST DATABASE
D. Key algorithms item G_01 G_02 G_03 G_04 G_11 G_12
/* The distribution of suffixed FP-tree*/ Nationality: hui| A3 A30 A111 A103 A113 A109
CREATE PROCEDEURE Sub_FPtree_assignment Register State:| B32 B126 B148 B25 B127 B43
(@sub_IP varchar(50))
Sex: female | C112 C7 C147 C139 C126 C111
AS
BEGIN Position: salesman| D81 D168 D9 D145 D29 D109
DECLARE @id int,@n int Body_weight::45-55| E125 E43 E46 E167 E31 E45
SELECT @n=count(item) FROM distribute_table --
Nationality: han| F76 F34 F28 F84 F122 F77
Sub_tree Dispatch Table
298
Education: student| G70 G29 G149 G28 G105 G136 strategy of taking the sub-machine IP as a hash factor ,so as
Body_height:160-170| H46 H2 H96 H28 H67 H63
to achieve the dual mapping of Hash frequent item sets,
ultimately to protect the privacy of association rules. The
Body_height:150-160| I7 I136 I131 I140 I85 I137 experiments show that the algorithm for data privacy
Age:20-23| J135 J139 J101 J126 J61 J13 protection has played a good role and is practical.
Nationality: bachelor| K84 K152 K164 K156 K82 K146
ACKNOWLEDGMENT
Register-State: chore| L47 L136 L12 L165 L138 L58
This work is supported by Program for New Century
Age:22-24| M76 M160 M30 M48 M63 M7 Excellent Talents in University of Ministry of Education(NCET-
08-0660),Open Fund Item of Key Laboratory of Spatial Data
Mining & Information Sharing of Ministry of Education(200807),
Sponsored by Program for Science & Technology Innovation
TABLE VI. THE FREQUENT ITEMSETS OF SUB COMPUTER A Talents in Universities of Henan Province(2008HASTIT012),
National Science Foundation of Henan Province(0511011000),
)UHTXHQWB,WHPBVHW OHYHO VXSSRUW &KHFN6XP Science and Technology key projects of Henan
Province(0624220081) and Science and Technology key projects
(_)_,_-_*_
of Zhen Zhou(064SGDG25127-9). Moreover, this project is a part
%_(_)_,_*_ of PH.D. Programs Foundation Research Projects of Henan
University of Technology.
%_(_)_-_*_
299