Sciweavers

165 search results - page 4 / 33
» Algorithms for Sparse Linear Classifiers in the Massive Data...
Sort
View
PPOPP
2012
ACM
12 years 1 months ago
Massively parallel breadth first search using a tree-structured memory model
Analysis of massive graphs has emerged as an important area for massively parallel computation. In this paper, it is shown how the Fresh Breeze trees-of-chunks memory model may be...
Tom St. John, Jack B. Dennis, Guang R. Gao
ICANN
2007
Springer
13 years 9 months ago
Resilient Approximation of Kernel Classifiers
Abstract. Trained support vector machines (SVMs) have a slow runtime classification speed if the classification problem is noisy and the sample data set is large. Approximating the...
Thorsten Suttorp, Christian Igel
BMCBI
2011
12 years 9 months ago
Learning sparse models for a dynamic Bayesian network classifier of protein secondary structure
Background: Protein secondary structure prediction provides insight into protein function and is a valuable preliminary step for predicting the 3D structure of a protein. Dynamic ...
Zafer Aydin, Ajit Singh, Jeff Bilmes, William Staf...
JMLR
2006
124views more  JMLR 2006»
13 years 5 months ago
A Direct Method for Building Sparse Kernel Learning Algorithms
Many kernel learning algorithms, including support vector machines, result in a kernel machine, such as a kernel classifier, whose key component is a weight vector in a feature sp...
Mingrui Wu, Bernhard Schölkopf, Gökhan H...
DATAMINE
1999
140views more  DATAMINE 1999»
13 years 5 months ago
A Scalable Parallel Algorithm for Self-Organizing Maps with Applications to Sparse Data Mining Problems
Abstract. We describe a scalable parallel implementation of the self organizing map (SOM) suitable for datamining applications involving clustering or segmentation against large da...
Richard D. Lawrence, George S. Almasi, Holly E. Ru...