{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,11]],"date-time":"2026-04-11T13:14:06Z","timestamp":1775913246275,"version":"3.50.1"},"publisher-location":"New York, NY, USA","reference-count":15,"publisher":"ACM","license":[{"start":{"date-parts":[[2015,3,18]],"date-time":"2015-03-18T00:00:00Z","timestamp":1426636800000},"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":[],"published-print":{"date-parts":[[2015,3,18]]},"DOI":"10.1145\/2732587.2732595","type":"proceedings-article","created":{"date-parts":[[2015,3,24]],"date-time":"2015-03-24T12:27:03Z","timestamp":1427200023000},"page":"59-68","update-policy":"https:\/\/doi.org\/10.1145\/crossmark-policy","source":"Crossref","is-referenced-by-count":19,"title":["Measuring network centrality using hypergraphs"],"prefix":"10.1145","author":[{"given":"Sanjukta","family":"Roy","sequence":"first","affiliation":[{"name":"Chennai Mathematical Institute"}]},{"given":"Balaraman","family":"Ravindran","sequence":"additional","affiliation":[{"name":"Indian Institute of Technology Madras"}]}],"member":"320","published-online":{"date-parts":[[2015,3,18]]},"reference":[{"key":"e_1_3_2_1_1_1","first-page":"1","volume-title":"Efficient computation of the shapley value for centrality in networks.\" in Proceedings of the Sixth Workshop on Internet and Network Economics (WINE)","author":"Aadithya K. V.","year":"2010","unstructured":"K. V. Aadithya , B. Ravindran , T. Michalak , and N. R. Jennings , \" Efficient computation of the shapley value for centrality in networks.\" in Proceedings of the Sixth Workshop on Internet and Network Economics (WINE) . Springer-Verlag , 2010 , pp. 1 -- 13 . K. V. Aadithya, B. Ravindran, T. Michalak, and N. R. Jennings, \"Efficient computation of the shapley value for centrality in networks.\" in Proceedings of the Sixth Workshop on Internet and Network Economics (WINE). Springer-Verlag, 2010, pp. 1--13."},{"key":"e_1_3_2_1_2_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2004.01.001"},{"key":"e_1_3_2_1_3_1","first-page":"159","volume-title":"An algorithm for detecting communities in folksonomy hypergraphs.\" in IICS, ser. LNI","author":"Bothorel C.","year":"2011","unstructured":"C. Bothorel and M. Bouklit , \" An algorithm for detecting communities in folksonomy hypergraphs.\" in IICS, ser. LNI , vol. P-186 . GI , 2011 , pp. 159 -- 168 . C. Bothorel and M. Bouklit, \"An algorithm for detecting communities in folksonomy hypergraphs.\" in IICS, ser. LNI, vol. P-186. GI, 2011, pp. 159--168."},{"key":"e_1_3_2_1_4_1","doi-asserted-by":"publisher","DOI":"10.1016\/j.socnet.2013.07.006"},{"key":"e_1_3_2_1_5_1","doi-asserted-by":"publisher","DOI":"10.1016\/S0378-8733(96)00300-0"},{"key":"e_1_3_2_1_6_1","volume-title":"North-Holland","author":"Berge C.","year":"1989","unstructured":"C. Berge , Hypergraphs : Combinatorics of Finite Sets . North-Holland , 1989 . C. Berge, Hypergraphs: Combinatorics of Finite Sets. North-Holland, 1989."},{"key":"e_1_3_2_1_7_1","first-page":"1601","volume-title":"Learning with hypergraphs: clustering, classification, and embedding.\" in NIPS","author":"Zhou D.","year":"2006","unstructured":"D. Zhou , J. Huang , and B. Sch\u00f6lkopf , \" Learning with hypergraphs: clustering, classification, and embedding.\" in NIPS . MIT Press , 2006 , pp. 1601 -- 1608 . D. Zhou, J. Huang, and B. Sch\u00f6lkopf, \"Learning with hypergraphs: clustering, classification, and embedding.\" in NIPS. MIT Press, 2006, pp. 1601--1608."},{"key":"e_1_3_2_1_8_1","volume-title":"A hypergraph approach to understanding the assembly of scientific research teams.\" in Sunbelt XXXII conference","author":"Lungeanu A.","year":"2012","unstructured":"A. Lungeanu , M. Murase , D. Carter , and N. Contractor , \" A hypergraph approach to understanding the assembly of scientific research teams.\" in Sunbelt XXXII conference , Redondo Beach, CA , 2012 . A. Lungeanu, M. Murase, D. Carter, and N. Contractor, \"A hypergraph approach to understanding the assembly of scientific research teams.\" in Sunbelt XXXII conference, Redondo Beach, CA, 2012."},{"key":"e_1_3_2_1_9_1","volume-title":"Teamwork at the hyper-edge: Impact of team hyperedge structures on performance.\" in Sunbelt XXXII conference","author":"Zhu M.","year":"2012","unstructured":"M. Zhu , A. Wax , L. DeChurch , and N. Contractor , \" Teamwork at the hyper-edge: Impact of team hyperedge structures on performance.\" in Sunbelt XXXII conference , Redondo Beach, CA , 2012 . M. Zhu, A. Wax, L. DeChurch, and N. Contractor, \"Teamwork at the hyper-edge: Impact of team hyperedge structures on performance.\" in Sunbelt XXXII conference, Redondo Beach, CA, 2012."},{"key":"e_1_3_2_1_10_1","volume-title":"Trust amongst rogues? A hypergraph approach for comparing clandestine trust networks in MMOGs.\" in Proceedings of the 5th International AAAI Conference on Weblogs and Social Media","author":"Ahmad M. A.","year":"2011","unstructured":"M. A. Ahmad , B. Keegan , D. Williams , J. Srivastava , and N. Contractor , \" Trust amongst rogues? A hypergraph approach for comparing clandestine trust networks in MMOGs.\" in Proceedings of the 5th International AAAI Conference on Weblogs and Social Media , 2011 . M. A. Ahmad, B. Keegan, D. Williams, J. Srivastava, and N. Contractor, \"Trust amongst rogues? A hypergraph approach for comparing clandestine trust networks in MMOGs.\" in Proceedings of the 5th International AAAI Conference on Weblogs and Social Media, 2011."},{"key":"e_1_3_2_1_11_1","volume-title":"Studying indian railways network using hypergraphs,\" in Proceedings of the Social Networking Workshop at COMSNETS","author":"Jain S. K.","year":"2014","unstructured":"S. K. Jain , S. N. Satchidanand , A. K. Maurya , and B. Ravindran , \" Studying indian railways network using hypergraphs,\" in Proceedings of the Social Networking Workshop at COMSNETS 2014 . Springer , 2014. S. K. Jain, S. N. Satchidanand, A. K. Maurya, and B. Ravindran, \"Studying indian railways network using hypergraphs,\" in Proceedings of the Social Networking Workshop at COMSNETS 2014. Springer, 2014."},{"key":"e_1_3_2_1_12_1","doi-asserted-by":"publisher","DOI":"10.1007\/11523468_91"},{"key":"e_1_3_2_1_13_1","first-page":"1509","volume-title":"IFAAMAS, 2008","author":"Narayanam R.","year":"2008","unstructured":"R. Narayanam and Y. Narahari , \" Determining the top-k nodes in social networks using the Shapley value.\" in AAMAS (3) . IFAAMAS, 2008 , pp. 1509 -- 1512 . {Online}. Available : http:\/\/dblp.uni-trier.de\/db\/conf\/atal\/aamas 2008 -3.html#SuriN08 R. Narayanam and Y. Narahari, \"Determining the top-k nodes in social networks using the Shapley value.\" in AAMAS (3). IFAAMAS, 2008, pp. 1509--1512. {Online}. Available: http:\/\/dblp.uni-trier.de\/db\/conf\/atal\/aamas2008-3.html#SuriN08"},{"key":"e_1_3_2_1_14_1","doi-asserted-by":"publisher","DOI":"10.1287\/moor.19.2.257"},{"key":"e_1_3_2_1_15_1","doi-asserted-by":"publisher","DOI":"10.1609\/aimag.v29i3.2157"}],"event":{"name":"CODS '15: 2nd IKDD Conference on Data Sciences","location":"Bangalore India","acronym":"CODS '15"},"container-title":["Proceedings of the Second ACM IKDD Conference on Data Sciences"],"original-title":[],"link":[{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2732587.2732595","content-type":"unspecified","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/dl.acm.org\/doi\/pdf\/10.1145\/2732587.2732595","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,6,18]],"date-time":"2025-06-18T06:16:47Z","timestamp":1750227407000},"score":1,"resource":{"primary":{"URL":"https:\/\/dl.acm.org\/doi\/10.1145\/2732587.2732595"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,18]]},"references-count":15,"alternative-id":["10.1145\/2732587.2732595","10.1145\/2732587"],"URL":"https:\/\/doi.org\/10.1145\/2732587.2732595","relation":{},"subject":[],"published":{"date-parts":[[2015,3,18]]},"assertion":[{"value":"2015-03-18","order":2,"name":"published","label":"Published","group":{"name":"publication_history","label":"Publication History"}}]}}