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

Trend · papers per month

79158237316 · Jun 202019922001200920172026
48 results for Research clusters

New research highlights flaws in evaluating clustering algorithms using classification datasets.

problem Flaws in evaluating clustering algorithms using classification datasets.
method Advanced visualization and dimension reduction techniques to expose flaws.
result Current practice of evaluating clustering algorithms may produce misleading results.

Mixed data comprises both numeric and categorical features, and mixed datasets occur frequently in many domains, such as health, finance, and marketing. Clustering is often applied to mixed datasets to find structures and to group similar objects for further analysis. However, clustering mixed data is challenging becau…

2018-11-11abs ↗pdf ↗

Estimates statistical power for cluster analysis in biomedical research.

problem Lack of established methods to compute a priori statistical power for cluster analysis.
method Simulation studies varying subgroup size, number, separation, and covariance structure.
result Sufficient statistical power achieved with small samples (N=20-30) for large effect sizes.

Quality assessments of models in unsupervised learning and clustering verification in particular have been a long-standing problem in the machine learning research. The lack of robust and universally applicable cluster validity scores often makes the algorithm selection and hyperparameter evaluation a tough guess. In t…

2018-03-29abs ↗pdf ↗

This paper automates mining of COVID-19 scholarly articles using machine learning.

problem Time-consuming and impractical manual extraction of relevant COVID-19 research articles.
method Used machine learning approaches, specifically clustering and parallel one-class support vector machines (OCSVMs), on the CORD-19 dataset.
result Parallel OCSVMs outperform other methods for both original and reduced feature space.

Paper presents a novel k-means clustering method using two distance measures for Gaussian data.

problem Improving clustering accuracy and robustness for Gaussian data.
method Integrates within cluster distance (WCD) and inter cluster distance (ICD) into k-means clustering.
result The algorithm provides more accurate clustering and better handles outliers.

Research uses machine learning to find central nodes and cliques in YouTube social networks.

problem Identifying central nodes and cliques in YouTube social networks.
method Unsupervised machine learning, Python programming, Bron-Kerbosch algorithm.
result Successfully found central nodes through clique-centrality and degree centrality.

A tutorial on various methods for clustering longitudinal data.

problem Identifying groups with different trends in longitudinal data.
method Group-based trajectory modeling, growth mixture modeling, longitudinal k-means.
result Strengths, limitations, and model extensions of the methods are discussed.

Traditionally it had been a problem that researchers did not have access to enough spatial data to answer pressing research questions or build compelling visualizations. Today, however, the problem is often that we have too much data. Spatially redundant or approximately redundant points may refer to a single feature (…

2018-03-21abs ↗pdf ↗

Error-robust multi-view clustering tackles noisy data across multiple sources.

problem Error in multi-view data degrades clustering performance.
method Blind clustering without error consideration is ineffective. Various approaches like sparsity, graph, subspace, and deep learning are reviewed.
result Error-robust multi-view clustering improves clustering accuracy even with corrupted data.

The paper extends fairness to hierarchical clustering, finding efficient algorithms with minimal loss.

problem Ensuring fairness in hierarchical clustering where data is recursively partitioned.
method Extending fairness to hierarchical clustering, developing simple, efficient algorithms for various objectives.
result Simple, efficient algorithms for fair hierarchical clustering with only a negligible loss in objective.

CSTS benchmarks time series clustering by evaluating correlation structures.

problem Lack of validated ground truth for objectively assessing clustering quality.
method Synthetic benchmark CSTS for evaluating correlation structures in multivariate time series data.
result CSTS enables precise diagnosis of methodological limitations in correlation-based time series clustering.

With rapidly increasing data, clustering algorithms are important tools for data analytics in modern research. They have been successfully applied to a wide range of domains; for instance, bioinformatics, speech recognition, and financial analysis. Formally speaking, given a set of data instances, a clustering algorith…

2015-11-25abs ↗pdf ↗

A new clustering algorithm fuses heat diffusion and turning angle for robustness.

problem Cluster similar elements in various fields.
method Combines heat diffusion and maximal turning angle for robust fission clustering.
result The SARFC algorithm outperforms other methods in clustering performance.

This study evaluates clustering algorithms on high-dimensional data.

problem Comparing clustering algorithms on high-dimensional datasets.
method Evaluation of K-means, DBSCAN, and Spectral Clustering using PCA, t-SNE, UMAP, and multiple metrics.
result UMAP preprocessing improves clustering quality across all algorithms, with Spectral Clustering excelling.

Model-based clustering is a popular approach for clustering multivariate data which has seen applications in numerous fields. Nowadays, high-dimensional data are more and more common and the model-based clustering approach has adapted to deal with the increasing dimensionality. In particular, the development of variabl…

2017-07-02abs ↗pdf ↗

The area of constrained clustering has been extensively explored by researchers and used by practitioners. Constrained clustering formulations exist for popular algorithms such as k-means, mixture models, and spectral clustering but have several limitations. A fundamental strength of deep learning is its flexibility, a…

2019-01-29abs ↗pdf ↗

Researchers have used from 30 days to several years of daily returns as source data for clustering financial time series based on their correlations. This paper sets up a statistical framework to study the validity of such practices. We first show that clustering correlated random variables from their observed values i…

2016-03-13abs ↗pdf ↗

This research evaluates and introduces new heuristics for clustering Bitcoin blockchain entities.

problem Efficiently analyzing the vast number of Bitcoin blockchain entities.
method Examined and introduced four new heuristics for clustering Bitcoin blockchain entities.
result Introduced clustering ratio to measure heuristic effectiveness.

The paper clusters PK curves using ML, finding it useful for identifying similar patterns.

problem Improving drug development and patient outcomes through ML in pharmacogenomics.
method Unsupervised clustering of PK curves using various dissimilarity measures.
result Euclidean distance is most suitable for clustering PK curves, and clustering can validate pharmacogenomic results.

There has been a surge in the number of large and flat data sets - data sets containing a large number of features and a relatively small number of observations - due to the growing ability to collect and store information in medical research and other fields. Hierarchical clustering is a widely used clustering tool. I…

2014-09-02abs ↗pdf ↗

Clustering methods based on deep neural networks have proven promising for clustering real-world data because of their high representational power. In this paper, we propose a systematic taxonomy of clustering methods that utilize deep neural networks. We base our taxonomy on a comprehensive review of recent work and v…

2018-01-23abs ↗pdf ↗

Paper proposes a quantum deep clustering framework with improved performance.

problem Improving clustering performance in quantum machine learning.
method Quantum deep SVM, deep convolutional neural networks, and quantum K-Means clustering.
result The proposed quantum deep clustering framework shows significant performance gains over classical methods.

Clustering is an extensive research area in data science. The aim of clustering is to discover groups and to identify interesting patterns in datasets. Crisp (hard) clustering considers that each data point belongs to one and only one cluster. However, it is inadequate as some data points may belong to several clusters…

2018-08-01abs ↗pdf ↗

Clustering is one of the most common unsupervised learning tasks in machine learning and data mining. Clustering algorithms have been used in a plethora of applications across several scientific fields. However, there has been limited research in the clustering of point patterns - sets or multi-sets of unordered elemen…

2017-02-08abs ↗pdf ↗

Detecting stellar clusters have always been an important research problem in Astronomy. Although images do not convey very detailed information in detecting stellar density enhancements, we attempt to understand if new machine learning techniques can reveal patterns that would assist in drawing better inferences from t…

2018-09-05abs ↗pdf ↗