Algorithms from the Book

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This record preserves its author, date and source link. Open HN to read the full context.

This is a personalized news site that I wrote in two months based on algorithms from the book Programming Collective Intelligence. Please tell me what you think. It has two main features: the ability to identify related /similar links and suggestions/recommendations that actually work. The basis for all of the algorithms is a document similarity metric presented in Chapter 3: Discovering Groups. Basically, to compare document A with document B, we calculate the Pearson correlation coefficient between the word frequencies of document A and the word counts of document B. (You can imagine this as plotting a series of points of a graph: each point's x coordinate is its frequency in document A and each point's Y coordinate is its frequency in document B. The Pearson correlation coefficient is a measure of how well the line-of-best-fit fits the…