{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T02:08:29Z","timestamp":1743041309135,"version":"3.40.3"},"publisher-location":"Cham","reference-count":11,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030223373"},{"type":"electronic","value":"9783030223380"}],"license":[{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2019,1,1]],"date-time":"2019-01-01T00:00:00Z","timestamp":1546300800000},"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":[[2019]]},"DOI":"10.1007\/978-3-030-22338-0_4","type":"book-chapter","created":{"date-parts":[[2019,7,9]],"date-time":"2019-07-09T23:33:30Z","timestamp":1562715210000},"page":"42-52","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Upstream, Downstream or Competitor? Detecting Company Relations for Commercial Activities"],"prefix":"10.1007","author":[{"given":"Yi-Pei","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ting-Lun","family":"Hsu","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Wen-Kai","family":"Chung","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Shih-Chieh","family":"Dai","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Lun-Wei","family":"Ku","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2019,6,14]]},"reference":[{"key":"4_CR1","first-page":"F02","volume":"1","author":"YL Hsieh","year":"2005","unstructured":"Hsieh, Y.L., Yang, D.-L., Wu, J.: Using data mining to study upstream and downstream causal relationship in stock market. Computer 1, F02 (2005)","journal-title":"Computer"},{"key":"4_CR2","doi-asserted-by":"crossref","unstructured":"Ma, W.-Y., Chen, K.-J.: Introduction to CKIP Chinese word segmentation system for the first international Chinese Word Segmentation Bakeoff, pp. 168\u2013171. Association for Computational Linguistics (2003)","DOI":"10.3115\/1119250.1119276"},{"key":"4_CR3","doi-asserted-by":"crossref","unstructured":"Pennington, J., Socher, R., Manning, C.D.: GloVe: global vectors for word representation. In: Empirical Methods in Natural Language Processing (EMNLP), pp. 1532\u20131543 (2014). http:\/\/www.aclweb.org\/anthology\/D14-1162","DOI":"10.3115\/v1\/D14-1162"},{"key":"4_CR4","unstructured":"Zeiler, M.D.: ADADELTA: An Adaptive Learning Rate Method. CoRR abs\/1212.5701 (2012). http:\/\/arxiv.org\/abs\/1212.5701"},{"key":"4_CR5","unstructured":"Kingma, D.P., Ba, J.: Adam: A Method for Stochastic Optimization. CoRR abs\/1412.6980 http:\/\/arxiv.org\/abs\/1412.6980 (2014)"},{"key":"4_CR6","unstructured":"Hinton, G.: Neural networks for machine learning - lecture 6a - overview of mini-batch gradient descent (2012)"},{"issue":"3","key":"4_CR7","doi-asserted-by":"publisher","first-page":"400","DOI":"10.1214\/aoms\/1177729586","volume":"22","author":"Herbert Robbins","year":"1951","unstructured":"Robbins, H., Monro, S.: A stochastic approximation method. Ann. Math. Statist. 22(3), 400\u2013407 (1951). https:\/\/doi.org\/10.1214\/aoms\/1177729586. https:\/\/projecteuclid.org\/euclid.aoms\/1177729586","journal-title":"The Annals of Mathematical Statistics"},{"issue":"3","key":"4_CR8","doi-asserted-by":"publisher","first-page":"462","DOI":"10.1214\/aoms\/1177729392","volume":"23","author":"J. Kiefer","year":"1952","unstructured":"Kiefer, J., Wolfowitz, J.: Stochastic estimation of the maximum of a regression function. Ann. Math. Statist. 23(3), 462\u2013466 (1952). https:\/\/doi.org\/10.1214\/aoms\/1177729392. https:\/\/projecteuclid.org\/euclid.aoms\/1177729392","journal-title":"The Annals of Mathematical Statistics"},{"issue":"1","key":"4_CR9","doi-asserted-by":"publisher","first-page":"145","DOI":"10.1016\/S0893-6080(98)00116-6","volume":"12","author":"N Qian","year":"1999","unstructured":"Qian, N.: On the momentum term in gradient descent learning algorithms. Neural Netw. 12(1), 145\u2013151 (1999). http:\/\/www.sciencedirect.com\/science\/article\/pii\/S0893608098001166","journal-title":"Neural Netw."},{"key":"4_CR10","first-page":"1929","volume":"15","author":"N Srivastava","year":"2014","unstructured":"Srivastava, N., Hinton, G., Krizhevsky, A., Sutskever, I., Salakhutdinov, R.: Dropout: a simple way to prevent neural networks from overfitting. J. Mach. Learn. Res. 15, 1929\u20131958 (2014). http:\/\/jmlr.org\/papers\/v15\/srivastava14a.html","journal-title":"J. Mach. Learn. Res."},{"key":"4_CR11","unstructured":"Ng, A.Y.: Feature selection, L1 vs. L2 regularization, and rotational invariance. In: Proceedings of the Twenty-First International Conference on Machine Learning, ICML 2004, Banff, Alberta, Canada, p. 78. ACM, New York (2004). http:\/\/doi.acm.org\/10.1145\/1015330.1015435"}],"container-title":["Lecture Notes in Computer Science","HCI in Business, Government and Organizations. Information Systems and Analytics"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-22338-0_4","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,7]],"date-time":"2024-03-07T13:41:47Z","timestamp":1709818907000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-22338-0_4"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2019]]},"ISBN":["9783030223373","9783030223380"],"references-count":11,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-22338-0_4","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2019]]},"assertion":[{"value":"14 June 2019","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"HCII","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Human-Computer Interaction","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Orlando, FL","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"USA","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2019","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"26 July 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"31 July 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"hcii2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/2019.hci.international\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}