{"type":"ScholarlyArticle","title":"Event Prediction in Complex Social Graphs using One-Dimensional Convolutional Neural Network","authors":[{"name":"Bonaventure Molokwu","slug":"bonaventure-molokwu","given":"Bonaventure","family":"Molokwu","affiliation":"School of Computer Science , University of Windsor , 401 Sunset Avenue , Ontario N9B-3P4 , Canada"}],"abstract":"Social network graphs possess apparent and latent knowledge about their respective actors and links which may be exploited, using effective and efficient techniques, for predicting events within the social graphs. Understanding the intrinsic relationship patterns among spatial social actors and their respective properties are crucial factors to be taken into consideration in event prediction within social networks. My research work proposes a unique approach for predicting events in social networks by learning the context of each actor/vertex using neighboring actors in a given social graph with the goal of generating vector-space embeddings for each vertex. Our methodology introduces a pre-convolution layer which is essentially a set of feature-extraction operations aimed at reducing the graph's dimensionality to aid knowledge extraction from its complex structure. Consequently, the low-dimensional node embeddings are introduced as input features to a one-dimensional ConvNet model for event prediction about the given social graph. Training and evaluation of this proposed approach have been done on datasets (compiled: November, 2017) extracted from real world social networks with respect to 3 European countries. Each dataset comprises an average of 280,000 links and 48,000 actors.","doi":"10.24963/ijcai.2019/914","url":"https://ijcai.org/proceedings/2019/914","pdf":"https://ijcai.org/proceedings/2019/0914.pdf","markdown":"https://ijcai.org/proceedings/2019/914.md","bibtex":"https://ijcai.org/proceedings/2019/bibtex/914","volume":{"slug":"2019","title":"Proceedings of the Twenty-Eighth International Joint Conference on Artificial Intelligence","short_title":"IJCAI 2019","url":"https://ijcai.org/proceedings/2019/","year":2019,"location":"Macao","dates":"10-16 August 2019","editors":"Sarit Kraus","isbn":"978-0-9992411-4-1","publisher":"International Joint Conferences on Artificial Intelligence Organization","doi_prefix":"10.24963/ijcai.2019"},"section":"Doctoral Consortium","track":"Doctoral Consortium","number":914,"pages":{"first":6450,"last":6451},"keywords":["Machine Learning: Dimensionality Reduction and Manifold Learning","Machine Learning: Deep Learning","Machine Learning: Feature Selection ; Learning Sparse Models","Machine Learning: Learning Graphical Models"],"videos":[],"references":[{"position":1,"raw":"[Cook, 1971] Stephen Arthur Cook. The complexity of theorem-proving procedures. In Proceedings of the Third Annual ACM Symposium on Theory of Computing, Vol. 1, pages 151-158, 1971.","title":"The complexity of theorem-proving procedures","authors":"Stephen Arthur, Cook","year":"1971","venue":"Proceedings of the Third Annual ACM Symposium on Theory of Computing","doi":null,"url":null,"internal_url":null},{"position":2,"raw":"[Hans van Maaren and Walsh, 2009] Armin Biere Hans van Maaren and Toby Walsh, editors. Handbook of Satisfiability. IOS Press, Amsterdam, The Netherlands, 2009.","title":"Handbook of Satisfiability","authors":"Walsh Hans Van Maaren","year":"2009","venue":null,"doi":null,"url":null,"internal_url":null},{"position":3,"raw":"[Ian Goodfellow and Courville, 2017] Yoshua Bengio Ian Goodfellow and Aaron Courville, editors. Deep Learning. MIT Press, Cambridge, MA, 2017.","title":"Deep Learning","authors":null,"year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":4,"raw":"[Jason Eisner and Poliak, 2017] Ryan Cotterell Jason Eisner, Benjamin Van Durme and Adam Poliak. Explaining and generalizing skip-gram through exponential family princi- pal component analysis. In EACL, 2017.","title":"Explaining and generalizing skip-gram through exponential family principal component analysis","authors":"Ryan Cotterell, Jason Eisner, Benjamin Van Durme, Adam Poliak","year":"2017","venue":"EACL","doi":null,"url":null,"internal_url":null},{"position":5,"raw":"[Leskovec and Krevl, 2014] Jure Leskovec and Andrej Krevl. SNAP Datasets: Stanford large network dataset collection. http://snap.stanford.edu/data, June 2014.","title":"SNAP Datasets: Stanford large network dataset collection","authors":"Jure Leskovec, Andrej Krevl","year":"2014","venue":null,"doi":null,"url":"http://snap.stanford.edu/data","internal_url":null},{"position":6,"raw":"[Scott, 2017] John Scott, editor. Social Network Analysis. SAGE Publications Ltd, Newbury Park, CA, 2017.","title":"Social Network Analysis","authors":null,"year":"2017","venue":null,"doi":null,"url":null,"internal_url":null},{"position":7,"raw":"[Tomas Mikolov and Dean, 2013] Gregory Corrado Tomas Mikolov, Kai Chen and Jeffrey Dean. Effi- cient estimation of word representations in vector space. CoRR, abs/1301.3781, 2013.","title":"Efficient estimation of word representations in vector space","authors":"Gregory Corrado, Tomas Mikolov, Kai Chen, Jeffrey Dean","year":"2013","venue":null,"doi":null,"url":null,"internal_url":null}],"license_note":"Copyright International Joint Conferences on Artificial Intelligence."}