4894 search results - page 807 / 979 » The Guarding Problem - Complexity and Approximation |
KDD
2006
ACM
14 years 8 months ago
2006
ACM
In this work we focus on the problem of frequent itemset mining on large, out-of-core data sets. After presenting a characterization of existing out-of-core frequent itemset minin...
KDD
2006
ACM
14 years 8 months ago
2006
ACM
We introduce a new EM framework in which it is possible not only to optimize the model parameters but also the number of model components. A key feature of our approach is that we...
KDD
2005
ACM
14 years 8 months ago
2005
ACM
The problem of finding frequent patterns from graph-based datasets is an important one that finds applications in drug discovery, protein structure analysis, XML querying, and soc...
KDD
2004
ACM
14 years 8 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
14 years 8 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...