Research
On-device research index

arXiv research

A locally-built, LLM-digested index of recent arXiv papers in quant finance, geometry/topology, and statistical ML — keyword search served straight from SQLite on this machine.

168,695 papers · 148 categories

Trend · papers per month

236473709945 · Jun 202019922001200920172026
48 results for telecommunication networks

A deep learning model for traffic forecasting in telecommunication networks.

problem Complex spatial-temporal dependency in traffic forecasting.
method Spatio-Temporal Hybrid Graph Convolutional Network (STHGCN) combining GRUs and hybrid-GCN.
result The proposed model outperforms classical and state-of-the-art methods.

Paper proposes a forecasting solution for network-rollout planning.

problem Accurate estimation of milestone completion times for network-rollout planning.
method Partition-based regression models incorporating data-driven statistical models.
result The proposed approach outperforms alternative models in terms of performance and model complexity.

In this paper we use a time-evolving graph which consists of a sequence of graph snapshots over time to model many real-world networks. We study the path classification problem in a time-evolving graph, which has many applications in real-world scenarios, for example, predicting path failure in a telecommunication netw…

2019-05-10abs ↗pdf ↗

Indirect competition emerged from the complex organization of human societies, and knowledge of the existing network topology may aid in developing effective strategies for success. Here, we propose an agent-based model of competition with systems co-existing in a `small-world' social network. We show that within the r…

2008-07-19abs ↗pdf ↗

Surveying machine learning for solving graph optimization problems.

problem Solving combinatorial optimization problems on graphs requires algorithmic engineering.
method Surveying machine learning approaches for graph optimization.
result Machine learning offers new ways to solve graph optimization problems.

Networks are a fundamental model of complex systems throughout the sciences, and network datasets are typically analyzed through lower-order connectivity patterns described at the level of individual nodes and edges. However, higher-order connectivity patterns captured by small subgraphs, also called network motifs, de…

2018-02-19abs ↗pdf ↗

Orchestrating the Twin Transition in GBS: A Socio-Technical Framework

problem MNCs' need to harmonize digital efficiency with environmental stewardship
method Technology Roadmapping (TRM) with ICT-centric innovation ecosystem toolkit
result Central 'operational airlock' for GBS in harmonizing digital and environmental transformation

A fast method for estimating radar amplitude density parameters.

problem Accurate estimation of amplitude density function parameters in radar applications.
method Projecting amplitude data onto horizontal and vertical axes, then using MLE for α\alpha-stale distribution parameters.
result The average of computed MLEs based on two projections is a fast and accurate estimator for amplitude distribution parameters.

Improved online changepoint detection for autocorrelated data.

problem Changepoint detection in autocorrelated data with false positives or delays.
method Generalized Likelihood Ratio (GLR) statistic for AR(p) processes, online focus algorithm.
result AR(p)-focus algorithm achieves high detection power in correlated data.

A new method for spotting symbols in CAD images reduces annotation costs and improves accuracy.

problem Challenging task of labeling symbols from CAD drawings.
method Pixel-wise point location via Progressive Gaussian Kernels (PGK) and local offset.
result The proposed method achieves good generalization on real-world CAD images.

With the widespread use of information technologies, information networks are becoming increasingly popular to capture complex relationships across various disciplines, such as social networks, citation networks, telecommunication networks, and biological networks. Analyzing these networks sheds light on different aspe…

2017-12-04abs ↗pdf ↗

fSDE-Net generates time series with long-term memory using neural networks.

problem Generating time series with long-term memory from irregularly sampled data.
method fSDE-Net: neural fractional Stochastic Differential Equation Network using fractional Brownian motion.
result fSDE-Net can replicate distributional properties of real time-series data.

Independent component analysis (ICA) has been widely used for blind source separation in many fields such as brain imaging analysis, signal processing and telecommunication. Many statistical techniques based on M-estimates have been proposed for estimating the mixing matrix. Recently, several nonparametric methods have…

2007-05-29abs ↗pdf ↗

Bayesian model reduces TV watching data to 11 parameters for churn prediction.

problem Predicting customer churn in telecommunications with high-dimensional data.
method Bayesian hierarchical joint model for time-to-event and count data.
result Model reduces data from thousands to 11 customer-level parameter estimates.

For the last few years, the amount of data has significantly increased in the companies. It is the reason why data analysis methods have to evolve to meet new demands. In this article, we introduce a practical analysis of a large database from a telecommunication operator. The problem is to segment a territory and char…

2015-10-30abs ↗pdf ↗

New method for faster graph parameter inference from large random Kronecker graphs.

problem Efficiently infer graph parameters from large random Kronecker graphs.
method Decompose adjacency matrix into signal and noise components, then use denoising and solving approach.
result Proposed method achieves comparable or better performance than existing methods at lower computational cost.

PolicySynth improves synthetic data alignment with real data for better campaign decisions.

problem Synthetic data used in decision support systems often leads to incorrect decisions.
method PolicySynth framework that conditions synthetic data on churn scorer to align with real data decisions.
result PolicySynth achieves high strategy simulation fidelity (0.923-0.960) on churn and acquisition datasets.

GANs improve anomaly detection in power plants, achieving nearly perfect classification.

problem Anomaly detection in power generation plants to identify irregularities.
method Used Generative Adversarial Networks (GANs) for anomaly detection in power generation plants.
result GANs achieved an accuracy rate of 98.99% in anomaly detection, significantly improved by data augmentation.

We calculated the cross correlations between the half-hourly times series of the ten Dow Jones US economic sectors over the period February 2000 to August 2008, the two-year intervals 2002--2003, 2004--2005, 2008--2009, and also over 11 segments within the present financial crisis, to construct minimal spanning trees (…

2010-09-29abs ↗pdf ↗

Telecommunication (Telco) outdoor position recovery aims to localize outdoor mobile devices by leveraging measurement report (MR) data. Unfortunately, Telco position recovery requires sufficient amount of MR samples across different areas and suffers from high data collection cost. For an area with scarce MR samples, i…

2019-12-10abs ↗pdf ↗

Many interesting problems in fields ranging from telecommunications to computational biology can be formalized in terms of large underdetermined systems of linear equations with additional constraints or regularizers. One of the most studied ones, the Compressed Sensing problem (CS), consists in finding the solution wi…

2019-04-10abs ↗pdf ↗

Customer retention campaigns increasingly rely on predictive models to detect potential churners in a vast customer base. From the perspective of machine learning, the task of predicting customer churn can be presented as a binary classification problem. Using data on historic behavior, classification algorithms are bu…

2017-12-21abs ↗pdf ↗

A flexible nonparametric online changepoint detection algorithm for high-frequency data.

problem Detecting changes in real-time in high-frequency data streams with limited computational resources.
method NP-FOCuS, a sequential likelihood ratio test for a change in the empirical cumulative density function, using functional pruning.
result NP-FOCuS outperforms current nonparametric online changepoint techniques in various settings.

A hybrid model combines BPH and HE distributions for better heavy-tailed distribution approximation.

problem Accurate modeling of heavy-tailed distributions in various applications.
method A hybrid model of Bernstein phase-type and hyperexponential distributions with optimized parameters.
result Significant improvement in capturing both body and tail of heavy-tailed distributions.

Framework for AI customer support that protects privacy and reduces costs.

problem Privacy risks and compliance challenges in AI customer support.
method Zero-shot learning with large language models, real-time data anonymization, retrieval-augmented generation, robust post-processing.
result Reduces privacy risks and compliance costs while maintaining accuracy.

The digital telecommunications receiver is an important context for inference methodology, the key objective being to minimize the expected loss function in recovering the transmitted information. For that criterion, the optimal decision is the Bayesian minimum-risk estimator. However, the computational load of the Bay…

2018-11-03abs ↗pdf ↗

RFN improves GCNs for road networks, outperforming state-of-the-art by 21%-40%.

problem Leveraging the structure of road networks effectively in machine learning tasks.
method Introducing RFN, a novel GCN specifically designed for road networks.
result RFN outperforms state-of-the-art GCNs by 21%-40% on road network tasks.

This survey clarifies dynamic network terminology and reviews GNN models for dynamic networks.

problem Ambiguity in dynamic network terminology and lack of GNN models for dynamic networks.
method Established consistent terminology and notation for dynamic networks, reviewed GNN models.
result Comprehensive survey of dynamic graph neural network models.

Chemical networks outperform spiking neural networks in classification tasks.

problem Learning tasks with spiking neural networks require hidden layers, which are computationally expensive.
method Used deterministic mass-action kinetics to prove chemical reaction networks without hidden layers can solve tasks previously solved by spiking neural networks.
result A chemical reaction network without hidden layers outperforms a spiking neural network with hidden layers in a handwritten digit classification task.