Searcharxiv⌕ Search

arXiv subjects

D. V. Lande

Publications and source records attributed to D. V. Lande.

At least 19 recordsLinked to original sources
arXiv2019

Design method of Temporary Horizontal Visibility Graph for information sources impact network

The absence of the efficient methods for the design of the information sources impact network does not allow defining the influence of the information sources on one another accurately and detecting the primary sources of the information spreading. The work represents a new approach - Temporary Horizontal Visibility Graph (THVG) method, which is based on the HVG algorithm modification. This method allows building the information sources impact networks and making the assumptions about the primary sources of information. Obtained method uses sources rating in data flow analysis. It is more effective than the usual Horizontal Visibility Graph design method in the following criteria: F-measure - by 7-9%, completeness - by 7-10% and accuracy - by 6-8% more effective.

cs.SI↗
arXiv2018

Decomposing an information stream into the principal components

We propose an approach to decomposing a thematic information stream into principal components. Each principal component is related to a narrow topic extracted from the information stream. The essence of the approach arises from analogy with the Fourier transform. We examine methods for analyzing the principal components and propose using multifractal analysis for identifying similar topics. The decomposition technique is applied to the information stream dedicated to Brexit. We provide a comparison between the principal components obtained by applying the decomposition to Brexit stream and the related topics extracted by Google Trends.

cs.SI↗
arXiv2018

The automatic detection of the information operations event basis

The methodology of automatic detection of the event basis of information operations, reflected in thematic information flows, is described. The presented methodology is based on the technologies for identifying information operations, the formation of the terminological basis of the subject area, the application of cluster analysis with cluster centroids, determined by analyzing the terminology of the information flow. The clusters formed in this way reflect the main events occurring during the information operations and reveal the technique for their implementation.

cs.CY↗
arXiv2017

Ranking of nodes of networks taking into account the power function of its weight of connections

To rank nodes in quasi-hierarchical networks of social nature, it is necessary to carry out a detailed analysis of the network and evaluate the results obtained according to all the given criteria and identify the most influential nodes. Existing ranking algorithms in the overwhelming majority estimate such networks in general, which does not allow to clearly determine the influence of nodes among themselves. In the course of the study, an analysis of the results of known algorithms for ranking the nodes of HITS, PageRank and compares the obtained data with the expert evaluation of the network. For the effective analysis of quasi-hierarchical networks, the basic algorithm of HITS is modified, which allows to evaluate and rank nodes according to the given criteria (the number of input and output links among themselves), which corresponds to the results of expert evaluation. It is shown that the received method in some cases provides results that correspond to the real social relation, and the indexes of the authorship of the nodes - pre-assigned social roles.

cs.SI↗
arXiv2017

Elements of nonlinear analysis of information streams

This review considers methods of nonlinear dynamics to apply for analysis of time series corresponding to information streams on the Internet. In the main, these methods are based on correlation, fractal, multifractal, wavelet, and Fourier analysis. The article is dedicated to a detailed description of these approaches and interconnections among them. The methods and corresponding algorithms presented can be used for detecting key points in the dynamic of information processes; identifying periodicity, anomaly, self-similarity, and correlations; forecasting various information processes. The methods discussed can form the basis for detecting information attacks, campaigns, operations, and wars.

cs.DS↗
arXiv2017

Wiki-index of authors popularity

The new index of the author's popularity estimation is represented in the paper. The index is calculated on the basis of Wikipedia encyclopedia analysis (Wikipedia Index - WI). Unlike the conventional existed citation indices, the suggested mark allows to evaluate not only the popularity of the author, as it can be done by means of calculating the general citation number or by the Hirsch index, which is often used to measure the author's research rate. The index gives an opportunity to estimate the author's popularity, his/her influence within the sought-after area "knowledge area" in the Internet - in the Wikipedia. The suggested index is supposed to be calculated in frames of the subject domain, and it, on the one hand, avoids the mistaken computation of the homonyms, and on the other hand - provides the entirety of the subject area. There are proposed algorithms and the technique of the Wikipedia Index calculation through the network encyclopedia sounding, the exemplified calculations of the index for the prominent researchers, and also the methods of the information networks formation - models of the subject domains by the automatic monitoring and networks information reference resources analysis. The considered in the paper notion network corresponds the terms-heads of the Wikipedia articles.

cs.DL↗
arXiv2016

Fractal Properties of Multiagent News Diffusion Model

The paper deals with fractal characteristics (Hurst exponent) and wavelet-scaleograms of the information distribution model, suggested by the authors. The authors have studied the effect of Hurst exponent change depending upon the model parameters, which have semantic meaning. The paper also considers fractal characteristics of real information streams. It is described, how the Hurst exponent dynamics depends on these information streams state in practice

cs.SI↗
arXiv2016

Corporate system of monitoring network informational resources based on agent-based approach

The paper provides a agent-based model, which describes distribution of informative messages, containing links to informational resources in the Internet. The results of modeling have been confirmed by studying a real network of Twitter microblogs. The paper describes stages of building a corporate system of monitoring network informational resources, the content of which is determined by links in microblogs. The advantages of such approach are set forth.

cs.SI↗
arXiv2016

K-method of cognitive mapping analysis

Introduced a new calculation method (K-method) for cognitive maps. K - method consists of two consecutive steps. In the first stage, allocated subgraph composed of all paths from one selected node (concept) to another node (concept) from the cognitive map (directed weighted graph) . In the second stage, after the transition to an undirected graph (symmetrization adjacency matrix) the influence of one node to another calculated with Kirchhoff method. In the proposed method, there is no problem inherent in the impulse method. In addition to "pair" influence of one node to another, the average characteristics are introduced, allowing to calculate the impact of the selected node to all other nodes and the influence of all on the one selected. For impulse method similar to the average characteristics in the case where the pulse method "works" are introduced and compared with the K-method.

cs.SI↗
arXiv2016

Agent-based model of information spread in social networks

We propose evolution rules of the multiagent network and determine statistical patterns in life cycle of agents - information messages. The main discussed statistical pattern is connected with the number of likes and reposts for a message. This distribution corresponds to Weibull distribution according to modeling results. We examine proposed model using the data from Twitter, an online social networking service.

cs.SI↗
arXiv2016

Formation of subject area and the co-authors network by sounding of Google Scholar Citations service

The suggested methodic is the way of formatting the subject areas models and co-authors networks by sounding the content networks. The paper represents the notion networks which match tags and authors of Google Scholar Citations service. Models depicted in the work were built for the physical optics area, and it can be applied for other domains. The proposed ways of defining connections between science areas and authors depicts the collaborations opportunities and versatility of interdisciplinary.

cs.DL↗
arXiv2016

"Conjectural" links in complex networks

This paper introduces the concept of Conjectural Link for Complex Networks, in particular, social networks. Conjectural Link we understand as an implicit link, not available in the network, but supposed to be present, based on the characteristics of its topology. It is possible, for example, when in the formal description of the network some connections are skipped due to errors, deliberately hidden or withdrawn (e.g. in the case of partial destruction of the network). Introduced a parameter that allows ranking the Conjectural Link. The more this parameter - the more likely that this connection should be present in the network. This paper presents a method of recovery of partially destroyed Complex Networks using Conjectural Links finding. Presented two methods of finding the node pairs that are not linked directly to one another, but have a great possibility of Conjectural Link communication among themselves: a method based on the determination of the resistance between two nodes, and method based on the computation of the lengths of routes between two nodes. Several examples of real networks are reviewed and performed a comparison to know network links prediction methods, not intended to find the missing links in already formed networks.

cs.SI↗
arXiv2013

Compactified Horizontal Visibility Graph for the Language Network

A compactified horizontal visibility graph for the language network is proposed. It was found that the networks constructed in such way are scale free, and have a property that among the nodes with largest degrees there are words that determine not only a text structure communication, but also its informational structure.

cs.CL↗
arXiv2012

The model of information retrieval based on the theory of hypercomplex numerical systems

The paper provided a description of a new model of information retrieval, which is an extension of vector-space model and is based on the principles of the theory of hypercomplex numerical systems. The model allows to some extent realize the idea of fuzzy search and allows you to apply in practice the model of information retrieval practical developments in the field of hypercomplex numerical systems.

cs.IR↗
arXiv2010

Detection Implicit Links and G-betweenness

A concept of implicit links for Complex Networks has been defined and a new value - cohesion factor, which allows to evaluate numerically the presence of such connection between any two nodes, has been introduced. We introduce a generalization of such characteristics as the betweenness, which allows to rank network nodes in more details. The effectiveness of the proposed concepts is shown by the numerical examples.

cond-mat.dis-nn↗
arXiv2010

Power law in website ratings

In the practical work of websites popularization, analysis of their efficiency and downloading it is of key importance to take into account web-ratings data. The main indicators of website traffic include the number of unique hosts from which the analyzed website was addressed and the number of granted web pages (hits) per unit time (for example, day, month or year). Of certain interest is the ratio between the number of hits (S) and hosts (H). In practice there is even used such a concept as "average number of viewed pages" (S/H), which on default supposes a linear dependence of S on H. What actually happens is that linear dependence is observed only as a partial case of power dependence, and not always. Another new power law has been discovered on the Internet, in particular, on the WWW.

cs.IR↗
arXiv2009

Diagram of measurement series elements deviation from local linear approximations

Method for detection and visualization of trends, periodicities, local peculiarities in measurement series (dL-method) based on DFA technology (Detrended fluctuation analysis) is proposed. The essence of the method lies in reflecting the values of absolute deviation of measurement accumulation series points from the respective values of linear approximation. It is shown that dL-method in some cases allows better determination of local peculiarities than wavelet-analysis. Easy-to-realize approach that is proposed can be used in the analysis of time series in such fields as economics and sociology.

stat.AP↗