אירועים והרצאות בפקולטה למדעי המחשב ע"ש הנרי ומרילין טאוב

In this thesis, we study temporal graphs and how to best represent their nodes and edges for multiple classification tasks. We first study the basics of how to represent nodes and edges in (un)weighted and (un)directed temporal graphs. We then present methods to leverage different aspects of temporal graphs, such as a temporal message passing and multiple attributes over edges. Finally, we study how bias manifests itself in temporal graphs and propose methods to balance accuracy and fairness in such graphs. We evaluate the effectiveness of our methods over a variety of temporal graphs for the two fundamental tasks of temporal link prediction and node classification, comparing to competitive baselines and algorithmic alternatives.