OK, I admit I have no idea what is the correct terminology, so could be thread title is completely off.(adsbygoogle = window.adsbygoogle || []).push({});

Imagine I have a graph of links between www pages. I suppose some of these pages are clustered - that is, they are heavily interlinked, but they don't link so extensively to other clusters/pages. How do I find them? This is not different from finding groups of friends in some population by analysing phone calls and so on.

I am more than sure that I have seen pictures showing results of such analysis (perhaps in Scientific American), but I can't remember any details, I am even not sure about correct terminology. Fact that I have probably read about the problem in Polish doesn't help either.

Names, links, keywords to look for will be appreciated.

**Physics Forums - The Fusion of Science and Community**

Join Physics Forums Today!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

The friendliest, high quality science and math community on the planet! Everyone who loves science is here!

# Algorithm for cluster finding (?)

Loading...

Similar Threads - Algorithm cluster finding | Date |
---|---|

C/++/# Is there a flaw in my longest common subsequence algorithm? | Feb 24, 2018 |

C/++/# Finding duplicates algorithm | Jan 20, 2018 |

Perceptron algorithm initial vector | Dec 28, 2017 |

C/++/# What should I be most familiar w/for C++ Data Structs & Algorithms | Dec 1, 2017 |

Input/Output error with error code -5 | Dec 16, 2015 |

**Physics Forums - The Fusion of Science and Community**