scholarly journals Modified Lomax model: a heavy-tailed distribution for fitting large-scale real-world complex networks

2021 ◽  
Vol 11 (1) ◽  
Author(s):  
Swarup Chattopadhyay ◽  
Tanujit Chakraborty ◽  
Kuntal Ghosh ◽  
Asit K. Das
Keyword(s):  
Complex Networks ◽  
Real World ◽  
Large Scale ◽  
Heavy Tailed Distribution ◽  
Heavy Tailed

scholarly journals RPM-Oriented Query Rewriting Framework for E-commerce Keyword-Based Sponsored Search (Student Abstract)

2020 ◽  
Vol 34 (10) ◽  
pp. 13769-13770
Author(s):  
Xiuying Chen ◽  
Daorui Xiao ◽  
Shen Gao ◽  
Guojun Liu ◽  
Wei Lin ◽  
...  
Keyword(s):  
Statistical Models ◽  
Large Scale ◽  
Query Rewriting ◽  
Sponsored Search ◽  
Search System ◽  
Oriented Sample ◽  
Search Models ◽  
Proposed Model ◽  
Heavy Tailed Distribution ◽  
Heavy Tailed

Sponsored search optimizes revenue and relevance, which is estimated by Revenue Per Mille (RPM). Existing sponsored search models are all based on traditional statistical models, which have poor RPM performance when queries follow a heavy-tailed distribution. Here, we propose an RPMoriented Query Rewriting Framework (RQRF) which outputs related bid keywords that can yield high RPM. RQRF embeds both queries and bid keywords to vectors in the same implicit space, converting the rewriting probability between each query and keyword to the distance between the two vectors. For label construction, we propose an RPM-oriented sample construction method, labeling keywords based on whether or not they can lead to high RPM. Extensive experiments are conducted to evaluate performance of RQRF. In a one month large-scale real-world traffic of e-commerce sponsored search system, the proposed model significantly outperforms traditional baseline.

scholarly journals A simple differential geometry for complex networks

2020 ◽  
pp. 1-28
Author(s):  
Emil Saucan ◽  
Areejit Samal ◽  
Jürgen Jost
Keyword(s):  
Differential Geometry ◽  
Complex Networks ◽  
Ricci Curvature ◽  
Real World ◽  
Large Scale ◽  
Metric Spaces ◽  
Geodesic Curvature ◽  
Higher Dimensional ◽  
Large Scale Networks ◽  
Bonnet Theorem

Abstract We introduce new definitions of sectional, Ricci, and scalar curvatures for networks and their higher dimensional counterparts, derived from two classical notions of curvature for curves in general metric spaces, namely, the Menger curvature and the Haantjes curvature. These curvatures are applicable to unweighted or weighted and undirected or directed networks and are more intuitive and easier to compute than other network curvatures. In particular, the proposed curvatures based on the interpretation of Haantjes definition as geodesic curvature allow us to give a network analogue of the classical local Gauss–Bonnet theorem. Furthermore, we propose even simpler and more intuitive proxies for the Haantjes curvature that allow for even faster and easier computations in large-scale networks. In addition, we also investigate the embedding properties of the proposed Ricci curvatures. Lastly, we also investigate the behavior, both on model and real-world networks, of the curvatures introduced herein with more established notions of Ricci curvature and other widely used network measures.

Uncovering the fuzzy community structure accurately based on steepest descent projection

2017 ◽  
Vol 31 (27) ◽  
pp. 1750249 ◽  
Author(s):  
Changjian Fang ◽  
Dejun Mu ◽  
Zhenghong Deng ◽  
Jiaqi Yan
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Complex Network ◽  
Real World ◽  
Large Scale ◽  
Steepest Descent ◽  
Topological Information ◽  
Generalized Framework ◽  
Open Question ◽  
Fuzzy C Means Algorithm

Uncovering the community structure in complex network is a hot research point in recent years. How to identify the community structure accurately in complex network is still an open question under research. There are lots of methods based on topological information, which have some good performances at the expense of longer runtimes. In this paper, we propose a new fuzzy algorithm which follows the line of fuzzy c-means algorithm. A steepest descent framework with projection by optimizing the quality function is presented under the generalized framework. The results of experiments on both real-world networks and synthetic networks show that the proposed method achieves the highest efficiency and is easy for detecting fuzzy community structure in large-scale complex networks.

scholarly journals An information-theoretic framework for resolving community structure in complex networks

2007 ◽  
Vol 104 (18) ◽  
pp. 7327-7331 ◽  
Author(s):  
Martin Rosvall ◽  
Carl T. Bergstrom
Keyword(s):  
Community Structure ◽  
Complex Networks ◽  
Real World ◽  
Large Scale ◽  
Information Theoretic ◽  
Model Networks

To understand the structure of a large-scale biological, social, or technological network, it can be helpful to decompose the network into smaller subunits or modules. In this article, we develop an information-theoretic foundation for the concept of modularity in networks. We identify the modules of which the network is composed by finding an optimal compression of its topology, capitalizing on regularities in its structure. We explain the advantages of this approach and illustrate them by partitioning a number of real-world and model networks.

scholarly journals A Cluster Truncated Pareto Distribution and Its Applications

2013 ◽  
Vol 2013 ◽  
pp. 1-10 ◽  
Author(s):  
Mei Ling Huang ◽  
Vincenzo Coia ◽  
Percy Brill
Keyword(s):  
Real World ◽  
Goodness Of Fit ◽  
Pareto Distribution ◽  
Estimation Method ◽  
Estimation Methods ◽  
Real World Data ◽  
Goodness Of Fit Tests ◽  
Heavy Tailed Distribution ◽  
Heavy Tailed ◽  
Truncated Pareto

The Pareto distribution is a heavy-tailed distribution with many applications in the real world. The tail of the distribution is important, but the threshold of the distribution is difficult to determine in some situations. In this paper we consider two real-world examples with heavy-tailed observations, which leads us to propose a mixture truncated Pareto distribution (MTPD) and study its properties. We construct a cluster truncated Pareto distribution (CTPD) by using a two-point slope technique to estimate the MTPD from a random sample. We apply the MTPD and CTPD to the two examples and compare the proposed method with existing estimation methods. The results of log-log plots and goodness-of-fit tests show that the MTPD and the cluster estimation method produce very good fitting distributions with real-world data.

scholarly journals Deep learning based network similarity for model selection

Data Science ◽  
2021 ◽  
pp. 1-21
Author(s):  
Kushal Veer Singh ◽  
Ajay Kumar Verma ◽  
Lovekesh Vig
Keyword(s):  
Deep Learning ◽  
Model Selection ◽  
Complex Networks ◽  
Real World ◽  
Network Architecture ◽  
Large Scale ◽  
Generative Models ◽  
Generative Model ◽  
Data Set ◽  
Feed Forward Network

Capturing data in the form of networks is becoming an increasingly popular approach for modeling, analyzing and visualising complex phenomena, to understand the important properties of the underlying complex processes. Access to many large-scale network datasets is restricted due to the privacy and security concerns. Also for several applications (such as functional connectivity networks), generating large scale real data is expensive. For these reasons, there is a growing need for advanced mathematical and statistical models (also called generative models) that can account for the structure of these large-scale networks, without having to materialize them in the real world. The objective is to provide a comprehensible description of the network properties and to be able to infer previously unobserved properties. Various models have been developed by researchers, which generate synthetic networks that adhere to the structural properties of real networks. However, the selection of the appropriate generative model for a given real-world network remains an important challenge. In this paper, we investigate this problem and provide a novel technique (named as TripletFit) for model selection (or network classification) and estimation of structural similarities of the complex networks. The goal of network model selection is to select a generative model that is able to generate a structurally similar synthetic network for a given real-world (target) network. We consider six outstanding generative models as the candidate models. The existing model selection methods mostly suffer from sensitivity to network perturbations, dependency on the size of the networks, and low accuracy. To overcome these limitations, we considered a broad array of network features, with the aim of representing different structural aspects of the network and employed deep learning techniques such as deep triplet network architecture and simple feed-forward network for model selection and estimation of structural similarities of the complex networks. Our proposed method, outperforms existing methods with respect to accuracy, noise-tolerance, and size independence on a number of gold standard data set used in previous studies.

1588-P: Therapy Trends in Initial 6 Months of the First Large-Scale Longitudinal Nationwide Study on Management and Real-World Outcomes of Diabetes in India (LANDMARC)

Diabetes ◽  
2020 ◽  
Vol 69 (Supplement 1) ◽  
pp. 1588-P ◽  
Author(s):  
ROMIK GHOSH ◽  
ASHOK K. DAS ◽  
AMBRISH MITHAL ◽  
SHASHANK JOSHI ◽  
K.M. PRASANNA KUMAR ◽  
...  
Keyword(s):  
Real World ◽  
Large Scale ◽  
Nationwide Study

2258-PUB: Impact of Cardiovascular (CV) Risk Factors during the Initial 6 Months of the First Large-Scale Longitudinal Nationwide Study on Management and Real-World Outcomes of Diabetes in India (LANDMARC)

Diabetes ◽  
2020 ◽  
Vol 69 (Supplement 1) ◽  
pp. 2258-PUB
Author(s):  
ROMIK GHOSH ◽  
ASHOK K. DAS ◽  
SHASHANK JOSHI ◽  
AMBRISH MITHAL ◽  
K.M. PRASANNA KUMAR ◽  
...  
Keyword(s):  
Risk Factors ◽  
Real World ◽  
Large Scale ◽  
Nationwide Study

scholarly journals Network robustness improvement via long-range links

2019 ◽  
Vol 6 (1) ◽  
Author(s):  
Vincenza Carchiolo ◽  
Marco Grassia ◽  
Alessandro Longheu ◽  
Michele Malgeri ◽  
Giuseppe Mangioni
Keyword(s):  
Complex Networks ◽  
Long Range ◽  
Real World ◽  
Network Robustness ◽  
Scale Free ◽  
Area Of Interest ◽  
Before And After ◽  
Significant Area ◽  
Better Than

AbstractMany systems are today modelled as complex networks, since this representation has been proven being an effective approach for understanding and controlling many real-world phenomena. A significant area of interest and research is that of networks robustness, which aims to explore to what extent a network keeps working when failures occur in its structure and how disruptions can be avoided. In this paper, we introduce the idea of exploiting long-range links to improve the robustness of Scale-Free (SF) networks. Several experiments are carried out by attacking the networks before and after the addition of links between the farthest nodes, and the results show that this approach effectively improves the SF network correct functionalities better than other commonly used strategies.

scholarly journals The graph neural networking challenge

2021 ◽  
Vol 51 (3) ◽  
pp. 9-16
Author(s):  
José Suárez-Varela ◽  
Miquel Ferriol-Galmés ◽  
Albert López ◽  
Paul Almasan ◽  
Guillermo Bernárdez ◽  
...  
Keyword(s):  
Machine Learning ◽  
Computer Networks ◽  
Real World ◽  
Large Scale ◽  
Lessons Learned ◽  
Educational Resources ◽  
Global Competition ◽  
International Telecommunication Union ◽  
International Telecommunication ◽  
Broad Audience

During the last decade, Machine Learning (ML) has increasingly become a hot topic in the field of Computer Networks and is expected to be gradually adopted for a plethora of control, monitoring and management tasks in real-world deployments. This poses the need to count on new generations of students, researchers and practitioners with a solid background in ML applied to networks. During 2020, the International Telecommunication Union (ITU) has organized the "ITU AI/ML in 5G challenge", an open global competition that has introduced to a broad audience some of the current main challenges in ML for networks. This large-scale initiative has gathered 23 different challenges proposed by network operators, equipment manufacturers and academia, and has attracted a total of 1300+ participants from 60+ countries. This paper narrates our experience organizing one of the proposed challenges: the "Graph Neural Networking Challenge 2020". We describe the problem presented to participants, the tools and resources provided, some organization aspects and participation statistics, an outline of the top-3 awarded solutions, and a summary with some lessons learned during all this journey. As a result, this challenge leaves a curated set of educational resources openly available to anyone interested in the topic.

Sign in / Sign up

Export Citation Format

Share Document