Публикации
We present a study on co-authorship network representation based on network embedding together with additional information on topic modeling of research papers and new edge embedding operator. We use the link prediction (LP) model for constructing a recommender system for searching collaborators with similar research interests. Extracting topics for each paper, we construct keywords co-occurrence network and use its embedding for further generalizing author attributes. Standard graph feature engineering and network embedding methods were combined for constructing co-author recommender system formulated as LP problem and prediction of future graph structure. We evaluate our survey on the dataset containing temporal information on National Research University Higher School of Economics over 25 years of research articles indexed in Russian Science Citation Index and Scopus. Our model of network representation shows better performance for stated binary classification tasks on several co-authorship networks.
In this paper we show that for a given co-authorship network we could construct a recommender system for searching collaborators with similar research interests defined via keywords and topic modelling. We suggest new link embedding method and evaluate our model on National Research University Higher School of Economics (NRU HSE) co-authorship network.
Co-authorship networks contain invisible patterns of collaboration among researchers. The process of writing joint paper can depend of different factors, such as friendship, common interests, and policy of university. We show that, having a temporal co-authorship network, it is possible to predict future publications. We solve the problem of recommending collaborators from the point of link prediction using graph embedding, obtained from co-authorship network. We run experiments on data from HSE publications graph and compare it with relevant models.
One of the major problem of recommendation services is commercial astroturfing. This work is devoted to constructing a model capable of detecting astroturfing based on network analysis. The main idea of the model is projecting a multipartite network to a unipartite and detecting communities in it representing actors with falsified opinions.
We consider the problem of depth reconstruction from downsampled sparse depth values. We compare our approach with semi-dense depth map interpolation and direct RGB-to-Depth reconstruction solutions on several datasets, including Matterport 3D dataset containing RGB and depth images of 90 building-scale scenes. We demonstrate that the proposed model can produce approximate depth map for over two hundreds images per second.
Definitions: State is a type of polity that is characterized by two main dimensions: “statehood” and “stateness.” Statehood is the recognition of the state by other states as independent nation, equal to others to participate on international arena; receiving and having the “statehood” for country mean that it is a part of the “concert of nations,” such as the member of the United Nations organization. Stateness is a state capacity to sustain its territory, nation, and citizens’ welfare; it is not enough being recognized by other states as such, but also important to support this status in time
In this paper, we study style transfer applications for the photo-realistic image processing tasks. First, we present the results on image quality improvement based with photo style transfer. Second, we describe the problems of learning style transfer under geometrical constraints for processing portrait images and multi-style transfer. Finally, we give a short glimpse on application of image-to-image translation methods for updating realistic graphics for video games.
Online social networks play major role in the spread of information on a very large scale. One of the major problems is to predict information propagation using social network interactions. The main purpose of this paper is to construct heuristic model of weighted graph based on empirical data that can outperform the existing models. We suggest a new approach of constructing the model of information based on matching specific weights to a given network.
In this paper, we consider new formulation of graph embedding algorithm, while learning node and edge representation under common constraints. We evaluate our approach on link prediction problem for co-authorship network of HSE researchers’ publications. We compare it with existing structural network embeddings and feature-engineering models.
In this paper, we propose to utilize the methods of network analysis to analyze the relationship between various elements that constitute any particular research in social sciences. Four levels that determine a design of the research can be established: ontological and epistemological assumptions that determine what is the reality under the study and how can we obtain the knowledge about it; a general methodological frame that defines the object of the study and a spectrum of research questions we are allowed to pose; and, finally, a list of methods that we might use in order to get answers. All these levels are interrelated, sometimes in very confusing way. We propose to extract a preliminary set of relations between various elements from textbooks on methodology of social and political sciences and to visualize and analyze their relations using network analytic methods.
