Sciweavers

1314 search results - page 55 / 263
» Approximate data mining in very large relational data
Sort
View
PKDD
2010
Springer
122views Data Mining» more  PKDD 2010»
15 years 20 hour ago
Exploration in Relational Worlds
Abstract. One of the key problems in model-based reinforcement learning is balancing exploration and exploitation. Another is learning and acting in large relational domains, in wh...
Tobias Lang, Marc Toussaint, Kristian Kersting
ICDT
2009
ACM
166views Database» more  ICDT 2009»
16 years 2 months ago
A compositional framework for complex queries over uncertain data
The ability to flexibly compose confidence computation with the operations of relational algebra is an important feature of probabilistic database query languages. Computing confi...
Christoph Koch, Michaela Götz
SDM
2008
SIAM
177views Data Mining» more  SDM 2008»
15 years 3 months ago
Practical Private Computation and Zero-Knowledge Tools for Privacy-Preserving Distributed Data Mining
In this paper we explore private computation built on vector addition and its applications in privacypreserving data mining. Vector addition is a surprisingly general tool for imp...
Yitao Duan, John F. Canny
136
Voted
ICDM
2010
IEEE
217views Data Mining» more  ICDM 2010»
14 years 11 months ago
iSAX 2.0: Indexing and Mining One Billion Time Series
There is an increasingly pressing need, by several applications in diverse domains, for developing techniques able to index and mine very large collections of time series. Examples...
Alessandro Camerra, Themis Palpanas, Jin Shieh, Ea...
TLCA
2005
Springer
15 years 7 months ago
Privacy in Data Mining Using Formal Methods
There is growing public concern about personal data collected by both private and public sectors. People have very little control over what kinds of data are stored and how such da...
Stan Matwin, Amy P. Felty, István T. Hern&a...