Sciweavers

1314 search results - page 140 / 263
» Approximate data mining in very large relational data
Sort
View
NEUROSCIENCE
2001
Springer
15 years 6 months ago
Analysis and Synthesis of Agents That Learn from Distributed Dynamic Data Sources
We propose a theoretical framework for specification and analysis of a class of learning problems that arise in open-ended environments that contain multiple, distributed, dynamic...
Doina Caragea, Adrian Silvescu, Vasant Honavar
SAC
2004
ACM
15 years 7 months ago
Time-frequency feature detection for time-course microarray data
Gene clustering based on microarray data provides useful functional information to the working biologists. Many current gene-clustering algorithms rely on Euclidean-based distance...
Jiawu Feng, Paolo Emilio Barbano, Bud Mishra
VCIP
2003
147views Communications» more  VCIP 2003»
15 years 3 months ago
An objective method for combining multiple subjective data sets
International recommendations for subjective video quality assessment (e.g., ITU-R BT.500-11) include specifications for how to perform many different types of subjective tests. I...
Margaret H. Pinson, Stephen Wolf
VLDB
1998
ACM
120views Database» more  VLDB 1998»
15 years 6 months ago
KODA - The Architecture And Interface of a Data Model Independent Kernel
In this paper we describe the architecture and interface of KODA, a production strength database kernel. KODA is unique in the industry in its ability to support two different dat...
Gopalan Arun, Ashok Joshi
108
Voted
KDD
1995
ACM
173views Data Mining» more  KDD 1995»
15 years 5 months ago
Knowledge Discovery in Textual Databases (KDT)
The information age is characterizedby a rapid growth in the amountof information availablein electronicmedia. Traditional data handling methods are not adequate to cope with this...
Ronen Feldman, Ido Dagan