Sciweavers

728 search results - page 42 / 146
» Mining for Empty Rectangles in Large Data Sets
Sort
View
PKDD
2010
Springer
164views Data Mining» more  PKDD 2010»
13 years 5 months ago
Efficient Planning in Large POMDPs through Policy Graph Based Factorized Approximations
Partially observable Markov decision processes (POMDPs) are widely used for planning under uncertainty. In many applications, the huge size of the POMDP state space makes straightf...
Joni Pajarinen, Jaakko Peltonen, Ari Hottinen, Mik...
ISMIS
1999
Springer
14 years 5 days ago
Applications and Research Problems of Subgroup Mining
Knowledge Discovery in Databases (KDD) is a data analysis process which, in contrast to conventional data analysis, automatically generates and evaluates very many hypotheses, deal...
Willi Klösgen
KDD
2003
ACM
243views Data Mining» more  KDD 2003»
14 years 8 months ago
Accurate decision trees for mining high-speed data streams
In this paper we study the problem of constructing accurate decision tree models from data streams. Data streams are incremental tasks that require incremental, online, and any-ti...
João Gama, Pedro Medas, Ricardo Rocha
KDD
2008
ACM
167views Data Mining» more  KDD 2008»
14 years 8 months ago
A sequential dual method for large scale multi-class linear svms
Efficient training of direct multi-class formulations of linear Support Vector Machines is very useful in applications such as text classification with a huge number examples as w...
S. Sathiya Keerthi, S. Sundararajan, Kai-Wei Chang...
AMINING
2003
Springer
293views Data Mining» more  AMINING 2003»
14 years 1 months ago
Data Mining Oriented CRM Systems Based on MUSASHI: C-MUSASHI
Abstract. MUSASHI is a set of commands which enables us to efficiently execute various types of data manipulations in a flexible manner, mainly aiming at data processing of huge a...
Katsutoshi Yada, Yukinobu Hamuro, Naoki Katoh, Tak...