Re-Mining Association Mining Results Through Visualization, Data Envelopment Analysis, and Decision Trees

  • Gurdal ErtekEmail author
  • Murat Mustafa Tunc
Part of the Atlantis Computational Intelligence Systems book series (ATLANTISCIS, volume 6)


Re-mining is a general framework which suggests the execution of additional data mining steps based on the results of an original data mining process. This study investigates the multi-faceted re-mining of association mining results, develops and presents a practical methodology, and shows the applicability of the developed methodology through real world data. The methodology suggests re-mining using data visualization, data envelopment analysis, and decision trees. Six hypotheses, regarding how re-mining can be carried out on association mining results, are answered in the case study through empirical analysis.


Data Envelopment Analysis Association Rule Data Envelopment Analysis Model Industrial Engineer Frequent Itemsets 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    J. Han, M. Kamber, and J. Pei, Data Mining: concepts and techniques, (2011).Google Scholar
  2. 2.
    A. Demiriz, G. Ertek, T. Atan, and U. Kula, Re-mining item associations: Methodology and a case study in apparel retailing, Decision Support Systems, 52 (1), pp. 284–293, (2011).Google Scholar
  3. 3.
    G. Ertek and A. Demiriz, A framework for visualizing association mining results, Lecture Notes in Computer Science (LNCS), 4263, pp. 593–602, (2006).Google Scholar
  4. 4.
    G. Ertek, M. Kaya, C. Kefeli, O. Onur, and K. Uzer, Scoring and Predicting Risk Preferences, in Behavior Computing: Modeling, Analysis, Mining and Decision, Cao, L., Yu, P.S. (Eds.), Springer, (2012).Google Scholar
  5. 5.
    R. Agrawal, T. Imielinski, and A.N. Swami, Mining association rules between sets of items in large databases,in SIGMOD Conference, P. Buneman and S. Jajodia, (Eds.), (1993).Google Scholar
  6. 6.
  7. 7.
  8. 8.
    Weka. September 11, 2012 18:42 Atlantis Press Book - 9.75in x 6.5in book_Kahraman Bibliography 621
  9. 9.
    C. Borgeltand and R. Kruse, Graphical models: methods for data analysis and mining, Wiley, (2002).Google Scholar
  10. 10.
    E.N. Cinicioglu, G. Ertek, D. Demirer, and H.E. Yoruk, A framework for automated association mining over multiple databases, in Innovations in Intelligent Systems and Applications (INISTA), International Symposium, IEEE, (2011).Google Scholar
  11. 11.
    A. Savasere, E. Omiecinski, and S. Navathe, Mining for strong negative associations in a large database of customer transactions, in Data Engineering, Proceedings, 14th International Conference, IEEE, (1998).Google Scholar
  12. 12.
    P.N. Tan, V. Kumar, and H.Kuno, in Western Users of SAS Software Conference, (2001).Google Scholar
  13. 13.
    I. Herman, G.Melancon, andM.S.Marshall, Graph visualization and navigation in information visualization: A survey, Visualization and Comp. Graphics, 6, (2000).Google Scholar
  14. 14.
    M. Van Kreveld and B. Speckmann, Graph Drawing, Lecture Notes in Computer Science (LNCS), 7034, (2012).Google Scholar
  15. 15.
    R. Spence, Information Visualization, ACM Press, (2001).Google Scholar
  16. 16.
    H. Ltifi, B. Ayed, A.M. Alimi, and S. Lepreux, Survey of information visualization techniques for exploitation in KDD, in Int. Conf. Comp. Sys.and App., (2009).Google Scholar
  17. 17.
    C. Chen, Information Visualization, Wiley Interdisciplinary Reviews: Computational Statistics, 2, (2010).Google Scholar
  18. 18.
    G. Ertek, A. Demiriz, and F. Çakmak, Linking Behavioral Patterns to Personal Attributes through Data Re-Mining, in Behavior Computing: Modeling, Analysis, Mining and Decision, Cao, L., Yu, P.S. (Eds.), Springer, (2012).Google Scholar
  19. 19.
    W.W. Cooper, L.M. Seiford, and K. Tone, Introduction to Data Envelopment Analysis and Its Uses: With DEA Solver Software and References, Springer, (2006).Google Scholar
  20. 20.
    S. Gattoufi, M. Oral, and A. Reisman, Data envelopment analysis literature: A bibliography update (1951–2001), Journal of Socio-Econ. Planning Sci., 38, pp. 159–229, (2004).Google Scholar
  21. 21.
    L. Page, S. Brin, R. Motwani, and T. Winograd, The PageRank Citation Ranking: Bringing Order to the Web, The PageRank Citation Ranking: Bringing Order to the Web, (1999).Google Scholar
  22. 22.
    D.J.Watts and S. Strogatz, Collective dynamics of ‘small-world’ networks, Nature, 393, (1998).Google Scholar
  23. 23.
    T. Opsahl, F. Agneessens, and J. Skvoretz, Node centrality in weighted networks: Generalizing degree and shortest paths, Social Networks, 32, pp. 245, (2010).Google Scholar
  24. 24.
    C. Christensen and A. Réka, Using graph concepts to understand the organization of complex systems, International Journal of Bifurcation and Chaos, 17, pp. 2201–2214, (2007).Google Scholar
  25. 25.
    C.F. Chien and L.F. Chen, Data mining to improve personnel selection and enhance human capital: A case study in high-technology industry, Expert Systems with Applications, 34, pp. 280–290, (2008).Google Scholar
  26. 26.
    J.R. Quinlan, Induction of decision trees, Machine Learning, 1 (1), pp. 81–106, (1986).Google Scholar
  27. 27.
  28. 28.
    E. Alpaydin, Introduction to Machine Learning, The MIT Press, (2010).Google Scholar
  29. 29.
    P.N. Tan, M. Steinbach, and V. Kumar, Introduction to Data Mining, Pearson Addison Wesley, (2006).Google Scholar
  30. 30.
    B. Bollobas, Modern Graph Theory, Springer, (1998).Google Scholar
  31. 31.
    J.L. Gross and J. Yellen, Handbook of Graph Theory, CRC Press, (2003).Google Scholar
  32. 32.
    M.E.J. Newman, Networks: An Introduction, Oxford University Press, (2010).Google Scholar
  33. 33.
  34. 34.
    T.M.J. Fruchterman and E.M. Reingold, Graph Drawing by Force-Directed Placement, SoftwarePractice & Experience, 21 (11), pp. 1129–1164, (1991).Google Scholar
  35. 35.
    E.M. Bonsignore, C. Dunne, D. Rotman, M. Smith, T. Capone, D.L. Hansen, and B. Shneiderman, First Steps to NetViz Nirvana: Evaluating Social Network Analysis with NodeXL, in International Symposium on Social Intelligence and Networking, (2009).Google Scholar
  36. 36.
    [36] NodeXL. September 11, 2012 18:42 Atlantis Press Book - 9.75in x 6.5in book_Kahraman Computational Intelligence Systems in Industrial Engineering
  37. 37.
    A.E. Akcay, G. Ertek, and G. Buyukozkan, Analyzing the solutions of DEA through information visualization and data mining techniques: SmartDEA framework, Expert Systems with Applications, 39, pp. 7763–7775, (2012).Google Scholar
  38. 38.
    T. Curk, J. Demsar, Q. Xu, G.Leban, U. Petrovic, I. Bratko, G. Shaulsky, and B. Zupan, Microarray data mining with visual programming, Bioinformatics, 21 (3), pp. 396–398, (2005).Google Scholar
  39. 39.
    R.D. Banker, A. Charnes, andW.W. Cooper, Some models for estimating technical and scale inefficiencies in data envelopment analysis, Management Science. 30 (9), pp. 1078–1092, (1984).Google Scholar

Copyright information

© Atlantis Press 2012

Authors and Affiliations

  1. 1.Faculty of Engineering and Natural SciencesSabanci UniversityTuzla, IstanbulTurkey

Personalised recommendations