# Data Mining P2

Chia sẻ: Tran Thach | Ngày: | Loại File: PDF | Số trang:20

0
85
lượt xem
25

## Data Mining P2

Mô tả tài liệu

Data compression is the technique to reduce the redundancies in data representation in order to decrease data storage requirements and, hence, communication costs when transmitted through a communication network [24, 25]. Reducing the storage requirement is equivalent to increasing the capacity of the storage medium. If the compressed data are properly indexed, it may improve the performance of mining data in the compressed large database as well

Chủ đề:

Bình luận(0)

Lưu

## Nội dung Text: Data Mining P2

1. DATA COMPRESSION 11 1. In English text files, common words (e.g., "is", "are", "the") or simi- lar patterns of character strings (e.g., lze\ lth\ iing'1} are usually used repeatedly. It is also observed that the characters in an English text occur in a well-documented distribution, with letter "e" and "space" being the most popular. 2. In numeric data files, often we observe runs of similar numbers or pre- dictable interdependency amongst the numbers. 3. The neighboring pixels in a typical image are highly correlated to each other, with the pixels in a smooth region of an image having similar values. 4. Two consecutive frames in a video are often mostly identical when mo- tion in the scene is slow. 5. Some audio data beyond the human audible frequency range are useless for all practical purposes. Data compression is the technique to reduce the redundancies in data repre- sentation in order to decrease data storage requirements and, hence, commu- nication costs when transmitted through a communication network [24, 25]. Reducing the storage requirement is equivalent to increasing the capacity of the storage medium. If the compressed data are properly indexed, it may improve the performance of mining data in the compressed large database as well. This is particularly useful when interactivity is involved with a data mining system. Thus the development of efficient compression techniques, particularly suitable for data mining, will continue to be a design challenge for advanced database management systems and interactive multimedia ap- plications. Depending upon the application criteria, data compression techniques can be classified as lossless and lossy. In lossless methods we compress the data in such a way that the decompressed data can be an exact replica of the original data. Lossless compression techniques are applied to compress text, numeric, or character strings in a database - typically, medical data, etc. On the other hand, there are application areas where we can compromise with the accuracy of the decompressed data and can, therefore, afford to lose some information. For example, typical image, video, and audio compression techniques are lossy, since the approximation of the original data during reconstruction is good enough for human perception. In our view, data compression is a field that has so far been neglected by the data mining community. The basic principle of data compression is to reduce the redundancies in data representation, in order to generate a shorter representation for the data to conserve data storage. In earlier discussions, we emphasized that data reduction is an important preprocessing task in data mining. Need for reduced representation of data is crucial for the success of very large multimedia database applications and the associated
2. 12 INTRODUCTION TO DATA MINING economical usage of data storage. Multimedia databases are typically much larger than, say, business or financial data, simply because an attribute itself in a multimedia database could be a high-resolution digital image. Hence storage and subsequent access of thousands of high-resolution images, which are possibly interspersed with other datatypes as attributes, is a challenge. Data compression offers advantages in the storage management of such huge data. Although data compression has been recognized as a potential area for data reduction in literature [13], not much work has been reported so far on how the data compression techniques can be integrated in a data mining system. Data compression can also play an important role in data condensation. An approach for dealing with the intractable problem of learning from huge databases is to select a small subset of data as representatives for learning. Large data can be viewed at varying degrees of detail in different regions of the feature space, thereby providing adequate importance depending on the underlying probability density [26]. However, these condensation techniques are useful only when the structure of data is well-organized. Multimedia data, being not so well-structured in its raw form, leads to a big bottleneck in the application of existing data mining principles. In order to avoid this problem, one approach could be to store some predetermined feature set of the multimedia data as an index at the header of the compressed file, and subsequently use this condensed information for the discovery of information or data mining. We believe that integration of data compression principles and techniques in data mining systems will yield promising results, particularly in the age of multimedia information and their growing usage in the Internet. Soon there will arise the need to automatically discover or access information from such multimedia data domains, in place of well-organized business and financial data only. Keeping this goal in mind, we intended to devote significant dis- cussions on data compression techniques and their principles in multimedia data domain involving text, numeric and non-numeric data, images, etc. We have elaborated on the fundamentals of data compression and image compression principles and some popular algorithms in Chapter 3. Then we have described, in Chapter 9, how some data compression principles can improve the efficiency of information retrieval particularly suitable for multi- media data mining. 1.4 INFORMATION RETRIEVAL Users approach large information spaces like the Web with different motives, namely, to (i) search for a specific piece of information or topic, (ii) gain familiarity with, or an overview of, some general topic or domain, and (iii) locate something that might be of interest, without a clear prior notion of what "interesting" should look like. The field of information retrieval devel-
3. INFORMATION RETRIEVAL 13 ops methods that focus on the first situation, whereas the latter motives are mainly addressed in approaches dealing with exploration and visualization of the data. Information retrieval [28] uses the Web (and digital libraries) to access multimedia information repositories consisting of mixed media data. The in- formation retrieved can be text as well as image document, or a mixture of both. Hence it encompasses both text and image mining. Information re- trieval automatically entails some amount of summarization or compression, along with retrieval based on content. Given a user query, the information system has to retrieve the documents which are related to that query. The potentially large size of the document collection implies that specialized in- dexing techniques must be used if efficient retrieval is to be achieved. This calls for proper indexing and searching, involving pattern or string matching. With the explosive growth of the amount of information over the Web and the associated proliferation of the number of users around the world, the difficulty in assisting users in finding the best and most recent information has increased exponentially. The existing problems can be categorized as the absence of • filtering: a user looking for some topic on the Internet receives too much information, • ranking of retrieved documents: the system provides no qualitative dis- tinction between the documents, • support of relevance feedback: the user cannot report her/his subjective evaluation of the relevance of the document, • personalization: there is a need of personal systems that serve the spe- cific interests of the user and build user profile, • adaptation: the system should notice when the user changes her/his interests. Retrieval can be efficient in terms of both (a) a high recall from the Inter- net and (b) a fast response time at the expense of a poor precision. Recall is the percentage of relevant documents that are retrieved, while precision refers to the percentage of documents retrieved that are considered as relevant [29]. These are some of the factors that are considered when evaluating the rele- vance feedback provided by a user, which can again be explicit or implicit. An implicit feedback entails features such as the time spent in browsing a Web page, the number of mouse-clicks made therein, whether the page is printed or bookmarked, etc. Some of the recent generations of search engines involve Meta-search engines (like Harvester, MetaCrawler) and intelligent Software Agent technologies. The intelligent agent approach [30, 31] is recently gaining attention in the area of building an appropriate user interface for the Web. Therefore, four main constituents can be identified in the process of infor- mation retrieval from the Internet. They are
4. 14 INTRODUCTION TO DATA MINING 1. Indexing: generation of document representation. 2. Querying: expression of user preferences through natural language or terms connected by logical operators. 3. Evaluation: performance of matching between user query and document representation. 4. User profile construction: storage of terms representing user preferences, especially to enhance the system retrieval during future accesses by the user. 1.5 TEXT MINING Text is practically one of the most commonly used multimedia datatypes in day-to-day use. Text is the natural choice for formal exchange of information by common people through electronic mail, Internet chat, World Wide Web, digital libraries, electronic publications, and technical reports, to name a few. Moreover, huge volumes of text data and information exist in the so-called "gray literature" and they are not easily available to common users outside the normal book-selling channels. The gray literature includes technical re- ports, research reports, theses and dissertations, trade and business literature, conference and journal papers, government reports, and so on [32]. Gray lit- erature is typically stored in text (or document) databases. The wealth of information embedded in the huge volumes of text (or document) databases distributed all over is enormous, and such databases are growing exponentially with the revolution of current Internet and information technology. The popu- lar data mining algorithms have been developed to extract information mainly from well-structured classical databases, such as relational, transactional, pro- cessed warehouse data, etc. Multimedia data are not so structured and often less formal. Most of the textual data spread all over the world are not very formally structured either. The structure of textual data formation and the underlying syntax vary from one language to another language (both machine and human), one culture to another, and possibly user to user. Text mining can be classified as the special data mining techniques particularly suitable for knowledge and information discovery from textual data. Automatic understanding of the content of textual data, and hence the extraction of knowledge from it, is a long-standing challenge in artificial in- telligence. There were efforts to develop models and retrieval techniques for semistructured data from the database community. The information retrieval community developed techniques for indexing and searching unstructured text documents. However, these traditional techniques are not sufficient for knowl- edge discovery and mining of the ever-increasing volume of textual databases. Although retrieval of text-based information was traditionally considered to be a branch of study in information retrieval only, text mining is currently
5. WEB MINING 15 emerging as an area of interest of its own. This became very prominent with the development of search engines used in the World Wide Web, to search and retrieve information from the Internet. In order to develop efficient text mining techniques for search and access of textual information, it is important to take advantage of the principles behind classical string matching techniques for pattern search in text or string of characters, in addition to traditional data mining principles. We describe some of the classical string matching algorithms and their applications in Chapter 4. In today's data processing environment, most of the text data is stored in compressed form. Hence access of text information in the compressed domain will become a challenge in the near future. There is practically no remarkable effort in this direction in the research community. In order to make progress in such efforts, we need to understand the principles behind the text compression methods and develop underlying text mining techniques exploiting these. Usually, classical text compression algorithms, such as the Lempel-Ziv family of algorithms, are used to compress text databases. We deal with some of these algorithms and their working principles in greater detail in Chapter 3. Other established mathematical principles for data reduction have also been applied in text mining to improve the efficiency of these systems. One such technique is the application of principal component analysis based on the matrix theory of singular value decomposition. Use of latent semantic analy- sis based on the principal component analysis and some other text analysis schemes for text mining have been discussed in great detail in Section 9.2. 1.6 WEB MINING Presently an enormous wealth of information is available on the Web. The objective is to mine interesting nuggets of information, like which airline has the cheapest flights in December, or search for an old friend, etc. Internet is definitely the largest multimedia data depository or library that ever ex- isted. It is the most disorganized library as well. Hence mining the Web is a challenge. The Web is a huge collection of documents that comprises (i) semistruc- tured (HTML, XML) information, (ii) hyper-link information, and (iii) access and usage information and is (iv) dynamic; that is, new pages are constantly being generated. The Web has made cheaper the accessibility of a wider au- dience to various sources of information. The advances in all kinds of digital communication has provided greater access to networks. It has also created free access to a large publishing medium. These factors have allowed people to use the Web and modern digital libraries as a highly interactive medium. However, present-day search engines are plagued by several problems like the
6. 16 INTRODUCTION TO DATA MINING • abundance problem, as 99% of the information is of no interest to 99% of the people, • limited coverage of the Web, as Internet sources are hidden behind search interfaces, • limited query interface, based on keyword-oriented search, and • limited customization to individual users. Web mining [27] refers to the use of data mining techniques to automat- ically retrieve, extract, and evaluate (generalize or analyze) information for knowledge discovery from Web documents and services. Considering the Web as a huge repository of distributed hypertext, the results from text mining have great influence in Web mining and information retrieval. Web data are typically unlabeled, distributed, heterogeneous, semistructured, time-varying, and high-dimensional. Hence some sort of human interface is needed to han- dle context-sensitive and imprecise queries and provide for summarization, deduction, personalization, and learning. The major components of Web mining include • information retrieval, • information extraction, • generalization, and • analysis. Information retrieval, as mentioned in Section 1.4, refers to the automatic retrieval of relevant documents, using document indexing and search engines. Information extraction helps identify document fragments that constitute the semantic core of the Web. Generalization relates to aspects from pattern recognition or machine learning, and it utilizes clustering and association rule mining. Analysis corresponds to the extraction, interpretation, validation, and visualization of the knowledge obtained from the Web. Different aspects of Web mining have been discussed in Section 9.5. 1.7 IMAGE MINING Image is another important class of multimedia datatypes. The World Wide Web is presently regarded as the largest global multimedia data repository, en- compassing different types of images in addition to other multimedia datatypes. As a matter of fact, much of the information communicated in the real-world is in the form of images; accordingly, digital pictures play a pervasive role in the World Wide Web for visual communication. Image databases are typically
7. IMAGE MINING 17 very large in size. We have witnessed an exponential growth in the genera- tion and storage of digital images in different forms, because of the advent of electronic sensors (like CMOS or CCD) and image capture devices such as digital cameras, camcorders, scanners, etc. There has been a lot of progress in the development of text-based search engines for the World Wide Web. However, search engines based on other multimedia datatypes do not exist. To make the data mining technology suc- cessful, it is very important to develop search engines in other multimedia datatypes, especially for image datatypes. Mining of data in the imagery do- main is a challenge. Image mining [33] deals with the extraction of implicit knowledge, image data relationship, or other patterns not explicitly stored in the images. It is more than just an extension of data mining to the im- age domain. Image mining is an interdisciplinary endeavor that draws upon expertise in computer vision, pattern recognition, image processing, image retrieval, data mining, machine learning, database, artificial intelligence, and possibly compression. Unlike low-level computer vision and image processing, the focus of image mining is in the extraction of patterns from a large collection of images. It, however, includes content-based retrieval as one of its functions. While cur- rent content-based image retrieval systems can handle queries about image contents based on one or more related image features such as color, shape, and other spatial information, the ultimate technology remains an impor- tant challenge. While data mining can involve absolute numeric values in relational databases, the images are better represented by relative values of pixels. Moreover, image mining inherently deals with spatial information and often involves multiple interpretations for the same visual pattern. Hence the mining algorithms here need to be subtly different than in traditional data mining. A discovered image pattern also needs to be suitably represented to the user, often involving feature selection to improve visualization. The informa- tion representation framework for an image can be at different levels, namely, pixel, object, semantic concept, and pattern or knowledge levels. Conven- tional image mining techniques include object recognition, image retrieval, image indexing, image classification and clustering, and association rule min- ing. Intelligently classifying an image by its content is an important way to mine valuable information from a large image collection [34]. Since the storage and communication bandwidth required for image data is pervasive, there has been a great deal of activity in the international standard committees to develop standards for image compression. It is not practical to store the digital images in uncompressed or raw data form. Image compres- sion standards aid in the seamless distribution and retrieval of compressed images from an image repository. Searching images and discovering knowl- edge directly from compressed image databases has not been explored enough. However, it is obvious that image mining in compressed domain will become a challenge in the near future, with the explosive growth of the image data
8. 18 INTRODUCTION TO DATA MINING depository distributed all over in the World Wide Web. Hence it is crucial to understand the principles behind image compression and its standards, in order to make significant progress to achieve this goal. We discuss the principles of multimedia data compression, including that for image datatypes, in Chapter 3. Different aspects of image mining are described in Section 9.3. 1.8 CLASSIFICATION Classification is also described as supervised learning [35]. Let there be a database of tuples, each assigned a class label. The objective is to develop a model or profile for each class. An example of a profile with good credit is 25 < age < 40 and income > 40K or married = "yes". Sample applications for classification include • Signature identification in banking or sensitive document handling (match, no match). • Digital fingerprint identification in security applications (match, no match). • Credit card approval depending on customer background and financial credibility (good, bad). • Bank location considering customer quality and business possibilities (good, fair, poor). • Identification of tanks from a set of images (friendly, enemy). • Treatment effectiveness of a drug in the presence of a set of disease symptoms (good, fair, poor). • Detection of suspicious cells in a digital image of blood samples (yes, no). The goal is to predict the class Ci = f(x\,..., £„), where x\,..., xn are the input attributes. The input to the classification algorithm is, typically, a dataset of training records with several attributes. There is one distinguished attribute called the dependent attribute. The remaining predictor attributes can be numerical or categorical in nature. A numerical attribute has continu- ous, quantitative values. A categorical attribute, on the other hand, takes up discrete, symbolic values that can also be class labels or categories. If the de- pendent attribute is categorical, the problem is called classification with this attribute being termed the class label. However, if the dependent attribute is numerical, the problem is termed regression. The goal of classification and regression is to build a concise model of the distribution of the dependent attribute in terms of the predictor attributes. The resulting model is used to
9. CLUSTERING 19 assign values to a database of testing records, where the values of the pre- dictor attributes are known but the dependent attribute is to be determined. Classification methods can be categorized as follows. 1. Decision trees [36], which divide a decision space into piecewise constant regions. Typically, an information theoretic measure is used for assessing the discriminatory power of the attributes at each level of the tree. 2. Probabilistic or generative models, which calculate probabilities for hy- potheses based on Bayes' theorem [35]. 3. Nearest-neighbor classifiers, which compute minimum distance from in- stances or prototypes [35]. 4. Regression, which can be linear or polynomial, of the form axi+bx^+c = Ci [37]. 5. Neural networks [38], which partition by nonlinear boundaries. These incorporate learning, in a data-rich environment, such that all informa- tion is encoded in a distributed fashion among the connection weights. Neural networks are introduced in Section 2.2.3, as a major soft computing tool. We have devoted the whole of Chapter 5 to the principles and techniques for classification. 1.9 CLUSTERING A cluster is a collection of data objects which are similar to one another within the same cluster but dissimilar to the objects in other clusters. Cluster anal- ysis refers to the grouping of a set of data objects into clusters. Clustering is also called unsupervised classification, where no predefined classes are as- signed [35]. Some general applications of clustering include • Pattern recognition. • Spatial data analysis: creating thematic maps in geographic information systems (GIS) by clustering feature spaces, and detecting spatial clusters and explaining them in spatial data mining. • Image processing: segmenting for object-background identification. • Multimedia computing: finding the cluster of images containing flowers of similar color and shape from a multimedia database. • Medical analysis: detecting abnormal growth from MRI. • Bioinformatics: determining clusters of signatures from a gene database.
10. 20 INTRODUCTION TO DATA MINING • Biometrics: creating clusters of facial images with similar fiduciary points. • Economic science: undertaking market research. • WWW: clustering Weblog data to discover groups of similar access pat- terns. A good clustering method will produce high-quality clusters with high in- traclass similarity and low interclass similarity. The quality of a clustering result depends on both (a) the similarity measure used by the method and (b) its implementation. It is measured by the ability of the system to discover some or all of the hidden patterns. Clustering approaches can be broadly categorized as 1. Partitional: Create an initial partition and then use an iterative control strategy to optimize an objective. 2. Hierarchical: Create a hierarchical decomposition (dendogram) of the set of data (or objects) using some termination criterion. 3. Density-based: Use connectivity and density functions. 4. Grid-based: Create multiple-level granular structure, by quantizing the feature space in terms of finite cells. Clustering, when used for data mining, is required to be (i) scalable, (ii) able to deal with different types of attributes, (iii) able to discover clusters with arbitrary shape, (iv) having minimal requirements for domain knowl- edge to determine input parameters, (v) able to deal with noise and outliers, (vi) insensitive to order of input records, (vii) of high dimensionality, and (viii) interpretable and usable. Further details on clustering are provided in Chapter 6. 1.10 RULE MINING Rule mining refers to the discovery of the relationship(s) between the at- tributes of a dataset, say, a set of transactions. Market basket data consist of a set of items bought together by customers, one such set of items being called a transaction. A lot of work has been done in recent years to find associations among items in large groups of transactions [39, 40]. A rule is normally expressed in the form X =>• Y, where X and Y are sets of attributes of the dataset. This implies that transactions which contain X also contain Y. A rule is normally expressed as IF < some-conditions .satisfied > THEN < predict .values-j'or. some-other-attributes >. So the association X =>• Y is expressed as IF X THEN Y. A sample rule could be of the form
11. STRING MATCHING 21 IF (salary > 12000) AND (unpaid-loan = "no") THEN (select-for-loan = "yes"). Rule mining can be categorized as 1. Association rule mining: An expression of the form X => Y, where X and Y are subsets of all attributes, and the implication holds with a confidence > c, where c is a user-defined threshold. This implies IF X THEN Y, with at least c confidence. 2. Classification rule mining: A supervised process uses a training dataset to generate the rules. The objective is to predict a predefined class or goal attribute, which can never appear in the antecedent part of a rule. The generated rules are used to predict the class attribute of an unknown test dataset. 3. Dependency rule modeling: This is also a supervised process, with the goal attribute being chosen from a predefined set of attributes. While non-goal attributes can occur only in the antecedent part of a rule, the goal attributes can appear in either its consequent or antecedent parts. Let us consider an example from medical decision-making. Often data may be missing for various reasons; for example, some examinations can be risky for the patient or contraindications can exist, an urgent diagnostic decision may need to be made and some very informative but prolonged test results may have to be excluded from the feature set, or appropriate technical equip- ment may not be available. In such cases, the system can query the user for additional information only when it is particularly necessary to infer a decision. Again, one realizes that the final responsibility for any diagnos- tic decision always has to be accepted by the medical practitioner. So the physician may want to verify the justification behind the decision reached, based on personal expertise. This requires the system to be able to explain its mode of reasoning for any inferred decision or recommendation, preferably in classification rule form, to convince the user that its reasoning is correct. Important association rule mining techniques have been considered in detail in Chapter 7. Generation of classification rules, in a modular framework, have been described in Chapter 8. 1.11 STRING MATCHING String matching is a very important area of research for successful develop- ment of data mining systems, particularly for text databases and in mining of data through the Internet by a text-based search engine. In this section, we briefly introduce the string matching problem [24]. Let P = a\a
12. 22 INTRODUCTION TO DATA MINING integers greater than 0. In its simplest form, the pattern or string match- ing problem consists of searching the text T to find the occurrence(s) of the pattern P in T (m < n). Several variants of the basic problem can be considered. The pattern may consist of a finite set of sequences P = {P1, P 2 ,..., Pfc}, where each P* is a pattern from the same alphabet and the problem is to search for occurrence(s) of any one of the members of the set in the text. The patterns may be fully or partially specified. • Let $denote a "don't care" or "wild card" character; then the pattern A$B denotes a set of patterns AAB, ABB, ACB, etc. - that is, any pattern that begins with A, ends with B, and has a single unspecified character in the middle. The character $is called a "fixed length don't care" (FLDC) character and may appear at any place in the pattern. • A special character 0 is used to denote the infinite set of patterns$ - {$, $$,$$$,...} and is called a "variable length don't care" (VLDC) character. Patterns containing special characters \$ or 0 are called partially specified; otherwise, they are termed fully specified. The string matching problem has been extensively studied in the litera- ture. Several linear time algorithms for the exact pattern matching problem (involving fully specified patterns) have been developed by researchers [41]- [43]. No linear time algorithm is yet known for the string matching problem with a partially specified pattern. The best known result for pattern matching us- ing a pattern consisting of wild card characters is by Fischer and Patterson [44] with complexity O(nlog 2 mloglogmlogc), where c is the size of the alpha- bet. Several two-dimensional exact pattern matching algorithms have been proposed in Refs. [45]-[47]. There are other variation of the string matching when the pattern is not fully specified. For example, finding the occurrences of similar patterns with small differences in the text. Let us consider trying to find the occurrences of patterns similar to (say) "birth," with maximum difference in two character positions in the text. Here the patterns "birth," "broth," "booth," "worth," "dirty," etc., will be considered to be valid occurrence in the text. All these above variations of the string matching problem is usually known as Approx- imate String Matching in the literature. The string (or pattern) matching problem becomes even more interest- ing when one attempts to directly match a pattern in a compressed text or database. String matching finds widespread applications in diverse areas such as text editing, text search, information retrieval, text mining, Web mining, Bioinformatics, etc. String matching is a very essential component in text analysis and retrieval in order to automatically extract the words, keywords, and set of terms in a document, and also in query processing when used in text mining.
13. BIOINFORMATICS 23 We have devoted Chapter 4 to string matching, encompassing a detailed description of the classical algorithms along with a number of examples for each of them. 1.12 BIOINFORMATICS A gene is a fundamental constituent of any living organism. Sequence of genes in a human body represent the signature(s) of the person. The genes are portions of the deoxyribonucleic acid, or DNA for short. J. D. Watson and F. H. Crick proposed a structure of DNA in 1953, consisting of two strands or chains. Each of these chains is composed of phosphate and deoxyribose sugar molecules joined together by covalent bonds. A nitrogenous base is attached to each sugar molecule. There are four bases: adenine [A], cytosine [C], guanine [G], and thymine [T]. From information theoretic perspective, the DNA can be considered as a string or sequence of symbols. Each symbol is one of the four above bases A, C, G, or T. In the human body there are approximately 3 billion such base pairs. The whole stretch of the DNA is called the genome of an organism. Obviously, such a long stretch of DNA cannot be sequenced all at once. Mapping, search, and analysis of patterns in such long sequences can be combinatorially explosive and can be impractical to process even in today's powerful digital computers. Typically, a DNA sequence may be 40,000-100,000 base pairs long. In practice, such a long stretch of DNA is first broken up into 400-2000 small fragments. Each such small fragment typically consists of approximately 1000 base pairs. These fragments are sequenced experimentally, and then reassem- bled together to reconstruct the original DNA sequence. Genes are encoded in these fragments of DNA. Understanding what parts of the genome encode which genes is a main area of study in computational molecular biology or Bioinformatics [7, 48]. The results of string matching algorithms and their derivatives have been applied in search, analysis and sequencing of DNA, and other developments in Bioinformatics. Microarray experiments are done to produce gene expression patterns, that provide dynamic information about cell function. The huge volume of such data, and their high dimensions, make gene expression data to be suitable candidates for the application of data mining functions like clustering, visu- alization, and string matching. Visualization is used to transform these high- dimensional data to lower-dimensional, human understandable form. This aids subsequent useful analysis, leading to efficient knowledge discovery. Mi- croarray technologies are utilized to evaluate the level of expression of thou- sands of genes, with applications in colon, breast, and blood cancer treatment [48]. Proteins are made up of polypeptide chains of amino acids, which consist of the DNA as the building block. General principles of protein structure, stability, and folding kinetics are being explored in Bioinformatics, using lat-
14. 24 INTRODUCTION TO DATA MINING tice models. These models represent protein chains involving some param- eters, and they allow complete explorations of conformational and sequence spaces. Interactions among spatially neighboring amino acids, during folding, are controlled by such factors as bond length, bond angle, electrostatic forces, hydrogen bonding, hydrophobicity, entropy, etc. [49]. The determination of an optimal conformation of a three-dimensional protein structure constitutes protein folding. This has wide-ranging applications in pharmacogenomics, and more specifically to drug design. The different aspects of the applicability of data mining to Bioinformatics are described in detail in Chapter 10. 1.13 DATA WAREHOUSING A data warehouse is a decision support database that is maintained sepa- rately from the organizations operational database. It supports information processing by providing a solid platform of consolidated, historical data for analysis. A data warehouse [13] is a subject-oriented, integrated, time-variant, and nonvolatile collection of data in support of managements decision-making process. Data warehousing deals with the process of constructing and using data warehouses. Database systems are of two types, namely, on-line transaction processing systems, like OLTP; and decision support systems, like warehouses, on-line an- alytical processing (OLAP), and mining. Historical data from OLTP systems form decision support systems, the goal being to learn from past experiences. While OLTP involves many short, update-intensive commands, a decision support system requires fewer but complex queries. OLTP is a major task of traditional relational database management systems. It involves day-to-day operations like purchasing, inventory, banking, manufacturing, payroll, reg- istration, accounting, etc. OLAP, on the other hand, is a primary task of a data warehouse system. It concentrates on data analysis and decision making, based on the content of the data warehouse. A data warehouse is subject-oriented, being organized around major sub- jects such as customer, product, and sales. It is constructed by integrating multiple, heterogeneous data sources, like relational databases, flat files, and on-line transaction records, in a uniform format. Data cleaning and data in- tegration techniques are applied to ensure consistency in naming conventions, encoding structures, attribute measures, etc., among different data sources. While an operational database is concerned with current value data, the data warehouse provides information from a historical perspective (e.g., past 5-10 years). Every key structure in the data warehouse contains an element of time, explicitly or implicitly, although the key of operational data may or may not contain the time element. Data warehouse constitutes a physically separate store of data, transformed from the operational environment. Op- erational update of data does not occur in the data warehouse environment.
15. APPLICATIONS AND CHALLENGES 25 It does not require transaction processing, recovery, and concurrency control mechanisms. It requires only two operations, namely, initial loading of data and its access. Traditional heterogeneous databases build wrappers or mediators on top of the databases and adopt a query-driven approach. When a query is posed to a client site, a meta-dictionary is used to translate the query into a form appropriate for individual heterogeneous sites involved, and the results are integrated into a global answer set. This involves complex information filter- ing and a competition for resources. Data warehouses, on the other hand, are high-performance systems providing a multidimensional view for complex OLAP queries. Information from heterogeneous sources is integrated in ad- vance, and it is stored in warehouses for direct query and analysis. OLAP helps provide fast, interactive answers to large aggregate queries at multiple levels of abstraction. A data cube allows such multidimensional data to be effectively modeled and viewed in the n dimensions. Typical OLAP operations include 1. Roll up (drill-up): Summarize data by climbing up hierarchy or by di- mension reduction. 2. Drill down (roll down): Reverse of roll-up from higher level summary to lower level summary or detailed data, or introducing new dimensions. 3. Slice and dice: Project and select. 4. Pivot (rotate): Reorient the cube, transform from 3D to a series of 2£> planes, and provide better visualization. 5. Drill across: Involving more than one fact table. 6. Drill through: From the bottom level of the cube to its back-end rela- tional tables (using structured query languages SQL). 1.14 APPLICATIONS AND CHALLENGES Some of the important issues in data mining include the identification of appli- cations for existing techniques, and developing new techniques for traditional as well as new application domains, like the Web, E-commerce, and Bioinfor- matics. Some of the existing practical uses of data mining exist in (i) tracking fraud, (ii) tracking game strategy, (iii) target marketing, (iv) holding on to good customers, and (v) weeding out bad customers, to name a few. There are many other areas we can envisage, where data mining can be applied. Some of these areas are as follows. • Medicine: Determine disease outcome and effectiveness of treatments, by analyzing patient disease history to find some relationship between diseases.
16. 26 INTRODUCTION TO DATA MINING • Molecular or pharmaceutical: Identify new drugs. • Security: Face recognition, identification, biometrics, etc. • Judiciary: Search and access of historical data on judgement of similar cases. • Biometrics: Positive identification of a person from a large image, fin- gerprint or voice database. • Multimedia retrieval: Search and identification of image, video, voice, and text from multimedia database, which may be compressed. • Scientific data analysis: Identify new galaxies by searching for subclus- ters. • Web site or Web store design, and promotion: Find affinity of visitors to Web pages, followed by subsequent layout modification. • Marketing: Help marketers discover distinct groups in their customer bases, and then use this knowledge to develop targeted marketing pro- grams. • Land use: Identify areas of similar land use in an earth observation database. • Insurance: Identify groups of motor insurance policy holders with a high average claim cost. • City-planning: Identify groups of houses according to their house type, value, and geographical location. • Geological studies: Infer that observed earthquake epicenters are likely to be clustered along continental faults. The first generation of data mining algorithms has been demonstrated to be of significant value across a variety of real-world applications. But these work best for problems involving a large set of data collected into a single database, where the data are described by numeric or symbolic features. Here the data invariably do not contain text and image features interleaved with these features, and they are carefully and cleanly collected with a particular decision-making task in mind. Development of new generation algorithms is expected to encompass more diverse sources and types of data that will support mixed-initiative data min- ing, where human experts collaborate with the computer to form hypotheses and test them. The main challenges to the data mining procedure, to be considered for future research, involve the following. 1. Massive datasets and high dimensionality. Huge datasets create combi- natorially explosive search space for model induction, and they increase
17. the chances that a data mining algorithm will find spurious patterns that are not generally valid. Possible solutions include robust and efficient algorithms, sampling approximation methods, and parallel processing. Scaling up of existing techniques is needed - for example, in the cases of classification, clustering, and rule mining. 2. User interaction and prior knowledge. Data mining is inherently an interactive and iterative process. Users may interact at various stages, and domain knowledge may be used either in the form of a high-level specification of the model or at a more detailed level. Visualization of the extracted model is also desirable for better user interaction at different levels. 3. Over-fitting and assessing the statistical significance. Datasets used for mining are usually huge and available from distributed sources. As a result, often the presence of spurious data points leads to over-fitting of the models. Regularization and re-sampling methodologies need to be emphasized for model design. 4. Understandability of patterns. It is necessary to make the discoveries more understandable to humans. Possible solutions include rule struc- turing, natural language representation, and the visualization of data and knowledge. 5. Nonstandard and incomplete data. The data can be missing and/or noisy. These need to be handled appropriately. 6. Mixed media data. Learning from data that are represented by a com- bination of various media, like (say) numeric, symbolic, images, and text. 7. Management of changing data and knowledge. Rapidly changing data, in a database that is modified or deleted or augmented, may make previ- ously discovered patterns invalid. Possible solutions include incremental methods for updating the patterns. 8. Integration. Data mining tools are often only a part of the entire decision-making system. It is desirable that they integrate smoothly, both with the database and the final decision-making procedure. 9. Compression. Storage of large multimedia databases is often required to be in compressed form. Hence the development of compression tech- nology, particularly suitable for data mining, is required. It would be even more beneficial if data can be accessed in the compressed domain [24]. 10. Human Perceptual aspects for data mining. Many multimedia data min- ing systems are intended to be used by humans. So it is a pragmatic
18. 28 INTRODUCTION TO DATA MINING approach to design multimedia systems and underlying data mining techniques based on the needs and capabilities of the human percep- tual system. The ultimate consumer of most perceptual information is the 'Human Perceptual System?. Primarily, the Human Perceptual Sys- tem consists of the 'Human Visual System1 and the 'Human Auditory System'. How these systems work synergistically is still not completely understood and is a subject of ongoing research. We also need to focus some attention in this direction so that their underlying principles can be adopted while developing data mining techniques, in order to make these more amenable and natural to the human customer. 11. Distributed database. Interest in the development of data mining sys- tems in a distributed environment will continue to grow. In today's networked society, data are not stored or archived in a single storage system unit. Problems arise while handling extremely large heteroge- neous databases spread over multiple files, possibly in different disks or across the Web in different geographical locations. Often combining such data in a single very large file may be infeasible. Development of algorithms for mining data from distributed databases will open up newer areas of applications in the near future. 1.15 CONCLUSIONS AND DISCUSSION Data mining is a good area of scientific study, holding ample promise for the research community. Recently a lot of progress has been reported for large databases, specifically involving association rules, classification, cluster- ing, similar time sequences, similar text document retrieval, similar image retrieval, outlier discovery, etc. Many papers have been published in major conferences and leading journals. However, it still remains a promising and rich field with many challenging research issues. In this chapter we have provided an introduction to knowledge discovery from databases and data mining. The major functions of data mining have been described from the perspectives of machine learning, pattern recogni- tion, and artificial intelligence. Handling of multimedia data, their compres- sion, matching, and their implications to text and image mining have been discussed. We have also stated principles of string matching, explaining how they can be applied in text retrieval and in Bioinformatics for DNA search type of operations. Different application domains and research challenges have also been highlighted. Since the databases to be mined are often very large, parallel algorithms are desirable [50]. However, one has to explore a trade-off between com- putation, communication, memory usage, synchronization, and the use of problem-specific information, in order to select a suitable parallel algorithm for data mining. One can also partition the data appropriately and distribute
19. CONCLUSIONS AND DISCUSSION 29 the subsets to multiple processors, learning concept descriptions in parallel and then combining them. This corresponds to loosely coupled collections of otherwise independent algorithms and is termed distributed data mining [51]. Traditional data mining algorithms require all data to be mined in a single, centralized data warehouse. A fundamental challenge is to develop distributed versions of data mining algorithms, so that data mining can be done while leaving some of the data in different places. In addition, appropriate proto- cols, languages, and network services are required for mining distributed data, handling the meta-data and the mappings required for mining the distributed data. Spatial database systems involve spatial data - that is, point objects or spatially extended objects in a 2D/3D or some high-dimensional feature space. Knowledge discovery is becoming more and more important in these databases, as increasingly large amounts of data obtained from satellite images, X-ray crystallography, or other automatic equipment are being stored in the spa- tial framework. Image mining holds promise in handling such databases. Moreover, Bioinformatics offers applications in modeling or analyzing protein structures that are represented as spatial data. There exist plenty of scope for the use of soft computing in data mining, because of the imprecise nature of data in many application domains. For example, neural nets can help in the learning, the fuzzy sets for natural lan- guage representation and imprecision handling, and the genetic algorithms for search and optimization. However, not much work has been reported in the use of soft computing tools in data mining. The relevance of soft comput- ing lies in its ability to (i) handle subjectivity, imprecision, and uncertainty in queries, (ii) model document relevance as a gradual instead of a crisp property, (iii) provide deduction capability to the search engines, (iv) provide person- alization and learning capability, and (v) deal with the dynamism, scale, and heterogeneity of Web documents. We take this opportunity to compile in this book the existing literature on the various aspects of data mining, highlighting its application to multimedia information and Bioinformatics. Soft computing, an emergent technology, has also demonstrated ample promise in data mining. Chapter 2 focuses on an introduction to soft computing, its tools, and finally its role in the different functions of data mining. The fundamentals of multimedia data compression, particularly text and image compression, are dealt with in Chapter 3. Chap- ter 4 deals in-depth with various issues in string matching. Here we provide examples to show how patterns are matched in general text, as well as how they can be applied in DNA matching in Bioinformatics. The different tasks of data mining like classification, clustering and association rules are covered in Chapters 5,6, and 7, respectively. The issue of rule generation and modu- lar hybridization, in the soft computing framework, is described in Chapter 8. Multimedia data mining, including text mining, image mining, and Web min- ing, is dealt with in Chapter 9. Finally, certain aspects of Bioinformatics, as an application of data mining, are discussed in Chapter 10.
20. 30 INTRODUCTION TO DATA MINING REFERENCES 1. U. Fayyad and R. Uthurusamy, "Data mining and knowledge discovery in databases," Communications of the ACM, vol. 39, pp. 24-27, 1996. 2. W. H. Inmon, "The data warehouse and data mining," Communications of the ACM, vol. 39, pp. 49-50, 1996. 3. T. Acharya and W. Metz, "Multimedia 'applications: Issues and chal- lenges," in Proceedings of the International Conference on Communica- tions, Computers and Devices (Indian Institute of Technology, Kharagpur, India), pp. 27-34, December 2000. 4. P. Piatetsky-Shapiro and W. J. Frawley, eds., Knowledge Discovery in Databases. Menlo Park, CA: AAAI/MIT Press, 1991. 5. President's Information Technology Advisory Committee's report, Wash- ington, http://www.ccic.gov/ac/interim/, 1998. 6. M. Lesk, Practical Digital Libraries: Books, Bytes, and Bucks. San Fran- cisco: Morgan Kaufmann, 1997. 7. S. L. Salzberg, D. B. Searls, and S. Kasif, eds., Computational Methods in Molecular Biology. Amsterdam: Elsevier Sciences B. V., 1998. 8. R. L. Blum, Discovery and Representation of Causal Relationships from a Large Time-Oriented Clinical Database: The RX Project, vol. 19 of Lecture Notes in Medical Informatics. New York: Spinger-Verlag, 1982. 9. J. A. Major and D. R. Riedinger, "EFD-a hybrid knowledge statistical- based system for the detection of fraud," International Journal of Intelli- gent Systems, vol. 7, pp. 687-703, 1992. 10. R. Heider, "Troubleshooting CFM 56-3 engines for the Boeing 737-using CBR and data-mining," Lecture Notes in Computer Science, vol. 1168, pp. 512-523, 1996. 11. U. Fayyad, D. Haussler, and P. Stolorz, "Mining scientific data," Com- munications of the ACM, vol. 39, pp. 51-57, 1996. 12. O. Etzioni, "The World-Wide Web: Quagmire or goldmine?," Communi- cations of the ACM, vol. 39, pp. 65-68, 1996. 13. J. Han and M. Kamber, Data Mining: Concepts and Techniques. San Diego: Academic Press, 2001. 14. S. Mitra, S. K. Pal, and P. Mitra, "Data mining in soft computing frame- work: A survey," IEEE Transactions on Neural Networks, vol. 13, pp. 3- 14, 2002.
{"extraction_info": {"found_math": true, "script_math_tex": 0, "script_math_asciimath": 0, "math_annotations": 0, "math_alttext": 0, "mathml": 0, "mathjax_tag": 0, "mathjax_inline_tex": 1, "mathjax_display_tex": 1, "mathjax_asciimath": 0, "img_math": 0, "codecogs_latex": 0, "wp_latex": 0, "mimetex.cgi": 0, "/images/math/codecogs": 0, "mathtex.cgi": 0, "katex": 0, "math-container": 0, "wp-katex-eq": 0, "align": 0, "equation": 0, "x-ck12": 0, "texerror": 0, "math_score": 0.3799419701099396, "perplexity": 1812.9215504349688}, "config": {"markdown_headings": true, "markdown_code": true, "boilerplate_config": {"ratio_threshold": 0.18, "absolute_threshold": 10, "end_threshold": 15, "enable": true}, "remove_buttons": true, "remove_image_figures": true, "remove_link_clusters": true, "table_config": {"min_rows": 2, "min_cols": 3, "format": "plain"}, "remove_chinese": true, "remove_edit_buttons": true, "extract_latex": true}, "warc_path": "s3://commoncrawl/crawl-data/CC-MAIN-2017-51/segments/1512948599549.81/warc/CC-MAIN-20171218005540-20171218031540-00699.warc.gz"}