CART

(0) items

Co-Clustering: Models, Algorithms and Applications,9781848214736
This item qualifies for
FREE SHIPPING!

FREE SHIPPING OVER $59!

Your order must be $59 or more, you must select US Postal Service Shipping as your shipping preference, and the "Group my items into as few shipments as possible" option when you place your order.

Bulk sales, PO's, Marketplace Items, eBooks, Apparel, and DVDs not included.

Co-Clustering: Models, Algorithms and Applications

by ;
Edition:
1st
ISBN13:

9781848214736

ISBN10:
1848214731
Format:
Hardcover
Pub. Date:
12/9/2013
Publisher(s):
Wiley-ISTE
List Price: $95.00

Rent Textbook

(Recommended)
 
Term
Due
Price
$85.50

Buy New Textbook

Currently Available, Usually Ships in 24-48 Hours
N9781848214736
$91.25

Used Textbook

We're Sorry
Sold Out

eTextbook

We're Sorry
Not Available

More New and Used
from Private Sellers
Starting at $86.24
See Prices

Questions About This Book?

Why should I rent this book?
Renting is easy, fast, and cheap! Renting from eCampus.com can save you hundreds of dollars compared to the cost of new or used books each semester. At the end of the semester, simply ship the book back to us with a free UPS shipping label! No need to worry about selling it back.
How do rental returns work?
Returning books is as easy as possible. As your rental due date approaches, we will email you several courtesy reminders. When you are ready to return, you can print a free UPS shipping label from our website at any time. Then, just return the book to your UPS driver or any staffed UPS location. You can even use the same box we shipped it in!
What version or edition is this?
This is the 1st edition with a publication date of 12/9/2013.
What is included with this book?
  • The New copy of this book will include any supplemental materials advertised. Please check the title of the book to determine if it should include any CDs, lab manuals, study guides, etc.
  • The Rental copy of this book is not guaranteed to include any supplemental materials. You may receive a brand new copy, but typically, only the book itself.

Summary

Cluster or co-cluster analyses are important tools in a variety of scientific areas. The introduction of this book presents a state of the art of already well-established, as well as more recent methods of co-clustering. The authors mainly deal with the two-mode partitioning under different approaches, but pay particular attention to a probabilistic approach.
Chapter 1 concerns clustering in general and the model-based clustering in particular. The authors briefly review the classical clustering methods and focus on the mixture model. They present and discuss the use of different mixtures adapted to different types of data. The algorithms used are described and related works with different classical methods are presented and commented upon. This chapter is useful in tackling the problem of
co-clustering under the mixture approach. Chapter 2 is devoted to the latent block model proposed in the mixture approach context. The authors discuss this model in detail and present its interest regarding co-clustering. Various algorithms are presented in a general context. Chapter 3 focuses on binary and categorical data. It presents, in detail, the appropriated latent block mixture models. Variants of these models and algorithms are presented and illustrated using examples. Chapter 4 focuses on contingency data. Mutual information, phi-squared and model-based co-clustering are studied. Models, algorithms and connections among different approaches are described and illustrated. Chapter 5 presents the case of continuous data. In the same way, the different approaches used in the previous chapters are extended to this situation.

Contents

1. Cluster Analysis.
2. Model-Based Co-Clustering.
3. Co-Clustering of Binary and Categorical Data.
4. Co-Clustering of Contingency Tables.
5. Co-Clustering of Continuous Data.

About the Authors

Gérard Govaert is Professor at the University of Technology of Compiègne, France. He is also a member of the CNRS Laboratory Heudiasyc (Heuristic and diagnostic of complex systems). His research interests include latent structure modeling, model selection, model-based cluster analysis, block clustering and statistical pattern recognition. He is one of the authors of the MIXMOD (MIXtureMODelling) software.
Mohamed Nadif is Professor at the University of Paris-Descartes, France, where he is a member of LIPADE (Paris Descartes computer science laboratory) in the Mathematics and Computer Science department. His research interests include machine learning, data mining, model-based cluster analysis, co-clustering, factorization and data analysis.

Cluster Analysis is an important tool in a variety of scientific areas. Chapter 1 briefly presents a state of the art of already well-established as well more recent methods. The hierarchical, partitioning and fuzzy approaches will be discussed amongst others. The authors review the difficulty of these classical methods in tackling the high dimensionality, sparsity and scalability. Chapter 2 discusses the interests of coclustering, presenting different approaches and defining a co-cluster. The authors focus on co-clustering as a simultaneous clustering and discuss the cases of binary, continuous and co-occurrence data. The criteria and algorithms are described and illustrated on simulated and real data. Chapter 3 considers co-clustering as a model-based co-clustering. A latent block model is defined for different kinds of data. The estimation of parameters and co-clustering is tackled under two approaches: maximum likelihood and classification maximum likelihood. Hard and soft algorithms are described and applied on simulated and real data. Chapter 4 considers co-clustering as a matrix approximation. The trifactorization approach is considered and algorithms based on update rules are described. Links with numerical and probabilistic approaches are established. A combination of algorithms are proposed and evaluated on simulated and real data. Chapter 5 considers a co-clustering or bi-clustering as the search for coherent co-clusters in biological terms or the extraction of co-clusters under conditions. Classical algorithms will be described and evaluated on simulated and real data. Different indices to evaluate the quality of coclusters are noted and used in numerical experiments.

Table of Contents

Ch 1: Cluster Analyis

1. Hierarchical clustering

2. Partitional clustering

3. Subspace clustering

Ch 2: Co-clustering analysis

1. Two-side cluster Analysis

2. Nature of a co-cluster

3. Objective functions and algorithms

4. Binary data and Crobin

5. Continuous data and Croeuc

6. Co-occurrence, dhillon, Croki2 etc. (text mining)

7. Numerical experiments

Ch 3: Model-based co-clustering

1. Latent block model

2. Classification Maximum likelihood approach

3. Complete data likelihood

4. Block CEM Algorithm

5. Binary, continuous and Co-occurrence table

6. Maximum likelihood approach

7. Likelihood

8. Variational  Algorithm

9. Binary, continuous and Co-occurrence table

10. Selection of the model

11. Numerical experiments

Ch 4: Matricial-based co-clustering

1. Matricial formulation of co-clustering

2. Nonnegative matrix factorization

3. Nonnegative matrix Tri-factorization

4. Numerical experiments

Ch 5: Co-clustering  in Bioinformatics

1. Cheng and Church algorithm

2. Bimax

3. Plaid model

4. Spectral algorithm

5. Xmotifs algorithm

6. Numerical experiments

Conclusion



Please wait while the item is added to your cart...