{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:01:40Z","timestamp":1742958100801,"version":"3.40.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030041816"},{"type":"electronic","value":"9783030041823"}],"license":[{"start":{"date-parts":[[2018,1,1]],"date-time":"2018-01-01T00:00:00Z","timestamp":1514764800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018]]},"DOI":"10.1007\/978-3-030-04182-3_39","type":"book-chapter","created":{"date-parts":[[2018,11,17]],"date-time":"2018-11-17T10:19:48Z","timestamp":1542449988000},"page":"448-459","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Learning from Titles to Recommend Keywords for Academic Papers"],"prefix":"10.1007","author":[{"given":"Huifang","family":"Ma","sequence":"first","affiliation":[]},{"given":"Fang","family":"Liu","sequence":"additional","affiliation":[]},{"given":"Qin","family":"Xia","sequence":"additional","affiliation":[]},{"given":"Li","family":"Yu","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2018,11,18]]},"reference":[{"doi-asserted-by":"crossref","unstructured":"Blank, I., Rokach, L., Shani, G.: Leveraging the citation graph to recommend keywords. In: 7th ACM Conference on Recommender Systems, pp. 359-362. ACM, Hong Kong (2013)","key":"39_CR1","DOI":"10.1145\/2507157.2507197"},{"key":"39_CR2","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/j.ins.2014.08.062","volume":"292","author":"Ugo Erra","year":"2015","unstructured":"Erra, U., Senatore, S., Minnella, F., Caggianese, G.: Approximate TF\u2013IDF based on topic extraction from massive message stream using the GPU. Inf. Sci. Int. J. 292(C), 143\u2013161 (2015)","journal-title":"Information Sciences"},{"key":"39_CR3","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1007\/978-3-319-63558-3_6","volume-title":"Knowledge Science, Engineering and Management","author":"H Ma","year":"2017","unstructured":"Ma, H., Xing, Y., Wang, S., Li, M.: Leveraging term co-occurrence distance and strong classification features for short text feature selection. In: Li, G., Ge, Y., Zhang, Z., Jin, Z., Blumenstein, M. (eds.) KSEM 2017. LNCS (LNAI), vol. 10412, pp. 67\u201375. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-63558-3_6"},{"doi-asserted-by":"crossref","unstructured":"Hua, W., Wang, Z., Wang, H., Zhou, X.F.: Short text understanding through lexical-semantic analysis. In: 31st International Conference on Data Engineering, pp. 495\u2013506. IEEE Computer Society, Seoul (2015)","key":"39_CR4","DOI":"10.1109\/ICDE.2015.7113309"},{"unstructured":"Blei, D.M., Ng, A.Y., Jordan, M,I.: Latent dirichlet allocation. J. Mach. Learn. Res. 3(1), 993\u20131022 (2012)","key":"39_CR5"},{"issue":"7","key":"39_CR6","doi-asserted-by":"publisher","first-page":"1479","DOI":"10.1109\/TPAMI.2015.2481420","volume":"38","author":"R Saeidi","year":"2015","unstructured":"Saeidi, R., Astudillo, R., Kolossa, D.: Uncertain LDA: including observation uncertainties in discriminative transforms. IEEE Trans. Pattern Anal. Mach. Intell. 38(7), 1479\u20131488 (2015)","journal-title":"IEEE Trans. Pattern Anal. Mach. Intell."},{"key":"39_CR7","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1007\/978-3-319-57529-2_29","volume-title":"Advances in Knowledge Discovery and Data Mining","author":"J Qiang","year":"2017","unstructured":"Qiang, J., Chen, P., Wang, T., Wu, X.: Topic modeling over short texts by incorporating word embeddings. In: Kim, J., Shim, K., Cao, L., Lee, J.-G., Lin, X., Moon, Y.-S. (eds.) PAKDD 2017. LNCS (LNAI), vol. 10235, pp. 363\u2013374. Springer, Cham (2017). https:\/\/doi.org\/10.1007\/978-3-319-57529-2_29"},{"issue":"2","key":"39_CR8","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1145\/3091108","volume":"36","author":"Chenliang Li","year":"2017","unstructured":"Li, C.L., Duan, Y., Wang, H.R., Zhang Z.Q.: Enhancing topic modeling for short texts with auxiliary word embeddings. ACM Trans. Inf. Syst. 36(2), 11:1\u201311:30 (2017)","journal-title":"ACM Transactions on Information Systems"},{"issue":"4","key":"39_CR9","first-page":"308","volume":"240","author":"WD Abilhoa","year":"2014","unstructured":"Abilhoa, W.D., Castro, L.N.: A keyword extraction method from twitter messages represented as graphs. Appl. Math. Comput. 240(4), 308\u2013325 (2014)","journal-title":"Appl. Math. Comput."},{"issue":"13","key":"39_CR10","first-page":"271","volume":"237","author":"W Wang","year":"2013","unstructured":"Wang, W., Li, S.J., Li, W.J., Wei, F.R.: Exploring hypergraph-based semi-supervised ranking for query-oriented summarization. Inf. Sci. Int. J. 237(13), 271\u2013286 (2013)","journal-title":"Inf. Sci. Int. J."},{"doi-asserted-by":"crossref","unstructured":"Zhou, D., Huang, J.: Learning with hypergraphs: clustering, classification, and embedding. In: 20th International Conference on Neural Information Processing Systems, pp. 1601\u20131608. British Columbia (2006)","key":"39_CR11","DOI":"10.7551\/mitpress\/7503.003.0205"},{"unstructured":"CCF. http:\/\/www.ccf.org.cn\/sites\/ccf\/paiming.jsp","key":"39_CR12"},{"unstructured":"Bellaachia, A., Mohammed, A.: HG-RANK: A Hypergraph-based keyphrase extraction for short documents in dynamic genre. In: 4th Workshop on Making Sense of Microposts Co-located with the 23rd International World Wide Web Conference, pp. 42\u201349. Microposts2014, Seoul (2014)","key":"39_CR13"},{"unstructured":"DBLP Dataset. http:\/\/dblp.uni-trier.de\/xml\/. Accessed 20 April 2016","key":"39_CR14"},{"unstructured":"Porter, M.F.: An Algorithm for Suffix Stripping. Readings in Information Retrieval. 1st edn. Morgan Kaufmann Publishers (1997)","key":"39_CR15"}],"container-title":["Lecture Notes in Computer Science","Neural Information Processing"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-04182-3_39","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T15:22:51Z","timestamp":1709824971000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-04182-3_39"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018]]},"ISBN":["9783030041816","9783030041823"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-04182-3_39","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2018]]},"assertion":[{"value":"18 November 2018","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICONIP","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Neural Information Processing","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Siem Reap","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Cambodia","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2018","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13 December 2018","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"16 December 2018","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"25","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iconip2018","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/conference.cs.cityu.edu.hk\/iconip\/","order":11,"name":"conference_url","label":"Conference URL","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":"EasyChair","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"575","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":"401","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":"70% - 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":"4","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":"6","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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}