474 search results - page 36 / 95 » Approximation Algorithms for Tensor Clustering |
COMPGEOM
2000
ACM
14 years 9 days ago
2000
ACM
We present an (1+ε)-approximation algorithm for computing the minimum-spanning tree of points in a planar arrangement of lines, where the metric is the number of crossings betwee...
ASPDAC
1999
ACM
14 years 7 days ago
1999
ACM
In this paper, two faster and better spectral algorithms are presented for the multi-way circuit partitioning problem with the objective of minimizing the Scaled Cost. As pointed ...
KDD
2004
ACM
14 years 8 months ago
2004
ACM
Co-clustering is a powerful data mining technique with varied applications such as text clustering, microarray analysis and recommender systems. Recently, an informationtheoretic ...
FUIN
2010
13 years 5 months ago
2010
Some distributed constraint optimization algorithms use a linear number of messages in the number of agents, but of exponential size. This is often the main limitation for their pr...
JMLR
2010
13 years 2 months ago
2010
We derive PAC-Bayesian generalization bounds for supervised and unsupervised learning models based on clustering, such as co-clustering, matrix tri-factorization, graphical models...