TY - GEN
T1 - Interesting rules mining with deductive method
AU - Dou, Wenxiang
AU - Hu, Jinglu
AU - Wu, Gengfeng
PY - 2009/12/1
Y1 - 2009/12/1
N2 - In this paper, we propose a novel rule deductive method to mine the real demanded association rules for any given user. This method does not like the most existing methods that mine frequent itemsets starting from candidate two-itemsets to candidate (n-1)-itemsets with inductive method and produce huge rough rules on these frequent itemsets. On the contrary, it avoids producing huge amounts of frequent itemsets contained by their upper long frequent itemsets and can interact with users by making them pick up their interested items to deduce the final interesting association rules. Moreover, it can do dynamic response to users in any time when users want to check whether their interested frequent itemsets have been founded. Its several dynamic response strategies have been proposed. These dynamic response algorithms can find most long frequent itemsets in initial time. Therefore, users can find their interested rules in short time with high probability. So, our method also can be used applied in online data mining.
AB - In this paper, we propose a novel rule deductive method to mine the real demanded association rules for any given user. This method does not like the most existing methods that mine frequent itemsets starting from candidate two-itemsets to candidate (n-1)-itemsets with inductive method and produce huge rough rules on these frequent itemsets. On the contrary, it avoids producing huge amounts of frequent itemsets contained by their upper long frequent itemsets and can interact with users by making them pick up their interested items to deduce the final interesting association rules. Moreover, it can do dynamic response to users in any time when users want to check whether their interested frequent itemsets have been founded. Its several dynamic response strategies have been proposed. These dynamic response algorithms can find most long frequent itemsets in initial time. Therefore, users can find their interested rules in short time with high probability. So, our method also can be used applied in online data mining.
UR - http://www.scopus.com/inward/record.url?scp=77951103945&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=77951103945&partnerID=8YFLogxK
M3 - Conference contribution
AN - SCOPUS:77951103945
SN - 9784907764333
T3 - ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings
SP - 142
EP - 146
BT - ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings
T2 - ICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009
Y2 - 18 August 2009 through 21 August 2009
ER -