User profiles for Si Si
Si SiGoogle Research Verified email at google.com Cited by 4909 |
[HTML][HTML] Effectiveness of general practice-based health checks: a systematic review and meta-analysis
S Si, JR Moss, TR Sullivan, SS Newton… - British Journal of General …, 2014 - bjgp.org
Background A recent review concluded that general health checks fail to reduce mortality in
adults. Aim This review focuses on general practice-based health checks and their effects on …
adults. Aim This review focuses on general practice-based health checks and their effects on …
Cluster-gcn: An efficient algorithm for training deep and large graph convolutional networks
Graph convolutional network (GCN) has been successfully applied to many graph-based
applications; however, training a large-scale GCN remains challenging. Current SGD-based …
applications; however, training a large-scale GCN remains challenging. Current SGD-based …
Bregman divergence-based regularization for transfer subspace learning
The regularization principals [31] lead approximation schemes to deal with various learning
problems, eg, the regularization of the norm in a reproducing kernel Hilbert space for the ill-…
problems, eg, the regularization of the norm in a reproducing kernel Hilbert space for the ill-…
Scaling up dataset distillation to imagenet-1k with constant memory
Dataset Distillation is a newly emerging area that aims to distill large datasets into much
smaller and highly informative synthetic ones to accelerate training and reduce storage. Among …
smaller and highly informative synthetic ones to accelerate training and reduce storage. Among …
Stable Large‐Area (10 × 10 cm2) Printable Mesoscopic Perovskite Module Exceeding 10% Efficiency
The commercial manufacturing of perovskite solar modules (PSM) suffers from stability
concerns and scalability issues. We demonstrate a hole‐conductor‐free printable solar module …
concerns and scalability issues. We demonstrate a hole‐conductor‐free printable solar module …
Memory efficient kernel approximation
Scaling kernel machines to massive data sets is a major challenge due to storage and
computation issues in handling large kernel matrices, that are usually dense. Recently, many …
computation issues in handling large kernel matrices, that are usually dense. Recently, many …
Scalable coordinate descent approaches to parallel matrix factorization for recommender systems
Matrix factorization, when the matrix has missing values, has become one of the leading
techniques for recommender systems. To handle web-scale datasets with millions of users and …
techniques for recommender systems. To handle web-scale datasets with millions of users and …
A stable silicon (0) compound with a Si= Si double bond
Y Wang, Y Xie, P Wei, RB King, HF Schaefer III… - Science, 2008 - science.org
… The Si-Si double-bond character of 3 is further supported by the π Si=Si –π* Si=Si absorption
(λ max = 466 nm, in THF), which is comparable to the reported ultraviolet/visible absorption …
(λ max = 466 nm, in THF), which is comparable to the reported ultraviolet/visible absorption …
A divide-and-conquer solver for kernel support vector machines
The kernel support vector machine (SVM) is one of the most widely used classification
methods; however, the amount of computation required becomes the bottleneck when facing …
methods; however, the amount of computation required becomes the bottleneck when facing …
Gradient boosted decision trees for high dimensional sparse output
In this paper, we study the gradient boosted decision trees (GBDT) when the output space is
high dimensional and sparse. For example, in multilabel classification, the output space is a …
high dimensional and sparse. For example, in multilabel classification, the output space is a …