Practical Data Mining - Softcover

Hancock, Jr. Monte F.

Softcover

ISBN 10: 1439868360 ISBN 13: 9781439868362

Publisher: Auerbach Publications, 2011

Synopsis

Used by corporations, industry, and government to inform and fuel everything from focused advertising to homeland security, data mining can be a very useful tool across a wide range of applications. Unfortunately, most books on the subject are designed for the computer scientist and statistical illuminati and leave the reader largely adrift in technical waters.

Revealing the lessons known to the seasoned expert, yet rarely written down for the uninitiated, Practical Data Mining explains the ins-and-outs of the detection, characterization, and exploitation of actionable patterns in data. This working field manual outlines the what, when, why, and how of data mining and offers an easy-to-follow, six-step spiral process. Catering to IT consultants, professional data analysts, and sophisticated data owners, this systematic, yet informal treatment will help readers answer questions, such as:

• What process model should I use to plan and execute a data mining project?



• How is a quantitative business case developed and assessed?



• What are the skills needed for different data mining projects?



• How do I track and evaluate data mining projects?



• How do I choose the best data mining techniques?

Helping you avoid common mistakes, the book describes specific genres of data mining practice. Most chapters contain one or more case studies with detailed projects descriptions, methods used, challenges encountered, and results obtained. The book includes working checklists for each phase of the data mining process. Your passport to successful technical and planning discussions with management, senior scientists, and customers, these checklists lay out the right questions to ask and the right points to make from an insider’s point of view.

Visit the book’s webpage

About this title

About the Author

Monte F. Hancock, Jr., BA, MS, is Chief Scientist for Celestech, Inc., which has offices in Falls Church, Virginia, and Phoenix, Arizona. He was also a Technical Fellow at Northrop Grumman; Chief Cognitive Research Scientist for CSI, Inc., and was a software architect and engineer at Harris corporation, and HRB Singer, Inc. He has over 30 years of industry experience in software engineering and data mining technology development.

He is also Adjunct Full Professor of Computer Science for the Webster University Space Coast Region, where he serves as Program Mentor for the Master of Science Degree in Computer Science. Monte has served for 26 years on the adjunct faculty in the Mathematics and Computer Science Department of the Hamilton Holt School of Rollins College, Winter Park, Florida, and served 3 semesters as adjunct Instructor in Computer Science at Pennsylvania State University.

Monte teaches secondary Mathematics, AP Physics, Chemistry, Logic, Western Philosophy, and Church History at New Covenant School, and New Testament Greek at Heritage Christian Academy, both in Melbourne, Florida. He was a mathematics curriculum developer for the Department of Continuing Education of the University of Florida in Gainesville, and serves on the Industry Advisory Panels in Computer Science for both the Florida Institute of Technology, and Brevard Community College in Melbourne, Florida. Monte has twice served on panels for the National Science Foundation.

Monte has served on many program committees for international data mining conferences, was a Session Chair for KDD. He has presented 15 conference papers, edited several book chapters, and co-authored the book Data Mining Explained with Rhonda Delmater, Digital Press, 2001.

Monte is cited in (among others):

• "Who’s Who in the World" (2009–2012)



• "Who’s Who in America" (2009–2012)



• "Who’s Who in Science and Engineering" (2006–2012)

Edition details

• Publisher: Auerbach Publications
• Publication date: 2011
• Language: English
• ISBN 10: 1439868360
• ISBN 13: 9781439868362
• Binding: Paperback
• Edition number: 1
• Number of pages: 302