TY - GEN
T1 - Exception rule mining with a relative interestingness measure
AU - Hussain, Farhad
AU - Liu, Huan
AU - Suzuki, Einoshin
AU - Lu, Hongjun
N1 - Publisher Copyright:
© Springer-Verlag Berlin Heidelberg 2000.
PY - 2000
Y1 - 2000
N2 - This paper presents a method for mining exception rules based on a novel measure which estimates interestingness relative to its corresponding common sense rule and reference rule. Mining interesting rules is one of the important data mining tasks. Interesting rules bring novel knowledge that helps decision makers for advantageous actions. It is true that interestingness is a relative issue that depends on the other prior knowledge. However, this estimation can be biased due to the incomplete or inaccurate knowledge about the domain. Even if possible to estimate interestingness, it is not so trivial to judge the interestingness from a huge set of mined rules. Therefore, an automated system is required that can exploit the knowledge extractacted from the data in measuring interestingness. Since the extraicted knowledge comes from the data, so it is possible to find a measure that is unbiased from the user's own belief. An unbiased measure that can estimate the interestingness of a rule with respect to the extractacted rules can be more acceptable to the user. In this work we try to show through the experiments, how our proposed relative measure can give an unbiased estimate of relative interestingness in a rule considering already mined rules.
AB - This paper presents a method for mining exception rules based on a novel measure which estimates interestingness relative to its corresponding common sense rule and reference rule. Mining interesting rules is one of the important data mining tasks. Interesting rules bring novel knowledge that helps decision makers for advantageous actions. It is true that interestingness is a relative issue that depends on the other prior knowledge. However, this estimation can be biased due to the incomplete or inaccurate knowledge about the domain. Even if possible to estimate interestingness, it is not so trivial to judge the interestingness from a huge set of mined rules. Therefore, an automated system is required that can exploit the knowledge extractacted from the data in measuring interestingness. Since the extraicted knowledge comes from the data, so it is possible to find a measure that is unbiased from the user's own belief. An unbiased measure that can estimate the interestingness of a rule with respect to the extractacted rules can be more acceptable to the user. In this work we try to show through the experiments, how our proposed relative measure can give an unbiased estimate of relative interestingness in a rule considering already mined rules.
UR - http://www.scopus.com/inward/record.url?scp=84942772223&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84942772223&partnerID=8YFLogxK
U2 - 10.1007/3-540-45571-x_11
DO - 10.1007/3-540-45571-x_11
M3 - Conference contribution
AN - SCOPUS:84942772223
SN - 3540673822
SN - 9783540673828
T3 - Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)
SP - 86
EP - 97
BT - Knowledge Discovery and Data Mining
A2 - Terano, Takao
A2 - Liu, Huan
A2 - Chen, Arbee L.P.
PB - Springer Verlag
T2 - 4th Pacific-Asia Conference on Knowledge Discovery and Data Mining, PAKDD 2000
Y2 - 18 April 2000 through 20 April 2000
ER -