npm package discovery and stats viewer.

Discover Tips

  • General search

    [free text search, go nuts!]

  • Package details

    pkg:[package-name]

  • User packages

    @[username]

Sponsor

Optimize Toolset

I’ve always been into building performant and accessible sites, but lately I’ve been taking it extremely seriously. So much so that I’ve been building a tool to help me optimize and monitor the sites that I build to make sure that I’m making an attempt to offer the best experience to those who visit them. If you’re into performant, accessible and SEO friendly sites, you might like it too! You can check it out at Optimize Toolset.

About

Hi, 👋, I’m Ryan Hefner  and I built this site for me, and you! The goal of this site was to provide an easy way for me to check the stats on my npm packages, both for prioritizing issues and updates, and to give me a little kick in the pants to keep up on stuff.

As I was building it, I realized that I was actually using the tool to build the tool, and figured I might as well put this out there and hopefully others will find it to be a fast and useful way to search and browse npm packages as I have.

If you’re interested in other things I’m working on, follow me on Twitter or check out the open source projects I’ve been publishing on GitHub.

I am also working on a Twitter bot for this site to tweet the most popular, newest, random packages from npm. Please follow that account now and it will start sending out packages soon–ish.

Open Software & Tools

This site wouldn’t be possible without the immense generosity and tireless efforts from the people who make contributions to the world and share their work via open source initiatives. Thank you 🙏

© 2024 – Pkg Stats / Ryan Hefner

linear-least-squares

v1.0.1

Published

Finds the best curve to fit a set of points through minimizing the sum of the squares of the offset of each point from the curve.

Downloads

16

Readme

LinearLeastSquares

Finds the best curve to fit a set of points through minimizing the sum of the squares of the offset of each point from the curve.

The constructor takes an Array<[number, number]>, which is an Array of tuples. Each tuple is a point represented by [x, y].

const LinearLeastSquares = require('linear-least-squares');

let points = [
  [2, 4],
  [3, 5],
  [5, 7],
  [7, 10],
  [9, 15]
];

let fit = new LinearLeastSquares(points);

After you have initialized an instance of LinearLeastSquares with the points it should analyze, you just need to have it compute_fit().

result = fit.compute_fit();

The result object contains 4 keys:

{
  m: 1.5182926829268293,
  b: 0.30487804878048674,
  rmse: 0.7986268703523449,
  r_squared: 0.9595301473319301
}

m: is the slope of the fit line.

b: is the y-intercept of the slop line.

rmse: is the root mean square error, it tells you how concentrated the data is around the line of best fit.

r_squared: is the R-squared statistical measure, evaluates the scatter of the data points around the fitted regression line.

If you want to generate a set of points with the specified result object, you can do the following:

predicted_points = fit.predicted_points(result.m, result.b);

[
  [ 0, 0.30487804878048674 ],
  [ 1, 1.823170731707316 ],
  [ 2, 3.3414634146341453 ],
  [ 3, 4.859756097560974 ],
  [ 4, 6.378048780487804 ],
  [ 5, 7.896341463414633 ],
  [ 6, 9.414634146341463 ],
  [ 7, 10.932926829268293 ],
  [ 8, 12.45121951219512 ]
]

If you would like to generate any point on the specified result object, you can do the following:

predicted_point = fit.predicted_point(result.m, 12, result.b);

[ 12, 18.524390243902438 ]

Source docs are available at https://github.com/jjviscomi/LinearLeastSquares/blob/master/docs/classes/linear_least_squares.linearleastsquares.md