Chapman & Hall/CRC Data Mining and Knowledge Discovery
2 total works
Spectral Feature Selection for Data Mining introduces a novel feature selection technique that establishes a general platform for studying existing feature selection algorithms and developing new algorithms for emerging problems in real-world applications. This technique represents a unified framework for supervised, unsupervised, and semisupervised feature selection.
The book explores the latest research achievements, sheds light on new research directions, and stimulates readers to make the next creative breakthroughs. It presents the intrinsic ideas behind spectral feature selection, its theoretical foundations, its connections to other algorithms, and its use in handling both large-scale data sets and small sample problems. The authors also cover feature selection and feature extraction, including basic concepts, popular existing algorithms, and applications.
A timely introduction to spectral feature selection, this book illustrates the potential of this powerful dimensionality reduction technique in high-dimensional data processing. Readers learn how to use spectral feature selection to solve challenging problems in real-life applications and discover how general feature selection and extraction are connected to spectral feature selection.
This book begins with a brief introduction to social computing and a review of classic graph theory and game theory. It then examines the data used to construct social networks, focusing on emerging Web 2.0 technologies and social networking websites, such as Facebook and MySpace. The book also explores data mining for social network extraction and analysis, presenting link and graph mining algorithms, such as subgraph discovery and clustering. In the last section, the authors provide case studies to illustrate concepts and principles as well as to demonstrate how to integrate components in order to solve real-world problems.