The code clone detection issue has been researched using a number of explicit factors based on the tokens and contents and found effective results. However, exposing code contents may be an impractical option because of privacy and security factors. Moreover, the lack of scalability of past methods is an important challenge. The code flow states can be inferred by code structure and implicitly represented using empirical graphs. The assumption is that modelling of the code clone detection problem can be achieved without the content of the codes being revealed. Here, a Graph-of-Code concept for the code clone detection problem is introduced, which represents codes into graphs. While Graph-of-Code provides structural properties and quantification of its characteristics, it can exclude code contents or tokens to identify the clone type. The aim is to evaluate the impact of graph-of-code structural properties on the performance of code clone detection. This work employs a feature extraction-based approach for unlabelled graphs. The approach generates a ‘Graph Fingerprint’ which represents different topological feature levels. The results of code clone detection indicate that code structure has a significant role in detecting clone types. We found different GoC-models outperform others. The models achieve between 96% to 99% in detecting code clones based on recall, precision, and F1-Score. The GoC approach is capable in detecting code clones with scalable dataset and with preserving codes privacy.

In this work, the team formation process in an online game was formulated as a sign prediction problem of social networks. Depending on the participation in either collaborative or competitive teams and squads and four different interaction types among gamers, the objective was to predict the signs (positive/negative) of their interactions in colluding or competing teams. Temporal features pertaining to the factors affecting team formation were used in a supervised classification setup. High performance by a classifier denotes that historical information related to gamers' prior interactions are effective in predicting the sign of their interactions.

Online games provide a rich recording of interactions that can contribute to understanding human behavior. One potential contribution is understanding what motivates people to choose their teammates. We examine several hypotheses about team formation using a large, longitudinal dataset from a team-based online gaming environment. Specifically, we test how positive familiarity, homophily, and competence determine team formation in Battlefield 4, a popular team-based game in which players choose one of two competing teams to play on. Our dataset covers over two months of in-game interactions between over 380,000 players. We show that familiarity is an important factor in team formation, while homophily is not. Competence affects team formation in more nuanced ways: players with similarly high competence team up repeatedly, but large variation in competence discourages repeated interactions.