Sciweavers

2512 search results - page 35 / 503
» Learning from Highly Structured Data by Decomposition
Sort
View
SC
2009
ACM
15 years 4 months ago
Lessons learned from a year's worth of benchmarks of large data clouds
In this paper, we discuss some of the lessons that we have learned working with the Hadoop and Sector/Sphere systems. Both of these systems are cloud-based systems designed to sup...
Yunhong Gu, Robert L. Grossman
PAKDD
2010
ACM
212views Data Mining» more  PAKDD 2010»
15 years 2 months ago
Fast Perceptron Decision Tree Learning from Evolving Data Streams
Abstract. Mining of data streams must balance three evaluation dimensions: accuracy, time and memory. Excellent accuracy on data streams has been obtained with Naive Bayes Hoeffdi...
Albert Bifet, Geoffrey Holmes, Bernhard Pfahringer...
SDM
2011
SIAM
414views Data Mining» more  SDM 2011»
14 years 16 days ago
Clustered low rank approximation of graphs in information science applications
In this paper we present a fast and accurate procedure called clustered low rank matrix approximation for massive graphs. The procedure involves a fast clustering of the graph and...
Berkant Savas, Inderjit S. Dhillon
IPPS
2010
IEEE
14 years 7 months ago
Efficient and scalable parallel reconstruction of sibling relationships from genetic data in wild populations
Wild populations of organism are often difficult to study in their natural settings. Often, it is possible to infer mating information about these species by genotyping the offspri...
Saad I. Sheikh, Ashfaq A. Khokhar, Tanya Y. Berger...
CORR
2011
Springer
186views Education» more  CORR 2011»
14 years 1 months ago
Blind Compressed Sensing Over a Structured Union of Subspaces
—This paper addresses the problem of simultaneous signal recovery and dictionary learning based on compressive measurements. Multiple signals are analyzed jointly, with multiple ...
Jorge Silva, Minhua Chen, Yonina C. Eldar, Guiller...