Knowledge Discovery in Databases (KDD) with Images: A Novel Approach toward Image Mining and Processing

We are in an age often referred to as the information age. In this information age, because we believe that information leads to power and success, from the technologies such as computers, satellites, etc., we have been collecting tremendous amounts of information. Our ability to analyze and understand massive datasets lags far behind our ability to gather and store data. Image and video data contains abundant, rich information for data miners to explore. On one hand, the rich literature on image and video data analysis will naturally provide many advanced methods that may help mining other kinds of data. On the other hand, recent research on data mining will also provide some new, interesting methods that may benefit image and video data retrieval and analysis. Today, a lot of data is available everywhere but the ability to understand and make use of that data is very less. Whether the context is business, medicine, science or government, the datasets themselves are of little value. What is of value is the knowledge that can be inferred from the data and put to use. We need systems which would analyze the data for us. This paper basically aims to find out important pixels of an image using one of the classification technique named as decision tree (ID-3). Our aim is to separate the important and unimportant pixels of an image using simple rules. Further one of the compression techniques named as Huffman algorithm is applied for image compression. Finally, resultant image is stored with lesser space complexity.

[1]  Don-Lin Yang,et al.  Image Processing and Image Mining using Decision Trees , 2009, J. Inf. Sci. Eng..

[2]  Alexander S. Szalay,et al.  The World Wide Telescope: An Archetype for Online Science , 2004, ArXiv.

[3]  J. Ross Quinlan,et al.  Induction of Decision Trees , 1986, Machine Learning.

[4]  Jiawei Han Data mining for image/video processing: a promising research frontier , 2008, CIVR '08.

[5]  Gregory Piatetsky-Shapiro,et al.  The KDD process for extracting useful knowledge from volumes of data , 1996, CACM.

[6]  D. Huffman A Method for the Construction of Minimum-Redundancy Codes , 1952 .

[7]  Herbert A. Simon,et al.  Applications of machine learning and rule induction , 1995, CACM.

[8]  Jiawei Han,et al.  Research Challenges for Data Mining in Science and Engineering , 2008, Next Generation of Data Mining.

[9]  Padhraic Smyth,et al.  From Data Mining to Knowledge Discovery: An Overview , 1996, Advances in Knowledge Discovery and Data Mining.

[10]  Jiawei Han,et al.  Data Mining: Concepts and Techniques , 2000 .

[11]  Hans-Peter Kriegel,et al.  Visual classification: an interactive approach to decision tree construction , 1999, KDD '99.

[12]  Philip S. Yu,et al.  Data Mining: An Overview from a Database Perspective , 1996, IEEE Trans. Knowl. Data Eng..

[13]  Alfredo De Santis,et al.  A note on D-ary Huffman codes , 1991, IEEE Trans. Inf. Theory.

[14]  Carlos Ordonez,et al.  Image Mining: A New Approach for Data Mining , 1998 .

[15]  David Haussler,et al.  Mining scientific data , 1996, CACM.