90 search results - page 12 / 18 » Efficient Evaluation of Queries with Mining Predicates |
KDD
1998
ACM
15 years 1 months ago
1998
ACM
This paper presents an algorithm for discovering conjunction rules with high reliability from data sets. The discovery of conjunction rules, each of which is a restricted form of ...
180
click to vote
ICDE
2006
IEEE
15 years 10 months ago
2006
IEEE
We consider the problem of creating a sample view of a database table. A sample view is an indexed, materialized view that permits efficient sampling from an arbitrary range query...
DLOG
2009
14 years 7 months ago
2009
We report on event recognition within the life logging application IYOUIT for the automatic creation of static diary-like Blogs. Based on the qualitative context histories produced...
162
Voted
SIGMOD
2007
ACM
15 years 9 months ago
2007
ACM
An emerging challenge in modern distributed querying is to efficiently process multiple continuous aggregation queries simultaneously. Processing each query independently may be i...
KES
2010
Springer
14 years 8 months ago
2010
Springer
In an era that, searching the WWW for information becomes a tedious task, it is obvious that mainly search engines and other data mining mechanisms need to be enhanced with charact...