In this course, you will: - Learn about GANs and their applications - Understand the intuition behind the fundamental components of GANs - Explore and implement multiple GAN architectures - Build conditional GANs capable of generating examples from determined categories The DeepLearning.AI Generative Adversarial Networks (GANs) Specialization provides an exciting introduction to image generation with GANs, charting a path from foundational concepts to advanced techniques through an easy-to-understand approach. It also covers social implications, including bias in ML and the ways to detect it, privacy preservation, and more. Build a comprehensive knowledge base and gain hands-on experience in GANs. Train your own model using PyTorch, use it to create images, and evaluate a variety of advanced GANs. This Specialization provides an accessible pathway for all levels of learners looking to break into the GANs space or apply GANs to their own projects, even without prior familiarity with advanced math and machine learning research.

Basic algorithms on tree data structures, binary search trees, self-balancing trees, graph data structures and basic traversal algorithms on graphs. This course also covers advanced topics such as kd-trees for spatial data and algorithms for spatial data. Trees and Graphs: Basics can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.

In this course you have the opportunity to use the skills you acquired in the two SAS programming courses to solve realistic problems. This course is also designed to give you a thorough review of SAS programming concepts so you are prepared to take the SAS Certified Specialist: Base Programming Using SAS 9.4 Exam.

In this one hour long project-based course, you will tackle a real-world computer vision problem. We will be locating and tracking a target in a video shot with a digital camera. We will encounter some of the classic challenges that make computer vision difficult: noisy sensor data, objects that change shape, and occlusion (object hidden from view). We will tackle these challenges with an artificial intelligence technique called a particle filter. By the end of this project, you will have coded a particle filter from scratch using Python and numpy. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.

This online course covers basic algorithmic techniques and ideas for computational problems arising frequently in practical applications: sorting and searching, divide and conquer, greedy algorithms, dynamic programming. We will learn a lot of theory: how to sort data and how it helps for searching; how to break a large problem into pieces and solve them recursively; when it makes sense to proceed greedily; how dynamic programming is used in genomic studies. You will practice solving computational problems, designing new algorithms, and implementing solutions efficiently (so that they run in less than a second).

In this 1-hour long project-based course, you will learn how to you can use coverage.py to ensure that every bit of your python code is covered by a test - hence the name coverage.py. You will create test functions for a python class, one method and a time. At each step, you will learn how to cover different aspects of your code and use the cool web interface of coverage.py to monitor your progress. Note: This course works best for learners who are based in the North America region. We’re currently working on providing the same experience in other regions.

The majority of data in the world is unlabeled and unstructured. Shallow neural networks cannot easily capture relevant structure in, for instance, images, sound, and textual data. Deep networks are capable of discovering hidden structures within this type of data. In this course you’ll use TensorFlow library to apply deep learning to different data types in order to solve real world problems. Learning Outcomes: After completing this course, learners will be able to: • explain foundational TensorFlow concepts such as the main functions, operations and the execution pipelines. • describe how TensorFlow can be used in curve fitting, regression, classification and minimization of error functions. • understand different types of Deep Architectures, such as Convolutional Networks, Recurrent Networks and Autoencoders. • apply TensorFlow for backpropagation to tune the weights and biases while the Neural Networks are being trained.

This course covers basics of algorithm design and analysis, as well as algorithms for sorting arrays, data structures such as priority queues, hash functions, and applications such as Bloom filters. Algorithms for Searching, Sorting, and Indexing can be taken for academic credit as part of CU Boulder’s Master of Science in Data Science (MS-DS) degree offered on the Coursera platform. The MS-DS is an interdisciplinary degree that brings together faculty from CU Boulder’s departments of Applied Mathematics, Computer Science, Information Science, and others. With performance-based admissions and no application process, the MS-DS is ideal for individuals with a broad range of undergraduate education and/or professional experience in computer science, information science, mathematics, and statistics. Learn more about the MS-DS program at https://www.coursera.org/degrees/master-of-science-data-science-boulder.

In this course, we will explore different types of problems, the boundaries of what makes a problem solvable, and the different algorithms, rules, and heuristics we can implement to solve these problems.

Manipulating big data distributed over a cluster using functional concepts is rampant in industry, and is arguably one of the first widespread industrial uses of functional ideas. This is evidenced by the popularity of MapReduce and Hadoop, and most recently Apache Spark, a fast, in-memory distributed collections framework written in Scala. In this course, we'll see how the data parallel paradigm can be extended to the distributed case, using Spark throughout. We'll cover Spark's programming model in detail, being careful to understand how and when it differs from familiar programming models, like shared-memory parallel collections or sequential Scala collections. Through hands-on examples in Spark and Scala, we'll learn when important issues related to distribution like latency and network communication should be considered and how they can be addressed effectively for improved performance. Learning Outcomes. By the end of this course you will be able to: - read data from persistent storage and load it into Apache Spark, - manipulate data with Spark and Scala, - express algorithms for data analysis in a functional style, - recognize how to avoid shuffles and recomputation in Spark, Recommended background: You should have at least one year programming experience. Proficiency with Java or C# is ideal, but experience with other languages such as C/C++, Python, Javascript or Ruby is also sufficient. You should have some familiarity using the command line. This course is intended to be taken after Parallel Programming: https://www.coursera.org/learn/parprog1. Note that this version of the course uses Scala 2.13. You can find a more recent version of the course that uses Scala 3 here: https://www.coursera.org/learn/scala-spark-big-data