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 ...
Read More
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.
Read Less
Add this copy of Scalable Algorithms for Data and Network Analysis to cart. $85.03, new condition, Sold by Ingram Customer Returns Center rated 5.0 out of 5 stars, ships from NV, USA, published 2016 by now publishers Inc.
Add this copy of Scalable Algorithms for Data and Network Analysis to cart. $103.25, new condition, Sold by GreatBookPrices rated 4.0 out of 5 stars, ships from Columbia, MD, UNITED STATES, published 2016 by now publishers Inc.
Choose your shipping method in Checkout. Costs may vary based on destination.
Seller's Description:
New. Foundations and TrendsŪ in Theoretical Computer Science . Intended for college/higher education audience. In Stock. 100% Money Back Guarantee. Brand New, Perfect Condition, allow 4-14 business days for standard shipping. To Alaska, Hawaii, U.S. protectorate, P.O. box, and APO/FPO addresses allow 4-28 business days for Standard shipping. No expedited shipping. All orders placed with expedited shipping will be cancelled. Over 3, 000, 000 happy customers.
Add this copy of Scalable Algorithms for Data and Network Analysis to cart. $103.26, new condition, Sold by Just one more Chapter rated 3.0 out of 5 stars, ships from Miramar, FL, UNITED STATES, published 2016 by Now Publishers.
Add this copy of Scalable Algorithms for Data and Network Analysis to cart. $114.08, new condition, Sold by Ria Christie Books rated 4.0 out of 5 stars, ships from Uxbridge, MIDDLESEX, UNITED KINGDOM, published 2016 by now publishers Inc.
Add this copy of Scalable Algorithms for Data and Network Analysis to cart. $116.26, new condition, Sold by Paperbackshop rated 4.0 out of 5 stars, ships from Bensenville, IL, UNITED STATES, published 2016 by Now Publishers.
