Mining Complex Data (eBook, PDF)

Redaktion: Zighed, Djamel A.; Hacid, Hakim; Ras, Zbigniew W.; Tsumoto, Shusaku

• Format: PDF

Produktbeschreibung

The aim of this book is to gather the most recent works that address issues related to the concept of mining complex data. The whole knowledge discovery process being involved, our goal is to provide researchers dealing with each step of this process by key entries. Actually, managing complex data within the KDD process implies to work on every step, starting from the pre-processing (e.g. structuring and organizing) to the visualization and interpretation (e.g. sorting or filtering) of the results, via the data mining methods themselves (e.g. classification, clustering, frequent patterns extraction, etc.). The papers presented here are selected from the workshop papers held yearly since 2006.

---

Dieser Download kann aus rechtlichen Gründen nur mit Rechnungsadresse in A, B, BG, CY, CZ, D, DK, EW, E, FIN, F, GR, HR, H, IRL, I, LT, L, LR, M, NL, PL, P, R, S, SLO, SK ausgeliefert werden.

Produktdetails

• Verlag: Springer Berlin Heidelberg
• Seitenzahl: 302
• Erscheinungstermin: 10. Oktober 2008
• Englisch
• ISBN-13: 9783540880677
• Artikelnr.: 44131232

Inhaltsangabe

General Aspects of Complex Data.- Using Layout Data for the Analysis of Scientific Literature.- Extracting a Fuzzy System by Using Genetic Algorithms for Imbalanced Datasets Classification: Application on Down's Syndrome Detection.- A Hybrid Approach of Boosting Against Noisy Data.- Dealing with Missing Values in a Probabilistic Decision Tree during Classification.- Kernel-Based Algorithms and Visualization for Interval Data Mining.- Rules Extraction.- Evaluating Learning Algorithms Composed by a Constructive Meta-learning Scheme for a Rule Evaluation Support Method.- Mining Statistical Association Rules to Select the Most Relevant Medical Image Features.- From Sequence Mining to Multidimensional Sequence Mining.- Tree-Based Algorithms for Action Rules Discovery.- Graph Data Mining.- Indexing Structure for Graph-Structured Data.- Full Perfect Extension Pruning for Frequent Subgraph Mining.- Parallel Algorithm for Enumerating Maximal Cliques in Complex Network.- Community Finding of Scale-Free Network: Algorithm and Evaluation Criterion.- The k-Dense Method to Extract Communities from Complex Networks.- Data Clustering.- Efficient Clustering for Orders.- Exploring Validity Indices for Clustering Textual Data.