{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,9,30]],"date-time":"2026-09-30T14:12:43Z","timestamp":1790777563571,"version":"4.1.0"},"publisher-location":"Cham","reference-count":26,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783030461492","type":"print"},{"value":"9783030461508","type":"electronic"}],"license":[{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"},{"start":{"date-parts":[[2020,1,1]],"date-time":"2020-01-01T00:00:00Z","timestamp":1577836800000},"content-version":"vor","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":[[2020]]},"DOI":"10.1007\/978-3-030-46150-8_32","type":"book-chapter","created":{"date-parts":[[2020,5,1]],"date-time":"2020-05-01T01:02:40Z","timestamp":1588294960000},"page":"541-557","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":5,"title":["Triangle Completion Time Prediction Using Time-Conserving Embedding"],"prefix":"10.1007","author":[{"given":"Vachik S.","family":"Dave","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Mohammad","family":"Al Hasan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2020,4,30]]},"reference":[{"key":"32_CR1","doi-asserted-by":"publisher","first-page":"130","DOI":"10.1016\/j.physd.2006.09.028","volume":"224","author":"T Antal","year":"2006","unstructured":"Antal, T., Krapivsky, P., Redner, S.: Social balance on networks: the dynamics of friendship and enmity. Physica D 224, 130\u2013136 (2006)","journal-title":"Physica D"},{"issue":"4","key":"32_CR2","doi-asserted-by":"publisher","first-page":"042806","DOI":"10.1103\/PhysRevE.90.042806","volume":"90","author":"G Bianconi","year":"2014","unstructured":"Bianconi, G., Darst, R.K., Iacovacci, J., Fortunato, S.: Triadic closure as a basic generating mechanism of communities in complex networks. Phys. Rev. E 90(4), 042806 (2014)","journal-title":"Phys. Rev. E"},{"key":"32_CR3","doi-asserted-by":"crossref","unstructured":"Bonner, S., Brennan, J., Kureshi, I., Theodoropoulos, G., McGough, A.S., Obara, B.: Temporal graph offset reconstruction: towards temporally robust graph representation learning. In: IEEE Big Data, pp. 3737\u20133746 (2018)","DOI":"10.1109\/BigData.2018.8622636"},{"key":"32_CR4","doi-asserted-by":"crossref","unstructured":"Dave, V.S., Ahmed, N.K., Hasan, M.A.: E-clog: counting edge-centric local graphlets. In: IEEE Intternational Conference on Big Data, pp. 586\u2013595, December 2017","DOI":"10.1109\/BigData.2017.8257974"},{"key":"32_CR5","doi-asserted-by":"crossref","unstructured":"Dave, V.S., Al Hasan, M., Reddy, C.K.: How fast will you get a response? Predicting interval time for reciprocal link creation. In: Eleventh International AAAI Conference on Web and Social Media, ICWSM 2017 (2017)","DOI":"10.1609\/icwsm.v11i1.14961"},{"issue":"1","key":"32_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1007\/s13278-018-0494-1","volume":"8","author":"VS Dave","year":"2018","unstructured":"Dave, V.S., Hasan, M.A., Zhang, B., Reddy, C.K.: Predicting interval time for reciprocal link creation using survival analysis. Soc. Netw. Anal. Min. 8(1), 1\u201320 (2018). https:\/\/doi.org\/10.1007\/s13278-018-0494-1","journal-title":"Soc. Netw. Anal. Min."},{"key":"32_CR7","doi-asserted-by":"crossref","unstructured":"Dave, V.S., Zhang, B., Al Hasan, M., AlJadda, K., Korayem, M.: A combined representation learning approach for better job and skill recommendation. In: ACM International Conference on Information and Knowledge Management, CIKM 2018, pp. 1997\u20132005 (2018)","DOI":"10.1145\/3269206.3272023"},{"key":"32_CR8","doi-asserted-by":"crossref","unstructured":"Dave, V.S., Zhang, B., Chen, P.Y., Hasan, M.A.: Neural-brane: neural Bayesian personalized ranking for attributed network embedding. Data Sci. Eng. (2019)","DOI":"10.1007\/s41019-019-0092-x"},{"key":"32_CR9","doi-asserted-by":"crossref","unstructured":"Dong, Y., et al.: Link prediction and recommendation across heterogeneous social networks. In: IEEE International Conference on Data Mining, pp. 181\u2013190 (2012)","DOI":"10.1109\/ICDM.2012.140"},{"key":"32_CR10","first-page":"2121","volume":"12","author":"J Duchi","year":"2011","unstructured":"Duchi, J., Hazan, E., Singer, Y.: Adaptive subgradient methods for online learning and stochastic optimization. J. Mach. Learn. Res. 12, 2121\u20132159 (2011)","journal-title":"J. Mach. Learn. Res."},{"key":"32_CR11","doi-asserted-by":"crossref","unstructured":"Durak, N., Pinar, A., Kolda, T.G., Seshadhri, C.: Degree relations of triangles in real-world networks and graph models. In: ACM International Conference on Information and Knowledge Management, pp. 1712\u20131716 (2012)","DOI":"10.1145\/2396761.2398503"},{"key":"32_CR12","doi-asserted-by":"crossref","unstructured":"Grover, A., Leskovec, J.: Node2vec: scalable feature learning for networks. In: KDD 2016, pp. 855\u2013864 (2016)","DOI":"10.1145\/2939672.2939754"},{"key":"32_CR13","unstructured":"Hamilton, W., Ying, Z., Leskovec, J.: Inductive representation learning on large graphs. In: Advances in Neural Information Processing Systems (NIPS), vol. 30, pp. 1024\u20131034 (2017)"},{"issue":"2","key":"32_CR14","doi-asserted-by":"publisher","first-page":"e1226","DOI":"10.1002\/widm.1226","volume":"8","author":"MA Hasan","year":"2018","unstructured":"Hasan, M.A., Dave, V.: Triangle counting in large networks: a review. Wiley Interdisc. Rev. Data Min. Knowl. Discov. 8(2), e1226 (2018)","journal-title":"Wiley Interdisc. Rev. Data Min. Knowl. Discov."},{"key":"32_CR15","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1007\/978-1-4419-8462-3_9","volume-title":"Social Network Data Analytics","author":"MA Hasan","year":"2011","unstructured":"Hasan, M.A., Zaki, M.J.: A survey of link prediction in social networks. In: Aggarwal, C. (ed.) Social Network Data Analytics, pp. 243\u2013275. Springer, Boston (2011). https:\/\/doi.org\/10.1007\/978-1-4419-8462-3_9"},{"issue":"12","key":"32_CR16","doi-asserted-by":"publisher","first-page":"3374","DOI":"10.1109\/TKDE.2015.2453956","volume":"27","author":"H Huang","year":"2015","unstructured":"Huang, H., Tang, J., Liu, L., Luo, J., Fu, X.: Triadic closure pattern analysis and prediction in social networks. IEEE Trans. Knowl. Data Eng. 27(12), 3374\u20133389 (2015)","journal-title":"IEEE Trans. Knowl. Data Eng."},{"key":"32_CR17","doi-asserted-by":"crossref","unstructured":"Leskovec, J., Backstrom, L., Kumar, R., Tomkins, A.: Microscopic evolution of social networks. In: KDD 2008, pp. 462\u2013470 (2008)","DOI":"10.1145\/1401890.1401948"},{"key":"32_CR18","doi-asserted-by":"crossref","unstructured":"Nguyen, G.H., Lee, J.B., Rossi, R.A., Ahmed, N.K., Koh, E., Kim, S.: Continuous-time dynamic network embeddings. In: Companion of the Web Conference 2018, pp. 969\u2013976 (2018)","DOI":"10.1145\/3184558.3191526"},{"key":"32_CR19","doi-asserted-by":"crossref","unstructured":"Perozzi, B., Al-Rfou, R., Skiena, S.: DeepWalk: online learning of social representations. In: KDD 2014, pp. 701\u2013710 (2014)","DOI":"10.1145\/2623330.2623732"},{"key":"32_CR20","doi-asserted-by":"crossref","unstructured":"Sala, A., Cao, L., Wilson, C., Zablit, R., Zheng, H., Zhao, B.Y.: Measurement-calibrated graph models for social network experiments. In: ACM International Conference on World Wide Web, pp. 861\u2013870 (2010)","DOI":"10.1145\/1772690.1772778"},{"key":"32_CR21","doi-asserted-by":"crossref","unstructured":"Tang, J., Qu, M., Wang, M., Zhang, M., Yan, J., Mei, Q.: Line: large-scale information network embedding. In: International Conference on World Wide Web, pp. 1067\u20131077 (2015)","DOI":"10.1145\/2736277.2741093"},{"key":"32_CR22","doi-asserted-by":"crossref","unstructured":"Tsitsulin, A., Mottin, D., Karras, P., M\u00fcller, E.: Verse: versatile graph embeddings from similarity measures. In: The World Wide Web Conference, pp. 539\u2013548 (2018)","DOI":"10.1145\/3178876.3186120"},{"issue":"6684","key":"32_CR23","doi-asserted-by":"publisher","first-page":"440","DOI":"10.1038\/30918","volume":"393","author":"DJ Watts","year":"1998","unstructured":"Watts, D.J., Strogatz, S.H.: Collective dynamics of small-world networks. Nature 393(6684), 440 (1998)","journal-title":"Nature"},{"key":"32_CR24","doi-asserted-by":"crossref","unstructured":"Zhang, Z., Cui, P., Wang, X., Pei, J., Yao, X., Zhu, W.: Arbitrary-order proximity preserved network embedding. In: KDD 2018, pp. 2778\u20132786 (2018)","DOI":"10.1145\/3219819.3219969"},{"key":"32_CR25","doi-asserted-by":"crossref","unstructured":"Zhou, L., Yang, Y., Ren, X., Wu, F., Zhuang, Y.: Dynamic network embedding by modeling triadic closure process. In: Conference on Artificial Intelligence (2018)","DOI":"10.1609\/aaai.v32i1.11257"},{"key":"32_CR26","doi-asserted-by":"crossref","unstructured":"Zuo, Y., Liu, G., Lin, H., Guo, J., Hu, X., Wu, J.: Embedding temporal network via neighborhood formation. In: ACM SIGKDD International Conference on Knowledge Discovery & Data Mining, pp. 2857\u20132866 (2018)","DOI":"10.1145\/3219819.3220054"}],"container-title":["Lecture Notes in Computer Science","Machine Learning and Knowledge Discovery in Databases"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-46150-8_32","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,5,6]],"date-time":"2025-05-06T09:33:30Z","timestamp":1746524010000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-030-46150-8_32"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030461492","9783030461508"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-46150-8_32","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"30 April 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ECML PKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Joint European Conference on Machine Learning and Knowledge Discovery in Databases","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"W\u00fcrzburg","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Germany","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":"16 September 2019","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"20 September 2019","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"ecml2019","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"http:\/\/ecmlpkdd2019.org\/","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":"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":"733","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":"130","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":"18% - 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.04","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":"5.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":"Yes","order":9,"name":"external_reviewers_involved","label":"External Reviewers Involved","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"ECML PKDD Workshops Information: single-blind review, submissions: 200, full papers accepted: 70, short papers accepted: 46","order":10,"name":"additional_info_on_review_process","label":"Additional Info on Review Process","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}}]}}