Sciweavers

1064 search results - page 162 / 213
» Exact Algorithms for the Quadratic Linear Ordering Problem
Sort
View
PKDD
2010
Springer
162views Data Mining» more  PKDD 2010»
15 years 2 months ago
Expectation Propagation for Bayesian Multi-task Feature Selection
In this paper we propose a Bayesian model for multi-task feature selection. This model is based on a generalized spike and slab sparse prior distribution that enforces the selectio...
Daniel Hernández-Lobato, José Miguel...
INFORMS
1998
100views more  INFORMS 1998»
15 years 3 months ago
Feature Selection via Mathematical Programming
The problem of discriminating between two nite point sets in n-dimensional feature space by a separating plane that utilizes as few of the features as possible, is formulated as a...
Paul S. Bradley, Olvi L. Mangasarian, W. Nick Stre...
DEXA
2010
Springer
182views Database» more  DEXA 2010»
15 years 4 months ago
Minimum Spanning Tree on Spatio-Temporal Networks
Given a spatio-temporal network (ST network) whose edge properties vary with time, a time-sub-interval minimum spanning tree (TSMST) is a collection of distinct minimum spanning t...
Viswanath Gunturi, Shashi Shekhar, Arnab Bhattacha...
SIAMJO
2010
100views more  SIAMJO 2010»
14 years 10 months ago
Explicit Sensor Network Localization using Semidefinite Representations and Facial Reductions
The sensor network localization, SNL , problem in embedding dimension r, consists of locating the positions of wireless sensors, given only the distances between sensors that are ...
Nathan Krislock, Henry Wolkowicz
146
Voted
KDD
2010
ACM
199views Data Mining» more  KDD 2010»
15 years 8 months ago
Online discovery and maintenance of time series motifs
The detection of repeated subsequences, time series motifs, is a problem which has been shown to have great utility for several higher-level data mining algorithms, including clas...
Abdullah Mueen, Eamonn J. Keogh