{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T10:01:29Z","timestamp":1740132089073,"version":"3.37.3"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2015,3,1]],"date-time":"2015-03-01T00:00:00Z","timestamp":1425168000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"funder":[{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["OIA-1027897","IIS-1302164"],"award-info":[{"award-number":["OIA-1027897","IIS-1302164"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/501100001459","name":"Singapore Ministry of Education","doi-asserted-by":"publisher","award":["MOE2010-T2-1-087"],"award-info":[{"award-number":["MOE2010-T2-1-087"]}],"id":[{"id":"10.13039\/501100001459","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Pattern Anal. Mach. Intell."],"published-print":{"date-parts":[[2015,3,1]]},"DOI":"10.1109\/tpami.2014.2346173","type":"journal-article","created":{"date-parts":[[2014,8,7]],"date-time":"2014-08-07T18:31:01Z","timestamp":1407436261000},"page":"541-554","source":"Crossref","is-referenced-by-count":18,"title":["Dense Subgraph Partition of Positive Hypergraphs"],"prefix":"10.1109","volume":"37","author":[{"given":"Hairong","family":"Liu","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Longin Jan","family":"Latecki","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shuicheng","family":"Yan","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2011.110"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587500"},{"article-title":"Network flows and minimization of quadratic pseudo-boolean functions","year":"1991","author":"boros","key":"ref33"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2010.91"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.1007\/BF02612354"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2005.188"},{"key":"ref37","article-title":"Power iteration clustering","volume":"10","author":"lin","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref36","first-page":"849","article-title":"On spectral clustering: Analysis and an algorithm","volume":"2","author":"ng","year":"2002","journal-title":"Adv Neural Inf Process Syst"},{"key":"ref35","first-page":"899","article-title":"Truncated power method for sparse eigenvalue problems","volume":"14","author":"yuan","year":"2013","journal-title":"J Mach Learn Res"},{"key":"ref34","first-page":"139","article-title":"One-class svms for document classification","volume":"2","author":"manevitz","year":"2002","journal-title":"J Mach Learn Res"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1145\/1014052.1014118"},{"key":"ref40","first-page":"1633","article-title":"Hypergraph matching via reweighted random walks","author":"lee","year":"0","journal-title":"Proc IEEE Conf Comput Vis Pattern Recogn"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2004.1262177"},{"journal-title":"Combinatorial Optimization Algorithms and Complexity","year":"1998","author":"papadimitriou","key":"ref12"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-23094-3_3"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/62882.62910"},{"key":"ref15","first-page":"1601","article-title":"Learning with hypergraphs: Clustering, classification, and embedding","author":"zhou","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/j.aml.2008.07.020"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1137\/S1064827595287997"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/B:MACH.0000033116.57574.95"},{"key":"ref19","first-page":"208","article-title":"Correlation clustering–minimizing disagreements on arbitrary weighted graphs","author":"emanuel","year":"0","journal-title":"Proc 11th Eur Symp Algorithms"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2012.226"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0601602103"},{"journal-title":"Finding A Maximum Density Subgraph","year":"1984","author":"goldberg","key":"ref27"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1007\/s00224-006-1350-7"},{"key":"ref6","first-page":"597","article-title":"On finding dense subgraphs","author":"khuller","year":"0","journal-title":"Proc Automata Languages Program"},{"key":"ref29","first-page":"456","article-title":"Dense subgraphs with restrictions and applications to gene annotation graphs","author":"saha","year":"0","journal-title":"Research in Computational Molecular Biology"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1109\/34.868688"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1002\/j.1538-7305.1970.tb01770.x"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1145\/266021.266273"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1109\/EDTC.1995.470419"},{"key":"ref1","article-title":"Algorithms for graph partitioning: A survey","volume":"3","author":"fj\u00e4llstr\u00f6m","year":"1998","journal-title":"Comput Inf Sci"},{"key":"ref20","first-page":"1530","article-title":"Higher-order correlation clustering for image segmentation","author":"kim","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref22","first-page":"721","article-title":"Discovering large dense subgraphs in massive graphs","author":"gibson","year":"0","journal-title":"Proc Int Conf Very Large Data Bases"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000022288.19776.77"},{"article-title":"hmetis: A hypergraph partitioning package, version 1.5. 3","year":"1998","author":"karypis","key":"ref42"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2013.16"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1023\/B:VISI.0000029664.99615.94"},{"key":"ref23","first-page":"671","article-title":"Robust graph mode seeking by graph shift","author":"liu","year":"0","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1109\/TPAMI.2007.250608"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1109\/TKDE.2010.271"}],"container-title":["IEEE Transactions on Pattern Analysis and Machine Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/34\/7029731\/06873327.pdf?arnumber=6873327","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,12]],"date-time":"2022-01-12T15:59:49Z","timestamp":1642003189000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6873327\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015,3,1]]},"references-count":42,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tpami.2014.2346173","relation":{},"ISSN":["0162-8828","2160-9292"],"issn-type":[{"type":"print","value":"0162-8828"},{"type":"electronic","value":"2160-9292"}],"subject":[],"published":{"date-parts":[[2015,3,1]]}}}