Find out what learning curves are and how to use them to evaluating your Machine Learning models.
Also find me here:
Baeldung Editor
Josh Cummings
Josh has been a software engineer for over 15 years building enterprise applications across multiple industries. He has long been passionate about application security and loves opportunities to mentor and to learn from others. When Josh isn't hacking away at code, he is either running, playing basketball, camping, or reading a Brandon Sanderson novel.
Here's what I've reviewed (so far):
Baeldung on Computer Science
- All
- Core Concepts (3)
- Algorithms (3)
- Data Science (2)
- Trees (1)
- Programming (1)
- Machine Learning (1)
- Graph Traversal (1)
- Concurrency (1)
Constituency Parsing vs Dependency Parsing
Filed under Core Concepts
Learn the difference between constituency and dependency parsing and when best to use each.
Minimum Spanning Tree vs Shortest Path Tree
Filed under Algorithms, Trees
Learn the difference between Minimum Spanning Trees and Shortest Path Trees
The ABA Problem in Concurrency
Filed under Concurrency
Learn about the ABA problem; how it happens, what problems it can cause, and how to fix it.
Understanding Space Complexity
Filed under Core Concepts
Learn how to analyze an algorithms space complexity
Predicates in Computer Science
Filed under Core Concepts, Data Science
Learn the fundamentals of Predicates, fuzzy or otherwise.
Longest Increasing Subsequence Using Dynamic Programming
Filed under Algorithms, Programming
Learn the dynamic programming approach for the longest increasing subsequence programming problem.
Clustering Into an Unknown Number of Clusters
Filed under Algorithms, Data Science
Understand clustering algorithms that may apply when we don’t know how many clusters there will be
Difference Between Prim’s and Dijkstra’s Algorithms
Filed under Graph Traversal
Learn when you’d use Prim’s or Dijkstra’s algorithms