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.

169,181 papers · 148 categories

Trend · papers per month

58115173230 · Jun 202019922001200920182026
48 results for customer selection

The study builds a customer selection model grouping and ranking customers based on multiple dimensions.

problem Traditional grouping methods based on assets are insufficient and ineffective.
method K-means unsupervised learning for grouping, weighted customer value calculation for ranking.
result Differentiates and ranks customers based on their values, not just assets.

COTA improves customer support speed and accuracy with machine learning.

problem Improving speed and reliability of customer support.
method Combining feature engineering and deep learning for automated ticket classification and answer selection.
result COTA v2 outperforms COTA v1 in reducing issue resolution time by 10%.

We study the dynamics of co-evolution of producers and customers described by bit-strings representing individual traits. Individual ''size-like'' properties are controlled by binary encounters which outcome depends upon a recognition process. Depending upon the parameter set-up, mutual selection of producers and custo…

2007-06-07abs ↗pdf ↗

Ebay uses forecasting and simulation to decide when to disable a vendor.

problem Determining the optimal time to disable a vendor to avoid customer loss.
method Data-driven approach involving multiplicative seasonality model, Monte Carlo simulation, and linear model.
result Identifies the best time to disable a vendor to minimize customer loss.

Supervised randomization makes randomized experiments more cost-effective for uplift modeling.

problem Costly randomized experiments for uplift modeling.
method Integrates existing scoring models into randomized trials to target relevant customers while correcting for selection bias.
result Cost-efficient data collection under supervised randomization with competitive uplift model performance.

ALICE combines feature selection and inter-rater agreeability for ML model insights.

problem Improving interpretability of black box machine learning models.
method Integrates feature selection and inter-rater agreeability into a user-friendly Python library.
result Initial experiments on customer churn modeling show promising insights.

System optimizes product images for e-commerce, enhancing customer engagement.

problem Optimizing product images for e-commerce to improve customer engagement.
method Machine learning, deep learning, and computer vision techniques applied to large e-commerce catalogs.
result System produces superior image sets tailored to customer preferences.

One of the key elements in the banking industry rely on the appropriate selection of customers. In order to manage credit risk, banks dedicate special efforts in order to classify customers according to their risk. The usual decision making process consists in gathering personal and financial information about the borr…

2017-04-14abs ↗pdf ↗

Model predicts customer churn in financial institutions using neural networks.

problem Manual feature engineering in customer churn prediction.
method Developed a Multi-layer Perceptron model using Artificial Neural Network architecture.
result Artificial Neural Network model achieved comparable performance to Neuro Solution Infinity software.

The paper provides an algorithm for the risk estimation when a company selects an outsourcing service provider for innovation product. Calculations are based on expert surveys conducted among customers and among providers of outsourcing. The surveys assessed the degree of materiality of species at risk.

2016-03-16abs ↗pdf ↗

Reduce survey questions to scale market research without annoying customers.

problem Performing market research by surveying customers with many questions is inefficient and annoying.
method Used Bayesian networks to model and reduce the number of questions asked to customers.
result Demonstrated the effectiveness of the approach using an example of broadband customer segmentation.

Algorithm reduces audit costs by identifying best service configurations from biased textual evidence.

problem Designing service systems from textual evidence requires accurate selection despite biased automated scoring.
method Developed PP-LUCB algorithm combining LLM scores and selective audits to minimize costs.
result Correctly identified the best model in 40/40 trials with 90% cost reduction.

Financial institutions use LSTM models to predict customer goals.

problem Predicting customer goals and actions in financial services.
method Used LSTM models with state-space graph embeddings on historical customer traces.
result Demonstrated the effectiveness of LSTM models in predicting customer goals and actions.

Customer momentum is a positive relationship between a firm's returns and past returns of its customers.

problem Understanding the relationship between a firm's returns and its customers' past returns.
method Examined customer momentum using a long-short equally-weighted decile portfolio and Fama-French factor models.
result Customer momentum generates significant monthly returns and is statistically significant.

Proposes robust assortment optimization from observational data.

problem Real-world scenarios often violate assumptions of stable customer preferences and correct choice models.
method Develops a robust framework that accounts for potential distributional shifts in customer choice behavior.
result Uncovered the notion of ``robust item-wise coverage'' as the minimal data requirement for sample-efficient robust assortment learning.

A method selects key genes from tumor transcriptomics data using kernel methods and improves classification performance.

problem Feature selection for tumor classification using gene expression data.
method Multiple Kernel Learning with latent regularization and non-linear dimensionality reduction.
result Improved tumor classification performance on unseen test samples.

Paper proposes a new topology for AML analysis using Poincaré embeddings.

problem Complex money laundering schemes and regulatory constraints hinder AML analysis and information sharing.
method Proposes a new topology for AML analysis using Poincaré embeddings.
result Demonstrates improved AML analysis and information sharing through Poincaré embeddings.

Paper proposes a method to aggregate customer engagement data for better ranking of e-commerce results.

problem Cold start problem and under-representation of new or under-impressed products in e-commerce search results.
method Aggregates customer engagements within a day for the same query as input training data for machine learning models.
result Training models on aggregated data leads to better ranking of new and under-impressed products.

We propose a nonparametric procedure to achieve fast inference in generative graphical models when the number of latent states is very large. The approach is based on iterative latent variable preselection, where we alternate between learning a 'selection function' to reveal the relevant latent variables, and use this …

2014-12-10abs ↗pdf ↗

Study uses Open Banking data to estimate customer value, showing potential 21% increase.

problem Limited CLV estimation using single-entity data.
method Introduces PCLV framework using Open Banking data for comprehensive customer value estimation.
result Open Banking data can estimate PCLV per competitor, showing a 21.06% increase over Actual CLV.

Predicts customer call intent for auto dealerships using CNN.

problem Understanding customer intent from phone calls for better service.
method Developed a CNN-based supervised learning model for multi-class classification.
result CNN model performs well on customer call intent classification.

FedACS uses attention to select clients with similar data for federated learning.

problem Non-IID data and data scarcity in federated learning.
method FedACS integrates an attention mechanism to prioritize clients with similar data distributions.
result FedACS improves federated learning performance by addressing non-IID data and data scarcity.

This study enhances sales forecasts by integrating market indicators into forecasting models.

problem Traditional forecasting models rely solely on historical demand data.
method Automated integration of macroeconomic time series data (GDP growth) into forecasting models using feature selection methods.
result Feature selection methods, especially Forward Feature Selection, significantly improve forecasting accuracy.

Silent abandonment reduces contact center efficiency by 5%-15%.

problem Measuring customer abandonment and patience in text-based contact centers is challenging due to uncertainty.
method Developed methodologies to identify silent-abandonment customers and estimate customer patience using text analysis and queueing models.
result Silent abandonment accounts for 30%-67% of customer abandonments and reduces system efficiency by 5%-15%.

DALC customizes LSTM models for detectors in large-scale traffic networks.

problem Fine-grained traffic prediction for large-scale transportation networks.
method Formulated as a finite Markov decision process, introduced ALC algorithm for automatic customization, and developed DALC for distributed customization.
result DALC provides higher prediction accuracy than Apache Spark MLlib approaches.

Adaptive sampling method optimizes DNN compression for resource-constrained platforms.

problem Efficiently compressing DNNs for resource-constrained platforms with high accuracy.
method Adaptive sampling using genetic algorithm-inspired operations to optimize hyperparameters.
result Adaptive sampling outperforms rule-based and reinforcement learning methods in compression rate and accuracy.