537 search results - page 39 / 108 » A Rough Set Approach to Attribute Generalization in Data Min... |
KDD
2004
ACM
14 years 8 months ago
2004
ACM
In this paper we provide a fast, data-driven solution to the failing query problem: given a query that returns an empty answer, how can one relax the query's constraints so t...
WWW
2006
ACM
14 years 8 months ago
2006
ACM
In this paper, we proposed an online algorithm, called FQT-Stream (Frequent Query Trees of Streams), to mine the set of all frequent tree patterns over a continuous XML data strea...
KDD
2012
ACM
11 years 10 months ago
2012
ACM
An ideal outcome of pattern mining is a small set of informative patterns, containing no redundancy or noise, that identifies the key structure of the data at hand. Standard freq...
AVI
2004
13 years 9 months ago
2004
Visualization interfaces that offer multiple coordinated views on a particular set of data items are useful for navigating and exploring complex information spaces. In this paper ...
VLDB
1998
ACM
13 years 12 months ago
1998
ACM
We consider the problem of finding association rules that make nearly optimal binary segmentations of huge categorical databases. The optimality of segmentation is defined by an o...