Back to Results
First PageMeta Content
Graph / Clique / Adjacency matrix / Path / Line graph / Planar separator theorem / Graph theory / Mathematics / Neighbourhood


Multi-agent random walks for local clustering on graphs Morteza Alamgir Max Planck Institute for Biological Cybernetics
Add to Reading List

Document Date: 2010-11-05 04:50:52


Open Document

File Size: 655,92 KB

Share Result on Facebook

Currency

pence / /

/

Facility

Morteza Alamgir Max Planck Institute / Ulrike von Luxburg Max Planck Institute / /

IndustryTerm

e-prints / data mining / local clustering algorithm / spectral clustering algorithm / social networks / data mining problems / graph clustering algorithms / nibble algorithm / local clustering algorithms / local graph clustering algorithms / min-max cut algorithm / random-walk based clustering algorithms / collaboration network / spectral algorithm / /

MusicGroup

U2 / /

Organization

Institute for Biological Cybernetics T¨ubingen / Morteza Alamgir Max Planck Institute for Biological Cybernetics T¨ubingen / Pattern Analysis and Machine Intelligence / /

Person

Ulrike von Luxburg Max / Morteza Alamgir Max / /

Position

individual random walker / /

PublishedMedium

IEEE Transactions on Pattern Analysis and Machine Intelligence / /

RadioStation

Wine / /

Technology

spectral clustering algorithm / data mining / random-walk based clustering algorithms / local graph clustering algorithms / machine learning / graph clustering algorithms / Nibble algorithm / local clustering algorithm / local clustering algorithms / min-max cut algorithm / expensive partitioning algorithms / /

SocialTag