摘要Words and their association in documents could be represented by hypergraph in a standard way. Communities of words often overlap. Accepting a community should have more internal than external connections, we view every hyperedge as a vertex, establish a network for hyperedges by their similarity, and use the method of modularity to find their communities. The example here shows that email address' communities, generated by pulling back hyperedges communities, naturally incorporate overlap and reveal hierarchical organization.
Abstract：Words and their association in documents could be represented by hypergraph in a standard way. Communities of words often overlap. Accepting a community should have more internal than external connections, we view every hyperedge as a vertex, establish a network for hyperedges by their similarity, and use the method of modularity to find their communities. The example here shows that email address' communities, generated by pulling back hyperedges communities, naturally incorporate overlap and reveal hierarchical organization.
[1] Salton G and Buckley C 1988 Inf. Proc. & Manag. 24 513
[2] Steyvers M 2007 Probabilistic Topic Models, Latent Semantic Analysis: A Road to Meaning (Laurence Erlbaum)
[3] Carlsson G 2009 B. Am. Math. Soc. 46 255
[4] Lin T Y and Chiang I J 2005 Int. J. Approx. Reasoning. 40 55
[5] Cheng X Q, Ren F X, ZHOU S and HU M B 2009 New J. Phys. 11 033019
[6] Edelsbrunner H, Letscher D and Zomorodian A 2000 In Proceeddings: FOCS p 454
[7] Bowman G R, Huang X, Yao Y, Sun J, Carlsson G, Guibas L J, and Pande V S 2008 J. Am. Chem. Soc. 40 9676
[8] Meng Q K 2011 Chin. Phys. Lett. 28 118901
[9] Agrawal R, Imielinski T and Swami A 1993 SIGMOD '93 p 207
[10] Schenker A 2005 Machine Perception Artificial Intelligence (Singapore: World Scientific) vol 62 chap 2
[11] Karypis G, Aggarwal R, Kumar V and Shekhar S 1999 IEEE Transactions VLSI Systems 7 69
[12] Han E H, Karypis G, Kumar V and Mobasher B 1997 SIGMOD'97 Workshop on Research Issues on Data Mining and Knowledge Discovery
[13] Newman M E J 2006 Proc. Natl. Acad. Sci. USA 103 8577
[14] Ahn Y Y, Bagrow J P and Lehmann S 2010 Nature 466 761
[15] Zomorodian A 2010 Commun. Graph. 34 263
2012, Vol. 29 
