{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,5]],"date-time":"2025-10-05T17:01:54Z","timestamp":1759683714002},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"11","license":[{"start":{"date-parts":[[2014,11,1]],"date-time":"2014-11-01T00:00:00Z","timestamp":1414800000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Knowl. Data Eng."],"published-print":{"date-parts":[[2014,11]]},"DOI":"10.1109\/tkde.2014.2306678","type":"journal-article","created":{"date-parts":[[2014,2,17]],"date-time":"2014-02-17T19:04:12Z","timestamp":1392663852000},"page":"2662-2675","source":"Crossref","is-referenced-by-count":22,"title":["Composite Retrieval of Diverse and Complementary Bundles"],"prefix":"10.1109","volume":"26","author":[{"given":"Sihem","family":"Amer-Yahia","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Francesco","family":"Bonchi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Carlos","family":"Castillo","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Esteban","family":"Feuerstein","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Isabel","family":"Mendez-Diaz","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Paula","family":"Zabala","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","article-title":"Agglomerative Hierarchical Clustering with Constraints: Theoretical and Empirical Results","author":"davidson","year":"2005","journal-title":"Proc Ninth European Conf Principles and Practice of Knowledge Discovery in Databases (PKDD)"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1145\/1557019.1557056"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s004530010050"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/LA-Web.2007.26"},{"key":"ref14","author":"goldberg","year":"1984","journal-title":"Finding A Maximum Density Subgraph"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1145\/1526709.1526761"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1016\/S0167-6377(97)00034-5"},{"key":"ref17","author":"karypis","year":"1995","journal-title":"MeTis Unstructured Graph Partitioning and Sparse Matrix Ordering System (version 2 0)"},{"key":"ref18","article-title":"Constructing and Exploring Composite Items","author":"roy","year":"2010","journal-title":"Proc ACM SIGMOD Int?l Conf Management of Data"},{"key":"ref19","first-page":"57","article-title":"Efficient Computation of Diverse Query Results","volume":"32","author":"vee","year":"2009","journal-title":"IEEE Data Eng Bull"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1006\/jagm.1999.1062"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1145\/1516360.1516464"},{"key":"ref6","doi-asserted-by":"crossref","DOI":"10.1145\/1806689.1806719","article-title":"Detecting High Log-Densities: An O( n<formula formulatype=\"inline\"><tex Notation=\"TeX\">$^{{1\/4}}$<\/tex> <mathgraphic graphicformat=\"GIF\" fileref=\"bonchi-ieq275-2306678.gif\" \/><\/formula>) Approximation for Densest k-Subgraph","author":"bhaskara","year":"2010","journal-title":"Proc 42nd ACM Symp Theory of Computing (STOC ?10)"},{"key":"ref5","doi-asserted-by":"crossref","DOI":"10.1201\/9781584889977","author":"basu","year":"2008","journal-title":"Constrained Clustering Advances in Algorithms Theory and Applications"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1145\/1247480.1247551"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1454008.1454037"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1007\/s11280-006-0222-z"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"79","DOI":"10.1145\/2487788.2487822","article-title":"Complexity and Algorithms for Composite Retrieval","author":"amer-yahia","year":"2013","journal-title":"Proc 22nd Int?l Conf World Wide Web Companion (WWW)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1810617.1810626"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1145\/1864708.1864739"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390310"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/ICDE.2011.5767954"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1145\/1060745.1060754"}],"container-title":["IEEE Transactions on Knowledge and Data Engineering"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/69\/6915958\/06742606.pdf?arnumber=6742606","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,7,10]],"date-time":"2023-07-10T14:34:27Z","timestamp":1688999667000},"score":1,"resource":{"primary":{"URL":"http:\/\/ieeexplore.ieee.org\/document\/6742606\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2014,11]]},"references-count":23,"journal-issue":{"issue":"11"},"URL":"https:\/\/doi.org\/10.1109\/tkde.2014.2306678","relation":{},"ISSN":["1041-4347"],"issn-type":[{"value":"1041-4347","type":"print"}],"subject":[],"published":{"date-parts":[[2014,11]]}}}