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,657 papers · 148 categories

Trend · papers per month

1345 · Oct 201119922001200920172026
25 results for subview agglomeration

The aim of this paper is to analyze the processes of polarization and agglomeration, to explain the mechanisms and causes of these phenomena in order to identify similarities and differences. As the main implication of this study should be noted that both process pretend to explain the concentration of economic activit…

2011-10-25abs ↗pdf ↗

The aim of this paper is to analyze the relationship between inter-industry, intra-industry and inter-regional clustering and demand for labor by companies in Portugal. Is expected at the outset that there is more demand for work where the agglomeration is greater. It should be noted, as a summary conclusion, the resul…

2011-10-25abs ↗pdf ↗

This work aims to study the Portuguese regional agglomeration process, using the linear form the New Economic Geography models that emphasize the importance of spatial factors (distance, costs of transport and communication) in explaining of the concentration of economic activity in certain locations. In a theoretical …

2011-10-25abs ↗pdf ↗

Newly available data on the spatial distribution of retail activities in cities makes it possible to build models formalized at the level of the single retailer. Current models tackle consumer location choices at an aggregate level and the opportunity new data offers for modeling at the retail unit level lacks a theore…

2016-12-16abs ↗pdf ↗

Extreme classification seeks to assign each data point, the most relevant labels from a universe of a million or more labels. This task is faced with the dual challenge of high precision and scalability, with millisecond level prediction times being a benchmark. We propose DEFRAG, an adaptive feature agglomeration tech…

2019-05-28abs ↗pdf ↗

The paper explores various forms of calibration scores and their implications for fairness.

problem The evaluation of probabilistic predictions through calibration.
method The authors organize three grouping choices and one agglomeration of group errors, providing a framework for comparing and creating new calibration scores.
result The study demonstrates that appropriate choices of grouping can provide notions of (sub-)group or individual fairness.

Efficiently clusters data with weak assumptions, robust to contamination.

problem General-shaped clustering under weak parametric assumptions with data contamination.
method Two-step hybrid robust clustering algorithm combining trimmed k-means and hierarchical agglomeration.
result Outperforms state-of-the-art methods in various applications.

New bounds improve linkage methods for clustering, distinguishing complete-link from single-link.

problem Improving bounds on linkage methods for clustering quality.
method Developed new bounds for complete-link and average-link methods in agglomeration clustering.
result Separated complete-link from single-link in terms of approximation for diameter.

Using open source data, we observe the fascinating dynamics of nighttime light. Following a global economic regime shift, the planetary center of light can be seen moving eastwards at a pace of about 60 km per year. Introducing spatial light Gini coefficients, we find a universal pattern of human settlements across dif…

2013-03-12abs ↗pdf ↗

Infinite mixture models are commonly used for clustering. One can sample from the posterior of mixture assignments by Monte Carlo methods or find its maximum a posteriori solution by optimization. However, in some problems the posterior is diffuse and it is hard to interpret the sampled partitionings. In this paper, we…

2013-10-01abs ↗pdf ↗

Study a simplified model of multiverse structure with synchronized timelines.

problem Understanding the complex structure of the local multiverse with multiple universes.
method Time-amalgamated globally hyperbolic model of multiverse as a collection of parallel universes.
result Elementary particles are transcosmic strings with multiple endpoints on parallel universes.

Sum-of-norms clustering is a method for assigning nn points in Rd\mathbb{R}^d to KK clusters, 1Kn1\le K\le n, using convex optimization. Recently, Panahi et al.\ proved that sum-of-norms clustering is guaranteed to recover a mixture of Gaussians under the restriction that the number of samples is not too large. The pu…

2019-02-19abs ↗pdf ↗

Developing a scientific understanding of cities in a fast urbanizing world is essential for planning sustainable urban systems. Recently, it was shown that income and wealth creation follow increasing returns, scaling superlinearly with city size. We study scaling of per capita incomes for separate census defined incom…

2015-09-03abs ↗pdf ↗

With this study we want to test the validity of the well known "Verdoorn's Law" which considers the relationship between the growth of productivity and output in the case of the Portuguese economy at a regional and sectoral levels (NUTs II) for the period 1995-1999. The importance of some additional variables in the or…

2011-10-25abs ↗pdf ↗

It has always been a great challenge for clustering algorithms to automatically determine the cluster numbers according to the distribution of datasets. Several approaches have been proposed to address this issue, including the recent promising work which incorporate Bayesian Nonparametrics into the kk-means clusterin…

2013-06-13abs ↗pdf ↗

Inverse inference, or "brain reading", is a recent paradigm for analyzing functional magnetic resonance imaging (fMRI) data, based on pattern recognition and statistical learning. By predicting some cognitive variables related to brain activation maps, this approach aims at decoding brain activity. Inverse inference ta…

2011-05-02abs ↗pdf ↗

Recent developments in unsupervised representation learning have successfully established the concept of transfer learning in NLP. Mainly three forces are driving the improvements in this area of research: More elaborated architectures are making better use of contextual information. Instead of simply plugging in stati…

2020-01-03abs ↗pdf ↗

CAF-HFCM automatically forms a cluster hierarchy and optimizes the number of clusters without trial-and-validation.

problem Challenges in determining the optimal number of clusters in fuzzy c-means.
method CAF-HFCM, an auto-fused hierarchical fuzzy c-means method.
result Automatic agglomeration and optimal number of clusters without validity indices.

This study predicts stock prices using various machine and deep learning models.

problem Predicting stock price movements is challenging but possible.
method Agglomerative approach combining statistical, machine learning, and deep learning models.
result Deep learning models outperform traditional methods in stock price prediction.