{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,26]],"date-time":"2025-06-26T09:30:09Z","timestamp":1750930209639,"version":"3.41.0"},"reference-count":18,"publisher":"Association for Computing Machinery (ACM)","issue":"Autumn","license":[{"start":{"date-parts":[[2009,9,1]],"date-time":"2009-09-01T00:00:00Z","timestamp":1251763200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["SIGWEB Newsl."],"published-print":{"date-parts":[[2009,9]]},"abstract":"<jats:p>\n            Data created by social bookmarking systems can be described as 3-partite 3-uniform hypergraphs connecting documents, users, and tags (tagging networks), such that the toolbox of complex network analysis can be applied to examine their properties. One of the most basic tools, the analysis of connected components, however cannot be applied meaningfully: Tagging networks tend to be almost entirely connected. We therefore propose a generalization of connected components,\n            <jats:italic>m<\/jats:italic>\n            -hyperincident connected components. We show that decomposing tagging networks into 2-hyperincident connected components yields a characteristic component distribution with a salient giant component that can be found across various datasets. This pattern changes if the underlying formation process changes, for example, if the hypergraph is constructed from search logs, or if the tagging data is contaminated by spam: It turns out that the second- to 129th largest components of the spam-labeled Bibsonomy dataset are inhabited exclusively by spam users. Based on these findings, we propose and unsupervised method for spam detection.\n          <\/jats:p>","DOI":"10.1145\/1592394.1592398","type":"journal-article","created":{"date-parts":[[2009,9,16]],"date-time":"2009-09-16T17:33:05Z","timestamp":1253122385000},"page":"1-10","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":6,"title":["Hyperincident connected components of tagging networks"],"prefix":"10.1145","volume":"2009","author":[{"given":"Nicolas","family":"Neubauer","sequence":"first","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Klaus","family":"Obermayer","sequence":"additional","affiliation":[{"name":"Technische Universit\u00e4t Berlin, Berlin, Germany"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2009,9]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1109\/TR.1986.4335424"},{"key":"e_1_2_1_2_1","volume-title":"Special Issue on \"Network Analysis in Natural Sciences and Engineering\", 20(4):245--262","author":"Cattuto C.","year":"2007","unstructured":"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 . 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."},{"key":"e_1_2_1_3_1","first-page":"17","article-title":"On the evolution of random graphs","volume":"5","author":"Erdos P.","year":"1960","unstructured":"P. Erdos and A. Renyi . On the evolution of random graphs . Publ. Math. Inst. Hung. Acad. Sci , 5 : 17 -- 61 , 1960 . P. Erdos and A. Renyi. On the evolution of random graphs. Publ. Math. Inst. Hung. Acad. Sci, 5:17--61, 1960.","journal-title":"Publ. Math. Inst. Hung. Acad. Sci"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1002\/1097-024X(200009)30:11%3C1203::AID-SPE338%3E3.3.CO;2-E"},{"key":"e_1_2_1_5_1","volume-title":"ECML PKDD Discovery Challenge 2008 (RSDC'08)","author":"Gkanogiannis A.","year":"2008","unstructured":"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 . 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."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1177\/0165551506062337"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1214\/009117904000000847"},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1109\/MIC.2007.125"},{"key":"e_1_2_1_9_1","volume-title":"Workshop at 18th Europ. Conf. on Machine Learning (ECML'08) \/ 11th Europ. Conf. on Principles and Practice of Knowledge Discovery in Databases (PKDD'08)","author":"Hotho A.","year":"2008","unstructured":"A. Hotho , D. Benz , R. J\u00e4schke , 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 . A. Hotho, D. Benz, R. J\u00e4schke, 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."},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1244408.1244420"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1451983.1451998"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1145\/1401890.1401955"},{"key":"e_1_2_1_13_1","volume-title":"ECML PKDD Discovery Challenge 2008 (RSDC'08)","author":"Neubauer N.","year":"2008","unstructured":"N. Neubauer and K. Obermayer . Predicting tag spam examining cooccurrences, network structures and url components . In ECML PKDD Discovery Challenge 2008 (RSDC'08) , 2008 . N. Neubauer and K. Obermayer. Predicting tag spam examining cooccurrences, network structures and url components. In ECML PKDD Discovery Challenge 2008 (RSDC'08), 2008."},{"key":"e_1_2_1_14_1","volume-title":"University of Kassel Benchmark folksonomy data from bibsonomy, version of june 30th","author":"Knowledge&amp;Data Engineering Group","year":"2008","unstructured":"Knowledge&amp;Data Engineering Group , University of Kassel Benchmark folksonomy data from bibsonomy, version of june 30th , 2008 . Knowledge&amp;Data Engineering Group, University of Kassel Benchmark folksonomy data from bibsonomy, version of june 30th, 2008."},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1146847.1146848"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/BF02579445"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008324520475"},{"key":"e_1_2_1_18_1","first-page":"26","volume-title":"Mining Social Data (MSoDa) Workshop Proceedings, ECAI 2008","author":"Wetzker R.","year":"2008","unstructured":"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 . 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."}],"container-title":["ACM SIGWEB Newsletter"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592394.1592398","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/1592394.1592398","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T12:17:47Z","timestamp":1750249067000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/1592394.1592398"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2009,9]]},"references-count":18,"journal-issue":{"issue":"Autumn","published-print":{"date-parts":[[2009,9]]}},"alternative-id":["10.1145\/1592394.1592398"],"URL":"https:\/\/doi.org\/10.1145\/1592394.1592398","relation":{},"ISSN":["1931-1745","1931-1435"],"issn-type":[{"type":"print","value":"1931-1745"},{"type":"electronic","value":"1931-1435"}],"subject":[],"published":{"date-parts":[[2009,9]]},"assertion":[{"value":"2009-09-01","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}