Sciweavers

476 search results - page 95 / 96
» Support Vector Machines with Example Dependent Costs
Sort
View
KDD
2002
ACM
106views Data Mining» more  KDD 2002»
14 years 6 months ago
Selecting the right interestingness measure for association patterns
Many techniques for association rule mining and feature selection require a suitable metric to capture the dependencies among variables in a data set. For example, metrics such as...
Pang-Ning Tan, Vipin Kumar, Jaideep Srivastava
NIPS
2004
13 years 7 months ago
Maximising Sensitivity in a Spiking Network
We use unsupervised probabilistic machine learning ideas to try to explain the kinds of learning observed in real neurons, the goal being to connect abstract principles of self-or...
Anthony J. Bell, Lucas C. Parra
WEBI
2009
Springer
14 years 19 days ago
Building Blocks: Layered Components Approach for Accumulating High-Demand Web Services
Abstract—Customization of systems is costly, but it is necessary to better meet the needs of multi-various tasks and requirements in the fields such as medical care, education, ...
Satoshi Morimoto, Satoshi Sakai, Masaki Gotou, Hee...
ICS
2007
Tsinghua U.
14 years 5 days ago
Sensitivity analysis for automatic parallelization on multi-cores
Sensitivity Analysis (SA) is a novel compiler technique that complements, and integrates with, static automatic parallelization analysis for the cases when relevant program behavi...
Silvius Rus, Maikel Pennings, Lawrence Rauchwerger
ACISP
2006
Springer
14 years 1 days ago
Towards Provable Security for Ubiquitous Applications
Abstract. The emergence of computing environments where smart devices are embedded pervasively in the physical world has made possible many interesting applications and has trigger...
Mike Burmester, Tri Van Le, Breno de Medeiros