1213 search results - page 111 / 243 » Approximation in quantale-enriched categories |
KDD
2005
ACM
15 years 11 months ago
2005
ACM
We consider a model in which background knowledge on a given domain of interest is available in terms of a Bayesian network, in addition to a large database. The mining problem is...
105
click to vote
KDD
2005
ACM
15 years 11 months ago
2005
ACM
Frequent-pattern mining has been studied extensively on scalable methods for mining various kinds of patterns including itemsets, sequences, and graphs. However, the bottleneck of...
KDD
2004
ACM
15 years 11 months ago
2004
ACM
In many applications that track and analyze spatiotemporal data, movements obey periodic patterns; the objects follow the same routes (approximately) over regular time intervals. ...
KDD
2003
ACM
15 years 11 months ago
2003
ACM
The problem of identifying approximately duplicate records in databases is an essential step for data cleaning and data integration processes. Most existing approaches have relied...
186
click to vote
POPL
2007
ACM
15 years 11 months ago
2007
ACM
XML programming involves idioms for expressing `structure shyness' such as the descendant axis of XPath or the default templates of XSLT. We initiate a discussion of the rela...