Interesting rules mining with deductive method

Wenxiang Dou, Takayuki Furuzuki, Gengfeng Wu

Research output: Chapter in Book/Report/Conference proceedingConference contribution

1 Citation (Scopus)

Abstract

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.

Original languageEnglish
Title of host publicationICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings
Pages142-146
Number of pages5
Publication statusPublished - 2009
EventICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009 - Fukuoka
Duration: 2009 Aug 182009 Aug 21

Other

OtherICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009
CityFukuoka
Period09/8/1809/8/21

Fingerprint

Dynamic response
Association rules
Data mining

ASJC Scopus subject areas

  • Information Systems
  • Control and Systems Engineering
  • Industrial and Manufacturing Engineering

Cite this

Dou, W., Furuzuki, T., & Wu, G. (2009). Interesting rules mining with deductive method. In ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings (pp. 142-146). [5333415]

Interesting rules mining with deductive method. / Dou, Wenxiang; Furuzuki, Takayuki; Wu, Gengfeng.

ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings. 2009. p. 142-146 5333415.

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Dou, W, Furuzuki, T & Wu, G 2009, Interesting rules mining with deductive method. in ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings., 5333415, pp. 142-146, ICROS-SICE International Joint Conference 2009, ICCAS-SICE 2009, Fukuoka, 09/8/18.
Dou W, Furuzuki T, Wu G. Interesting rules mining with deductive method. In ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings. 2009. p. 142-146. 5333415
Dou, Wenxiang ; Furuzuki, Takayuki ; Wu, Gengfeng. / Interesting rules mining with deductive method. ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings. 2009. pp. 142-146
@inproceedings{23de531117a84d3580d27ce3b8f9e653,
title = "Interesting rules mining with deductive method",
abstract = "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.",
author = "Wenxiang Dou and Takayuki Furuzuki and Gengfeng Wu",
year = "2009",
language = "English",
isbn = "9784907764333",
pages = "142--146",
booktitle = "ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings",

}

TY - GEN

T1 - Interesting rules mining with deductive method

AU - Dou, Wenxiang

AU - Furuzuki, Takayuki

AU - Wu, Gengfeng

PY - 2009

Y1 - 2009

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

SP - 142

EP - 146

BT - ICCAS-SICE 2009 - ICROS-SICE International Joint Conference 2009, Proceedings

ER -