Hyperincident connected components of tagging networks

Proceedings of the 20th ACM Conference on Hypertext and Hypermedia, HT'09

Volumn , Issue , 2009, Pages 229-238

  Neubauer, Nicolas ^a   Obermayer, Klaus ^a  

^a TECHNISCHE UNIVERSITÄT BERLIN   (Germany)

Author keywords

Algorithms; Experimentation

Indexed keywords

3-UNIFORM HYPERGRAPHS; COMPLEX NETWORK ANALYSIS; COMPONENT DISTRIBUTIONS; CONNECTED COMPONENT; DATA SETS; FORMATION PROCESS; HYPERGRAPH; PATTERN CHANGE; SEARCH LOGS; SOCIAL BOOKMARKING; SPAM DETECTION; UNSUPERVISED METHOD;

ELECTRIC NETWORK ANALYSIS; HYPERTEXT SYSTEMS; SPAMMING;

INTERNET;

EID: 70450164140     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1557914.1557954     Document Type: Conference Paper

References (18)

1. F. Boesch. Synthesis of reliable networks, a survey. IEEE Trans. Reliab, 35:240-246, 1986.
2. C. Cattuto, C. Schmitz, A. Baldassarri, V. D. P. Servedio, V. Loreto, A. Hotho, M. Grahl, and G. Stumme. Network properties of folksonomies. AI Communications Journal, Special Issue on "Network Analysis in Natural Sciences and Engineering", 20(4):245-262, 2007.
3. P. Erdos and A. Renyi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5:17-61, 1960.
4. E. R. Gansner and S. C. North. An open graph visualization system and its applications to software engineering. Software | Practice and Experience, 30(11):1203-1233, 2000.
5. A. Gkanogiannis and T. Kalamboukis. A novel supervised learning algorithm and its use for spam detection in social bookmarking systems. In ECML PKDD Discovery Challenge 2008 (RSDC'08), 2008.
6. S. Golder and B. A. Huberman. Usage patterns of collaborative tagging systems. Journal of Information Science, 32(2):198-208, April 2006.
7. C. Goldschmidt. Critical random hypergraphs: the emergence of a giant set of identifiable vertices,. Annals of Probability, 33(4):1573-1600, 2005.
8. P. Heymann, G. Koutrika, and H. Garcia-Molina. Fighting spam on social web sites: A survey of approaches and future challenges. IEEE Internet Computing, 11(6):36-45, 2007.
9. A. Hotho, D. Benz, R. Jaschke, and B. Krause, editors. ECML PKDD Discovery Challenge 2008 (RSDC'08). Workshop at 18th Europ. Conf. on Machine Learning (ECML'08)/11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'08), 2008.
10. G. Koutrika, F. A. Effendi, Z. Gyongyi, P. Heymann, and H. Garcia-Molina. Combating spam in tagging systems. In AIRWeb '07: Proceedings of the 3rd international workshop on Adversarial information retrieval on the web, pages 57-64, New York, NY, USA, 2007. ACM.
11. B. Krause, A. Hotho, and G. Stumme. The anti-social tagger - detecting spam in social bookmarking systems. In Proc. of the Fourth International Workshop on Adversarial Information Retrieval on the Web, 2008.
12. M. McGlohon, L. Akoglu, and C. Faloutsos. Weighted graphs and disconnected components: patterns and a generator. In KDD '08: Proceeding of the 14th ACM SIGKDD international conference on Knowledge discovery and data mining, pages 524-532, New York, NY, USA, 2008. ACM.
13. N. Neubauer and K. Obermayer. Predicting tag spam examining cooccurrences, network structures and url components. In ECML PKDD Discovery Challenge 2008 (RSDC'08), 2008.
14. Knowledge & Data Engineering Group, University of Kassel Benchmark folksonomy data from bibsonomy, version of june 30th, 2008.
15. G. Pass, A. Chowdhury, and C. Torgeson. A picture of search. In InfoScale '06: Proceedings of the 1st international conference on Scalable information systems, page 1, New York, NY, USA, 2006. ACM Press.
16. J. Schmidt-Pruzan and E. Shamir. Component structure in the evolution of random hypergraphs. Combinatorica, 5(1):81-94, 1984.
17. J. Serra. Connectivity on complete lattices. Journal of Mathematical Imaging and Vision, 9:231-251, 1998.
18. R. Wetzker, C. Zimmermann, and C. Bauckhage. Analyzing social bookmarking systems: A del.icio.us cookbook. In Mining Social Data (MSoDa) Workshop Proceedings, ECAI 2008, pages 26-30, 2008.