Sciweavers

1314 search results - page 45 / 263
» Approximate data mining in very large relational data
Sort
View
ICDE
1998
IEEE
108views Database» more  ICDE 1998»
16 years 2 months ago
Efficient Discovery of Functional and Approximate Dependencies Using Partitions
Discovery of functionaldependencies from relations has been identified as an important database analysis technique. In this paper, we present a new approach for finding functional...
Ykä Huhtala, Juha Kärkkäinen, Pasi ...
ICDE
2006
IEEE
148views Database» more  ICDE 2006»
16 years 2 months ago
Unifying the Processing of XML Streams and Relational Data Streams
Relational data streams and XML streams have previously provided two separate research foci, but their unified support by a single Data Stream Management System (DSMS) is very des...
Xin Zhou, Hetal Thakkar, Carlo Zaniolo
ICDM
2009
IEEE
181views Data Mining» more  ICDM 2009»
14 years 11 months ago
Efficient Discovery of Frequent Correlated Subgraph Pairs
The recent proliferation of graph data in a wide spectrum of applications has led to an increasing demand for advanced data analysis techniques. In view of this, many graph mining ...
Yiping Ke, James Cheng, Jeffrey Xu Yu
AAAI
2007
15 years 3 months ago
Learning Large Scale Common Sense Models of Everyday Life
Recent work has shown promise in using large, publicly available, hand-contributed commonsense databases as joint models that can be used to infer human state from day-to-day sens...
William Pentney, Matthai Philipose, Jeff A. Bilmes...
CORR
2007
Springer
151views Education» more  CORR 2007»
15 years 1 months ago
Decision tree modeling with relational views
Data mining is a useful decision support technique that can be used to discover production rules in warehouses or corporate data. Data mining research has made much effort to appl...
Fadila Bentayeb, Jérôme Darmont