{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T14:18:40Z","timestamp":1743085120681,"version":"3.40.3"},"publisher-location":"Cham","reference-count":29,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030880804"},{"type":"electronic","value":"9783030880811"}],"license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2021]]},"DOI":"10.1007\/978-3-030-88081-1_1","type":"book-chapter","created":{"date-parts":[[2021,9,29]],"date-time":"2021-09-29T11:07:08Z","timestamp":1632913628000},"page":"3-15","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Negative Sampling for Knowledge Graph Completion Based on Generative Adversarial Network"],"prefix":"10.1007","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2180-4222","authenticated-orcid":false,"given":"Thanh","family":"Le","sequence":"first","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8354-3286","authenticated-orcid":false,"given":"Trinh","family":"Pham","sequence":"additional","affiliation":[]},{"ORCID":"https:\/\/orcid.org\/0000-0002-4306-6945","authenticated-orcid":false,"given":"Bac","family":"Le","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2021,9,30]]},"reference":[{"key":"1_CR1","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Neural Information Processing Systems (NIPS), pp. 1\u20139 (2013)"},{"key":"1_CR2","doi-asserted-by":"crossref","unstructured":"Cai, L. and Wang, W.Y: KBGAN: adversarial learning for knowledge graph embeddings. arXiv preprint arXiv:1711.04071 (2017)","DOI":"10.18653\/v1\/N18-1133"},{"key":"1_CR3","doi-asserted-by":"crossref","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: Problems, techniques, and applications. IEEE Trans. Knowl. Data Eng. 30(9), 1616\u20131637 (2018)","DOI":"10.1109\/TKDE.2018.2807452"},{"key":"1_CR4","unstructured":"Cheng, K., Zhu, Y., Zhang, M. and Sun, Y.: NoiGAN: noise aware knowledge graph embedding with adversarial learning (2019)"},{"key":"1_CR5","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., Riedel, S.: Convolutional 2D knowledge graph embeddings. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"1_CR6","doi-asserted-by":"crossref","unstructured":"Gal\u00e1rraga, L., Teflioudi, C., Hose, K., Suchanek, F.M.: Fast rule mining in ontological knowledge bases with AMIE. VLDB J. 24(6), 707\u2013730 (2015)","DOI":"10.1007\/s00778-015-0394-1"},{"key":"1_CR7","doi-asserted-by":"crossref","unstructured":"Guo, S., Wang, Q., Wang, L., Wang, B., Guo, L.: Knowledge graph embedding with iterative guidance from soft rules. In: Proceedings of the AAAI Conference on Artificial Intelligence, vol. 32, no. 1 (2018)","DOI":"10.1609\/aaai.v32i1.11918"},{"key":"1_CR8","unstructured":"Guo, L., Sun, Z., Hu, W.: Learning to exploit long-term relational dependencies in knowledge graphs. In: International Conference on Machine Learning, pp. 2505\u20132514. PMLR (2019)"},{"key":"1_CR9","doi-asserted-by":"crossref","unstructured":"Han, X., Zhang, C., Ji, Y., Hu, Z.: A dilated recurrent neural network-based model for graph embedding. IEEE Access 7, 32085\u201332092 (2019)","DOI":"10.1109\/ACCESS.2019.2901804"},{"key":"1_CR10","doi-asserted-by":"publisher","unstructured":"Hutter, F., Kotthoff, L., Vanschoren, J.: Automated Machine Learning: Methods, Systems, Challenges, pp. 219. Springer, Heidelberg (2019). https:\/\/doi.org\/10.1007\/978-3-030-05318-5","DOI":"10.1007\/978-3-030-05318-5"},{"key":"1_CR11","unstructured":"Kotnis, B., Nastase, V.: Analysis of the impact of negative sampling on link prediction in knowledge graphs. arXiv preprint arXiv:1708.06816 (2017)"},{"key":"1_CR12","doi-asserted-by":"publisher","unstructured":"Meilicke, C., Fink, M., Wang, Y., Ruffinelli, D., Gemulla, R., Stuckenschmidt, H.: Fine-grained evaluation of rule-and embedding-based systems for knowledge graph completion. In: Vrande\u010di\u0107, D., et al. (eds.) ISWC 2018. LNCS, vol. 11136, pp. 3\u201320. Springer, Cham (2018). https:\/\/doi.org\/10.1007\/978-3-030-00671-6_1","DOI":"10.1007\/978-3-030-00671-6_1"},{"key":"1_CR13","doi-asserted-by":"crossref","unstructured":"Meilicke, C., Chekol, M.W., Ruffinelli, D., Stuckenschmidt, H.: Anytime bottom-up rule learning for knowledge graph completion. In: IJCAI, pp. 3137\u20133143 (2019)","DOI":"10.24963\/ijcai.2019\/435"},{"key":"1_CR14","doi-asserted-by":"crossref","unstructured":"Nathani, D., Chauhan, J., Sharma, C., Kaul, M.: Learning attention-based embeddings for relation prediction in knowledge graphs. In: Proceedings of the 57th Annual Meeting of the Association for Computational Linguistics (2019)","DOI":"10.18653\/v1\/P19-1466"},{"key":"1_CR15","doi-asserted-by":"crossref","unstructured":"Nguyen, D.Q., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A novel embedding model for knowledge base completion based on convolutional neural network. In: Proceedings of NAACL-HLT (2017)","DOI":"10.18653\/v1\/N18-2053"},{"key":"1_CR16","doi-asserted-by":"crossref","unstructured":"Nickel, M., Murphy, K., Tresp, V., Gabrilovich, E.: A review of relational machine learning for knowledge graphs. Proc. IEEE 104(1), pp. 11\u201333 (2015)","DOI":"10.1109\/JPROC.2015.2483592"},{"key":"1_CR17","doi-asserted-by":"crossref","unstructured":"Ortona, S., Meduri, V.V., Papotti, P.: Robust discovery of positive and negative rules in knowledge bases. In: IEEE 34th International Conference on Data Engineering (ICDE), pp. 1168\u20131179 (2018)","DOI":"10.1109\/ICDE.2018.00108"},{"key":"1_CR18","unstructured":"Peng, B., Min, R., Ning, X.: CNN-based dual-chain models for knowledge graph learning. arXiv preprint arXiv:1911.06910 (2019)"},{"key":"1_CR19","unstructured":"Sabour, S., Frosst, N., Hinton, G.E.: Dynamic routing between capsules. In: Proceedings of the 31st International Conference on Neural Information Processing Systems (NIPS 2017) (2017)"},{"key":"1_CR20","unstructured":"Socher, R., Chen, D., Manning, C.D., Ng, A.: Reasoning with neural tensor networks for knowledge base completion. In: Advances in Neural Information Processing Systems, pp. 926\u2013934 (2013)"},{"key":"1_CR21","unstructured":"Trouillon, T., Welbl, J., Riedel, S., Gaussier, \u00c9, Bouchard, G.: Complex embeddings for simple link prediction. In: International Conference on Machine Learning, pp. 2071\u20132080, PMLR (2016)"},{"key":"1_CR22","unstructured":"Veli\u010dkovi\u0107, P., Cucurull, G., Casanova, A., Romero, A., Lio, P., Bengio, Y.: Graph attention networks. arXiv preprint arXiv:1710.10903 (2017)"},{"key":"1_CR23","doi-asserted-by":"crossref","unstructured":"Vu, T., Nguyen, T.D., Nguyen, D.Q., Phung, D.: A capsule network-based embedding model for knowledge graph completion and search personalization. In: Proceedings of the 2019 Conference of the North American Chapter of the Association for Computational Linguistics: Human Language Technologies, vol. 1 (Long and Short Papers), pp. 2180\u20132189 (2019)","DOI":"10.18653\/v1\/N19-1226"},{"key":"1_CR24","doi-asserted-by":"crossref","unstructured":"Wang, X., Xu, Y., He, X., Cao, Y., Wang, M. and Chua, T.S.: Reinforced negative sampling over knowledge graph for recommendation. In: Proceedings of The Web Conference 2020, pp. 99\u2013109 (2020)","DOI":"10.1145\/3366423.3380098"},{"key":"1_CR25","doi-asserted-by":"crossref","unstructured":"Zhang, W., Chen, T., Wang, J., Yu, Y.: Optimizing Top-N collaborative filtering via dynamic negative item sampling. In: Proceedings of the 36th International ACM SIGIR Conference on Research and Development in Information Retrieval, pp. 785\u2013788 (2013)","DOI":"10.1145\/2484028.2484126"},{"key":"1_CR26","doi-asserted-by":"crossref","unstructured":"Toutanova, K., Chen, D.: Observed versus latent features for knowledge base and text inference. In: Proceedings of the 3rd Workshop on Continuous Vector Space Models and their Compositionality, pp. 57\u201366 (2015)","DOI":"10.18653\/v1\/W15-4007"},{"key":"1_CR27","doi-asserted-by":"crossref","unstructured":"Dettmers, T., Minervini, P., Stenetorp, P., Riedel, S.: Convolutional 2D knowledge graph embeddings. In Proceedings of the 32nd AAAI Conference on Artificial Intelligence (2018, page to appear)","DOI":"10.1609\/aaai.v32i1.11573"},{"key":"1_CR28","doi-asserted-by":"crossref","unstructured":"Toutanova, K., Chen, D.: Observed versus latent features for knowledge base and text inference. In: Workshop on CVSMC, pp. 57\u201366 (2015)","DOI":"10.18653\/v1\/W15-4007"},{"key":"1_CR29","doi-asserted-by":"crossref","unstructured":"Wang, Y., Ruffinelli, D., Broscheit, S., Gemulla, R.: On evaluating embedding models for knowledge base completion. Technical report. arXiv:1812.06410 (2018)","DOI":"10.18653\/v1\/W19-4313"}],"container-title":["Lecture Notes in Computer Science","Computational Collective Intelligence"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-88081-1_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,1,10]],"date-time":"2023-01-10T18:53:41Z","timestamp":1673376821000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-88081-1_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"ISBN":["9783030880804","9783030880811"],"references-count":29,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-88081-1_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2021]]},"assertion":[{"value":"30 September 2021","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ICCCI","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Computational Collective Intelligence","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Rhodos","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Greece","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2021","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"29 September 2021","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"1 October 2021","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"13","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"iccci2021","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/iccci.pwr.edu.pl\/2021\/","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":"231","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":"58","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":"25% - 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":"3","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)"}}]}}