Explore structural properties of undirected social network (Facebook dataset) using connectivity and degree distribution.
Explore structural properties of personalized network of core nodes using Fast-Greeedy, Edge-Betweenness, and Infomap community detection algorithms.
Explore characteristics of nodes in the personalized networks using Embeddedness and Dispersion.
Implement friend recommendation in personalized networks using neighborhood-based measures, including common neighbor measure, Jaccard measure, and Adamic-Adar measure, and evaluate with average accuracy measure.
Explore the community structure of directed social network (Google+ dataset), defined by homogeneity and completeness.
Construct a correlation graph using correlation coefficient computed among stock-return time series data.
Extract the Minimum Spanning Tree (MST) of the correlation graph and interpret it.
Predict the market sector of an unknown stock, and evaluate the performance using sector clustering in MST.
Simulate the influence of traffic block on the flow between certain places, and estimate how many roads could be blocked before paralyzing the traffic in Los Angeles area.
About
Implementation and application of graph theory, social network mining, reinforcement learning, and inverse reinforcement learning.