Sciweavers

1083 search results - page 87 / 217
» Efficient Discovery of Confounders in Large Data Sets
Sort
View
BTW
1999
Springer
129views Database» more  BTW 1999»
15 years 10 months ago
Dual Retrieval in Conceptual Information Systems
Conceptual Information Systems provide a multi-dimensional conceptually structured view on data stored in relational databases. On restricting the expressiveness of the retrieval l...
Gerd Stumme
ICDE
2009
IEEE
290views Database» more  ICDE 2009»
16 years 8 months ago
GraphSig: A Scalable Approach to Mining Significant Subgraphs in Large Graph Databases
Graphs are being increasingly used to model a wide range of scientific data. Such widespread usage of graphs has generated considerable interest in mining patterns from graph datab...
Sayan Ranu, Ambuj K. Singh
BMCBI
2005
201views more  BMCBI 2005»
15 years 6 months ago
Principal component analysis for predicting transcription-factor binding motifs from array-derived data
Background: The responses to interleukin 1 (IL-1) in human chondrocytes constitute a complex regulatory mechanism, where multiple transcription factors interact combinatorially to...
Yunlong Liu, Matthew P. Vincenti, Hiroki Yokota
VLDB
1998
ACM
105views Database» more  VLDB 1998»
15 years 10 months ago
Computing Iceberg Queries Efficiently
Many applications compute aggregate functions over an attribute (or set of attributes) to find aggregate values above some specified threshold. We call such queries iceberg querie...
Min Fang, Narayanan Shivakumar, Hector Garcia-Moli...
DMIN
2009
142views Data Mining» more  DMIN 2009»
15 years 4 months ago
Efficient Record Linkage using a Double Embedding Scheme
Record linkage is the problem of identifying similar records across different data sources. The similarity between two records is defined based on domain-specific similarity functi...
Noha Adly