Data mining: past, present and future

  title={Data mining: past, present and future},
  author={Frans Coenen},
  journal={The Knowledge Engineering Review},
  pages={25 - 29}
  • Frans Coenen
  • Published 1 February 2011
  • Computer Science
  • The Knowledge Engineering Review
Abstract Data mining has become a well-established discipline within the domain of artificial intelligence (AI) and knowledge engineering (KE). It has its roots in machine learning and statistics, but encompasses other areas of computer science. It has received much interest over the last decade as advances in computer hardware have provided the processing power to enable large-scale data mining to be conducted. Unlike other innovations in AI and KE, data mining can be argued to be an… 
Data mining applications and techniques : a systematic review
The aim of this paper is to present a systematic review about the data mining techniques and tasks, showing the applicability on several and multidisciplinary areas.
A Brief Review of Alternative Uses of Data Mining: Education, Engineering, & Others
A review or survey of alternative uses of data mining in education, medicine, and engineering were discussed and the increasing need for finding more hidden information in large amounts of data was discussed.
Data warehouse state of the art and future challenges
The data warehousing is introduced, terminologies necessary for understanding the process are given, and its evolution is summarized; an analysis of the latest research in the field is presented, and the future trends are explored.
Application of Data Mining Techniques for Customer Segmentation in Real Time Business Intelligence
The paper aimed to study different DM techniques used so far for customer segmentation in online retail Industry to identify the gaps from previous studies which can be helpful for further research in the field.
Information Mining Technologies to Enable Discovery of Actionable Intelligence to Facilitate Maritime Situational Awareness: I-MINE
An extensive review and explores potential use of available information/data mining technologies by maritime analysts to enable discovery of actionable intelligenceto facilitate maritime situational awareness and assessments of selected data mining tools using the scenarios of potential interest to the maritime environment.
Abstract Mining Association Rules Events over Data Streams
This thesis focuses on developing a data stream association rule mining algorithm among co-occurring events that is efficient and effective in extracting association rules from data streams, thus having a faster processing time and better memory management.
A Novel Approach for Association Mining Based on Matrix Factorization and Deep Neural Network
A viable instance of applying market basket analysis on a certifiable deals exchange informational collection utilizing time arrangement grouping, as opposed to utilizing customary affiliation manage mining.
The Effect of Data Mining Based on Association Rules in Strategic Management
Strategic planning in the organizations asks for high consideration in required data mining. The challenge with which the strategists confront is the interchangeable nature of the data. Applying data
Mining frequent pattern with Attribute Oriented Induction High Level Emerging Pattern (AOI-HEP)
  • H. L. Warnars
  • Computer Science
    2014 2nd International Conference on Information and Communication Technology (ICoICT)
  • 2014
How AOI-HEP mining technique can be used to mine frequent pattern is explained and it is shown that adult dataset which learn on workclass attribute had AOi-H EP mining interest for frequent pattern and there are four frequent patterns which have strong discrimination rule.
Data mining for microbiologists


The KDD process for extracting useful knowledge from volumes of data
A new generation of computational techniques and tools is required to support the extraction of useful knowledge from the rapidly growing volumes of data, the subject of the emerging field of knowledge discovery in databases (KDD) and data mining.
Integrating Classification and Association Rule Mining
The integration is done by focusing on mining a special subset of association rules, called class association rules (CARs), and shows that the classifier built this way is more accurate than that produced by the state-of-the-art classification system C4.5.
Mining frequent patterns without candidate generation
This study proposes a novel frequent pattern tree (FP-tree) structure, which is an extended prefix-tree structure for storing compressed, crucial information about frequent patterns, and develops an efficient FP-tree-based mining method, FP-growth, for mining the complete set of frequent patterns by pattern fragment growth.
BIRCH: an efficient data clustering method for very large databases
A data clustering method named BIRCH (Balanced Iterative Reducing and Clustering using Hierarchies) is presented, and it is demonstrated that it is especially suitable for very large databases.
Classification and regression trees
  • W. Loh
  • Computer Science
    WIREs Data Mining Knowl. Discov.
  • 2011
This article gives an introduction to the subject of classification and regression trees by reviewing some widely available algorithms and comparing their capabilities, strengths, and weakness in two examples.
C4.5: Programs for Machine Learning
A complete guide to the C4.5 system as implemented in C for the UNIX environment, which starts from simple core learning methods and shows how they can be elaborated and extended to deal with typical problems such as missing data and over hitting.
Mining association rules between sets of items in large databases
An efficient algorithm is presented that generates all significant association rules between items in the database of customer transactions and incorporates buffer management and novel estimation and pruning techniques.
Some methods for classification and analysis of multivariate observations
The main purpose of this paper is to describe a process for partitioning an N-dimensional population into k sets on the basis of a sample. The process, which is called 'k-means,' appears to give
On Classification and Regression
A unified framework to approach the problem of computing various types of expressive tests for decision tress and regression trees is presented, and the design of efficient algorithms for computing important special cases is revisited.
Idiot's Bayes—Not So Stupid After All?
Folklore has it that a very simple supervised classification rule, based on the typically false assumption that the predictor variables are independent, can be highly effective, and often more