Sciweavers

84 search results - page 9 / 17
» Optimizing time series discretization for knowledge discover...
Sort
View
JCDCG
2004
Springer
14 years 22 days ago
Farthest-Point Queries with Geometric and Combinatorial Constraints
In this paper we discuss farthest-point problems in which a set or sequence S of n points in the plane is given in advance and can be preprocessed to answer various queries efficie...
Ovidiu Daescu, Ningfang Mi, Chan-Su Shin, Alexande...
KES
2010
Springer
13 years 5 months ago
Evolving takagi sugeno modelling with memory for slow processes
Evolving Takagi Sugeno (eTS) models are optimised for use in applications with high sampling rates. This mode of use produces excellent prediction results very quickly and with lo...
Simon McDonald, Plamen P. Angelov
HICSS
2006
IEEE
149views Biometrics» more  HICSS 2006»
14 years 1 months ago
An Efficient Heuristic Search for Real-Time Frequent Pattern Mining
Real-time frequent pattern mining for business intelligence systems are currently in the focal area of research. In a number of areas of doing business, especially in the arena of...
Rajanish Dass, Ambuj Mahanti
HICSS
2003
IEEE
171views Biometrics» more  HICSS 2003»
14 years 20 days ago
Improving the Efficiency of Interactive Sequential Pattern Mining by Incremental Pattern Discovery
The discovery of sequential patterns, which extends beyond frequent item-set finding of association rule mining, has become a challenging task due to its complexity. Essentially, ...
Ming-Yen Lin, Suh-Yin Lee
JMLR
2006
124views more  JMLR 2006»
13 years 7 months ago
Policy Gradient in Continuous Time
Policy search is a method for approximately solving an optimal control problem by performing a parametric optimization search in a given class of parameterized policies. In order ...
Rémi Munos