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

Trend · papers per month

0.3%0.5%0.8%0.6% · Dec 201719922001200920172026
48 results for text-mining

Large-scale automated meta-analysis of neuroimaging data has recently established itself as an important tool in advancing our understanding of human brain function. This research has been pioneered by NeuroSynth, a database collecting both brain activation coordinates and associated text across a large cohort of neuro…

2016-05-01abs ↗pdf ↗

Study finds implicit government guarantee improves municipal investment bond ratings.

problem Questioning the objectivity of municipal investment bond ratings due to implicit government guarantee.
method Text mining of policy documents and PMC index model for implicit guarantee strength calculation.
result Implicit government guarantee boosts municipal investment bond ratings, especially in less developed regions.

This paper uses SVM to predict stock market trends from financial news.

problem Predicting stock market trends using text mining and sentiment analysis.
method Text mining, sentiment analysis, support vector machine (SVM), parameter optimization.
result SVM models show significant influence of news on stock market, with parameter G having the main effect.

This paper examines feature selection for extracting user intentions from Twitter.

problem Extracting user intentions from informal, misspelled tweets.
method Developed a dataset from Twitter feeds, used two feature selection techniques (Information Gain and hybrid forward selection), and applied four classification algorithms.
result The hybrid feature selection approach outperformed the Information Gain method.

A new text clustering method using NMF and LSA improves stability and performance.

problem Text data's large, sparse term-document matrix makes clustering difficult.
method Proposes a new feature agglomeration method based on NMF and deterministic K-Means initialization.
result Significantly improves clustering performance and stability.

This paper measures the intensity of implicit government guarantees using PMC index model.

problem Excessive local government debt due to implicit government guarantees.
method Text mining of policy documents related to municipal investment bonds, PMC index model.
result Recent policies have reduced the intensity of implicit government guarantees.

Matrix approximation is a common tool in machine learning for building accurate prediction models for recommendation systems, text mining, and computer vision. A prevalent assumption in constructing matrix approximations is that the partially observed matrix is of low-rank. We propose a new matrix approximation model w…

2013-01-15abs ↗pdf ↗

iGecco+ integrates multi-view data for better clustering.

problem Discovering common group structure in mixed multi-view data.
method Integrative Generalized Convex Clustering Optimization (iGecco) with adaptive feature selection.
result iGecco+ achieves superior clustering performance on high-dimensional mixed multi-view data.

Study examines active travel in Chicago communities, revealing mixed perceptions.

problem Transport disadvantage and lack of active mobility in underserved communities.
method Focus groups, qualitative discourse analysis, quantitative text-mining (topic modeling, sentiment analysis).
result Residents view active travel as both necessity and symbol of privilege, influenced by local culture.

This paper presents an algorithm for the unsupervised learning of latent variable models from unlabeled sets of data. We base our technique on spectral decomposition, providing a technique that proves to be robust both in theory and in practice. We also describe how to use this algorithm to learn the parameters of two …

2016-12-11abs ↗pdf ↗

Nonnegative matrix factorization (NMF) has become a widely used tool for the analysis of high-dimensional data as it automatically extracts sparse and meaningful features from a set of nonnegative data vectors. We first illustrate this property of NMF on three applications, in image processing, text mining and hyperspe…

2014-01-21abs ↗pdf ↗

Study investigates micro-event detection on FLOSS version releases from Stack Overflow.

problem Detecting micro-events in FLOSS version release events from textual messages.
method Developed pipelines using LDA topic modeling, hSBM topics, and sentiment analysis; optimized feature spaces with RFECV; evaluated models with statistical analysis.
result Found characteristic changes in topics or sentiment features before or after FLOSS version releases.

It is oftentimes impossible to understand how machine learning models reach a decision. While recent research has proposed various technical approaches to provide some clues as to how a learning model makes individual decisions, they cannot provide users with ability to inspect a learning model as a complete entity. In…

2017-05-23abs ↗pdf ↗

Principal Component Analysis (PCA) has wide applications in machine learning, text mining and computer vision. Classical PCA based on a Gaussian noise model is fragile to noise of large magnitude. Laplace noise assumption based PCA methods cannot deal with dense noise effectively. In this paper, we propose Cauchy Princ…

2014-12-19abs ↗pdf ↗

With the advent of Web 2.0, various types of data are being produced every day. This has led to the revolution of big data. Huge amount of structured and unstructured data are produced in financial markets. Processing these data could help an investor to make an informed investment decision. In this paper, a framework …

2018-11-17abs ↗pdf ↗

Unstructured data refers to information that does not have a predefined data model or is not organized in a pre-defined manner. Loosely speaking, unstructured data refers to text data that is generated by humans. In after-sales service businesses, there are two main sources of unstructured data: customer complaints, wh…

2016-07-26abs ↗pdf ↗

A novel method extracts topological features from word embeddings for text classification.

problem High dimensional and noisy text representations in natural language processing.
method Persistent homology for topological data analysis on word embeddings.
result Topological features outperform conventional text mining features on long textual documents.

In the biclustering problem, we seek to simultaneously group observations and features. While biclustering has applications in a wide array of domains, ranging from text mining to collaborative filtering, the problem of identifying structure in high dimensional genomic data motivates this work. In this context, biclust…

2014-08-05abs ↗pdf ↗

In recent years, we have been faced with a series of natural disasters causing a tremendous amount of financial, environmental, and human losses. The unpredictable nature of natural disasters' behavior makes it hard to have a comprehensive situational awareness (SA) to support disaster management. Using opinion surveys…

2019-03-07abs ↗pdf ↗

Clustering consists of grouping together samples giving their similar properties. The problem of modeling simultaneously groups of samples and features is known as Co-Clustering. This paper introduces ROCCO - a Robust Continuous Co-Clustering algorithm. ROCCO is a scalable, hyperparameter-free, easy and ready to use al…

2018-02-14abs ↗pdf ↗

Proposes MorphMine for unsupervised morpheme segmentation to improve word embeddings.

problem Lack of semantic information in word-level analysis for infrequent and out-of-vocabulary words.
method MorphMine applies a parsimony criterion to hierarchically segment words into the fewest number of morphemes.
result MorphMine segments words into human-verified morphemes and improves word embedding quality.