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

336598130 · Jun 202019922001200920172026
48 results for app store ranking

Generalized linear models with nonlinear feature transformations are widely used for large-scale regression and classification problems with sparse inputs. Memorization of feature interactions through a wide set of cross-product feature transformations are effective and interpretable, while generalization requires more…

2016-06-24abs ↗pdf ↗

App classification is useful in a number of applications such as adding apps to an app store or building a user model based on the installed apps. Presently there are a number of existing methods to classify apps based on a given taxonomy on the basis of their text metadata. However, text based methods for app classifi…

2019-12-16abs ↗pdf ↗

This study analyzes app reviews to understand students' behavior in the app market.

problem Extracting sentiment from growing app reviews manually is impractical.
method Used machine learning algorithms with TF-IDF for text representation and ensemble learning for evaluation.
result SVM achieved the highest accuracy (93.37%) on tri-gram + TF-IDF scheme.

As mobile devices become more and more popular, mobile gaming has emerged as a promising market with billion-dollar revenues. A variety of mobile game platforms and services have been developed around the world. A critical challenge for these platforms and services is to understand the churn behavior in mobile games, w…

2019-01-14abs ↗pdf ↗

AOBTM adapts online topic modeling for short app reviews, revealing coherent topics over time.

problem Challenges in inferring latent topics from short, dynamic app reviews over multiple versions.
method Adaptive Online Biterm Topic Model (AOBTM) that addresses sparsity and considers statistical data from previous versions.
result AOBTM finds more coherent topics and outperforms state-of-the-art baselines.

Graph machine learning and Super-App data improve credit risk prediction for financial inclusion.

problem Improving credit risk prediction for financial inclusion.
method Two graph-based experiments using centrality, behavior, and transactionality features.
result Graph features enhance credit risk models, leading to more inclusive financial systems.

An app-based mHealth intervention uses reinforcement learning to send effective reminder notifications.

problem Designing an effective reinforcement learning algorithm for app-based mHealth interventions.
method Developed a reinforcement learning algorithm to send reminder notifications based on participant likelihood of app engagement.
result The algorithm improved app-based mHealth interventions by reducing participant burden and promoting behavior change.

Alternative app data improves credit scoring for underserved borrowers.

problem Improving credit scoring for low-wealth and young individuals.
method Use of alternative data from app-based marketplaces, validated with TreeSHAP method.
result Alternative data sources predict financial behavior better than traditional bureau data.

FATE predicts user engagement on social apps with explainable explanations.

problem Accurate user engagement prediction for social apps with explainability.
method FATE, a flexible neural framework incorporating friendships, actions, and temporal dynamics.
result FATE outperforms state-of-the-art approaches by 10% error and 20% runtime reduction.

The paper tackles carousel personalization in music streaming apps using contextual bandits.

problem Selecting relevant items to display in carousels for personalized content recommendation.
method Modeling carousel personalization as a contextual multi-armed bandit problem with multiple plays, cascade-based updates and delayed batch feedback.
result Empirically shows the effectiveness of the framework in capturing characteristics of real-world carousels.

It is widely acknowledged that addiction relapse is highly associated with spatial-temporal factors such as some specific places or time periods. Current studies suggest that those factors can be utilized for better relapse interventions, however, there is no relapse prevention application that makes use of those facto…

2019-12-02abs ↗pdf ↗

We propose a modelling framework for the optimal selection of crypto assets. Crypto assets differ by two essential features: security (technological) and stability (governance). Investors make choices over crypto assets similarly to how they make choices by using a recommender app: the app presents each investor with a…

2019-06-23abs ↗pdf ↗

Many machine intelligence techniques are developed in E-commerce and one of the most essential components is the representation of IDs, including user ID, item ID, product ID, store ID, brand ID, category ID etc. The classical encoding based methods (like one-hot encoding) are inefficient in that it suffers sparsity pr…

2017-12-22abs ↗pdf ↗

Factorization machines (FM) are a popular model class to learn pairwise interactions by a low-rank approximation. Different from existing FM-based approaches which use a fixed rank for all features, this paper proposes a Rank-Aware FM (RaFM) model which adopts pairwise interactions from embeddings with different ranks.…

2019-05-18abs ↗pdf ↗

Motivated by applications in neuroimaging analysis, we propose a new regression model, Sparse TensOr REsponse regression (STORE), with a tensor response and a vector predictor. STORE embeds two key sparse structures: element-wise sparsity and low-rankness. It can handle both a non-symmetric and a symmetric tensor respo…

2016-09-15abs ↗pdf ↗

Smart phone apps that enable users to easily track their diets have become widespread in the last decade. This has created an opportunity to discover new insights into obesity and weight loss by analyzing the eating habits of the users of such apps. In this paper, we present diet2vec: an approach to modeling latent str…

2016-12-01abs ↗pdf ↗

Smartphone app diagnoses pulmonary diseases from chest X-rays.

problem Scarcity of training data and class imbalance issues.
method Data Augmentation Generative Adversarial Network (DAGAN) and Convolutional Siamese Network with attention mechanism.
result Achieved 99.30% and 98.40% testing accuracy on Binary/Multiclass scenarios.

Flora uses random projections to achieve high-rank updates with low memory usage.

problem Excessive memory usage in large neural networks during training.
method Flora approximates LoRA using random projections to enable high-rank updates with sublinear space complexity.
result Flora achieves high-rank updates with significantly reduced memory usage compared to LoRA.

Study how predictions affect the data they're based on, improving generalization guarantees.

problem How well do models generalize when predictions influence the data they're trained on?
method Embed performative predictions into statistical learning theory and prove generalization bounds.
result There's a fundamental trade-off between affecting data and learning from it.

FRAPPE estimates tensor canonical rank without CPD computation.

problem Estimating the canonical rank of tensors efficiently.
method Generates synthetic data matching input tensor's size and sparsity, trains a regression model to estimate rank.
result 24 times faster than best baseline, 10% improvement in MAPE on synthetic dataset.

Flow-SSN improves segmentation efficiency and accuracy.

problem Challenges in medical imaging segmentation, especially high-rank pixel-wise covariances.
method Generative segmentation model using discrete-time autoregressive and continuous-time flow variants.
result Flow-SSNs can estimate high-rank pixel-wise covariances efficiently without assuming rank or storing parameters.

Low rank tensor learning, such as tensor completion and multilinear multitask learning, has received much attention in recent years. In this paper, we propose higher order matching pursuit for low rank tensor learning problems with a convex or a nonconvex cost function, which is a generalization of the matching pursuit…

2015-03-07abs ↗pdf ↗

Paper proposes a scoring function for detecting anomalies in large datasets.

problem Detecting outliers in large, feature-rich datasets.
method Binary classification problem with a two-sample linear rank statistic.
result Empirical results show the effectiveness of the proposed scoring function.