Sciweavers

61 search results - page 1 / 13
» Efficient Formulations for 1-SVM and their Application to Re...
Sort
View
JCP
2006
102views more  JCP 2006»
13 years 4 months ago
Efficient Formulations for 1-SVM and their Application to Recommendation Tasks
The present paper proposes new approaches for recommendation tasks based on one-class support vector machines (1-SVMs) with graph kernels generated from a Laplacian matrix. We intr...
Yasutoshi Yajima, Tien-Fang Kuo
CORR
2010
Springer
177views Education» more  CORR 2010»
13 years 4 months ago
Supervised Random Walks: Predicting and Recommending Links in Social Networks
Predicting the occurrence of links is a fundamental problem in networks. In the link prediction problem we are given a snapshot of a network and would like to infer which interact...
Lars Backstrom, Jure Leskovec
DCOSS
2008
Springer
13 years 6 months ago
Energy-Efficient Task Mapping for Data-Driven Sensor Network Macroprogramming
Data-driven macroprogramming of wireless sensor networks (WSNs) provides an easy to use high-level task graph representation to the application developer. However, determining an e...
Animesh Pathak, Viktor K. Prasanna
KDD
2005
ACM
109views Data Mining» more  KDD 2005»
14 years 5 months ago
Formulating distance functions via the kernel trick
Tasks of data mining and information retrieval depend on a good distance function for measuring similarity between data instances. The most effective distance function must be for...
Gang Wu, Edward Y. Chang, Navneet Panda
CTW
2006
88views more  CTW 2006»
13 years 4 months ago
Using multiple cognitive task analysis methods for supervisory control interface design in high-throughput biological screening
Cognitive task analysis (CTA) approaches are currently needed in many domains to provide explicit guidance on redesigning existing systems. This study used goal-directed task analy...
David B. Kaber, Noa Segall, Rebecca S. Green, K. E...