Sciweavers

1055 search results - page 86 / 211
» Convex Factorization Machines
Sort
View
93
Voted
ALT
2009
Springer
15 years 9 months ago
Approximation Algorithms for Tensor Clustering
Abstract. We present the first (to our knowledge) approximation algorithm for tensor clustering—a powerful generalization to basic 1D clustering. Tensors are increasingly common...
Stefanie Jegelka, Suvrit Sra, Arindam Banerjee
77
Voted
CAL
2011
14 years 18 days ago
Heterogeneity in "Homogeneous" Warehouse-Scale Computers: A Performance Opportunity
—The class of modern datacenters recently coined as “warehouse scale computers” (WSCs) has traditionally been embraced as homogeneous computing platforms. However, due to fre...
Jason Mars, Lingjia Tang, Robert Hundt
100
Voted
IFIP
2004
Springer
15 years 6 months ago
Engineering an External Memory Minimum Spanning Tree Algorithm
We develop an external memory algorithm for computing minimum spanning trees. The algorithm is considerably simpler than previously known external memory algorithms for this proble...
Roman Dementiev, Peter Sanders, Dominik Schultes, ...
KDD
1997
ACM
109views Data Mining» more  KDD 1997»
15 years 4 months ago
Beyond Concise and Colorful: Learning Intelligible Rules
A variety of techniques from statistics, signal processing, pattern recognition, machine learning, and neural networks have been proposed to understand data by discovering useful ...
Michael J. Pazzani, Subramani Mani, William Rodman...
100
Voted
ESANN
2006
15 years 2 months ago
Using sampling methods to improve binding site predictions
Currently the best algorithms for transcription factor binding site prediction are severely limited in accuracy. In previous work we combine random selection under-sampling with th...
Yi Sun, Mark Robinson, Rod Adams, Rene te Boekhors...