{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,6,19]],"date-time":"2025-06-19T04:20:08Z","timestamp":1750306808253,"version":"3.41.0"},"reference-count":30,"publisher":"Association for Computing Machinery (ACM)","issue":"4","license":[{"start":{"date-parts":[[2013,11,1]],"date-time":"2013-11-01T00:00:00Z","timestamp":1383264000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.acm.org\/publications\/policies\/copyright_policy#Background"}],"funder":[{"DOI":"10.13039\/100006754","name":"U.S. Army Research Laboratory","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006754","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":["dl.acm.org"],"crossmark-restriction":true},"short-container-title":["ACM Trans. Knowl. Discov. Data"],"published-print":{"date-parts":[[2013,11]]},"abstract":"<jats:p>We present a new algorithm called iHypR for computing prominence of actors in social networks of collaborations. Our algorithm builds on the assumption that prominent actors collaborate on prominent objects, and prominent objects are naturally grouped into prominent clusters or groups (hyperedges in a graph). iHypR makes use of the relationships between actors, objects, and hyperedges to compute a global prominence score for the actors in the network. We do not assume the hyperedges are given in advance. Hyperedges computed by our method can perform as well or even better than \u201ctrue\u201d hyperedges. Our algorithm is customized for networks of collaborations, but it is generally applicable without further tuning. We show, through extensive experimentation with three real-life data sets and multiple external measures of prominence, that our algorithm outperforms existing well-known algorithms. Our work is the first to offer such an extensive evaluation. We show that unlike most existing algorithms, the performance is robust across multiple measures of performance. Further, we give a detailed study of the sensitivity of our algorithm to different data sets and the design choices within the algorithm that a user may wish to change. Our article illustrates the various trade-offs that must be considered in computing prominence in collaborative social networks.<\/jats:p>","DOI":"10.1145\/2541268.2541269","type":"journal-article","created":{"date-parts":[[2014,1,6]],"date-time":"2014-01-06T20:42:39Z","timestamp":1389040959000},"page":"1-32","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":0,"title":["iHypR"],"prefix":"10.1145","volume":"7","author":[{"given":"Sibel","family":"Adali","sequence":"first","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Malik","family":"Magdon-Ismail","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy NY"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Xiaohui","family":"Lu","sequence":"additional","affiliation":[{"name":"Department of Computer Science, Rensselaer Polytechnic Institute, Troy NY"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"320","published-online":{"date-parts":[[2013,12,25]]},"reference":[{"volume-title":"Proceedings of the International AAAI Conference on Weblogs and Social Media (ICWSM'11)","author":"Adali S.","key":"e_1_2_1_1_1","unstructured":"Adali , S. , Lu , X. , Magdon-Ismail , M. , and Purnell , J . 2011. Prominence ranking in graphs with community structure . In Proceedings of the International AAAI Conference on Weblogs and Social Media (ICWSM'11) . Adali, S., Lu, X., Magdon-Ismail, M., and Purnell, J. 2011. Prominence ranking in graphs with community structure. In Proceedings of the International AAAI Conference on Weblogs and Social Media (ICWSM'11)."},{"key":"e_1_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(03)00009-1"},{"volume-title":"Proceedings of the AAAI Conference on Social Media and Weblogs (ICWSM'11)","author":"Adamic L. A.","key":"e_1_2_1_3_1","unstructured":"Adamic , L. A. , Lauterbach , D. , Teng , C.-Y. , and Ackerman , M. S . 2011. Rating friends without making enemies . In Proceedings of the AAAI Conference on Social Media and Weblogs (ICWSM'11) . Adamic, L. A., Lauterbach, D., Teng, C.-Y., and Ackerman, M. S. 2011. Rating friends without making enemies. In Proceedings of the AAAI Conference on Social Media and Weblogs (ICWSM'11)."},{"key":"e_1_2_1_4_1","volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases.","volume":"30","author":"Balmin A.","unstructured":"Balmin , A. , Hristidis , V. , and Papakonstantinou , Y . 2004. Objectrank: Authority-based keyword search in databases . In Proceedings of the 30th International Conference on Very Large Data Bases. vol. 30 . 564--575. Balmin, A., Hristidis, V., and Papakonstantinou, Y. 2004. Objectrank: Authority-based keyword search in databases. In Proceedings of the 30th International Conference on Very Large Data Bases. vol. 30. 564--575."},{"key":"e_1_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1145\/1242572.1242640"},{"key":"e_1_2_1_6_1","doi-asserted-by":"publisher","DOI":"10.1145\/1052934.1052942"},{"volume-title":"Proceedings of the ACM WWW Conference. 107--117","author":"Brin S.","key":"e_1_2_1_7_1","unstructured":"Brin , S. and Page , L . 1998. The anatomy of a large-scale hypertextual web search engine . In Proceedings of the ACM WWW Conference. 107--117 . Brin, S. and Page, L. 1998. The anatomy of a large-scale hypertextual web search engine. In Proceedings of the ACM WWW Conference. 107--117."},{"key":"e_1_2_1_8_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.70.066111"},{"key":"e_1_2_1_9_1","doi-asserted-by":"publisher","DOI":"10.1007\/s10588-005-5377-0"},{"key":"e_1_2_1_10_1","doi-asserted-by":"publisher","DOI":"10.1137\/S0895480102412856"},{"key":"e_1_2_1_11_1","doi-asserted-by":"crossref","unstructured":"Faust K. and Wasserman S. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press New York.  Faust K. and Wasserman S. 1994. Social Network Analysis: Methods and Applications. Cambridge University Press New York.","DOI":"10.1017\/CBO9780511815478"},{"key":"e_1_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/s007780050005"},{"volume-title":"Proceedings of the 30th International Conference on Very Large Data Bases.","author":"Gyongyi Z.","key":"e_1_2_1_13_1","unstructured":"Gyongyi , Z. , Garcia-Molina , H. , and Pedersen , J . 2004. Combating web spam with trustrank . In Proceedings of the 30th International Conference on Very Large Data Bases. Gyongyi, Z., Garcia-Molina, H., and Pedersen, J. 2004. Combating web spam with trustrank. In Proceedings of the 30th International Conference on Very Large Data Bases."},{"key":"e_1_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1145\/511446.511513"},{"key":"e_1_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0507655102"},{"key":"e_1_2_1_16_1","doi-asserted-by":"publisher","DOI":"10.1007\/11762256_31"},{"key":"e_1_2_1_17_1","doi-asserted-by":"publisher","DOI":"10.1145\/775047.775126"},{"key":"e_1_2_1_18_1","doi-asserted-by":"publisher","DOI":"10.1126\/science.1158357"},{"key":"e_1_2_1_19_1","doi-asserted-by":"publisher","DOI":"10.1145\/324133.324140"},{"key":"e_1_2_1_20_1","doi-asserted-by":"publisher","DOI":"10.1145\/382979.383041"},{"volume-title":"Proceedings of the IEEE International Conference on Social Computing.","author":"Magdon-Ismail M.","key":"e_1_2_1_21_1","unstructured":"Magdon-Ismail , M. and Purnell , J . 2011. SSDE-cluster: Fast overlapping clustering of networks using sampled spectral distance embedding and GMMs . In Proceedings of the IEEE International Conference on Social Computing. Magdon-Ismail, M. and Purnell, J. 2011. SSDE-cluster: Fast overlapping clustering of networks using sampled spectral distance embedding and GMMs. In Proceedings of the IEEE International Conference on Social Computing."},{"key":"e_1_2_1_22_1","doi-asserted-by":"publisher","DOI":"10.1103\/PhysRevE.67.026126"},{"key":"e_1_2_1_23_1","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060828"},{"key":"e_1_2_1_24_1","doi-asserted-by":"publisher","DOI":"10.1146\/annurev.soc.34.040507.134743"},{"key":"e_1_2_1_26_1","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516426"},{"key":"e_1_2_1_27_1","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557107"},{"key":"e_1_2_1_28_1","volume-title":"Introduction to Graph Theory","author":"West D. B.","unstructured":"West , D. B. 2000. Introduction to Graph Theory 2 nd Ed., Prentice Hall , Upper Saddle River, NJ. West, D. B. 2000. Introduction to Graph Theory 2nd Ed., Prentice Hall, Upper Saddle River, NJ.","edition":"2"},{"key":"e_1_2_1_29_1","volume-title":"Commentary: Why do team-authored papers get cited more&quest","author":"Wuchty S.","year":"2007","unstructured":"Wuchty , S. , Jones , B. , and Uzzi , B . 2007 . Commentary: Why do team-authored papers get cited more&quest ; Science 317, 1496. Wuchty, S., Jones, B., and Uzzi, B. 2007. Commentary: Why do team-authored papers get cited more&quest; Science 317, 1496."},{"key":"e_1_2_1_30_1","doi-asserted-by":"publisher","DOI":"10.1145\/988672.988715"},{"key":"e_1_2_1_31_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.ipm.2005.03.012"}],"container-title":["ACM Transactions on Knowledge Discovery from Data"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541268.2541269","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2541268.2541269","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T07:35:01Z","timestamp":1750232101000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2541268.2541269"}},"subtitle":["Prominence ranking in networks of collaborations with hyperedges\n            <sup>1<\/sup>"],"short-title":[],"issued":{"date-parts":[[2013,11]]},"references-count":30,"journal-issue":{"issue":"4","published-print":{"date-parts":[[2013,11]]}},"alternative-id":["10.1145\/2541268.2541269"],"URL":"https:\/\/doi.org\/10.1145\/2541268.2541269","relation":{},"ISSN":["1556-4681","1556-472X"],"issn-type":[{"type":"print","value":"1556-4681"},{"type":"electronic","value":"1556-472X"}],"subject":[],"published":{"date-parts":[[2013,11]]},"assertion":[{"value":"2012-02-01","order":0,"name":"received","label":"Received","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-03-01","order":1,"name":"accepted","label":"Accepted","group":{"name":"publication_history","label":"Publication History"}},{"value":"2013-12-25","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}