{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T18:40:03Z","timestamp":1743014403109,"version":"3.40.3"},"publisher-location":"Cham","reference-count":28,"publisher":"Springer Nature Switzerland","isbn-type":[{"type":"print","value":"9783031478420"},{"type":"electronic","value":"9783031478437"}],"license":[{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2023,11,7]],"date-time":"2023-11-07T00:00:00Z","timestamp":1699315200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2024]]},"DOI":"10.1007\/978-3-031-47843-7_24","type":"book-chapter","created":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:27:25Z","timestamp":1699306045000},"page":"341-355","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Discovering Densest Subgraph over\u00a0Heterogeneous Information Networks"],"prefix":"10.1007","author":[{"given":"Haozhe","family":"Yin","sequence":"first","affiliation":[]},{"given":"Kai","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Wenjie","family":"Zhang","sequence":"additional","affiliation":[]},{"given":"Dong","family":"Wen","sequence":"additional","affiliation":[]},{"given":"Xiaoyang","family":"Wang","sequence":"additional","affiliation":[]},{"given":"Ying","family":"Zhang","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2023,11,7]]},"reference":[{"key":"24_CR1","doi-asserted-by":"crossref","unstructured":"Bahmani, B., Kumar, R., Vassilvitskii, S.: Densest subgraph in streaming and MapReduce. In: PVLDB, pp. 454\u201346 (2012)","DOI":"10.14778\/2140436.2140442"},{"key":"24_CR2","unstructured":"Batagelj, V., Zaversnik, M.: An o(m) algorithm for cores decomposition of networks. arXiv preprint cs\/0310049 (2003)"},{"key":"24_CR3","doi-asserted-by":"crossref","unstructured":"Cantador, I., Brusilovsky, P., Kuflik, T.: 2nd workshop on information heterogeneity and fusion in recommender systems (HetRec 2011). In: Proceedings of the 5th ACM Conference on Recommender Systems, RecSys 2011, New York, NY, USA (2011)","DOI":"10.1145\/2043932.2044016"},{"key":"24_CR4","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"84","DOI":"10.1007\/3-540-44436-X_10","volume-title":"Approximation Algorithms for Combinatorial Optimization","author":"M Charikar","year":"2000","unstructured":"Charikar, M.: Greedy approximation algorithms for finding dense components in a graph. In: Jansen, K., Khuller, S. (eds.) APPROX 2000. LNCS, vol. 1913, pp. 84\u201395. Springer, Heidelberg (2000). https:\/\/doi.org\/10.1007\/3-540-44436-X_10"},{"issue":"7","key":"24_CR5","first-page":"1216","volume":"24","author":"J Chen","year":"2012","unstructured":"Chen, J., Saad, Y.: Dense subgraph extraction with application to community detection. TKDE 24(7), 1216\u20131230 (2012)","journal-title":"TKDE"},{"issue":"5","key":"24_CR6","doi-asserted-by":"publisher","first-page":"1338","DOI":"10.1137\/S0097539702403098","volume":"32","author":"E Cohen","year":"2003","unstructured":"Cohen, E., Halperin, E., Kaplan, H., Zwick, U.: Reachability and distance queries via 2-hop labels. SIAM J. Comput. 32(5), 1338\u20131355 (2003)","journal-title":"SIAM J. Comput."},{"key":"24_CR7","unstructured":"Dongen, S.M.V.: Graph clustering by flow simulation. Ph.D. thesis, University of Utrecht (2000)"},{"key":"24_CR8","doi-asserted-by":"crossref","unstructured":"Epasto, A., Lattanzi, S., Sozio, M.: Efficient densest subgraph computation in evolving graphs. In: WWW, pp. 300\u2013310 (2015)","DOI":"10.1145\/2736277.2741638"},{"issue":"6","key":"24_CR9","doi-asserted-by":"publisher","first-page":"854","DOI":"10.14778\/3380750.3380756","volume":"13","author":"Y Fang","year":"2020","unstructured":"Fang, Y., Yang, Y., Zhang, W., Lin, X., Ca, X.: Effective and efficient community search over large heterogeneous information networks. Proc. VLDB Endow. 13(6), 854\u2013867 (2020)","journal-title":"Proc. VLDB Endow."},{"issue":"14","key":"24_CR10","doi-asserted-by":"publisher","first-page":"e150","DOI":"10.1093\/bioinformatics\/btl243","volume":"22","author":"E Fratkin","year":"2006","unstructured":"Fratkin, E., Naughton, B.T., Brutlag, D.L., Batzoglou, S.: MotifCut: regulatory motifs finding with maximum density subgraphs. Bioinformatics 22(14), e150\u2013e157 (2006)","journal-title":"Bioinformatics"},{"key":"24_CR11","unstructured":"Goldberg, A.V.: Finding a maximum density subgraph. UC Berkeley (1984)"},{"key":"24_CR12","doi-asserted-by":"publisher","unstructured":"Harper, F.M., Konstan, J.A.: The MovieLens datasets: history and context. ACM Trans. Interact. Intell. Syst. 5, 19:1\u201319:19 (2015). https:\/\/doi.org\/10.1145\/2827872","DOI":"10.1145\/2827872"},{"key":"24_CR13","doi-asserted-by":"crossref","unstructured":"He, R., McAuley, J.: Ups and downs: Modeling the visual evolution of fashion trends with one-class collaborative filtering. In: WWW (2016). https:\/\/cseweb.ucsd.edu\/jmcauley\/datasets.html#amazon_reviews","DOI":"10.1145\/2872427.2883037"},{"key":"24_CR14","unstructured":"Heineman, G., Pollice, G., Selkow, S.: Network flow algorithms. Algorithms in a Nutshell (2008)"},{"key":"24_CR15","doi-asserted-by":"crossref","unstructured":"Huang, Z., Zheng, Y., Cheng, R., Sun, Y., Mamoulis, N., Li, X.: Meta structure: computing relevance in large heterogeneous information networks. In: KDD, pp. 1595\u20131604 (2016)","DOI":"10.1145\/2939672.2939815"},{"key":"24_CR16","unstructured":"Schloss Dagstuhl - Leibniz Center for Informatics.: DBLP computer science bibliography (2019). http:\/\/dblp.uni-trier.de\/xml"},{"key":"24_CR17","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"597","DOI":"10.1007\/978-3-642-02927-1_50","volume-title":"Automata, Languages and Programming","author":"S Khuller","year":"2009","unstructured":"Khuller, S., Saha, B.: On finding dense subgraphs. In: Albers, S., Marchetti-Spaccamela, A., Matias, Y., Nikoletseas, S., Thomas, W. (eds.) ICALP 2009. LNCS, vol. 5555, pp. 597\u2013608. Springer, Heidelberg (2009). https:\/\/doi.org\/10.1007\/978-3-642-02927-1_50"},{"key":"24_CR18","doi-asserted-by":"crossref","unstructured":"McAuley, J., Targett, C., Shi, J., van den Hengel, A.: Image-based recommendations on styles and substitutes. In: SIGIR (2015). https:\/\/cseweb.ucsd.edu\/jmcauley\/datasets.html#amazon_reviews","DOI":"10.1145\/2766462.2767755"},{"key":"24_CR19","doi-asserted-by":"crossref","unstructured":"Qin, L., Li, R.H., Chang, L., Zhang, C.: Locally densest subgraph discover. In: KDD, pp. 965\u2013974 (2015)","DOI":"10.1145\/2783258.2783299"},{"key":"24_CR20","unstructured":"S. M. of Science Innovation, the Regional Government of Madrid: International Workshop on Information Heterogeneity and Fusion in Recommender Systems (2011). http:\/\/www.lastfm.com"},{"key":"24_CR21","unstructured":"Scott, J.: Social Network Analysis: A Handbook. Sage Publications (2000)"},{"issue":"11","key":"24_CR22","first-page":"992","volume":"4","author":"Y Sun","year":"2011","unstructured":"Sun, Y., Han, J., Yan, X., Yu, P.S., Wu, T.: PathSim: meta path-based top-k similarity search in heterogeneous information networks. PVLDB 4(11), 992\u20131003 (2011)","journal-title":"PVLDB"},{"key":"24_CR23","unstructured":"Tang, J., Qu, M., Mei, Q.: Predictive text embedding through large-scale heterogeneous text networks. In: SIGKDD (2015)"},{"key":"24_CR24","doi-asserted-by":"crossref","unstructured":"Tsourakakis, C., Bonchi, F., Gionis, A., Gullo, F., Tsiarli, M.: Denser than the densest subgraph: extracting optimal quasi-cliques with quality guarantees. In: KDD, pp. 104\u2013112 (2013)","DOI":"10.1145\/2487575.2487645"},{"key":"24_CR25","doi-asserted-by":"publisher","first-page":"1335","DOI":"10.1587\/transinf.2021EDL8093","volume":"105","author":"Y Yan","year":"2022","unstructured":"Yan, Y., Wang, Q., Liu, L.: Latent influence based self-attention framework for heterogeneous network embedding. IEICE Trans. Inf. Syst. 105, 1335\u20131339 (2022)","journal-title":"IEICE Trans. Inf. Syst."},{"key":"24_CR26","doi-asserted-by":"crossref","unstructured":"Yang, D., Zhang, D., Yu, Z., Yu, Z.: Fine-grained preference-aware location search leveraging crowdsourced digital footprints from LBSNs. In: ACM International Joint Conference on Pervasive and Ubiquitous Computing, pp. 8\u201312 (2013)","DOI":"10.1145\/2493432.2493464"},{"key":"24_CR27","series-title":"Lecture Notes in Computer Science","doi-asserted-by":"publisher","first-page":"414","DOI":"10.1007\/978-3-319-45817-5_37","volume-title":"Web Technologies and Applications","author":"B Zhang","year":"2016","unstructured":"Zhang, B., Nie, T., Shen, D., Kou, Y., Yu, G., Zhou, Z.: A graph clustering algorithm for citation networks. In: Li, F., Shim, K., Zheng, K., Liu, G. (eds.) APWeb 2016. LNCS, vol. 9932, pp. 414\u2013418. Springer, Cham (2016). https:\/\/doi.org\/10.1007\/978-3-319-45817-5_37"},{"key":"24_CR28","first-page":"1","volume":"16","author":"X Zhang","year":"2022","unstructured":"Zhang, X., Xie, H., Lui, J.C.S.: Improving bandit learning via heterogeneous information networks: algorithms and applications. ACM Trans. Knowl. Discov. Data 16, 1\u201325 (2022)","journal-title":"ACM Trans. Knowl. Discov. Data"}],"container-title":["Lecture Notes in Computer Science","Databases Theory and Applications"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-031-47843-7_24","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,11,6]],"date-time":"2023-11-06T21:34:34Z","timestamp":1699306474000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-031-47843-7_24"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,11,7]]},"ISBN":["9783031478420","9783031478437"],"references-count":28,"URL":"https:\/\/doi.org\/10.1007\/978-3-031-47843-7_24","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2023,11,7]]},"assertion":[{"value":"7 November 2023","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ADC","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australasian Database Conference","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Melbourne, VIC","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Australia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2023","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 November 2023","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"3 November 2023","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"34","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"adc2023","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Single-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"Microsoft CMT","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"41","order":3,"name":"number_of_submissions_sent_for_review","label":"Number of Submissions Sent for Review","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"26","order":4,"name":"number_of_full_papers_accepted","label":"Number of Full Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"0","order":5,"name":"number_of_short_papers_accepted","label":"Number of Short Papers Accepted","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"63% - The value is computed by the equation \"Number of Full Papers Accepted \/ Number of Submissions Sent for Review * 100\" and then rounded to a whole number.","order":6,"name":"acceptance_rate_of_full_papers","label":"Acceptance Rate of Full Papers","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"3","order":7,"name":"average_number_of_reviews_per_paper","label":"Average Number of Reviews per Paper","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"2.5","order":8,"name":"average_number_of_papers_per_reviewer","label":"Average Number of Papers per Reviewer","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"No","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}