Sciweavers

219 search results - page 16 / 44
» Fast Algorithms for Finding Extremal Sets
Sort
View
BMCBI
2011
12 years 11 months ago
Elastic SCAD as a novel penalization method for SVM classification tasks in high-dimensional data
Background: Classification and variable selection play an important role in knowledge discovery in highdimensional data. Although Support Vector Machine (SVM) algorithms are among...
Natalia Becker, Grischa Toedt, Peter Lichter, Axel...
KDD
1997
ACM
213views Data Mining» more  KDD 1997»
13 years 11 months ago
A Probabilistic Approach to Fast Pattern Matching in Time Series Databases
Theproblemof efficiently and accurately locating patterns of interest in massivetimeseries data sets is an important and non-trivial problemin a wide variety of applications, incl...
Eamonn J. Keogh, Padhraic Smyth
ISICA
2007
Springer
14 years 1 months ago
Fast Multi-swarm Optimization with Cauchy Mutation and Crossover Operation
The standard Particle Swarm Optimization (PSO) algorithm is a novel evolutionary algorithm in which each particle studies its own previous best solution and the group’s previous ...
Qing Zhang, Changhe Li, Yong Liu, Lishan Kang
CIKM
2008
Springer
13 years 9 months ago
Fast mining of complex time-stamped events
Given a collection of complex, time-stamped events, how do we find patterns and anomalies? Events could be meetings with one or more persons with one or more agenda items at zero ...
Hanghang Tong, Yasushi Sakurai, Tina Eliassi-Rad, ...
CORR
2006
Springer
154views Education» more  CORR 2006»
13 years 7 months ago
How Hard Is Bribery in Elections?
We study the complexity of influencing elections through bribery: How computationally complex is it for an external actor to determine whether by paying certain voters to change t...
Piotr Faliszewski, Edith Hemaspaandra, Lane A. Hem...