I have a 1830*6800 matrix like below:
The row 1830 is for different startup companies ID, the column is for 6800 different investors. Now I want to find the similarities between those companies that successfully collect enough money, and those who are not so lucky to acquire enough money.
I am thinking of using k-means clustering and spectral clustering, setting the cluster number to 2 to have 2 different groups (i.e. success & fail). But the k-means is giving me almost all 0's which means all rows are in the same cluster.
Can anyone give me some thought, how to choose a more suitable algorithm for this situation? It doesn't have to be clustering.