A maximum discrimination DEA method for ranking association rules in data mining
- 14 April 2011
- journal article
- research article
- Published by Taylor & Francis in International Journal of Computer Mathematics
- Vol. 88 (11) , 2233-2245
Abstract
A data mining algorithm, such as Apriori, discovers a huge number of association rules (ARs) and therefore efficiently ranking all these rules is an important issue. This paper suggests a data envelopment analysis (DEA) method for ranking the discovered ARs using a maximum discrimination between the interestingness criteria defined for all ARs. It is shown that the proposed DEA model has a unique optimal solution which can be computed efficiently when the maximum discrimination between the criteria, the difference between DEA weights, is considered. The contribution of this study can be explained as follows: First, we show that using the conventional DEA model for ranking ARs may produce an invalid result because the weights corresponding to interestingness criteria would not discriminate between the criteria. This is investigated for a dataset consisting of 46 ARs with four criteria, namely support, confidence, itemset value and cross-selling. The paper also introduces the maximum discrimination between the weights of the criteria and obtains the optimal solution of the corresponding DEA model efficiently without the need of solving the related mathematical models. On the other hand, this model concludes less number of useful rule(s). A comparative analysis is then used to show the advantage of the proposed DEA method.Keywords
This publication has 18 references indexed in Scilit:
- A new data envelopment analysis method for priority determination and group decision making in the analytic hierarchy processEuropean Journal of Operational Research, 2009
- A new method for ranking discovered rules from data mining by DEAExpert Systems with Applications, 2009
- Improved common weight MCDM model for technology selectionInternational Journal of Production Research, 2008
- Ranking discovered rules from data mining with multiple criteria by data envelopment analysisExpert Systems with Applications, 2007
- Interestingness measures for data miningACM Computing Surveys, 2006
- Data envelopment analysis for weight derivation and aggregation in the analytic hierarchy processComputers & Operations Research, 2006
- Prioritization of association rules in data mining: Multiple criteria decision approachExpert Systems with Applications, 2005
- K-Optimal Rule DiscoveryData Mining and Knowledge Discovery, 2005
- Content analysis of data envelopment analysis literature and its comparison with that of other OR/MS fieldsJournal of the Operational Research Society, 2004
- Mining association rules between sets of items in large databasesACM SIGMOD Record, 1993