Sciweavers

334 search results - page 39 / 67
» Boosting with structural sparsity
Sort
View
ICDE
2004
IEEE
125views Database» more  ICDE 2004»
14 years 9 months ago
Range CUBE: Efficient Cube Computation by Exploiting Data Correlation
Data cube computation and representation are prohibitively expensive in terms of time and space. Prior work has focused on either reducing the computation time or condensing the r...
Ying Feng, Divyakant Agrawal, Amr El Abbadi, Ahmed...
MICCAI
2009
Springer
14 years 9 months ago
Functional Segmentation of fMRI Data Using Adaptive Non-negative Sparse PCA (ANSPCA)
We propose a novel method for functional segmentation of fMRI data that incorporates multiple functional attributes such as activation effects and functional connectivity, under a ...
Bernard Ng, Rafeef Abugharbieh, Martin J. McKeow...
KDD
2001
ACM
196views Data Mining» more  KDD 2001»
14 years 8 months ago
Efficient discovery of error-tolerant frequent itemsets in high dimensions
We present a generalization of frequent itemsets allowing the notion of errors in the itemset definition. We motivate the problem and present an efficient algorithm that identifie...
Cheng Yang, Usama M. Fayyad, Paul S. Bradley
SC
2009
ACM
14 years 2 months ago
Implementing sparse matrix-vector multiplication on throughput-oriented processors
Sparse matrix-vector multiplication (SpMV) is of singular importance in sparse linear algebra. In contrast to the uniform regularity of dense linear algebra, sparse operations enc...
Nathan Bell, Michael Garland
IAT
2009
IEEE
14 years 2 months ago
Social Trust-Aware Recommendation System: A T-Index Approach
Collaborative Filtering based on similarity suffers from a variety of problems such as sparsity and scalability. In this paper, we propose an ontological model of trust between us...
Alireza Zarghami, Soude Fazeli, Nima Dokoohaki, Mi...