Pages that link to "Item:Q703073"
From MaRDI portal
The following pages link to Clustering large graphs via the singular value decomposition (Q703073):
Displaying 17 items.
- Turning Big Data Into Tiny Data: Constant-Size Coresets for $k$-Means, PCA, and Projective Clustering (Q3304733) (← links)
- (Q3385388) (← links)
- The Planar k-Means Problem is NP-Hard (Q3605504) (← links)
- (Q4252300) (← links)
- Local Search Yields a PTAS for $k$-Means in Doubling Metrics (Q4634026) (← links)
- A New Troubled-Cell Indicator for Discontinuous Galerkin Methods Using K-Means Clustering (Q4958916) (← links)
- Exact algorithms of searching for the largest size cluster in two integer 2-clustering problems (Q5043014) (← links)
- An improved primal-dual approximation algorithm for the <i>k</i>-means problem with penalties (Q5048009) (← links)
- (Q5149239) (← links)
- The Parallel Seeding Algorithm for k-Means Problem with Penalties (Q5149519) (← links)
- (Q5743481) (← links)
- Fast and Accurate Proper Orthogonal Decomposition using Efficient Sampling and Iterative Techniques for Singular Value Decomposition (Q5865522) (← links)
- The provably good parallel seeding algorithms for the <i>k</i>‐means problem with penalties (Q6092504) (← links)
- How to find a good explanation for clustering? (Q6136087) (← links)
- k-means-g*: accelerating \(k\)-means clustering algorithm utilizing primitive geometric concepts (Q6150442) (← links)
- Minimizing the size of the uncertainty regions for centers of moving entities (Q6547939) (← links)
- Visualizing large graphs (Q6604447) (← links)
