Home > Store

Solving Data Mining Problems Through Pattern Recognition

Register your product to gain access to bonus material or receive a coupon.

Solving Data Mining Problems Through Pattern Recognition

Book

  • Sorry, this book is no longer in print.
Not for Sale

Description

  • Copyright 1998
  • Dimensions: 7" x 9-1/4"
  • Pages: 400
  • Edition: 1st
  • Book
  • ISBN-10: 0-13-095083-1
  • ISBN-13: 978-0-13-095083-3


9508C-2

Apply pattern recognition to find the hidden gems in your data!

Data mining technology is helping businesses everywhere to work smarter by revealing unknown patterns within existing archives. Applying the latest advances in pattern recognition software can give you a key competitive edge across all data mining applications. The tutorials and software package included in Solving Data Mining Problems through Pattern Recognition take advantage of machine learning techniques and neural networks to help you get the most out of your data. Besides explaining the most current theories, Solving Data Mining Problems through Pattern Recognition takes a practical approach to overall project development concerns.

The rigorous, multi-step method includes:

  • Defining the pattern recognition problem
  • Collection, preparation, and preprocessing of data
  • Choosing the appropriate algorithm and tuning algorithm parameters Training, testing, and troubleshooting.

Pattern classification, estimation, and modeling are addressed using the following algorithms:

  • Linear and logistic regression
  • Unimodal Gaussian and Gaussian mixture
  • Multilayered perceptron/backpropagation and radial basis function neural networks
  • K nearest neighbors and nearest cluster
  • K means clustering.

While some aspects of pattern recognition involve advanced mathematical principles, most successful projects rely on a strong element of human experience and intuition. Solving Data Mining Problems through Pattern Recognition provides a strong theoretical grounding for beginners, yet it also contains detailed models and insights into real-world problem-solving that will inspire more experienced users, be they database designers, modelers, or project leaders.

This book includes a free, 90-day trial copy of Pattern Recognition Workbench, a powerful, easy-to-use system that combines machine learning, neural networks, and statistical algorithms to help you apply pattern recognition to your data right now. The enclosed CD-ROM runs under Windows(r) 95 and Windows NT(tm).

Sample Content

Table of Contents



1. Introduction .

Pattern Recognition by Humans. Pattern Recognition by Computers. Data Mining and Pattern Recognition. Types of Pattern Recognition. Classification. Calculation in Classification. Uncertainty in Classification. Computer-Automated Classification.Estimation. Calculation in Estimation. Uncertainty in Estimation. Computer-Automated Estimation. Developing a Model. Fixed Models. Parametric Models. Nonparametric Models. Preprocessing. A Continuum of Methods. Biases Due to Prior Knowledge. The Purpose of this Book.



2. Key Concepts: Estimation.

Terminology and Notation. Characteristics of an Optimal Model. Sources of Error. Fixed Models. Parametric Models. Example: Linear Regression. Generalization. Shortcomings of Parametric Methods. Iteration through Parametric Forms. Nonparametric Models. The Underlying Modeling Problem. Heuristics in Nonparametric Modeling. Approximation Architectures. A Practical Nonparametric Approach. The Role of Preprocessing. Statistical Considerations.



3. Key Concepts: Classification.

Terminology and Notation. Characteristics of an Optimal Classifier. Types of Models. Decision-Region Boundaries. Probability Density Functions. Posterior Probabilities. Approaches to Modeling. Fixed Models. Parametric Models. Nonparametric Models. The Role of Preprocessing. The Importance of Multiple Techniques.



Appendix. Statistical Considerations.


4. Additional Application Areas.

Database Marketing. Response Modeling. Cross Selling. Time-Series Prediction. Detection. Probability Estimation. Information Compression. Sensitivity Analysis.



5. Overview of the Development Process.

Defining the Pattern Recognition Problem. Collecting Data. Preparing Data. Preprocessing. Selecting an Algorithm and Training Parameters. Training and Testing. Iterating Steps and Troubleshooting.



Appendix. Evaluating the Final Model.


6. Defining the Pattern Recognition Problem.

What Problems Are Suitable for Data-Driven Solutions? How Do You Evaluate Results? Is It a Classification or Estimation Problem?What Are the Inputs and Outputs?



Appendix. Defining the Problem in PRW.


7. Collecting Data.

What Data to Collect. How to Collect Data. How Much Data Is Enough. Using Simulated Data.



Appendix. Importing Data into PRW.


8. Preparing Data.

Transforming Data into Numerical Values. Inconsistent Data and Outliers.



Appendix. Preparing Data in PRW.

Handling Missing Data. Converting Non-Numeric Inputs. Handling Inconsistent Data or Outliers.



9. Data Preprocessing.

Why Should You Preprocess Your Data? Averaging Data Values. Thresholding Data. Reducing the Input Space. Normalizing Data. Why Normalize Data? Types of Normalization. Modifying Prior Probabilities. Other Considerations.



Appendix A: Preprocessing in PRW.

Averaging Time-Series Data. Thresholding and Replacing Input Values. Reducing the Input Space. Normalizing Data. Modifying Prior Input Probabilities.



10. Selecting Architectures and Training Parameters.

Types of Algorithms. How to Pick an Algorithm.Practical Constraints. Memory Usage. Training Times. Classification/Estimation Times. Algorithm Descriptions. Linear Regression. Logistic Regression. Unimodal Gaussian. Multilayered Perceptron/Backpropagation. Radial Basis Functions. K Nearest Neighbors. Gaussian Mixture. Nearest Cluster. K Means Clustering. Decision Trees. Other Nonparametric Architectures. Algorithm Comparison Summary.



Appendix A: Selecting Algorithms and Training Parameters in PRW.

Selecting an Algorithm in PRW. Setting Algorithm Parameters. Linear Regression. Logistic Regression. Unimodal Gaussian. Backpropagation/MLP. Radial Basis Functions. K Nearest Neighbors. Gaussian Mixture. Nearest Cluster. K Means Clustering.



11. Training and Testing.

Train, Test, and Evaluation Sets. Validation Techniques. Cross Validation. Bootstrap Validation. Sliding Window Validation.



Appendix A: Training, Testing, and Reporting in PRW.

The Experiment Manager. Running Experiments. Enabling and Disabling Experiments. Scheduling Experiments. Selecting Report Options. Viewing Different Reports. Cross Validation. Sliding Window Validation.



12. Iterating Steps and Trouble-Shooting.

Iterating to Improve Your Solution. Automated Searches.Input Variable Selection. Algorithm Parameter Searches. Trouble-Shooting. Training Error Is High. Test Error Is High. Classification Problem Performs Poorly on Some Classes. Problems with Production Accuracy. Decision Tree Works Best by Far. Backpropagation Does Not Converge. Backpropagation Finds a Local Minimum Solution. Matrix Inversion Problem. Unimodal Gaussian Has High Training Error. Gaussian Mixture Diverges. RBF Has High Training Error.



Appendix A: Iterating in PRW.

Overview of PRW Features. Creating Multiple Spreadsheets. Creating Multiple Experiment Managers. Using Multiple Work Sessions. Using Automated Searches. Preprocessing Data. Exporting Experiments and Reports. Re-Using Experiment Parameters. Building User Functions.



Appendix A: References and Suggested Reading.


Appendix B: Pattern Recognition Workbench.


Appendix C: Unica Technologies, Inc.

About Unica. Unica's Software Products.



Appendix D: Glossary.


Index.


Software License Agreement.


What's on this CD.

Preface

Preface

Data Mining

Data mining is a term usually applied to techniques that can be used to find underlying structure and relationships in large amounts of data. These techniques are drawn primarily from the related fields of neural networks, statistics, pattern classification, and machine learning. They are becoming more important as computer automation spreads and as the processing and storage capabilities of computers increase. Widely available, low-cost computer technology now makes it possible to both collect historical data and also to institute on-line analysis and controls for newly arriving data.

Applications

Data mining techniques are being successfully used for many diverse applications. These include paper and sheet metal production control, medical diagnosis and risk prediction, credit-card fraud detection, computer security break-in and misuse detection, computer user identity verification, aluminum and steel smelting control, oil refinery control, pollution control in power plants, fraudulent income tax return detection, automobile engine control and fault detection, electric motor fault and failure prediction, mass mailing and telemarketing, and simplifying world-wide-web usage by predicting useful sites from past user behavior. Benefits of Data Mining

Benefits in these and other applications include reduced costs due to more accurate control, more accurate future predictions, more effective fault detection and prediction, fraud detection and control, and automation of repetitive human tasks. In addition, services can be improved and extended due to a better understanding of underlying processes and human behavior. Outline of this Book

This book provides a concise introduction to some of the most important input-output mapping, prediction, pattern classification, and clustering algorithms useful for data mining. This introduction is based on many collective years of experience by the authors, which has led to a focus on practical issues that must be addressed to successfully solve data mining problems. The book provides a basic road map for experts who know much about a specific application, but little about neural networks, statistics, pattern classification, or machine learning.

This road map first helps potential users determine whether input-output mapping, prediction, pattern classification, or clustering algorithms are appropriate for a given application. It then helps users determine which measurements, attributes, or features might be useful as inputs to these algorithms and provides guidance in collecting and formatting this data for computer analysis. Guidelines are then presented for accurately accessing performance using separate training, evaluation, and test data partitions or cross-validation. Finally, each important algorithm is described and guidance is provided concerning settings for parameters used to control the many algorithms. Multi-Algorithm Approach

An important truism presented in this book is that data mining is an art and that there is no single simple approach that is best for all problems. Rather, there are many algorithms and data representations, and the best strategy is to interactively experiment to find an approach that works for a particular data set. This human interaction is greatly simplified by the availability of software toolkits which allow users to interactively explore many algorithms on a common data set using the same performance metrics. This book focuses on one comprehensive software toolkit (Pattern Recognition Workbench) that includes most of the algorithms described and has the capability of handling large data sets. Details concerning this software, however, are relegated to the Appendix and to sections at the ends of chapters. These details can thus be skipped or used as examples of the types of information required to apply the various algorithms. Intended Audience

This book is most useful for persons who have a specific application in mind, but who know little about data mining algorithms. They can use this book to determine whether the algorithms presented can be applied to their application, to learn terminology, and to provide guidance when they try out some of the recommended approaches using a software toolkit. More experienced users who want to understand the theory behind prediction, mapping, control, pattern classification, and clustering or who would like to read detailed descriptions concerning specific data mining applications should explore other more advanced texts.

Richard P. Lippmann

Updates

Submit Errata

More Information

InformIT Promotional Mailings & Special Offers

I would like to receive exclusive offers and hear about products from InformIT and its family of brands. I can unsubscribe at any time.

Overview


Pearson Education, Inc., 221 River Street, Hoboken, New Jersey 07030, (Pearson) presents this site to provide information about products and services that can be purchased through this site.

This privacy notice provides an overview of our commitment to privacy and describes how we collect, protect, use and share personal information collected through this site. Please note that other Pearson websites and online products and services have their own separate privacy policies.

Collection and Use of Information


To conduct business and deliver products and services, Pearson collects and uses personal information in several ways in connection with this site, including:

Questions and Inquiries

For inquiries and questions, we collect the inquiry or question, together with name, contact details (email address, phone number and mailing address) and any other additional information voluntarily submitted to us through a Contact Us form or an email. We use this information to address the inquiry and respond to the question.

Online Store

For orders and purchases placed through our online store on this site, we collect order details, name, institution name and address (if applicable), email address, phone number, shipping and billing addresses, credit/debit card information, shipping options and any instructions. We use this information to complete transactions, fulfill orders, communicate with individuals placing orders or visiting the online store, and for related purposes.

Surveys

Pearson may offer opportunities to provide feedback or participate in surveys, including surveys evaluating Pearson products, services or sites. Participation is voluntary. Pearson collects information requested in the survey questions and uses the information to evaluate, support, maintain and improve products, services or sites, develop new products and services, conduct educational research and for other purposes specified in the survey.

Contests and Drawings

Occasionally, we may sponsor a contest or drawing. Participation is optional. Pearson collects name, contact information and other information specified on the entry form for the contest or drawing to conduct the contest or drawing. Pearson may collect additional personal information from the winners of a contest or drawing in order to award the prize and for tax reporting purposes, as required by law.

Newsletters

If you have elected to receive email newsletters or promotional mailings and special offers but want to unsubscribe, simply email information@informit.com.

Service Announcements

On rare occasions it is necessary to send out a strictly service related announcement. For instance, if our service is temporarily suspended for maintenance we might send users an email. Generally, users may not opt-out of these communications, though they can deactivate their account information. However, these communications are not promotional in nature.

Customer Service

We communicate with users on a regular basis to provide requested services and in regard to issues relating to their account we reply via email or phone in accordance with the users' wishes when a user submits their information through our Contact Us form.

Other Collection and Use of Information


Application and System Logs

Pearson automatically collects log data to help ensure the delivery, availability and security of this site. Log data may include technical information about how a user or visitor connected to this site, such as browser type, type of computer/device, operating system, internet service provider and IP address. We use this information for support purposes and to monitor the health of the site, identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents and appropriately scale computing resources.

Web Analytics

Pearson may use third party web trend analytical services, including Google Analytics, to collect visitor information, such as IP addresses, browser types, referring pages, pages visited and time spent on a particular site. While these analytical services collect and report information on an anonymous basis, they may use cookies to gather web trend information. The information gathered may enable Pearson (but not the third party web trend services) to link information with application and system log data. Pearson uses this information for system administration and to identify problems, improve service, detect unauthorized access and fraudulent activity, prevent and respond to security incidents, appropriately scale computing resources and otherwise support and deliver this site and its services.

Cookies and Related Technologies

This site uses cookies and similar technologies to personalize content, measure traffic patterns, control security, track use and access of information on this site, and provide interest-based messages and advertising. Users can manage and block the use of cookies through their browser. Disabling or blocking certain cookies may limit the functionality of this site.

Do Not Track

This site currently does not respond to Do Not Track signals.

Security


Pearson uses appropriate physical, administrative and technical security measures to protect personal information from unauthorized access, use and disclosure.

Children


This site is not directed to children under the age of 13.

Marketing


Pearson may send or direct marketing communications to users, provided that

  • Pearson will not use personal information collected or processed as a K-12 school service provider for the purpose of directed or targeted advertising.
  • Such marketing is consistent with applicable law and Pearson's legal obligations.
  • Pearson will not knowingly direct or send marketing communications to an individual who has expressed a preference not to receive marketing.
  • Where required by applicable law, express or implied consent to marketing exists and has not been withdrawn.

Pearson may provide personal information to a third party service provider on a restricted basis to provide marketing solely on behalf of Pearson or an affiliate or customer for whom Pearson is a service provider. Marketing preferences may be changed at any time.

Correcting/Updating Personal Information


If a user's personally identifiable information changes (such as your postal address or email address), we provide a way to correct or update that user's personal data provided to us. This can be done on the Account page. If a user no longer desires our service and desires to delete his or her account, please contact us at customer-service@informit.com and we will process the deletion of a user's account.

Choice/Opt-out


Users can always make an informed choice as to whether they should proceed with certain services offered by InformIT. If you choose to remove yourself from our mailing list(s) simply visit the following page and uncheck any communication you no longer want to receive: www.informit.com/u.aspx.

Sale of Personal Information


Pearson does not rent or sell personal information in exchange for any payment of money.

While Pearson does not sell personal information, as defined in Nevada law, Nevada residents may email a request for no sale of their personal information to NevadaDesignatedRequest@pearson.com.

Supplemental Privacy Statement for California Residents


California residents should read our Supplemental privacy statement for California residents in conjunction with this Privacy Notice. The Supplemental privacy statement for California residents explains Pearson's commitment to comply with California law and applies to personal information of California residents collected in connection with this site and the Services.

Sharing and Disclosure


Pearson may disclose personal information, as follows:

  • As required by law.
  • With the consent of the individual (or their parent, if the individual is a minor)
  • In response to a subpoena, court order or legal process, to the extent permitted or required by law
  • To protect the security and safety of individuals, data, assets and systems, consistent with applicable law
  • In connection the sale, joint venture or other transfer of some or all of its company or assets, subject to the provisions of this Privacy Notice
  • To investigate or address actual or suspected fraud or other illegal activities
  • To exercise its legal rights, including enforcement of the Terms of Use for this site or another contract
  • To affiliated Pearson companies and other companies and organizations who perform work for Pearson and are obligated to protect the privacy of personal information consistent with this Privacy Notice
  • To a school, organization, company or government agency, where Pearson collects or processes the personal information in a school setting or on behalf of such organization, company or government agency.

Links


This web site contains links to other sites. Please be aware that we are not responsible for the privacy practices of such other sites. We encourage our users to be aware when they leave our site and to read the privacy statements of each and every web site that collects Personal Information. This privacy statement applies solely to information collected by this web site.

Requests and Contact


Please contact us about this Privacy Notice or if you have any requests or questions relating to the privacy of your personal information.

Changes to this Privacy Notice


We may revise this Privacy Notice through an updated posting. We will identify the effective date of the revision in the posting. Often, updates are made to provide greater clarity or to comply with changes in regulatory requirements. If the updates involve material changes to the collection, protection, use or disclosure of Personal Information, Pearson will provide notice of the change through a conspicuous notice on this site or other appropriate way. Continued use of the site after the effective date of a posted revision evidences acceptance. Please contact us if you have questions or concerns about the Privacy Notice or any objection to any revisions.

Last Update: November 17, 2020