Mining actionable knowledge using reordering based diversified actionable decision trees

12Citations
Citations of this article
14Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Actionable knowledge discovery plays a vital role in industrial problems such as Customer Relationship Management,insurance and banking. Actionable knowledge discovery techniques are not only useful in pointing out customers who are loyal and likely attritors,but it also suggests actions to transform customers from undesirable to desirable. Postprocessing is one of the actionable knowledge discovery techniques which are efficient and effective in strategic decision making and used to unearth hidden patterns and unknown correlations underlying the business data. In this paper,we present a novel technique named Reordering based Diversified Actionable Decision Trees (RDADT),which is an effective actionable knowledge discovery based classification algorithm. RDADT contrasts traditional classification algorithms by constructing committees of decision trees in a reordered fashion and discover actionable rules containing all the attributes. Experimental evaluation on UCI benchmark data shows that the proposed technique has higher classification accuracy than traditional decision tree algorithms.

Cite

CITATION STYLE

APA

Subramani, S., Wang, H., Balasubramaniam, S., Zhou, R., Ma, J., Zhang, Y., … Rangarajan, S. (2016). Mining actionable knowledge using reordering based diversified actionable decision trees. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 10041 LNCS, pp. 553–560). Springer Verlag. https://doi.org/10.1007/978-3-319-48740-3_41

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free