{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,11]],"date-time":"2024-09-11T19:39:56Z","timestamp":1726083596105},"publisher-location":"Cham","reference-count":25,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783030474355"},{"type":"electronic","value":"9783030474362"}],"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"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2020]]},"DOI":"10.1007\/978-3-030-47436-2_3","type":"book-chapter","created":{"date-parts":[[2020,5,8]],"date-time":"2020-05-08T03:02:47Z","timestamp":1588906967000},"page":"31-43","update-policy":"http:\/\/dx.doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Mining Dynamic Graph Streams for Predictive Queries Under Resource Constraints"],"prefix":"10.1007","author":[{"given":"Xuanming","family":"Liu","sequence":"first","affiliation":[]},{"given":"Tingjian","family":"Ge","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2020,5,6]]},"reference":[{"key":"3_CR1","unstructured":"Movielens data (2019). https:\/\/grouplens.org\/datasets\/movielens\/latest\/"},{"key":"3_CR2","unstructured":"New york taxi data (2019). http:\/\/chriswhong.com\/open-data\/foil_nyc_taxi\/"},{"key":"3_CR3","doi-asserted-by":"publisher","first-page":"137","DOI":"10.1006\/jcss.1997.1545","volume":"58","author":"N Alon","year":"1999","unstructured":"Alon, N., Matias, Y., Szegedy, M.: The space complexity of approximating the frequency moments. J. Comput. Syst. Sci. 58, 137\u2013147 (1999)","journal-title":"J. Comput. Syst. Sci."},{"key":"3_CR4","unstructured":"Amazon: Amazon neptune (2019). https:\/\/aws.amazon.com\/neptune\/"},{"key":"3_CR5","doi-asserted-by":"crossref","unstructured":"Bizer, C., Heath, T., Berners-Lee, T.: Linked data - the story so far. Int. J. Semantic Web Inf. Syst. (2009)","DOI":"10.4018\/jswis.2009081901"},{"key":"3_CR6","doi-asserted-by":"publisher","first-page":"422","DOI":"10.1145\/362686.362692","volume":"13","author":"BH Bloom","year":"1970","unstructured":"Bloom, B.H.: Space\/time trade-offs in hash coding with allowable errors. Commun. ACM 13, 422\u2013426 (1970)","journal-title":"Commun. ACM"},{"key":"3_CR7","unstructured":"Bordes, A., Usunier, N., Garcia-Duran, A., Weston, J., Yakhnenko, O.: Translating embeddings for modeling multi-relational data. In: Advances in Neural Information Processing Systems, pp. 2787\u20132795 (2013)"},{"key":"3_CR8","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"146","DOI":"10.1007\/978-3-540-28650-9_7","volume-title":"Advanced Lectures on Machine Learning","author":"L Bottou","year":"2004","unstructured":"Bottou, L.: Stochastic learning. In: Bousquet, O., von Luxburg, U., R\u00e4tsch, G. (eds.) ML -2003. LNCS (LNAI), vol. 3176, pp. 146\u2013168. Springer, Heidelberg (2004). https:\/\/doi.org\/10.1007\/978-3-540-28650-9_7"},{"key":"3_CR9","doi-asserted-by":"crossref","unstructured":"Boykin, O., Ritchie, S., O\u2019Connell, I., Lin, J.: Summingbird: a framework for integrating batch and online MapReduce computations. In: VLDB (2014)","DOI":"10.14778\/2733004.2733016"},{"key":"3_CR10","doi-asserted-by":"publisher","first-page":"221","DOI":"10.1016\/j.ins.2016.07.077","volume":"370","author":"M Cafaro","year":"2016","unstructured":"Cafaro, M., Pulimeno, M., Epicoco, I., Aloisio, G.: Mining frequent items in the time fading model. Inf. Sci. 370, 221\u2013238 (2016)","journal-title":"Inf. Sci."},{"key":"3_CR11","first-page":"1616","volume":"30","author":"H Cai","year":"2018","unstructured":"Cai, H., Zheng, V.W., Chang, K.C.C.: A comprehensive survey of graph embedding: problems, techniques and applications. TKDE 30, 1616\u20131637 (2018)","journal-title":"TKDE"},{"key":"3_CR12","doi-asserted-by":"publisher","first-page":"58","DOI":"10.1016\/j.jalgor.2003.12.001","volume":"55","author":"G Cormode","year":"2005","unstructured":"Cormode, G., Muthukrishnan, S.: An improved data stream summary: the count-min sketch and its applications. J. Algorithms 55, 58\u201375 (2005)","journal-title":"J. Algorithms"},{"key":"3_CR13","doi-asserted-by":"crossref","unstructured":"Dong, X., et al.: Knowledge vault: a web-scale approach to probabilistic knowledge fusion. In: KDD (2014)","DOI":"10.1145\/2623330.2623623"},{"key":"3_CR14","doi-asserted-by":"crossref","unstructured":"Garcia Lopez, P., et al.: Edge-centric computing: vision and challenges. SIGCOMM Comput. Commun. Rev. (2015)","DOI":"10.1145\/2831347.2831354"},{"key":"3_CR15","unstructured":"Google: Google inside search (2019). https:\/\/www.google.com\/intl\/en_us\/insidesearch\/features\/search\/knowledge.html"},{"key":"3_CR16","doi-asserted-by":"crossref","unstructured":"Lin, Y., Liu, Z., Sun, M., Liu, Y., Zhu, X.: Learning entity and relation embeddings for knowledge graph completion. In: AAAI (2015)","DOI":"10.1609\/aaai.v29i1.9491"},{"key":"3_CR17","unstructured":"Liu, X., Ge, T.: Mining dynamic graph streams for predictive queries under resource constraints (2020). http:\/\/www.cs.uml.edu\/~ge\/paper\/gstream_predictive_queries_tech_report.pdf"},{"issue":"1","key":"3_CR18","doi-asserted-by":"publisher","first-page":"9","DOI":"10.1145\/2627692.2627694","volume":"43","author":"A McGregor","year":"2014","unstructured":"McGregor, A.: Graph stream algorithms: a survey. ACM SIGMOD Rec. 43(1), 9\u201320 (2014)","journal-title":"ACM SIGMOD Rec."},{"key":"3_CR19","unstructured":"Mikolov, T., Sutskever, I., Chen, K., Corrado, G., Dean, J.: Distributed representations of words and phrases and their compositionality. In: NIPS (2013)"},{"issue":"58","key":"3_CR20","first-page":"240","volume":"I","author":"K Pearson","year":"1895","unstructured":"Pearson, K.: Note on regression and inheritance in the case of two parents. Proc. R. Soc. Lond. Series I(58), 240\u2013242 (1895)","journal-title":"Proc. R. Soc. Lond. Series"},{"key":"3_CR21","doi-asserted-by":"crossref","unstructured":"Tai, K.S., Sharan, V., Bailis, P., Valiant, G.: Sketching linear classifiers over data streams. In: SIGMOD (2018)","DOI":"10.1145\/3183713.3196930"},{"issue":"12","key":"3_CR22","first-page":"2724","volume":"29","author":"Q Wang","year":"2017","unstructured":"Wang, Q., Mao, Z., Wang, B., Guo, L.: Knowledge graph embedding: a survey of approaches and applications. TKDE 29(12), 2724\u20132743 (2017)","journal-title":"TKDE"},{"key":"3_CR23","doi-asserted-by":"crossref","unstructured":"Wang, Z., Zhang, J., Feng, J., Chen, Z.: Knowledge graph embedding by translating on hyperplanes. In: AAAI, vol. 14, pp. 1112\u20131119 (2014)","DOI":"10.1609\/aaai.v28i1.8870"},{"key":"3_CR24","unstructured":"Zhang, B., Srihari, S.N.: Properties of binary vector dissimilarity measures. In: CVPR (2003)"},{"key":"3_CR25","first-page":"73","volume":"17","author":"S Zilberstein","year":"1996","unstructured":"Zilberstein, S.: Using anytime algorithms in intelligent systems. AI Mag. 17, 73 (1996)","journal-title":"AI Mag."}],"container-title":["Lecture Notes in Computer Science","Advances in Knowledge Discovery and Data Mining"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-030-47436-2_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,10,23]],"date-time":"2022-10-23T04:42:20Z","timestamp":1666500140000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-030-47436-2_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020]]},"ISBN":["9783030474355","9783030474362"],"references-count":25,"URL":"https:\/\/doi.org\/10.1007\/978-3-030-47436-2_3","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2020]]},"assertion":[{"value":"6 May 2020","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"PAKDD","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Pacific-Asia Conference on Knowledge Discovery and Data Mining","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Singapore","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2020","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"11 May 2020","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"14 May 2020","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"24","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"pakdd2020","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"https:\/\/www.pakdd2020.org\/","order":11,"name":"conference_url","label":"Conference URL","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Double-blind","order":1,"name":"type","label":"Type","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"CMT System","order":2,"name":"conference_management_system","label":"Conference Management System","group":{"name":"ConfEventPeerReviewInformation","label":"Peer Review Information (provided by the conference organizers)"}},{"value":"628","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":"135","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":"21% - 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-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-8","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":"The conference was held virtually due to the COVID-19 pandemic.","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)"}},{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}