0
Your cart

Your cart is empty

Books > Computing & IT > General theory of computing

Buy Now

Scalable Algorithms for Data and Network Analysis (Paperback) Loot Price: R2,253
Discovery Miles 22 530
Scalable Algorithms for Data and Network Analysis (Paperback): Shang-Hua Teng

Scalable Algorithms for Data and Network Analysis (Paperback)

Shang-Hua Teng

Series: Foundations and Trends (R) in Theoretical Computer Science

 (sign in to rate)
Loot Price R2,253 Discovery Miles 22 530 | Repayment Terms: R211 pm x 12*

Bookmark and Share

Expected to ship within 10 - 15 working days

In the age of Big Data, efficient algorithms are in higher demand more than ever before. While Big Data takes us into the asymptotic world envisioned by our pioneers, it also challenges the classical notion of efficient algorithms: algorithms that used to be considered efficient, according to polynomial-time characterization, may no longer be adequate for solving today's problems. It is not just desirable but essential that efficient algorithms should be scalable. In other words, their complexity should be nearly linear or sub-linear with respect to the problem size. Thus, scalability, not just polynomial-time computability, should be elevated as the central complexity notion for characterizing efficient computation. Scalable Algorithms for Data and Network Analysis surveys a family of algorithmic techniques for the design of scalable algorithms. These techniques include local network exploration, advanced sampling, sparsification, and geometric partitioning. They also include spectral graph-theoretical methods, such as are used for computing electrical flows and sampling from Gaussian Markov random fields. These methods exemplify the fusion of combinatorial, numerical, and statistical thinking in network analysis. This book illustrates the use of these techniques by a few basic problems that are fundamental in analyzing network data, particularly for the identification of significant nodes and coherent clusters/communities in social and information networks. It also discusses some frameworks beyond graph-theoretical models for studying conceptual questions that arise in network analysis and social influences.

General

Imprint: Now Publishers Inc
Country of origin: United States
Series: Foundations and Trends (R) in Theoretical Computer Science
Release date: May 2016
First published: 2016
Authors: Shang-Hua Teng
Dimensions: 234 x 156 x 16mm (L x W x T)
Format: Paperback
Pages: 292
ISBN-13: 978-1-68083-130-6
Categories: Books > Computing & IT > General theory of computing > General
Books > Computing & IT > Applications of computing > General
LSN: 1-68083-130-5
Barcode: 9781680831306

Is the information for this product incomplete, wrong or inappropriate? Let us know about it.

Does this product have an incorrect or missing image? Send us a new image.

Is this product missing categories? Add more categories.

Review This Product

No reviews yet - be the first to create one!

Partners