Author |
: K. R. Venugopal |
Publisher |
: Springer |
Total Pages |
: 354 |
Release |
: 2009-02-24 |
ISBN-10 |
: 9783642001932 |
ISBN-13 |
: 3642001939 |
Rating |
: 4/5 (32 Downloads) |
Book Synopsis Soft Computing for Data Mining Applications by : K. R. Venugopal
Download or read book Soft Computing for Data Mining Applications written by K. R. Venugopal and published by Springer. This book was released on 2009-02-24 with total page 354 pages. Available in PDF, EPUB and Kindle. Book excerpt: The authors have consolidated their research work in this volume titled Soft Computing for Data Mining Applications. The monograph gives an insight into the research in the ?elds of Data Mining in combination with Soft Computing methodologies. In these days, the data continues to grow - ponentially. Much of the data is implicitly or explicitly imprecise. Database discovery seeks to discover noteworthy, unrecognized associations between the data items in the existing database. The potential of discovery comes from the realization that alternate contexts may reveal additional valuable information. The rate at which the data is storedis growing at a phenomenal rate. Asaresult,traditionaladhocmixturesofstatisticaltechniquesanddata managementtools are no longer adequate for analyzing this vast collection of data. Severaldomainswherelargevolumesofdataarestoredincentralizedor distributeddatabasesincludesapplicationslikeinelectroniccommerce,bio- formatics, computer security, Web intelligence, intelligent learning database systems,?nance,marketing,healthcare,telecommunications,andother?elds. E?cient tools and algorithms for knowledge discovery in large data sets have been devised during the recent years. These methods exploit the ca- bility of computers to search huge amounts of data in a fast and e?ective manner. However,the data to be analyzed is imprecise and a?icted with - certainty. In the case of heterogeneous data sources such as text and video, the data might moreover be ambiguous and partly con?icting. Besides, p- terns and relationships of interest are usually approximate. Thus, in order to make the information mining process more robust it requires tolerance toward imprecision, uncertainty and exceptions.