The tag has no usage guidance.

learn more… | top users | synonyms

2
votes
0answers
14 views

Clustering with probabilities / vector quantization with arbitrary distance measures

Suppose I'm given $n$ points $x_1,\dots,x_n$ in some space $\mathcal{S}$ (think: $\mathbb{R}^d$), and probabilities $p_1,\dots,p_n$ that form a probability distribution (so $p_1 + \dots + p_n=1$). ...
3
votes
0answers
17 views

Persistent Homology vs Clustering Methods

How do persistent homology and clustering methods for data point clouds differ? I'm specifically interested in the application to gene expression data of cancer patients, but any example works. I ...
4
votes
2answers
93 views

The nearest points in a set

I have $N$ points and I have a distance between every pair of points stored in a 2D matrix. The goal is to find the nearest $K$ points among these $N$ points. "Nearest" means the sum of all distances ...
0
votes
1answer
87 views

Cluster Edge Deletion on 2-trees [closed]

Definitions: Cluster Edge Deletion problem is a graph modification problem, in which we want to remove the minimum number of edges such that the resulting graph does not contain a $P_3$ as an induced ...
1
vote
2answers
46 views

Community detection in weighted directed graphs for fixed number of communities

I have a weighted directed graph $G=(V,E)$ with positive weights. Say these vertices represent cities and the weight $w : V_1 \rightarrow V_2$ represents number of students moving into other cities ...
0
votes
0answers
21 views

clustering disk pages In the most I/O efficient manner

Let's suppose there're consecutive 5 disk pages (each disk page size = 8KB). P0 P1 P2 P3 P4 Among those 5 pages, we need to read P0, P1 and P3. There are three ways to load those pages: [1] Issue ...
2
votes
3answers
54 views

How to calculate IV, EV and optimal k for K-means?

Could someone explain how to calculate the following 3 evaluative properties: Intercluster Variability (IV) - How different are the data points within the same cluster Extracluster Variability (EV) -...
2
votes
1answer
52 views

Densely connected non overlapping subgraph

I'm trying to detect quasi cliques in an undirected graph. My problem is that I don't want any overlap between cluster. I'm currently trying to detect community using Louvain algorithm, but it ...
1
vote
0answers
42 views

Clustering images based on timestamp

I want to make folders of images of users in a meaningful way. The images have only the timestamp of creation associated with them. Each folder can have a maximum of k images. I can use median or ...