Construct, analyze, and visualize networks with networkx, a Python language module. Network analysis is a powerful tool you can apply to a multitude of datasets and situations. Discover how to work with all kinds of networks, including social, product, temporal, spatial, and semantic networks. Convert almost any real-world data into a complex network--such as recommendations on co-using cosmetic products, muddy hedge fund connections, and online friendships. Analyze and visualize the network, and make business decisions based on your analysis. If you're a curious Python programmer, a data scientist, or a CNA specialist interested in mechanizing mundane tasks, you'll increase your productivity exponentially.
Complex network analysis used to be done by hand or with non-programmable network analysis tools, but not anymore! You can now automate and program these tasks in Python. Complex networks are collections of connected items, words, concepts, or people. By exploring their structure and individual elements, we can learn about their meaning, evolution, and resilience.
Starting with simple networks, convert real-life and synthetic network graphs into networkx data structures. Look at more sophisticated networks and learn more powerful machinery to handle centrality calculation, blockmodeling, and clique and community detection. Get familiar with presentation-quality network visualization tools, both programmable and interactive--such as Gephi, a CNA explorer. Adapt the patterns from the case studies to your problems. Explore big networks with NetworKit, a high-performance networkx substitute. Each part in the book gives you an overview of a class of networks, includes a practical study of networkx functions and techniques, and concludes with case studies from various fields, including social networking, anthropology, marketing, and sports analytics.
Combine your CNA and Python programming skills to become a better network analyst, a more accomplished data scientist, and a more versatile programmer.
What You Need:
You will need a Python 3.x installation with the following additional modules: Pandas (>=0.18), NumPy (>=1.10), matplotlib (>=1.5), networkx (>=1.11), python-louvain (>=0.5), NetworKit (>=3.6), and generalizesimilarity. We recommend using the Anaconda distribution that comes with all these modules, except for python-louvain, NetworKit, and generalizedsimilarity, and works on all major modern operating systems.
Le informazioni nella sezione "Riassunto" possono far riferimento a edizioni diverse di questo titolo.
Dmitry Zinoviev has graduate degrees in physics and computer science with a PhD from Stony Brook University. His research interests include computer simulation and modeling, network science, network analysis, and digital humanities. He has been teaching at Suffolk University in Boston, MA since 2001. He is the author of Data Science Essentials in Python.
Le informazioni nella sezione "Su questo libro" possono far riferimento a edizioni diverse di questo titolo.
GRATIS per la spedizione in U.S.A.
Destinazione, tempi e costiEUR 3,83 per la spedizione in U.S.A.
Destinazione, tempi e costiDa: SecondSale, Montgomery, IL, U.S.A.
Condizione: Very Good. Item in very good condition! Textbooks may not include supplemental items i.e. CDs, access codes etc. Codice articolo 00090295550
Quantità: 2 disponibili
Da: BooksRun, Philadelphia, PA, U.S.A.
Paperback. Condizione: Good. 1. It's a preowned item in good condition and includes all the pages. It may have some general signs of wear and tear, such as markings, highlighting, slight damage to the cover, minimal wear to the binding, etc., but they will not affect the overall reading experience. Codice articolo 1680502697-11-1
Quantità: 1 disponibili
Da: HPB-Red, Dallas, TX, U.S.A.
Paperback. Condizione: Good. Connecting readers with great books since 1972! Used textbooks may not include companion materials such as access codes, etc. May have some wear or writing/highlighting. We ship orders daily and Customer Service is our top priority! Codice articolo S_434280898
Quantità: 1 disponibili
Da: More Than Words, Waltham, MA, U.S.A.
Condizione: Good. A sound copy with only light wear. Overall a solid copy at a great price! Codice articolo BOS-O-08i-01315
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.1. Codice articolo G1680502697I3N00
Quantità: 1 disponibili
Da: ThriftBooks-Dallas, Dallas, TX, U.S.A.
Paperback. Condizione: Good. No Jacket. Pages can have notes/highlighting. Spine may show signs of wear. ~ ThriftBooks: Read More, Spend Less 1.1. Codice articolo G1680502697I3N00
Quantità: 1 disponibili
Da: ThriftBooks-Atlanta, AUSTELL, GA, U.S.A.
Paperback. Condizione: Very Good. No Jacket. May have limited writing in cover pages. Pages are unmarked. ~ ThriftBooks: Read More, Spend Less 1.1. Codice articolo G1680502697I4N00
Quantità: 1 disponibili
Da: Dream Books Co., Denver, CO, U.S.A.
Condizione: good. Gently used with minimal wear on the corners and cover. A few pages may contain light highlighting or writing, but the text remains fully legible. Dust jacket may be missing, and supplemental materials like CDs or codes may not be included. May be ex-library with library markings. Ships promptly! Codice articolo DBV.1680502697.G
Quantità: 1 disponibili
Da: 2nd Life Books, Burlington, NJ, U.S.A.
Condizione: good. Used book in good condition. May have some wear to binding, spine, cover, and pages. Some light highlighting markings writing may be present. May have some stickers and or sticker residue present. May be Ex-lib. copy. May NOT include discs, or access code or other supplemental material. We ship Monday-Saturday and respond to inquiries within 24 hours. Codice articolo BXM.9ZGR
Quantità: 1 disponibili
Da: Goodwill Books, Hillsboro, OR, U.S.A.
Condizione: acceptable. Fairly worn, but readable and intact. If applicable: Dust jacket, disc or access code may not be included. Codice articolo 3IIK100058P4_ns
Quantità: 2 disponibili