My name is Dehan Zhang. I’m currently doing research on runtime problems during graph pattern mining. My current research interest is graph learning. Besides graph learning, I’m also interested on machine learning, statistical learning, and optimization. Before joining the EDA group, I did research on gradual machine learning, which has no requirement for data to be independently and identically distributed and can be applied to many real-world scenarios. In the future, I want to discover more efficient machine learning algorithms and apply them to the real world.