/tags/java/Recent content in java on Rodrigo AraujoHugo -- gohugo.ioen-usFri, 09 Jan 2015 00:00:00 +0000/posts/gradient-descent-algorithm-in-java/Fri, 09 Jan 2015 00:00:00 +0000/posts/gradient-descent-algorithm-in-java/<h3 id="how-can-we-make-a-machine-learn-from-data">How can we make a machine learn from data?</h3> <p>Then, how can we make the machine predicts things based on that learned data? Those are the question answered by one of the most classic Machine Learning Algorithms, the <strong>Gradient Descent Algorithm</strong>, from a Mathematical-Statistical side it’s called <strong>Univariate Linear Regression</strong>.</p> <p>This is one of the tools of the Machine Learning toolbox, and what it tries to do is to model a relationship between a scalar dependent variable Y and a explanatory variable X.</p> <h3 id="in-laymans-term">In Layman’s term…</h3> <p>Let’s suppose you have a few points distributed in a Graph, so you already know that in a point A you have a well defined X and Y, which means, if you input X, your output will be Y, and in a point B you have a well defined X’ and Y’ as well. But, thing is, if a point emerge between A and B, and you only have the X… what will be the Y <em>(the output)</em>?</p>/post/fun-with-graphs-pt1/Fri, 10 Oct 2014 00:00:00 +0000/post/fun-with-graphs-pt1/<p>Graph Theory is definitely one of my favorite branches of the Mathematics &amp; Computer Science, mostly because of its nearest infinity applications, in both real world problems and pure theoretical problems.</p> <p>These days I’ve been working (with my buddy Daniel Almeida) in a framework to create and manipulate graphs. Which means, creating a data structure to represent graphs, edges, vertexes and creating algorithms to work on this structure. All this is being made with Java and I’ll expose this code here, as I saw a terrible lack of good readable codes about it on the internet.</p>