{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,10,5]],"date-time":"2026-10-05T11:38:40Z","timestamp":1791200320759,"version":"4.2.0"},"reference-count":19,"publisher":"Association for Computing Machinery (ACM)","issue":"11","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Proc. VLDB Endow."],"published-print":{"date-parts":[[2012,7]]},"abstract":"<jats:p>\n            The rise of Web 2.0 is signaled by sites such as Flickr, del.icio.us, and YouTube, and social tagging is essential to their success. A typical tagging action involves three components,\n            <jats:italic>user, item<\/jats:italic>\n            (e.g., photos in Flickr), and\n            <jats:italic>tags<\/jats:italic>\n            (i.e., words or phrases). Analyzing how tags are assigned by certain users to certain items has important implications in helping users search for desired information. In this paper, we explore common analysis tasks and propose\n            <jats:italic>a dual mining framework<\/jats:italic>\n            for social tagging behavior mining. This framework is centered around two opposing measures,\n            <jats:italic>similarity<\/jats:italic>\n            and\n            <jats:italic>diversity<\/jats:italic>\n            , being applied to one or more tagging components, and therefore enables a wide range of analysis scenarios such as characterizing similar users tagging diverse items with similar tags, or diverse users tagging similar items with diverse tags, etc. By adopting different concrete measures for similarity and diversity in the framework, we show that a wide range of concrete analysis problems can be defined and they are NP-Complete in general. We design efficient algorithms for solving many of those problems and demonstrate, through comprehensive experiments over real data, that our algorithms significantly out-perform the exact brute-force approach without compromising analysis result quality.\n          <\/jats:p>","DOI":"10.14778\/2350229.2350270","type":"journal-article","created":{"date-parts":[[2014,6,24]],"date-time":"2014-06-24T12:17:57Z","timestamp":1403612277000},"page":"1567-1578","source":"Crossref","is-referenced-by-count":15,"title":["Who tags what?"],"prefix":"10.14778","volume":"5","author":[{"given":"Mahashweta","family":"Das","sequence":"first","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Saravanan","family":"Thirumuruganathan","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Sihem","family":"Amer-Yahia","sequence":"additional","affiliation":[{"name":"Qatar Computing Research Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Gautam","family":"Das","sequence":"additional","affiliation":[{"name":"University of Texas at Arlington and Qatar Computing Research Institute"}],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Cong","family":"Yu","sequence":"additional","affiliation":[{"name":"Google Research"}],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"320","published-online":{"date-parts":[[2012,7]]},"reference":[{"key":"e_1_2_1_1_1","doi-asserted-by":"publisher","DOI":"10.1145\/1559845.1559953"},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2009.178"},{"issue":"3","key":"e_1_2_1_3_1","first-page":"993","article-title":"Latent dirichlet allocation","volume":"3","author":"Blei D. M.","year":"2003","unstructured":"D. M. Blei , A. Y. Ng , and M. I. Jordan . Latent dirichlet allocation . Journal of Machine Learning Research , 3 ( 3 ): 993 -- 1022 , 2003 . D. M. Blei, A. Y. Ng, and M. I. Jordan. Latent dirichlet allocation. Journal of Machine Learning Research, 3(3):993--1022, 2003.","journal-title":"Journal of Machine Learning Research"},{"key":"e_1_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1145\/509907.509965"},{"key":"e_1_2_1_5_1","volume-title":"Computational Social Systems and the Internet","author":"Chen Y.","year":"2007","unstructured":"Y. Chen , F. M. Harper , J. A. Konstan , and S. X. Li . Social comparisons and contributions to online communities: A field experiment on movielens . In Computational Social Systems and the Internet , 2007 . Y. Chen, F. M. Harper, J. A. Konstan, and S. X. Li. Social comparisons and contributions to online communities: A field experiment on movielens. In Computational Social Systems and the Internet, 2007."},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.14778\/3402707.3402742"},{"key":"e_1_2_1_7_1","doi-asserted-by":"publisher","DOI":"10.1016\/0305-0548(90)90027-5"},{"key":"e_1_2_1_8_1","first-page":"518","volume-title":"VLDB","author":"Gionis A.","year":"1999","unstructured":"A. Gionis , P. Indyk , and R. Motwani . Similarity search in high dimensions via hashing . In VLDB , pages 518 -- 529 , 1999 . A. Gionis, P. Indyk, and R. Motwani. Similarity search in high dimensions via hashing. In VLDB, pages 518--529, 1999."},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1145\/227683.227684"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810629"},{"key":"e_1_2_1_11_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810646"},{"key":"e_1_2_1_12_1","volume-title":"Location on networks: theory and algorithms","author":"Handler G.","year":"1979","unstructured":"G. Handler and P. Mirchandani . Location on networks: theory and algorithms . MIT Press series in signal processing, optimization, and control. MIT Press , 1979 . G. Handler and P. Mirchandani. Location on networks: theory and algorithms. MIT Press series in signal processing, optimization, and control. MIT Press, 1979."},{"key":"e_1_2_1_13_1","doi-asserted-by":"publisher","DOI":"10.1145\/276698.276876"},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1016\/0196-6774(87)90021-6"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810645"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810628"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810627"},{"key":"e_1_2_1_18_1","first-page":"355","volume-title":"WADS","author":"Ravi S. S.","year":"1991","unstructured":"S. S. Ravi , D. J. Rosenkrantz , and G. K. Tayi . Facility dispersion problems: Heuristics and special cases (extended abstract) . In WADS , pages 355 -- 366 , 1991 . S. S. Ravi, D. J. Rosenkrantz, and G. K. Tayi. Facility dispersion problems: Heuristics and special cases (extended abstract). In WADS, pages 355--366, 1991."},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1016\/0306-4573(88)90021-0"}],"container-title":["Proceedings of the VLDB Endowment"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.14778\/2350229.2350270","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,12,28]],"date-time":"2022-12-28T11:30:24Z","timestamp":1672227024000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.14778\/2350229.2350270"}},"subtitle":["an analysis framework"],"short-title":[],"issued":{"date-parts":[[2012,7]]},"references-count":19,"journal-issue":{"issue":"11","published-print":{"date-parts":[[2012,7]]}},"alternative-id":["10.14778\/2350229.2350270"],"URL":"https:\/\/doi.org\/10.14778\/2350229.2350270","relation":{},"ISSN":["2150-8097"],"issn-type":[{"value":"2150-8097","type":"print"}],"subject":[],"published":{"date-parts":[[2012,7]]}}}