Seminar on Internet Technologies (Winter 2017/2018): Difference between revisions

Line 77: Line 77:
| '''A Review of Relational Machine Learning for Knowledge Graphs'''   
| '''A Review of Relational Machine Learning for Knowledge Graphs'''   
Traditional machine learning algorithms take as input a feature vector, which represents an object in terms of numeric or categorical attributes. The main learning task is to learn a mapping from this feature vector to an output prediction of some form. In Statistical Relational Learning (SRL), the representation of an object can contain its relationships to other objects. Thus the data is in the form of a graph, consisting of nodes (entities) and labelled edges (relationships between entities). The main goals of SRL include prediction of missing edges, prediction of properties of nodes, and clustering nodes based on their connectivity patterns. The task is to review a variety of techniques from the SRL community and explain how they can be applied to large-scale knowledge graphs (KGs), i.e., graph structured knowledge bases (KBs) that store factual information in form of relationships between entities.
Traditional machine learning algorithms take as input a feature vector, which represents an object in terms of numeric or categorical attributes. The main learning task is to learn a mapping from this feature vector to an output prediction of some form. In Statistical Relational Learning (SRL), the representation of an object can contain its relationships to other objects. Thus the data is in the form of a graph, consisting of nodes (entities) and labelled edges (relationships between entities). The main goals of SRL include prediction of missing edges, prediction of properties of nodes, and clustering nodes based on their connectivity patterns. The task is to review a variety of techniques from the SRL community and explain how they can be applied to large-scale knowledge graphs (KGs), i.e., graph structured knowledge bases (KBs) that store factual information in form of relationships between entities.
|[Bo Zhao (bo.zhao@gwdg.de)]
|Bo Zhao (bo.zhao@gwdg.de)
|[http://ieeexplore.ieee.org/document/7358050/]
|[http://ieeexplore.ieee.org/document/7358050/]
|-
| '''Deep Learning''' 
Deep learning allows computational models that are composed of multiple processing layers to learn representations of data with multiple levels of abstraction. These methods have dramatically improved the state-of-the-art in speech recognition, visual object recognition, object detection and many other domains such as drug discovery and genomics. Deep learning discovers intricate structure in large data sets by using the backpropagation algorithm to indicate how a machine should change its internal parameters that are used to compute the representation in each layer from the representation in the previous layer. Deep convolutional nets have brought about breakthroughs in processing images, video, speech and audio, whereas recurrent nets have shone light on sequential data such as text and speech. The main task is to summarize some representative application scenarios of deep learning in big data analysis.
|Bo Zhao (bo.zhao@gwdg.de)
|[http://www.nature.com/nature/journal/v521/n7553/abs/nature14539.html?foxtrotcallback=true][http://dl.acm.org/citation.cfm?id=3092831]
|-
| '''Parallel Processing Systems for Big Data''' 
The volume, variety, and velocity properties of big data and the valuable information it contains have motivated the investigation of many new parallel data processing systems in addition to the approaches using traditional database management systems (DBMSs). The task is to explore new research opportunities and assist users in selecting suitable processing systems for specific applications, considering the existing parallel data processing systems categorized by the data input as batch processing, stream processing, graph processing, and machine learning processing and introduce representative projects in each category.
|Bo Zhao (bo.zhao@gwdg.de)
|[http://ieeexplore.ieee.org/abstract/document/7547948/]
|-
|-
|}
|}
87

edits