Data Mining: Multimedia, Soft Computing, and BioinformaticsA primer on traditional hard and emerging soft computing approaches for mining multimedia data While the digital revolution has made huge volumes of high dimensional multimedia data available, it has also challenged users to extract the information they seek from heretofore unthinkably huge datasets. Traditional hard computing data mining techniques have concentrated on flat-file applications. Soft computing tools-such as fuzzy sets, artificial neural networks, genetic algorithms, and rough sets-however, offer the opportunity to apply a wide range of data types to a variety of vital functions by handling real-life uncertainty with low-cost solutions. Data Mining: Multimedia, Soft Computing, and Bioinformatics provides an accessible introduction to fundamental and advanced data mining technologies. This readable survey describes data mining strategies for a slew of data types, including numeric and alpha-numeric formats, text, images, video, graphics, and the mixed representations therein. Along with traditional concepts and functions of data mining-like classification, clustering, and rule mining-the authors highlight topical issues in multimedia applications and bioinformatics. Principal topics discussed throughout the text include: The role of soft computing and its principles in data mining Principles and classical algorithms on string matching and their role in data (mainly text) mining Data compression principles for both lossless and lossy techniques, including their scope in data mining Access of data using matching pursuits both in raw and compressed data domains Application in mining biological databases |
From inside the book
Results 1-3 of 91
In case of continuous-valued parameters, a decimal-to-binary conversion is used.
For example, using a 5-bit representation, 13 is encoded as 01101. In case of
parameters having categorical values, a particular bit position in the
chromosomal ...
(Example: From Fig. 3.3 we find that the two lowest probability symbols g and d
are associated with nodes N6 and TV3, respectively. The new node 7V8
becomes the parent of N3 and N6.) 3. Label the probability of this new parent
node as the ...
Example 3: We illustrate an example of string matching with. Fig. 4.4 Finite
automata: (a) state diagram, (b) state transition table, and (c) pattern matching
example. Fig. 4.13 Example of Karp-Rabin string matching algorithm with modulo
.
What people are saying - Write a review
Contents
Soft Computing | 35 |
Multimedia Data Compression | 89 |
standard | 129 |
Copyright | |
9 other sections not shown
Other editions - View all
Data Mining: Multimedia, Soft Computing, and Bioinformatics Sushmita Mitra,Tinku Acharya Limited preview - 2005 |
Data Mining: Multimedia, Soft Computing, and Bioinformatics Sushmita Mitra,Tinku Acharya No preview available - 2005 |