Sciweavers

2576 search results - page 377 / 516
» The Complexity of Zero Knowledge
Sort
View
ECML
1997
Springer
15 years 10 months ago
Constructing Intermediate Concepts by Decomposition of Real Functions
In learning from examples it is often useful to expand an attribute-vector representation by intermediate concepts. The usual advantage of such structuring of the learning problemi...
Janez Demsar, Blaz Zupan, Marko Bohanec, Ivan Brat...
ECML
1997
Springer
15 years 10 months ago
Parallel and Distributed Search for Structure in Multivariate Time Series
Abstract. E cient data mining algorithms are crucial fore ective knowledge discovery. We present the Multi-Stream Dependency Detection (msdd) data mining algorithm that performs a ...
Tim Oates, Matthew D. Schmill, Paul R. Cohen
ICDE
2010
IEEE
290views Database» more  ICDE 2010»
15 years 10 months ago
The Model-Summary Problem and a Solution for Trees
Modern science is collecting massive amounts of data from sensors, instruments, and through computer simulation. It is widely believed that analysis of this data will hold the key ...
Biswanath Panda, Mirek Riedewald, Daniel Fink
KGC
1993
Springer
15 years 10 months ago
Nonmonotonic Reasoning is Sometimes Simpler
We establish the complexity of decision problems associated with the nonmonotonic modal logic S4. We prove that the problem of existence of an S4-expansion for a given set A of pr...
Grigori Schwarz, Miroslaw Truszczynski
KDD
1994
ACM
96views Data Mining» more  KDD 1994»
15 years 10 months ago
DICE: A Discovery Environment Integrating Inductive Bias
: Most of Knowledge Discovery in Database (KDD) systems are integrating efficient Machine Learning techniques. In fact issues in Machine Learning and KDD are very close allowing fo...
Jean-Daniel Zucker, Vincent Corruble, J. Thomas, G...